• Title/Summary/Keyword: map-matching algorithm

Search Result 233, Processing Time 0.028 seconds

The Background Segmentation of the Target Object for the Stereo Vision System (스테레오 비젼 시스템을 위한 표적물체의 배경 분리)

  • Ko, Jung Hwan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.4 no.1
    • /
    • pp.25-31
    • /
    • 2008
  • In this paper, we propose a new method that separates background and foreground from stereo images. This method can be improved automatic target tracking system by using disparity map of the stereo vision system and background-separating mask, which can be obtained camera configuration parameters. We use disparity map and camera configuration parameters to separate object from background. Disparity map is made with block matching algorithm from stereo images. A morphology filter is used to compensate disparity error that can be caused by occlusion area. We could obtain a separated object from background when the proposed method was applied to real stereo cameras system.

Map Matching Algorithm Using Continuous GPS Coordinates (연속 GPS좌표를 이용한 지도 매칭 알고리즘)

  • Park, Do-Young;WhangBo, Taeg-Keun
    • Journal of Korea Spatial Information System Society
    • /
    • v.4 no.1 s.7
    • /
    • pp.27-37
    • /
    • 2002
  • Ideas providing an optimal car route using current traffic condition, maintaining the current location and the history of driven route of a car in the main central office, in where GPS signals transmitted from the driving cars are received, have been proposed. Since GPS signals occurred in certain time interval instead of all GPS signals are transmitted from the car due to the cost of transmission, an algorithm that is able to recover the missing GPS signals is required. In this paper, an efficient algorithm, which finds the driven route and the current location of a car fast, is proposed. To verify the efficiency of the proposed algorithm, it is applied to the various real GIS map and it turns out to be very effective.

  • PDF

3D Simultaneous Localization and Map Building (SLAM) using a 2D Laser Range Finder based on Vertical/Horizontal Planar Polygons (2차원 레이저 거리계를 이용한 수직/수평 다각평면 기반의 위치인식 및 3차원 지도제작)

  • Lee, Seungeun;Kim, Byung-Kook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.11
    • /
    • pp.1153-1163
    • /
    • 2014
  • An efficient 3D SLAM (Simultaneous Localization and Map Building) method is developed for urban building environments using a tilted 2D LRF (Laser Range Finder), in which a 3D map is composed of perpendicular/horizontal planar polygons. While the mobile robot is moving, from the LRF scan distance data in each scan period, line segments on the scan plane are successively extracted. We propose an "expected line segment" concept for matching: to add each of these scan line segments to the most suitable line segment group for each perpendicular/horizontal planar polygon in the 3D map. After performing 2D localization to determine the pose of the mobile robot, we construct updated perpendicular/horizontal infinite planes and then determine their boundaries to obtain the perpendicular/horizontal planar polygons which constitute our 3D map. Finally, the proposed SLAM algorithm is validated via extensive simulations and experiments.

Implementation of a 3D Recognition applying Depth map and HMM (깊이 맵과 HMM을 이용한 인식 시스템 구현)

  • Han, Chang-Ho;Oh, Choon-Suk
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.2
    • /
    • pp.119-126
    • /
    • 2012
  • Recently, we used to recognize for human motions with some recognition algorithms. examples, HMM, DTW, PCA etc. In many human motions, we concentrated our research on recognizing fighting motions. In previous work, to obtain the fighting motion data, we used motion capture system which is developed with some active markers and infrared rays cameras and 3 dimension information converting algorithms by the stereo matching method. In this paper, we describe that the different method to acquiring 3 dimension fighting motion data and a HMM algorithm to recognize the data. One of the obtaining 3d data we used is depth map algorithm which is calculated by a stereo method. We test the 3d acquiring and the motion recognition system, and show the results of accuracy and performance results.

Path Determination Algorithm of Guidance Robot for the Visually Impaired (시각장애인 유도로봇의 경로 결정 알고리즘)

  • Jang, Tae-Jin;Shen, Dongfan;Lee, Eung-Hyuk;Hong, Seung-Hong
    • Proceedings of the KIEE Conference
    • /
    • 2003.11b
    • /
    • pp.259-262
    • /
    • 2003
  • In this paper, we studied the path determination algorithm of the guidance robot for the visually impaired. Using the guidance robot for the visually impaired, the visually impaired can go to the destination where they want without other's heir. The navigation path of the guidance robot for the visually impaired must be the optimal path not only the shortest but also the most safe, which is different from a shortest path for common people. GPS and electronic map are used for the location information of the visually impaired. We corrected the error by converting the coordinates of location information from GPS, which includes maximum several tens of meters error, to the coordinates of electronic map. Information such as simple path and direction to the destination is not enough because it may be different between a going path from the start to the destination and a coming path from the destination to the start as around environment. So, we added information which can be dangerous for the visually impaired such as driveway, sidewalk without braille blocks, crosswalk, stairs and overpass, each has weight value as dangerous degree, when matching the GPS information to the electronic map, enough large as 1:5,000 scale.

  • PDF

