• Title/Summary/Keyword: Reference map

Search Result 450, Processing Time 0.027 seconds

Map Building Using ICP Algorithm based a Robot Position Prediction (로봇 위치 예측에 기반을 둔 ICP 알고리즘을 이용한 지도 작성)

  • Noh, Sung-Woo;Kim, Tae-Gyun;Ko, Nak-Yong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.4
    • /
    • pp.575-582
    • /
    • 2013
  • This paper proposes a map building using the ICP algorithm based robot localization prediction. Proposed method predicts a robot location to dead reckoning, makes a map in the ICP algorithm. Existing method makes a map building and robot position using a sensor value of reference data and current data. In this case, a large interval of the difference of the reference data and the current data is difficult to compensate. The proposed method can map correction through practical experiments.

Vehicle Localization Method for Lateral Position within Lane Based on Vision and HD Map (비전 및 HD Map 기반 차로 내 차량 정밀측위 기법)

  • Woo, Rinara;Seo, Dae-Wha
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.20 no.5
    • /
    • pp.186-201
    • /
    • 2021
  • As autonomous driving technology advances, the accuracy of the vehicle position is important for recognizing the environments around driving. Map-matching localization techniques based on high definition (HD) maps have been studied to improve localization accuracy. Because conventional map-matching techniques estimate the vehicle position based on an HD map reference dataset representing the center of the lane, the estimated position does not reflect the deviation of the lateral distance within the lane. Therefore, this paper proposes a localization system based on the reference lateral position dataset extracted using image processing and HD maps. Image processing extracts the driving lane number using inverse perspective mapping, multi-lane detection, and yellow central lane detection. The lane departure method estimates the lateral distance within the lane. To collect the lateral position reference dataset, this approach involves two processes: (i) the link and lane node is extracted based on the lane number obtained from image processing and position from GNSS/INS, and (ii) the lateral position is matched with the extracted link and lane node. Finally, the vehicle position is estimated by matching the GNSS/INS local trajectory and the reference lateral position dataset. The performance of the proposed method was evaluated by experiments carried out on a highway environment. It was confirmed that the proposed method improves accuracy by about 1.0m compared to GNSS / INS, and improves accuracy by about 0.04m~0.21m (7~30%) for each section when compared with the existing lane-level map matching method.

Graph-based Wi-Fi Radio Map Construction and Update Method (그래프 기반 Wi-Fi 신호 지도 구축 및 갱신 기법)

  • Yu, Subin;Choi, Wonik
    • Journal of KIISE
    • /
    • v.44 no.6
    • /
    • pp.643-648
    • /
    • 2017
  • Among Wi-Fi based indoor positioning systems, fingerprinting localization is the most common technique with high precision. However, construction of the initial radio map and the update process require considerable labor and time effort. To address this problem, we propose an efficient method that constructs the initial radio map at each vertex based on a graph. In addition, we introduce a method to update the radio map automatically by mapping signal data acquired from users to the reference point created on each edge. Since the proposed method collects signal data manually only at the vertex of the graph to build the initial radio map and updates it automatically, our proposed method can dramatically reduce labor and time effort, which are the disadvantages of the conventional fingerprinting method. In our experimental study, we show validity of our radio map update method by comparing with the actual reference point data. We also show that our proposed method is able to construct the radio map with an accuracy of about 3.5m by automatically updating the radio map.

Depth-map Preprocessing Algorithm Using Two Step Boundary Detection for Boundary Noise Removal (경계 잡음 제거를 위한 2단계 경계 탐색 기반의 깊이지도 전처리 알고리즘)

  • Pak, Young-Gil;Kim, Jun-Ho;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.12
    • /
    • pp.555-564
    • /
    • 2014
  • The boundary noise in image syntheses using DIBR consists of noisy pixels that are separated from foreground objects into background region. It is generated mainly by edge misalignment between the reference image and depth map or blurred edge in the reference image. Since hole areas are generally filled with neighboring pixels, boundary noise adjacent to the hole is the main cause of quality degradation in synthesized images. To solve this problem, a new boundary noise removal algorithm using a preprocessing of the depth map is proposed in this paper. The most common way to eliminate boundary noise caused by boundary misalignment is to modify depth map so that the boundary of the depth map can be matched to that of the reference image. Most conventional methods, however, show poor performances of boundary detection especially in blurred edge, because they are based on a simple boundary search algorithm which exploits signal gradient. In the proposed method, a two-step hierarchical approach for boundary detection is adopted which enables effective boundary detection between the transition and background regions. Experimental results show that the proposed method outperforms conventional ones subjectively and objectively.

A New Reference Pixel Prediction for Reversible Data Hiding with Reduced Location Map

  • Chen, Jeanne;Chen, Tung-Shou;Hong, Wien;Horng, Gwoboa;Wu, Han-Yan;Shiu, Chih-Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.1105-1118
    • /
    • 2014
  • In this paper, a new reversible data hiding method based on a dual binary tree of embedding levels is proposed. Four neighborhood pixels in the upper, below, left and right of each pixel are used as reference pixels to estimate local complexity for deciding embeddable and non-embeddable pixels. The proposed method does not need to record pixels that might cause underflow, overflow or unsuitable for embedment. This can reduce the size of location map and release more space for payload. Experimental results show that the proposed method is more effective in increasing payload and improving image quality than some recently proposed methods.

