• 제목/요약/키워드: Localization algorithm

검색결과 808건 처리시간 0.022초

스케일 불변 특징을 이용한 이동 로봇의 위치 추정 및 매핑 (Mobile Robot Localization and Mapping using Scale-Invariant Features)

  • 이종실;신동범;권오상;이응혁;홍승홍
    • 전기전자학회논문지
    • /
    • 제9권1호
    • /
    • pp.7-18
    • /
    • 2005
  • 로봇이 자율주행을 하는데 있어 중요한 요소는 로봇 스스로 위치를 추정하고 동시에 주위 환경에 대한 지도를 작성하는 것이다 본 논문에서는 스케일 불변 특정을 이용한 비전 기반 위치 추정 및 매핑 알고리즘을 제안한다. 로봇에 어안렌즈가 부착된 카메라를 천정을 바라볼 수 있도록 부착하여 스케일 불변 특정을 갖는 고급의 영상 특정을 구하여 맹 빌딩과 위치 추정을 수행한다. 먼저, 전처리 과정으로 어안렌즈를 통해 입력된 영상을 카메라 보정을 행하여 축방향 왜곡을 제거하고 레이블링과 컨벡스헐을 적용하여 천정영역과 벽영역으로 분할한다 최초 맵 빌딩시에는 분할된 영역에 대해 특정점을 구하고 맵 데이터베이스에 저장한다. 맵 빌딩이 종료될 때까지 연속하여 입력되는 영상에 대해 특정점들을 구하고 이미 작성된 맵과 매칭되는 점들을 찾고 매칭되지 않은 점들에 대해서는 기존의 맴에 추가하는 과정을 반복한다. 위치 추정은 맵 빌딩과정에서 매칭되는 점들을 찾을 때 동시에 수행되어 진다. 그리고 임의의 위치에서 기존의 작성된 맵과 매칭되는 점들을 찾음으로서 위치 추정이 행해지며 동시에 기존의 맵 데이터베이스의 특정점들을 갱신하게 된다. 제안한 방법은 $50m^2$의 영역에 대해 맵 빌딩을 2 분내에 수행할 수 있었으며, 위치의 정확도는 ${\pm}13cm$, 위치에 대한 로봇의 자세(각도)는 ${\pm}3$도의 오차를 갖는다.

  • PDF

Synthesis of 3D Sound Movement by Embedded DSP

  • Komata, Shinya;Sakamoto, Noriaki;Kobayashi, Wataru;Onoye, Takao;Shirakawa, Isao
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -1
    • /
    • pp.117-120
    • /
    • 2002
  • A single DSP implementation of 3D sound movement is described. With the use of a realtime 3D acoustic image localization algorithm, an efficient approach is devised for synthesizing the 3D sound movement by interpolating only two parameters of "delay" and "gain". Based on this algorithm, the realtime 3D sound synthesis is performed by a commercially available 16-bit fixed-point DSP with computational labor of 65 MIPS and memory space of 9.6k words, which demonstrates that the algorithm call be used even for the mobile applications.

  • PDF

지능형 서비스 로봇을 위한 원거리 음원 추적 기술 (Sound Source Localization Technique at a Long Distance for Intelligent Service Robot)

  • 이지연;한민수
    • 대한음성학회지:말소리
    • /
    • 제57호
    • /
    • pp.85-97
    • /
    • 2006
  • This paper suggests an algorithm that can estimate the direction of the sound source in real time. The algorithm uses the time difference and sound intensity information among the recorded sound source by four microphones. Also, to deal with noise of robot itself, the Kalman filter is implemented. The proposed method can take shorter execution time than that of an existing algorithm to fit the real-time service robot. Also, using the Kalman filter, signal ratio relative to background noise, SNR, is approximately improved to 8 dB. And the estimation result of azimuth shows relatively small error within the range of ${\pm}7$ degree.

  • PDF

타악기 음원 분리에 기반한 모노-스테레오 업믹싱 기법 (A Mono-To-Stereo Upmixing Algorithm Based on the Harmonic-Percussive Separation)

  • 최근우
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2013년도 하계학술대회
    • /
    • pp.60-63
    • /
    • 2013
  • In this research, a mono-to-stereo upmixing algorithm based on music source separation is proposed. For the upmixing, a harmonic and percussive separation for jazz music is implemented. Then, the sources are re-panned by equalizing the loudness of left and right sides of listeners in the one proposed approach. In the other approach, the harmonic sources are spread by a decorrelator while the percussive sources are panned to the center. In the experiments, the re-panning algorithm showed advanced performance in terms of localization and timbral quality.

  • PDF

