• Title/Summary/Keyword: Adaptive Search

Search Result 474, Processing Time 0.028 seconds

Performance Improvement of Adaptive Hierarchical Hexagonal Search Using Matching Verification Pattern (정합 검증 패턴을 이용한 적응형 계층 육각 탐색의 성능 개선)

  • Kim, Myoung-Ho;Kwak, No-Yoon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2007.02a
    • /
    • pp.79-82
    • /
    • 2007
  • 본 논문은 정합 검증 패턴을 이용한 적응형 계층 육각 탐색의 성능 개선에 관한 것이다. 제안된 방법은 움직임 추정 블록에 시공간적으로 인접한 블록들의 움직임 벡터를 이용하여 움직임 활동도를 정의한 후, 움직임 활동도가 높을 경우 웨이블렛 변환의 다단계 저주파 부영상들로 구성된 피라미드 계층 구조상에서 정합 검증 패턴을 이용한 적응형 계층 육각 탐색을 수행한다. 제안된 방법을 이용할 경우, 정합 검증 패턴을 적용한 검증 과정에서 추가적인 연산량 증가가 초래되지만 이를 상호타협적으로 보상할 수 있는 화질 측면에서의 성능 개선 효과를 기대할 수 있다. 제안된 방법의 타당성과 보편성을 검증하기 위해서로 다른 움직임 특성을 갖는 복수의 영상 시퀀스들을 대상으로 움직임 보상 화질과 수렴시간 측면에서 그 성능을 분석 평가하였다. 컴퓨터 시뮬레이션 결과에 따르면, 제안된 방법은 고속 움직임 탐색이 가능한 적웅형 계층 육각 탐색의 장점을 유지하면서도 움직임 활동도가 높은 영상 시퀀스에서 야기되는 국부 최소 문제를 효과적으로 억제시킴으로써 보상 화질 측면에서 개선된 성능을 제공할 수 있었다.

  • PDF

A Study on Designing the System of Vital and Environmental Sensor for Future Soldier System (미래병사 생체환경센서 시스템 설계에 관한 연구)

  • Kim, Hyun-Jun;Chae, Je-Wook;Choe, Eui-Jung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.3
    • /
    • pp.233-239
    • /
    • 2013
  • This paper includes the algorithm of eliminating noise, the processing technique of sensor and the results of designing vital and environmental sensor, one of the survivability subsystem of Future Soldier System. In this paper, we propose the adaptive filtering, moving noise removal in order to detect signals stabilized. And these help that we get bio-signals the ECG calculating methods such as search back and ensemble method. It is made up the vital and environmental sensor including the flexible sensor. In that sense, this study can be applied when it is planned the modular type Future Soldier System.

Reconfigurable Selective Harmonic Elimination Technique for Wide Range Operations in Asymmetric Cascaded Multilevel Inverter

  • Kavitha, R;Rani, Thottungal
    • Journal of Power Electronics
    • /
    • v.18 no.4
    • /
    • pp.1037-1050
    • /
    • 2018
  • This paper presents a novel reconfigurable selective harmonic elimination technique to control harmonics over a wide range of Modulation Indexes (MI) in Multi-Level Inverter (MLI). In the proposed method, the region of the MI is divided into various sectors and expressions are formulated with different switching patterns for each of the sectors. A memetic BBO-MAS (Biogeography Based Optimization - Mesh Adaptive direct Search) optimization algorithm is proposed for solving the Selective Harmonic Elimination - Pulse Width Modulation (SHE-PWM) technique. An experimental prototype is developed using a Field Programmable Gate Array (FPGA) and their FFT spectrums are analyzed over a wide range of MI using a fluke power logger. Simulation and experimental results have validated the performance of the proposed optimization algorithms and the reconfigurable SHE-PWM technique. Further, the sensitivity of the harmonics has been analyzed considering non-integer variations in the magnitude of the input DC sources.

On a New Evolutionary Algorithm for Network Optimization Problems (네트워크 문제를 위한 새로운 진화 알고리즘에 대하여)

  • Soak, Sang-Moon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.2
    • /
    • pp.109-121
    • /
    • 2007
  • This paper focuses on algorithms based on the evolution, which is applied to various optimization problems. Especially, among these algorithms based on the evolution, we investigate the simple genetic algorithm based on Darwin's evolution, the Lamarckian algorithm based on Lamark's evolution and the Baldwin algorithm based on the Baldwin effect and also Investigate the difference among them in the biological and engineering aspects. Finally, through this comparison, we suggest a new algorithm to find more various solutions changing the genotype or phenotype search space and show the performance of the proposed method. Conclusively, the proposed method showed superior performance to the previous method which was applied to the constrained minimum spanning tree problem and known as the best algorithm.

Edge Detection Using Simulated Annealing Algorithm (Simulated Annealing 알고리즘을 이용한 에지추출)

  • Park, J.S.;Kim, S.G.
    • Journal of Power System Engineering
    • /
    • v.2 no.3
    • /
    • pp.60-67
    • /
    • 1998
  • Edge detection is the first step and very important step in image analysis. We cast edge detection as a problem in cost minimization. This is achieved by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for comparing the performances of different detectors. This cost function is made of desirable characteristics of edges such as thickness, continuity, length, region dissimilarity. And we use a simulated annealing algorithm for minimum of cost function. Simulated annealing are a class of adaptive search techniques that have been intensively studied in recent years. We present five strategies for generating candidate states. Experimental results(building image and test image) which verify the usefulness of our simulated annealing approach to edge detection are better than other operator.

  • PDF

