• Title/Summary/Keyword: 탐색 알고리듬

Search Result 202, Processing Time 0.025 seconds

Area Search of Multiple UAV's based on Evolutionary Robotics (진화로봇공학 기반의 복수 무인기를 이용한 영역 탐색)

  • Oh, Soo-Hun;Suk, Jin-Young
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.38 no.4
    • /
    • pp.352-362
    • /
    • 2010
  • The simultaneous operation of multiple UAV's makes it possible to enhance the mission accomplishment efficiency. In order to achieve this, easily scalable control algorithms are required, and swarm intelligence having such characteristics as flexibility, robustness, decentralized control, and self-organization based on behavioral model comes into the spotlight as a practical substitute. Recently, evolutionary robotics is applied to the control of UAV's to overcome the weakness of difficulties in the logical design of behavioral rules. In this paper, a neural network controller evolved by evolutionary robotics is applied to the control of multiple UAV's which have the mission of searching limited area. Several numerical demonstrations show the proposed algorithm has superior results to those of behavior based neural network controller which is designed by intuition.

On the Development of a Large-Vocabulary Continuous Speech Recognition System for the Korean Language (대용량 한국어 연속음성인식 시스템 개발)

  • Choi, In-Jeong;Kwon, Oh-Wook;Park, Jong-Ryeal;Park, Yong-Kyu;Kim, Do-Yeong;Jeong, Ho-Young;Un, Chong-Kwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.5
    • /
    • pp.44-50
    • /
    • 1995
  • This paper describes a large-vocabulary continuous speech recognition system using continuous hidden Markov models for the Korean language. To improve the performance of the system, we study on the selection of speech modeling units, inter-word modeling, search algorithm, and grammars. We used triphones as basic speech modeling units, generalized triphones and function word-dependent phones are used to improve the trainability of speech units and to reduce errors in function words. Silence between words is optionally inserted by using a silence model and a null transition. Word pair grammar and bigram model based oil word classes are used. Also we implement a search algorithm to find N-best candidate sentences. A postprocessor reorders the N-best sentences using word triple grammar, selects the most likely sentence as the final recognition result, and finally corrects trivial errors related with postpositions. In recognition tests using a 3,000-word continuous speech database, the system attained $93.1\%$ word recognition accuracy and $73.8\%$ sentence recognition accuracy using word triple grammar in postprocessing.

  • PDF

A Single Field Deinterlacing Algorithm Using Edge Map in the Image Block (영상 블록에서의 에지 맵을 이용한 단일 필드 디인터레이싱 알고리듬)

  • Kang, Kun-Hwa;Jeon, Gwang-Gil;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4C
    • /
    • pp.355-362
    • /
    • 2009
  • A new intra field deinterlacing algorithm with edge map in the image block is introduced. Conventional deinterlacing methods usually employ edge-based line average algorithm within pixel-by-pixel approach. However, it is sensitive to variation of intensity. To reduce this shortcoming, we proposed edge direction vector computed by edge map, and also its interpolation technique. We first introduce an edge direction vector, which is computed by Sobel mask, so that finer resolution of the edge direction can be acquired. The proposed edge direction vector oriented deinterlacer operates by identifying small pixel variations in five orientations, while weighted averaging to estimate missing pixel. According to the edge direction of the direction vector, we calculate weights on each edge direction. These weight values multiplied by the candidate deinterlaced pixels in order to successively build approximations of the deinterlaced sequence.

Half-Pixel Accuracy Motion Estimation Algorithm in the Transform Domain for H.264 (H.264를 위한 주파수 영역에서의 반화소 정밀도 움직임 예측 알고리듬)

  • Kang, Min-Jung;Heo, Jae-Seong;Ryu, Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.917-924
    • /
    • 2008
  • Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.

(Lip Recognition Using Active Shape Model and Gaussian Mixture Model) (Active Shape 모델과 Gaussian Mixture 모델을 이용한 입술 인식)

  • 장경식;이임건
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.5_6
    • /
    • pp.454-460
    • /
    • 2003
  • In this paper, we propose an efficient method for recognizing human lips. Based on Point Distribution Model, a lip shape is represented as a set of points. We calculate a lip model and the distribution of shape parameters using Principle Component Analysis and Gaussian mixture, respectively. The Expectation Maximization algorithm is used to determine the maximum likelihood parameter of Gaussian mixture. The lip contour model is derived by using the gray value changes at each point and in regions around the point and used to search the lip shape in a image. The experiments have been performed for many images, and show very encouraging result.

