• Title/Summary/Keyword: Vector Map Data

Search Result 220, Processing Time 0.02 seconds

2D Grid Map Compensation Using ICP Algorithm based on Feature Points (특징 점 기반의 ICP 알고리즘을 이용한 2차원 격자지도 보정)

  • Hwang, Yu-Seop;Lee, Dong-Ju;Yu, Ho-Yun;Lee, Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.10
    • /
    • pp.965-971
    • /
    • 2015
  • This paper suggests a feature point-based Iterative Closest Point (ICP) algorithm to compensate for the disparity error in building a two-dimensional map. The ICP algorithm is a typical algorithm for matching a common object in two different images. In the process of building a two-dimensional map using the laser scanner data, warping and distortions exist in the map because of the disparity between the two sensor values. The ICP algorithm has been utilized to reduce the disparity error in matching the scanned line data. For this matching process in the conventional ICP algorithm, pre-known reference data are required. Since the proposed algorithm extracts characteristic points from laser-scanned data, reference data are not required for the matching. The laser scanner starts from the right side of the mobile robot and ends at the left side, which causes disparity in the scanned line data. By finding the matching points between two consecutive frame images, the motion vector of the mobile robot can be obtained. Therefore, the disparity error can be minimized by compensating for the motion vector caused by the mobile robot motion. The validity of the proposed algorithm has been verified by comparing the proposed algorithm in terms of map-building accuracy to conventional ICP algorithm real experiments.

A Watermarking Scheme for Shapefile-Based GIS Digital Map Using Polyline Perimeter Distribution

  • Huo, Xiao-Jiao;Lee, Suk-Hwan;Kwon, Seong-Geun;Moon, Kwan-Seok;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.595-606
    • /
    • 2011
  • This paper proposes a robust watermarking scheme for GIS digital map by using the geometric properties of polyline and polygon, which are the fundamental components in vector data structure. In the proposed scheme, we calculate the lengths and the perimeters of all polylines and polygons in a map and cluster them to a number of groups. Then we embed the binary watermark by changing the mean of lengths and perimeters in an embedding group. For improving the safety and robustness, we permute the binary watermark through PRNS(pseudo-random number sequence) processing and embed it repeatedly in a model. Experimental results verified that our scheme has a good invisibility, safety and robustness to various geometric attacks and also our scheme needs not the original map in the extracting process of watermark.

Design of Spatial Data Compression Methods for Improvement of Mobile Transmission Efficiency (모바일 전송 효율 향상을 위한 공간 데이터 압축 기법의 설계)

  • 최진오;김진덕;문상호
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.4
    • /
    • pp.950-954
    • /
    • 2004
  • According to the rapid advance of computer and communication techniques, the request of mobile internet services is highly increasing. However, the main obstacles for mobile vector map service environments, are large data volume and narrow wireless bandwidth. Among the many possible solutions, spatial data compression technique may contribute to reduce the load of bandwidth and client response time. This thesis proposes two methods for spatial data compression. The one is relative coordinates transformation method, and the other is client coordinates transformation method. And, this thesis also proposes the system architecture for experiments. The two compression methods could be evaluated the compression effect and the response time.

Study on the Filtering Methods for Mobile Vector Map Service (모바일 벡터 맵 서비스를 위한 필터링 기법 연구)

  • Choi Jin-Ho;Lee Sang-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.9
    • /
    • pp.1612-1616
    • /
    • 2006
  • For map services in the mobile environment, it should be considered that resource restriction or the mobile device. on, if a map database dedicated to mobile services may not be developed, the spatial data extracted from general map databases should be simplified before transmitting. % is paper suggests the filtering methods to manipulate the spatial data, which are changed to be able to displayed on the mobile devices. The suggested methods are evaluated by experiments. This method is based on the map generalization operator 'selection' and is refined to adapt on mobile phone environments.

Feature-Based Image Retrieval using SOM-Based R*-Tree

  • Shin, Min-Hwa;Kwon, Chang-Hee;Bae, Sang-Hyun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2003.11a
    • /
    • pp.223-230
    • /
    • 2003
  • Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R*-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R*-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R*-tree combines SOM and R*-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R*-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R*-tree with that of an SOM and an R*-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R*-tree outperforms both the SOM and R*-tree due to the reduction of the number of nodes required to build R*-tree and retrieval time cost.

  • PDF