Hybrid Artificial Immune System Approach for Profit Based Unit Commitment Problem

  • Lakshmi, K.;Vasantharathna, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.5
    • /
    • pp.959-968
    • /
    • 2013
  • This paper presents a new approach with artificial immune system algorithm to solve the profit based unit commitment problem. The objective of this work is to find the optimal generation scheduling and to maximize the profit of generation companies (Gencos) when subjected to various constraints such as power balance, spinning reserve, minimum up/down time and ramp rate limits. The proposed hybrid method is developed through adaptive search which is inspired from artificial immune system and genetic algorithm to carry out profit maximization of generation companies. The effectiveness of the proposed approach has been tested for different Gencos consists of 3, 10 and 36 generating units and the results are compared with the existing methods.

Implementation of Image Adaptive Map (적응적인 Saliency Map 모델 구현)

  • Park, Sang-Bum;Kim, Ki-Joong;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.2
    • /
    • pp.131-139
    • /
    • 2008
  • This paper presents a new saliency map which is constructed by providing dynamic weights on individual features in an input image to search ROI(Region Of Interest) or FOA(Focus Of Attention). To construct a saliency map on there is no a priori information, three feature-maps are constructed first which emphasize orientation, color, and intensity of individual pixels, respectively. From feature-maps, conspicuity maps are generated by using the It's algorithm and their information quantities are measured in terms of entropy. Final saliency map is constructed by summing the conspicuity maps weighted with their individual entropies. The prominency of the proposed algorithm has been proved by showing that the ROIs detected by the proposed algorithm in ten different images are similar with those selected by one-hundred person's naked eyes.

Design and Development of the Multi-joint Tracked Robot for Adaptive Uneven Terrain Driving (험지 주행을 위한 다관절 트랙 로봇 설계 및 개발)

  • Koh, Doo-Yeol;Kim, Soo-Hyun
    • The Journal of Korea Robotics Society
    • /
    • v.4 no.4
    • /
    • pp.265-272
    • /
    • 2009
  • IVarious driving mechanisms to adapt to uneven environment have been developed for many urban search and rescue (USAR) missions. A tracked mechanism has been widely used to maintain the stability of robot's pose and to produce large traction force on uneven terrain in this research area. However, it has a drawback of low energy efficiency due to friction force when rotating. Moreover, single tracked mechanism can be in trouble when the body gets caught with high projections, so the track doesn't contact on the ground. A transformable tracked mechanism is proposed to solve these problems. The mechanism is designed with several articulations surrounded by tracks, used to generate an attack angle when the robot comes near obstacles. The stair climbing ability of proposed robot was analyzed since stairs are one of the most difficult obstacles in USAR mission. Stair climbing process is divided into four separate static analysis phases. Design parameters are optimized according to geometric limitations from the static analysis. The proposed mechanism was produced from optimized design parameters, and demonstrated in artificially constructed uneven environment and the actual stairway.

  • PDF

A Comparison of Operational Productivity between Conventional berth and Indented berth in Container Terminals (컨테이너 터미널에서 일반부두와 양현부두의 본선작업 완료시간 비교 연구)

  • Jeong, Da-Hun;Park, Yeong-Man;Lee, Byeong-Gwon;Kim, Gap-Hwan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.336-345
    • /
    • 2006
  • 최근 컨테이너 선박의 대형화는 물동량을 크게 증가 시켰으며, 이로 인해 컨테이너 터미널에서는 규모의 경제를 달성하고, 선사의 요구를 만족시키기 위해 노력하고 있다. 이에 대한대안이 양현부두(Indented berth)의 등장이다. 양현부두에는 대형 컨테이너선의 물량을 신속히 처리하기 위해 선석에서 컨테이너를 취급하는 장비인 안벽크레인(Quay Crane : QC)의 작업 대수가 일반부두(Conventional berth)보다는 많이 할당될 수 있다. 본 연구에서는 일반부두와 양현부두의 작업 생산성을 비교하였다. 이를 위하여 탐색기법인 GRASP(Greedy Randomized Adaptive Search Procedure)를 적용한 안벽크레인 일정계획 알고리즘을 이용하였다. 또한 컨테이너 터미널의 실제 자료를 이용하여 두 가지 형태의 부두에서의 본선작업 완료시간을 비교 하였다.

  • PDF

A Codebook Design for Vector Quantization Using a Neural Network (신경망을 이용한 벡터 양자화의 코드북 설계)

  • 주상현;원치선;신재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.2
    • /
    • pp.276-283
    • /
    • 1994
  • Using a neural network for vector quantization, we can expect to have better codebook design algorithm for its adaptive process. Also, the designed codebook puts the codewords in order by its self-organizing characteristics, which makes it possible to partially search the codebook for real time process. To exploit these features of the neural network, in this paper, we propose a new codebook design algorithm that modified the KSFM(Kohonen`s Self-organizing Feature Map) and then combines the K-means algorithm. Experimental results show the performance improvment and the ability of the partical seach of the codebook for the real time process.

  • PDF