• 제목/요약/키워드: random operators

검색결과 63건 처리시간 0.026초

Central Moments를 이용한 경계선 검출 (Edge Extraction Using Central Moments)

  • 김학상;김영모;박길흠;이광호;하영호
    • 대한전자공학회논문지
    • /
    • 제25권10호
    • /
    • pp.1244-1251
    • /
    • 1988
  • 영상에서 명암도의 변화가 큰 영역을 경계선이라 하며 이는 영상을 분류하고 해석하는 가장 기본적인 특징 중의 하나이다. 본 논문에서는 central moments에 의한 새로운 경계선 검출 방법을 제안하였다. 제안된 방법은 서로 다르게 정의된 확률변수 및 확률밀도함수와 moment의 차수에 따라 여러 가지 특성을 가진 경계선을 검출하였다. 또한 미분이 아닌 창내의 명암도의 평균과 각 화소와의 차를 적분한 연산자로서 기존의 연산자보다 잡음에 우수하며 가늘고 섬세한 경계선을 검출하였다.

  • PDF

유전알고리즘을 이용한 이원계 나노입자의 원자배열 예측 (Prediction of Atomic Configuration in Binary Nanoparticles by Genetic Algorithm)

  • 오정수;류원룡;이승철;최정혜
    • 한국세라믹학회지
    • /
    • 제48권6호
    • /
    • pp.493-498
    • /
    • 2011
  • Optimal atomic configurations in a nanoparticle were predicted by genetic algorithm. A truncated octahedron with a fixed composition of 1 : 1 was investigated as a model system. A Python code for genetic algorithm linked with a molecular dynamics method was developed. Various operators were implemented to accelerate the optimization of atomic configuration for a given composition and a given morphology of a nanoparticle. The combination of random mix as a crossover operator and total_inversion as a mutation operator showed the most stable structure within the shortest calculation time. Pt-Ag core-shell structure was predicted as the most stable structure for a nanoparticle of approximately 4 nm in diameter. The calculation results in this study led to successful prediction of the atomic configuration of nanoparticle, the size of which is comparable to that of practical nanoparticls for the application to the nanocatalyst.

미디안 규칙을 갖는 셀룰러 오토마타를 이용한 화상의 잡음제거 (Noise Removal of Images Using the Median Rule Cellular Automata)

  • 김석태
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2001년도 춘계종합학술대회
    • /
    • pp.638-642
    • /
    • 2001
  • 본 논문에서는 국부적인 미디안(median)규칙에 따라 움직이는 셀룰러 오토마타를 이용해 화상에 대한 사전 지식이 필요 없는 화상의 잡음제거 알고리즘을 제안한다. 각 규칙은 원화상이 가지는 특징의 손실없이 국부적으로 밝기값(gray level)을 증감시킨다. 이러한 셀룰러 오토마타는 순차적이고 병렬적인 움직임을 가지며, 이 움직임은 Lyapunov functional을 만족하는 함수로 표현된다. 따라서 본 셀룰러 오토마타를 이용한 화상의 잡음제거 알고리즘은 매우 빠른 속도로 수렴하고, 안정적인 결과를 나타낸다. 실험을 통해 본 방법의 유효성을 확인한다.

  • PDF

Obstacles to Accessing Finance by Small Business Operators in the Buffalo City Metropolitan Municipality

  • Chimucheka, Tendai
    • Asian Journal of Business Environment
    • /
    • 제3권2호
    • /
    • pp.23-29
    • /
    • 2013
  • Purpose - The study investigates the obstacles faced by small business owners (SBOs) in accessing finance in the Buffalo City Metropolitan Municipality. The study aims to identify the causes of inaccessibility to finance for SBOs, investigate the role of government agencies in supporting SBOs, assess the extent to which banks support SMMEs, and suggest solutions to ease the challenge of inaccessibility of finance. Research design, data, methodology -We used a triangulation research design, wherein SMME owners and managers in the Buffalo City Metropolitan Municipality were the target population. We used simple random sampling techniques to select respondents, and conducted in-depth interviews to collect qualitative data. Results - We analyzed quantitative data using descriptive statistics, Chi-square tests, and factor analysis. The qualitative data was analyzed using content analysis. The study identifies and discusses the obstacles in accessing finance; the main among which are the lack of collateral security, poor business plans, lack of knowledge, and lack of financial deposit. Conclusions -We urge the banks, government, and government agencies to support the SMME sector, for it remains the economic engine of many African countries and helps in reducing the impact of socio-economic challenges, like unemployment and poverty.

소프트 제약을 포함하는 조립라인 밸런싱 문제 최적화 (Optimizing Assembly Line Balancing Problems with Soft Constraints)

  • 최성훈;이근철
    • 산업경영시스템학회지
    • /
    • 제41권2호
    • /
    • pp.105-116
    • /
    • 2018
  • In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