Maximum Likelihood (ML)-Based Quantizer Design for Distributed Systems

  • Kim, Yoon Hak
    • Journal of information and communication convergence engineering
    • /
    • 제13권3호
    • /
    • pp.152-158
    • /
    • 2015
  • We consider the problem of designing independently operating local quantizers at nodes in distributed estimation systems, where many spatially distributed sensor nodes measure a parameter of interest, quantize these measurements, and send the quantized data to a fusion node, which conducts the parameter estimation. Motivated by the discussion that the estimation accuracy can be improved by using the quantized data with a high probability of occurrence, we propose an iterative algorithm with a simple design rule that produces quantizers by searching boundary values with an increased likelihood. We prove that this design rule generates a considerably reduced interval for finding the next boundary values, yielding a low design complexity. We demonstrate through extensive simulations that the proposed algorithm achieves a significant performance gain with respect to traditional quantizer designs. A comparison with the recently published novel algorithms further illustrates the benefit of the proposed technique in terms of performance and design complexity.

비전시스템 기반 군집주행 이동로봇들의 삼차원 위치 및 자세 추정 (Three-Dimensional Pose Estimation of Neighbor Mobile Robots in Formation System Based on the Vision System)

  • 권지욱;박문수;좌동경;홍석교
    • 제어로봇시스템학회논문지
    • /
    • 제15권12호
    • /
    • pp.1223-1231
    • /
    • 2009
  • We derive a systematic and iterative calibration algorithm, and position and pose estimation algorithm for the mobile robots in formation system based on the vision system. In addition, we develop a coordinate matching algorithm which calculates matched sequence of order in both extracted image coordinates and object coordinates for non interactive calibration and pose estimation. Based on the results of calibration, we also develop a camera simulator to confirm the results of calibration and compare the results of simulations with those of experiments in position and pose estimation.

SURF알고리듬에서의 고속 특징점 검출 방식 (A Fast Interest Point Detection Method in SURF Algorithm)

  • 황인소;엄일규;문용호;하석운
    • 대한임베디드공학회논문지
    • /
    • 제10권1호
    • /
    • pp.49-55
    • /
    • 2015
  • In this paper, we propose a fast interest point detection method using SURF algorithm. Since the SURF algorithm needs a great computations to detect the interest points and obtain the corresponding descriptors, it is not suitable for real-time based applications. In order to overcome this problem, the interest point detection step is parallelized by OpenMP and SIMD based on analysis of the scale space representation process and localization one in the step. The simulation results demonstrate that processing speed is enhanced about 55% by applying the proposed method.

능동 전방향 거리 측정 시스템을 이용한 이동로봇의 위치 추정 (Localization of Mobile Robot Using Active Omni-directional Ranging System)

  • 류지형;김진원;이수영
    • 제어로봇시스템학회논문지
    • /
    • 제14권5호
    • /
    • pp.483-488
    • /
    • 2008
  • An active omni-directional raging system using an omni-directional vision with structured light has many advantages compared to the conventional ranging systems: robustness against external illumination noise because of the laser structured light and computational efficiency because of one shot image containing $360^{\circ}$ environment information from the omni-directional vision. The omni-directional range data represents a local distance map at a certain position in the workspace. In this paper, we propose a matching algorithm for the local distance map with the given global map database, thereby to localize a mobile robot in the global workspace. Since the global map database consists of line segments representing edges of environment object in general, the matching algorithm is based on relative position and orientation of line segments in the local map and the global map. The effectiveness of the proposed omni-directional ranging system and the matching are verified through experiments.

지능형 로봇 '웨버'를 위한 음원 추적 기술 (Sound Localization Technique for Intelligent Service Robot 'WEVER')

  • 이지연;한민수;지수영;조영조
    • 대한음성학회:학술대회논문집
    • /
    • 대한음성학회 2005년도 추계 학술대회 발표논문집
    • /
    • pp.117-120
    • /
    • 2005
  • This paper suggests an algorithm that can estimate the direction of the sound source in realtime. Our intelligent service robot, WEVER, is used to implement the proposed method at the home environment. The algorithm uses the time difference and sound intensity information among the recorded sound source by four microphones. Also, to deal with noise of robot itself, the kalman filter is implemented. The proposed method takes shorter execution time than that of an existing algorithm to fit the real-time service robot. The result shows relatively small error within the range of ${\pm}$ 7 degree.

  • PDF

병렬 분산 환경에서의 DEVS 형식론의 구현 (An Implementation of the DEVS Formalism on a Parallel Distributed Environment)

  • 성영락
    • 한국시뮬레이션학회논문지
    • /
    • 제1권1호
    • /
    • pp.64-76
    • /
    • 1992
  • The DEVS(discrete event system specificaition) formalism specifies a discrete event system in a hierarchical, modular form. DEVSIM++ is a C++based general purpose DEVS abstract simulator which can simulate systems modeled by the DEVS formalism in a sequential environment. This paper describes P-DEVSIM++which is a parallel version of DEVSIM++ . In P-DEVSIM++, the external and internal event of DEVS models can by processed in parallel. For such processing, we propose a parallel, distributed optimistic simulation algorithm based on the Time Warp approach. However, the proposed algorithm localizes the rollback of a model within itself, not possible in the standard Time Warp approach. An advantage of such localization is that the simulation time may be reduced. To evaluate its performance, we simulate a single bus multiprocessor architecture system with an external common memory. Simulation result shows that significant speedup is made possible with our algorithm in a parallel environment.

  • PDF