Validation of MODIS LAI Product Over Temperate Forest

  • Kim, Sun-Hwa;Lee, Kyu-Sung
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.679-684
    • /
    • 2002
  • MODIS LAI has been one of key products for analyzing the quantitative aspects ofterrestrial ecology. This study was designed to validate MODIS LAS product by using the reference LAI map that was derived from both ground measurements and ETM+ surface reflectance. The study area, the Kwangneung Experiment Forest in Korea, covers mixed species of deciduous and conifers of temperate forest. Throughout the growing season of 2002, we have measured LAS at the 30 sample plots using an optical device. Ground measured LAS data were then correlated to the ETM+ reflectance to produce a continuous map of LAS over the study area. Preliminary comparison between MODIS LAI and the reference LAI map showed the lower LAI values from the MODIS product.

  • PDF

A Preliminary Cut-off Indoor Positioning Scheme Using Beacons (비콘을 활용하여 실내위치 찾는 사전 컷-오프 방식)

  • Kim, Dongjun;Park, Byoungkwan;Son, Jooyoung
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.2
    • /
    • pp.110-115
    • /
    • 2017
  • We propose a new indoor positioning algorithm named Cut-off algorithm. This algorithm cuts off candidates of beacons and reference points in advance, before looking for K neighbor reference points which are guessed to be closest to the user's actual location. The algorithm consists of two phases: off-line phase, and on-line phase. In the off-line phase, RSSI and UUID data from beacons are gathered at reference points placed in the indoor environment, and construct a fingerprint map of the data. In the on-line phase, the map is reduced to a smaller one according to the RSSI data of beacons received from the user's device. The nearest K reference points are selected using the reduced map, which are used for estimating user's location. In both phases, relative ranks of the peak signals received from each beacon are used, which smoothen the fluctuations of the signals. The algorithm is shown to be more efficient in terms of accuracy and estimating time.

DEM Estimation Using Two Stage Stereo Matching Method (2단계 스테레오 정합기법을 이용한 DEM 추정)

  • Nam, Chang-Woo;Woo, Dong-Min
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.3044-3046
    • /
    • 2000
  • A Stereo matching has been an important tool for reconstructing three dimensional terrain. In this stereo matching process, DEM(Digitai Elevation Map) can be generated by the disparity from reference image to target image. Generally disparity map in matching process can be implemented by wraping from reference image to target image and if the role of reference and target is interchanged, the different DEM can be obtained. To evaluate the generated DEM from matching process, We adapted the Photorealistic synthetic image generator using ray tracing technique. The generator produce two simulated image from previous DEM and Ortho-image which is regard as Ground-truth. In this paper, we are concern about estimating more accurate DEM from these two DEMs. The several fusion methods of two DEMs are proposed to generate accurate DEM and compared with previous method. one of fusion methods is by using Cross-Correlation match score and the true DEM should have a high matching score.

  • PDF

Radio map fingerprint algorithm based on a log-distance path loss model using WiFi and BLE (WiFi와 BLE 를 이용한 Log-Distance Path Loss Model 기반 Fingerprint Radio map 알고리즘)

  • Seong, Ju-Hyeon;Gwun, Teak-Gu;Lee, Seung-Hee;Kim, Jeong-Woo;Seo, Dong-hoan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.1
    • /
    • pp.62-68
    • /
    • 2016
  • The fingerprint, which is one of the methods of indoor localization using WiFi, has been frequently studied because of its ability to be implemented via wireless access points. This method has low positioning resolution and high computational complexity compared to other methods, caused by its dependence of reference points in the radio map. In order to compensate for these problems, this paper presents a radio map designed algorithm based on the log-distance path loss model fusing a WiFi and BLE fingerprint. The proposed algorithm designs a radio map with variable values using the log-distance path loss model and reduces distance errors using a median filter. The experimental results of the proposed algorithm, compared with existing fingerprinting methods, show that the accuracy of positioning improved by from 2.747 m to 2.112 m, and the computational complexity reduced by a minimum of 33% according to the access points.

A New Method for Relative/Quantitative Comparison of Map Built by SLAM (SLAM으로 작성한 지도 품질의 상대적/정량적 비교를 위한 방법 제안)

  • Kwon, Tae-Bum;Chang, Woo-Sok
    • The Journal of Korea Robotics Society
    • /
    • v.9 no.4
    • /
    • pp.242-249
    • /
    • 2014
  • By a SLAM (simultaneous localization and mapping) method, we get a map of an environment for autonomous navigation of a robot. In this case, we want to know how accurate the map is. Or we want to know which map is more accurate when different maps can be obtained by different SLAM methods. So, several methods for map comparison have been studied, but they have their own drawbacks. In this paper, we propose a new method which compares the accuracy or error of maps relatively and quantitatively. This method sets many corresponding points on both reference map and SLAM map, and computes the translational and rotational values of all corresponding points using least-squares solution. Analyzing the standard deviations of all translational and rotational values, we can know the error of two maps. This method can consider both local and global errors while other methods can deal with one of them, and this is verified by a series of simulations and real world experiments.