미디안 규칙을 갖는 셀룰러 오토마타를 이용한 영상의 잡음제거 (Noise Removal of Images Using the Median Rule Cellular Automata)

  • 김석태
    • 한국정보통신학회논문지
    • /
    • 제5권2호
    • /
    • pp.343-348
    • /
    • 2001
  • 본 논문에서는 국부적인 미디안(median)규칙에 파라 움직이는 셀룰러 오토마타를 이용해 영상에 대한 사전 지식이 필요 없는 영상의 잡음제거 알고리즘을 제안한다. 각 규칙은 원영상이 가지는 특징의 손실없이 국부적으로 자기값(gray level)을 증감시킨다. 이러한 셀룰러 오토마타는 순차적이고 병렬적인 움직임을 가지며, 이 움직임은 Lyapunov functional을 만족하는 함수로 표현된다. 따라서 본 셀룰러 오토마타를 이용한 영상의 잡음제거 알고리즘은 매우 빠른 속도로 수렴하고, 안정적인 결과를 나타낸다. 실험을 통해 본 방법의 유효성을 확인한다.

  • PDF

Potts Automata를 이용한 영상의 잡음 제거 및 에지 주줄 (A Potts Automata algorithm for Noise Removal and Edge Detection)

  • 이석기;김석태;조성진
    • 한국통신학회논문지
    • /
    • 제28권3C호
    • /
    • pp.327-335
    • /
    • 2003
  • Cellular Automata는 자연계의 현상 현상이 국부적인 관계에 의해 완전히 표현될 수 있는 이상적인 동적 시스템이다. 본 논문에서는 Cellular Automata의 특성을 가지는 Potts Automata를 이용한 잡음 제거 및 에지 추출 알고리즘을 제안한다. 본 방법은 대상영상에 대한 특징을 그대로 보존하면서 천이규칙에 따라 국부적으로 밝기값의 차이를 증가 및 감소시킨다. 이러한 Automata는 순차적이고 병렬적인 움직임을 가지고 Lyapunov 함수를 만족한다. 제안한 천이규칙은 랜덤잡음을 가진 대상영상에 대해 빠른 수련속도를 가지고 안정적인 결과를 나타낸다. 실험을 통해 본 방법의 유효성을 확인한다.

A Novel Algorithm for Optimal Location of FACTS Devices in Power System Planning

  • Kheirizad, Iraj;Mohammadi, Amir;Varahram, Mohammad Hadi
    • Journal of Electrical Engineering and Technology
    • /
    • 제3권2호
    • /
    • pp.177-183
    • /
    • 2008
  • The particle swarm optimization(PSO) has been shown to converge rapidly during the initial stages of a global search, but around global optimum, the search process becomes very slow. On the other hand, the genetic algorithm is very sensitive to the initial population. In fact, the random nature of the GA operators makes the algorithm sensitive to initial population. This dependence to the initial population is in such a manner that the algorithm may not converge if the initial population is not well selected. In this paper, we have proposed a new algorithm which combines PSO and GA in such a way that the new algorithm is more effective and efficient and can find the optimal solution more accurately and with less computational time. Optimal location of SVC using this hybrid PSO-GA algorithm is found. We have also found the optimal place of SVC using GA and PSO separately and have compared the results. It has been shown that the new algorithm is more effective and efficient. An IEEE 68 bus test system is used for simulation.

Hybrid genetic-paired-permutation algorithm for improved VLSI placement

  • Ignatyev, Vladimir V.;Kovalev, Andrey V.;Spiridonov, Oleg B.;Kureychik, Viktor M.;Ignatyeva, Alexandra S.;Safronenkova, Irina B.
    • ETRI Journal
    • /
    • 제43권2호
    • /
    • pp.260-271
    • /
    • 2021
  • This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2).

안전요원 배치 여부에 따른 무인운전 경전철의 운행중단 시간예측 연구 (A Study on Prediction of Suspension Time of Unmanned Light Rail according to Safety Personal Deployment)

  • 곽상록
    • 한국안전학회지
    • /
    • 제38권1호
    • /
    • pp.87-92
    • /
    • 2023
  • The number of unmanned light rail train operators is continuously increasing in Korea. In a failure event during an operation due to the nature of the unmanned operation, recovery is performed based on the remote control. However, if remote recovery is not feasible, safety personnel arrive at the train to resume the train operation. There are regulations on safety personnel and the suspension time of the train operation. However, there is currently no rule for safety personnel deployment. Currently, railway operating organizations operate in three scenarios: safety personnel on board trains, stationed at stations, and deployed at major stations. Four major factors influence the downtime for each emergency response scenario. However, these four influencing factors vary too much to predict results with simple calculations. In this study, four influencing factors were considered as random variables with high uncertainty. In addition, the Monte Carlo method was applied to each scenario for the safety personnel deployment to predict train service downtime. This study found a 17% difference in train service suspension by safety personnel deployment scenario. The results of this study can be used in setting service goals, such as standards for future safety personnel placement and frequency of service interruptions.