레이다와 전파신호처리 기술(I)

  • 곽영길
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.5 no.1
    • /
    • pp.100-110
    • /
    • 1994
  • 레이다 신호는 대표적인 전자파 신호로서 주변환경에 따라 시간, 주파수, 공간 영역에서 고유한 신호특성을 가지고 있으며, 신호처리 기법도 다양하다. 본 논문에서는 먼저 레이다를 위한 전파 신호처리 의정의와 필요성을 언급한뒤, 레이다 신호환경 특성을 살펴보고 신호처리를 위한 신호의 시간 및 스펙트럼 특성에 대해 기술하였다. 그리고, 신호특성에 적합한 신호처리기의 구현을 위해 레이다 신호처리에 관 련된 주요 기법에 대해 개괄적으로 설명하였다. 레이다 신호처리 분야는 일반적으로 잘 알려진 음성이 나 영상신호처리 분야와 달리 고유한 알고리듬과 구조가 요구된다. 신호처리기법으로서 레이다 파형설 계, 해상도 모호성, 펄스압축, 클러터제거, 도플러처리, 일정오경보탐지, 클러터 지도, 표적군 형성/ 추출, 표적식별, 레이다영상기법, 적응배열처리 등에 관해 개괄적으로 설명하였다. 레이다 선호처리 기술은 "스마트"한 레이다를 위한 두뇌 역할을 하기때문에 그 필요성과 중요성이 증가하고 있다. 그러나, 고속, 대용량의 신호를 주어진 빔 주사시간동안에 실시간으로 처리하여 표적 정보를 추출해야 하기 때문에 아직도 상용 프로세서의 속도 한계내에서 알고리듬의 수행에 다소 제약을 받고 있으나, 최근 디지탈 신호처리 전용의 고속 칩의 출현으로 많은 발전을 가져오고 있다. 끝으로, 향후 레이다 신호처리 발전 추세와 응용분야에 대해 살펴보았다. 응용분야는 군수 및 민수용의 겸용 파급효과가 매우 크고, 군용의 대공탐색 및 조기경보, 전장감시뿐만 아니라 전투기 탑재용으로 필수적이며, 특히 민수용의 공 항, 항공기, 선박, 위성 등 매우 다양하다. 최근 발전추세에 따른 기술로서 다중모드 신호처리, 고집적 회로기술, 적응배열, 디지탈 빔형성, 적응성, 고분해능 및 방향성, 표적식별, 다차원 신호처리에 대해 언급 하였다.

  • PDF

A Study on the Optimization Method using the Genetic Algorithm with Sensitivity Analysis (민감도가 고려된 알고리듬을 이용한 최적화 방법에 관한 연구)

  • Lee, Jae-Gwan;Sin, Hyo-Cheol
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.6 s.177
    • /
    • pp.1529-1539
    • /
    • 2000
  • A newly developed optimization method which uses the genetic algorithm combined with the sensitivity analysis is presented in this paper. The genetic algorithm is a probabilistic method, searching the optimum at several points simultaneously, requiring only the values of the object and constraint functions. It has therefore more chances to find global solution and can be applied various problems. Nevertheless, it has such shortcomings that even it approaches the optimum rapidly in the early stage, it slows down afterward and it can't consider the constraints explicitly. It is only because it can't search the local area near the current points. The traditional method, on the other hand, using sensitivity analysis is of great advantage in searching the near optimum. Thus the combination of the two techniques makes use of the individual advantages, that is, the superiority both in global searching by the genetic algorithm and in local searching by the sensitivity analysis. Application of the method to the several test functions verifies that the method suggested is very efficient and powerful to find the global solutions, and that the constraints can be considered properly.

A Petri Net based Disassembly Sequence Planning Model with Precedence Operations (분해우선작업을 가지는 페트리 넷 기반의 분해순서계획모델)

  • Seo, Kwang-Kyu
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.5
    • /
    • pp.1392-1398
    • /
    • 2008
  • This paper presents a Petri Net (PN) based disassembly sequence planning model with precedence operations. All feasible disassembly sequences are generated by a disassembly tree and a disassembly sequence is determined using the disassembly precedence and disassembly value matrix, The precedence of disassembly operations is determined through a disassembly tree and the value of disassembly is induced by economic analysis in the end-of-life phase. To solve the disassembly sequence planning model with precedence operations, a heuristic algorithm based on PNs is developed. The developed algorithm generates and searches a partial reachability graph to arrive at an optimal or near-optimal disassembly sequence based on the firing sequence of transitions of the PN model. A refrigerator is shown as an example to demonstrate the effectiveness of proposed model.

Development of an Enhanced Artificial Life Optimization Algorithm and Optimum Design of Short Journal Bearings (향상된 인공생명 최적화 알고리듬의 개발과 소폭 저널 베어링의 최적설계)

  • Yang, Bo-Suk;Song, Jin-Dae
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.12 no.6
    • /
    • pp.478-487
    • /
    • 2002
  • This paper presents a hybrid method to compute the solutions of an optimization Problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The artificial life algorithm has the most important feature called emergence. The emergence is the result of dynamic interaction among the individuals consisting of the system and is not found in an individual. The conventional artificial life algorithm for optimization is a stochastic searching algorithm using the feature of artificial life. Emergent colonies appear at the optimum locations in an artificial ecology. And the locations are the optimum solutions. We combined the feature of random-tabu search method with the conventional algorithm. The feature of random-tabu search method is to divide any given region into sub-regions. The enhanced artificial life algorithm (EALA) not only converge faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The enhanced artificial life algorithm is applied to the optimum design of high-speed, short journal bearings and its usefulness is verified through an optimization problem.

GA Based Locomotion Method for Quadruped Robot with Waist Joint to Walk on the Slop (허리 관절을 갖는 4족 로봇의 GA 기반 경사면 보행방법)

  • Choi, Yoon-Ho;Kim, Dong-Sub;Kim, Guk-Hwa
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.11
    • /
    • pp.1665-1674
    • /
    • 2013
  • In this paper, we propose a genetic algorithm(GA) based locomotion method of a quadruped robot with waist joint, which makes a quadruped robot walk on the slop efficiently. In the proposed method, we first derive the kinematic model of a quadruped robot with waist joint and then set the gene and the fitness function for GA. In addition, we determine the best attitude for a quadruped robot and the landing point of a foot in the walk space, which has the optimal energy stability margin(ESM). Finally, we verify the effectiveness of the proposed method by comparing with the performance of the previous method through the computer simulations.