• Title/Summary/Keyword: SA 알고리즘

Search Result 144, Processing Time 0.025 seconds

Image Mosaicing Based on Normalized Correlation and Rectangle-to-Quadrilateral Perspective Transformation (정규상관과 직사각형-사변형 투영 변환에 기반한 영상 모자익)

  • Kim, Dong-Geun;Jang, Byeong-Tae
    • The KIPS Transactions:PartB
    • /
    • v.8B no.3
    • /
    • pp.311-318
    • /
    • 2001
  • 본 논문에서는 중첩되는 영상사이의 평면 투영 변환을 구하는 방법을 제안하였다. 제안한 방법은 정규상관과 직사각형-사변형 평면 투영 변환에 기반 한다. 블록 정합을 이용하여 전역 이동을 계산하고, 중첩되는 영역의 정규 상관 계수 값을 최대로 하는 4개의 대응점을 찾기 위하여 가우시안 영상 피라미드에서 SA(simulated annealing) 알고리즘을 사용하였다. 이들 대응점에서 직사각형-사변형으로의 사상을 이용하여 평면 투영 변환을 계산하고, 마지막으로 중첩되는 영역의 RGB 컬러 값을 선형 가중치에 의해 혼합하였다. 실험으로 세 장의 영상을 한 장읠 큰 모자익 영상으로 합성하는 결과를 보였다.

  • PDF

Detection of a Center-Point for Separation of Touching Objects (근접 객체 구분을 위한 중심점 추출)

  • Chung, Yeonwoo;Baek, Hansol;Ju, Miso;Sa, Jaewon;Chung, Yongwha;Park, Daihee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2016.10a
    • /
    • pp.674-676
    • /
    • 2016
  • 감시 카메라 환경에서 움직이는 객체들이 서로 근접한 경우 객체들을 개별적으로 구분하기 어렵기 때문에 근접한 객체들을 분리하는 방법이 필요하다. 본 논문에서는 근접 객체 구분을 위하여 외곽선 데이터를 시계열 데이터로 변환하는데 필요한 중심점을 검출하는 방법을 제안한다. 실험 결과, 제안한 알고리즘은 다양한 근접 패턴에 대하여 중심점을 정확히 추출할 수 있음을 확인하였다.

A Study on design of Robot Manipulator and Application of Control Algorithm (로보트 매니퓰레이터(3-축)의 제작과 제어 알고리즘 적용에 관한 연구)

  • Lee, Hee-Jin;Kim, Seung-Woo;SaGong, Seong-Dae;Park, Mi-Gnon;Lee, Sang-Bae
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.273-277
    • /
    • 1988
  • This paper is to show design of robot manipulator which has 3-link using DC Motor and realization of control algorithm with IBM - XT Micro-computer connected. Gentral algorithm is applicated by position and pass control using point-to-point method. At first, this paper computes required angles on each joint in order to search desired position or path, and uses a voltage control with feedback from output of encoder and tachometer in real time. The application of control algorithm on position, velocity and force for each joint of manipulator by using self-tuning control is left for next study.

  • PDF

A Study on the Parameters Tuning Method of the Fuzzy Power System Stabilizer Using Genetic Algorithm and Simulated Annealing (혼합형 유전 알고리즘을 이용한 퍼지 안정화 제어기의 계수동조 기법에 관한 연구)

  • Lee, Heung-Jae;Im, Chan-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.12
    • /
    • pp.589-594
    • /
    • 2000
  • The fuzzy controllers have been applied to the power system stabilizer due to its excellent properties on the nonlinear systems. But the design process of fuzzy controller requires empirical and heuristic knowledge of human experts as well as many trial-and-errors in general. This process is time consuming task. This paper presents an parameters tuning method of the fuzzy power system stabilizer using the genetic algorithm and simulated annealing(SA). The proposed method searches the local minimum point using the simulated annealing algorithm. The proposed method is applied to the one-machine infinite-bus of a power system. Through the comparative simulation with conventional stabilizer and fuzzy stabilizer tuned by genetic algorithm under various operating conditions and system parameters, the robustness of fuzzy stabilizer tuned by proposed method with respect to the nonlinear power system is verified.

  • PDF