A Haptic Rendering Technique for 3D Objects with Vector Field (벡터 필드를 가진 3차원 오브젝트의 햅틱 렌더링 기법)

  • Kim, Lae-Hyun;Park, Se-Hyung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.4
    • /
    • pp.216-222
    • /
    • 2006
  • Vector field has been commonly used to visualize the data set which is invisible or is hard to explain. For instance, it could be used to visualize scientific data such as the direction and amount of wind and water field, transfer of heat through thermally conductive materials, and electromagnetic field. In this paper, we present a technique to enable intuitive recognition of the data though haptic feedback along with visual feedback. To add tactile information to graphical vector field, we model a haptic vector field and then apply it to the haptic map to guide a user to destination and haptic simulation of water field on 2D images whish can be used ill everyday life. These systems allow one to recognize vector information intuitively through haptic interface. We expect that the haptic rendering technique of vector field can be applied to various applications such as education, training, and entertainment.

A Blind Vector Digital Watermarking for GIS using the Closest Pair of Points (최근점 쌍을 이용한 벡터 맵 디지털 워터마킹)

  • Kim, Jung-Yeop;Park, Soo-Hong
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.6
    • /
    • pp.536-544
    • /
    • 2009
  • This paper proposed a novel vector digital watermarking method to protect copyright. The proposed method embeds watermarks after finding the closest pair of points and calculating the distance of the points. We tested the robustness of the method through several attacks on watermarked data. The experimental results show that the proposed method has more robustness than previous methods. And the new method doesn't change the topology of the vector data. Therefore, this method can be 'the vector digital watermarking for GIS.

Graph-based Segmentation for Scene Understanding of an Autonomous Vehicle in Urban Environments (무인 자동차의 주변 환경 인식을 위한 도시 환경에서의 그래프 기반 물체 분할 방법)

  • Seo, Bo Gil;Choe, Yungeun;Roh, Hyun Chul;Chung, Myung Jin
    • The Journal of Korea Robotics Society
    • /
    • v.9 no.1
    • /
    • pp.1-10
    • /
    • 2014
  • In recent years, the research of 3D mapping technique in urban environments obtained by mobile robots equipped with multiple sensors for recognizing the robot's surroundings is being studied actively. However, the map generated by simple integration of multiple sensors data only gives spatial information to robots. To get a semantic knowledge to help an autonomous mobile robot from the map, the robot has to convert low-level map representations to higher-level ones containing semantic knowledge of a scene. Given a 3D point cloud of an urban scene, this research proposes a method to recognize the objects effectively using 3D graph model for autonomous mobile robots. The proposed method is decomposed into three steps: sequential range data acquisition, normal vector estimation and incremental graph-based segmentation. This method guarantees the both real-time performance and accuracy of recognizing the objects in real urban environments. Also, it can provide plentiful data for classifying the objects. To evaluate a performance of proposed method, computation time and recognition rate of objects are analyzed. Experimental results show that the proposed method has efficiently in understanding the semantic knowledge of an urban environment.

A Consideration of the Optimal Thinning Algorithm for Cadastral Map Vectorizing (지적도 벡터라이징을 위한 최적 세선화 알고리즘에 대한 고찰)

  • Won, Nam-Sik;Kim, Kwon-Yang
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.2 no.1
    • /
    • pp.54-62
    • /
    • 1999
  • Vectorizing for input processing of map is the most time and cost consuming task, and the quality of vector data depends on that processing result. Therefore, it is an important task to develop a good vectorizing system in the GIS. Thinning algorithm is the most important technology for deciding the quality of vector data in the vectorizing system. In this paper, as a suitable algorithm for map vectorizing we considered several algorithms that preserve topological and geometric characteristics, and have no distortion of the contour line. As a results, we implemented WPTA4 and well known thinning algorithm, and compared WPTA4 execution results with the others.

  • PDF

Measurement System Development for Three-Dimensional Flow Velocity Components Using Straight-Type Five-Hole Pressure Probe (직선형 5공 압력프로브를 이용한 3차원 유동속도 계측시스템 개발)

  • Kim, J.K.;Jeong, K.J.;Oh, S.H.
    • Journal of Power System Engineering
    • /
    • v.10 no.4
    • /
    • pp.56-64
    • /
    • 2006
  • This paper shows the development process of a straight-type five-hole pressure probe for measuring three-dimensional flow velocity components. The data reduction method using a bi-cubic curve-fitting program in a new calibration map was introduced in this study. This new calibration map can be applied up to the application angle, ${\pm}55^{\circ}$ of a probe. As a result, for the application angle of ${\pm}45^{\circ}$, an error for yaw and pitch angles appeared from $-1.76^{\circ}\;to\;1.83^{\circ}$ and from $-1.91^{\circ}\;to\;1.75^{\circ}$, respectively. Moreover, an error for a vector magnitude and a static pressure compared with a dynamic one showed from -7.83% to 4.87% and from -0.73 to 0.77, respectively. Even though this data reduction method showed unsatisfactory errors in a vector magnitude, it resulted in an easy and simple application method. Especially, when it was applied to an actual flow field including a swirling flow, a good result came out on the whole. However, in order to obtain a better result, it is thought that a more sophisticated interpolation method needs to be introduced.

  • PDF