Competition-Based Disparity Detection on the Diffusion-Based Stereo Matching (확산을 이용한 스테레오 정합에서 경쟁적 변이 검출)

  • Lee, Sang-Chan;Kim, Eun-Ji;Seol, Seong-Uk;Nam, Gi-Gon;Kim, Jae-Chang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.4
    • /
    • pp.16-25
    • /
    • 2000
  • In this paper, a new disparity detection algorithm which is robust to noise is presented. It detects the disparity of an arbitrary pixel through the iterative competition with neighbor pixels in the range of disparity. A diffusion process to improve stereo matching confidence is used prior to detecting disparity of an arbitrary pixel. It is used for aggregating initial matching measure of the difference map. If the image region for matching is too small, a wrong match might be found due to noise. On the contrary, the region is too big, it results in blurring of object boundaries. Therefore, we decide the image region for matching by using the diffusion process for aggregating matching measure, then detect the true disparity with proposed competition method to the distribution of matching measure. Through the proposed method we get the result of improving matching rate of 6.96% with real stereo imge. From the simulation with the stereo imge, the proposed disparity detection method significantly outperforms the conventional method to matching rate.

  • PDF

Data Association of Robot Localization and Mapping Using Partial Compatibility Test (Partial Compatibility Test 를 이용한 로봇의 위치 추정 및 매핑의 Data Association)

  • Yan, Rui Jun;Choi, Youn Sung;Wu, Jing;Han, Chang Soo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.33 no.2
    • /
    • pp.129-138
    • /
    • 2016
  • This paper presents a natural corners-based SLAM (Simultaneous Localization and Mapping) with a robust data association algorithm in a real unknown environment. Corners are extracted from raw laser sensor data, which are chosen as landmarks for correcting the pose of mobile robot and building the map. In the proposed data association method, the extracted corners in every step are separated into several groups with small numbers of corners. In each group, local best matching vector between new corners and stored ones is found by joint compatibility, while nearest feature for every new corner is checked by individual compatibility. All these groups with local best matching vector and nearest feature candidate of each new corner are combined by partial compatibility with linear matching time. Finally, SLAM experiment results in an indoor environment based on the extracted corners show good robustness and low computation complexity of the proposed algorithms in comparison with existing methods.

Windowed Wavelet Stereo Matching Using Shift ability (이동성(shift ability)을 이용한 윈도우 웨이블릿 스테레오 정합)

  • 신재민;이호근;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1C
    • /
    • pp.56-63
    • /
    • 2003
  • In this paper, a wavelet-based stereo matching algorithm to obtain an accurate disparity map in wavelet transformed domain by using a shift ability property, a modified wavelet transform, the similarities for their sub-bands, and a hierarchical structure is proposed. New approaches for stereo matching by lots of feature information are to utilize translation-variant results of the sub-bands in the wavelet transformed domain because they cannot literally expect translation invariance in a system based on convolution and sub-sampling. After the similarity matching for each sub-band, we can easily find optimal matched-points because the sub-bands appearance of the shifted signals is definitely different from that of the original signal with no shift.

Robust Object Extraction Algorithm in the Sea Environment (해양환경에서 강건한 물표 추적 알고리즘)

  • Park, Jiwon;Jeong, Jongmyeon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.3
    • /
    • pp.298-303
    • /
    • 2014
  • In this paper, we proposed a robust object extraction and tracking algorithm in the IR image sequence acquired in the sea environment. In order to extract size-invariant object, we detect horizontal and vertical edges by using DWT and combine it to generate saliency map. To extract object region, binarization technique is applied to saliency map. The correspondences between objects in consecutive frames are defined by the calculating minimum weighted Euclidean distance as a matching measure. Finally, object trajectories are determined by considering false correspondences such as entering object, vanishing objects and false object and so on. The proposed algorithm can find trajectories robustly, which has shown by experimental results.

Object Tracking Algorithm using Feature Map based on Siamese Network (Siamese Network의 특징맵을 이용한 객체 추적 알고리즘)

  • Lim, Su-Chang;Park, Sung-Wook;Kim, Jong-Chan;Ryu, Chang-Su
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.6
    • /
    • pp.796-804
    • /
    • 2021
  • In computer vision, visual tracking method addresses the problem of localizing an specific object in video sequence according to the bounding box. In this paper, we propose a tracking method by introducing the feature correlation comparison into the siamese network to increase its matching identification. We propose a way to compute location of object to improve matching performance by a correlation operation, which locates parts for solving the searching problem. The higher layer in the network can extract a lot of object information. The lower layer has many location information. To reduce error rate of the object center point, we built a siamese network that extracts the distribution and location information of target objects. As a result of the experiment, the average center error rate was less than 25%.