Analysis of the Inner Degradation Pattern by Clustering Algorism at Distribution Line (군집화 알고리즘을 이용한 배전선로 내부 열화 패턴 분석)

  • Choi, Woon-Shik;Kim, Jin-Sa
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.29 no.1
    • /
    • pp.58-61
    • /
    • 2016
  • Degradation in power cables used in distribution lines to the material of the wire, manufacturing method, but also the line of the environment, generates a variety of degradation depending upon the type of load. The local wire deterioration weighted wire breakage accident can occur frequently, causing significant proprietary damage can lead to accidents and precious. In this study, the signal detected by the eddy current aim to develop algorithms capable of determining the signals for the top part and at least part of the signal by using a signal processing technique called K-means algorithm.

The Design of Algorithm for Saving the Real-time Data Using Microprocessor (원칩마이컴을 이용한 실시간 데이터 저장을 위한 알고리즘 설계)

  • Shin Sa-Hyun;Kim Ki-Bum;Cho Geum-Bae;Baek Hyung-Lae;Seo Jin-Youn;Choi Nak-Il
    • Proceedings of the KIPE Conference
    • /
    • 2001.07a
    • /
    • pp.657-661
    • /
    • 2001
  • In This paper describes on the development of detecting power using Microprocessor. The detecting power system is composed of main controller system and analyzing software. Re system detected voltage, current, temperature, leakage current md its saved in ROM. This system applies the 'AT89C52' to CPU and 'AM29F040B' used a memory to sue the data.

  • PDF

Stochastic Radar Beam Scheduling Using Simulated Annealing (Simulated Annealing을 이용한 추계적 레이더 빔 스케줄링 알고리즘)

  • Roh, Ji-Eun;Ahn, Chang-Soo;Kim, Seon-Joo;Jang, Dae-Sung;Choi, Han-Lim
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.2
    • /
    • pp.196-206
    • /
    • 2012
  • AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed stochastic radar beam scheduling algorithm using simulated annealing(SA), and evaluated the performance on the multi-function radar scenario. As a result, we showed that our proposed algorithm is superior to previous dispatching rule based scheduling algorithm from the viewpoint of beam processing latency and the number of scheduled beams, with real time capability.

An Efficient Datapath Placement Algorithm to Minimize Track Density Using Spectral Method (스팩트럴 방법을 이용해 트랙 밀도를 최소화 할 수 있는 효과적인 데이터패스 배치 알고리즘)

  • Seong, Gwang-Su
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.2
    • /
    • pp.55-64
    • /
    • 2000
  • In this paper, we propose an efficient datapath placement algorithm to minimize track density. Here, we consider each datapath element as a cluster, and merge the most strongly connected two clusters to a new cluster until only one cluster remains. As nodes in the two clusters to be merged are already linearly ordered respectively, we can merge two clusters with connecting them. The proposed algorithm produces circular linear ordering by connecting starting point and end point of the final cluster, and n different linear ordering by cutting between two contiguous elements of the circular linear ordering. Among the n different linear ordering, the linear ordering to minimize track density is final solution. In this paper, we show and utilize that if two clusters are strongly connected in a graph, the inner product of the corresponding vectors mapped in d-dimensional space using spectral method is maximum. Compared with previous datapath placement algorithm GA/S $A^{[2]}$, the proposed algorithm gives similar results with much less computation time.

  • PDF

An Earthwork Districting Model for Large Construction Projects (단지공사의 토공구획 계획 모델)

  • Baek, Hyeon Gi;Kang, Sang Hyeok;Seo, Jong Won
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.35 no.3
    • /
    • pp.715-723
    • /
    • 2015
  • Earthwork in a large construction project such as a land development generally costs 20-30% of the total cost. The earthmoving process, comprising of four repetitive tasks: loading, hauling, unloading, returning, is quite simple and it does not need delicate or advanced techniques. Therefore, earthmoving earthwork planning can heavily affect the cost and time., and Even a slight deviation from the plan can increase or decrease the cost and time. This study presents a planning model that minimizes average haul distance in a large complex construction project. Based on earthwork planning, practitioners' heuristics, a districting algorithm and Simulated Annealing algorithm were employed to build the model. Districting algorithm plays a role that divides in dividing an earthmoving area into several sections. Simulated annealing provides a function that decides whether a new generated solution is confident. Finally, the proposed model was applied to a real earthmoving project of a large land development. It was found that the model showed approximately 14% improvement in average hauling distance compared to the actual design plan.