• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.822-827
• /
• 2003

Topological maps have drawn more attention recently because they are compact, provide natural interfaces, and are applicable to path planning easily. To build a topological map incrementally, Voronoi diagram was used by many researchers. The Voronoi diagram, however, has difficulty in applying to arbitrarily shaped objects and needs long computation time. In this paper, we present a new method for global topological map from the local topological maps incrementally. The local topological maps are created through a thinning algorithm from a local grid map, which is built based on the sensor information at the current robot position. A thinning method requires simpler computation than the Voronoi diagram. Localization based on the topological map is usually difficult, but additional nodes created by the thinning method can improve localization performance. A series of experiments have been conducted using a two-wheeled mobile robot equipped with a laser scanner. It is shown that the proposed scheme can create satisfactory topological maps.

• The Journal of Korea Robotics Society
• /
• v.13 no.2
• /
• pp.79-85
• /
• 2018

This study focuses on autonomous exploration based on map expansion for an underwater robot equipped with acoustic sonars. Map expansion is applicable to large-area mapping, but it may affect localization accuracy. Thus, as the key contribution of this paper, we propose a method for underwater autonomous exploration wherein the robot determines the trade-off between map expansion ratio and position accuracy, selects which of the two has higher priority, and then moves to a mission step. An occupancy grid map is synthesized by utilizing the measurements of an acoustic range sonar that determines the probability of occupancy. This information is then used to determine a path to the frontier, which becomes the new search point. During area searching and map building, the robot revisits artificial landmarks to improve its position accuracy as based on imaging sonar-based recognition and EKF-SLAM if the position accuracy is above the predetermined threshold. Additionally, real-time experiments were conducted by using an underwater robot, yShark, to validate the proposed method, and the analysis of the results is discussed herein.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.12
• /
• pp.1061-1067
• /
• 2016

Position of the vehicle for driving is essential to autonomous navigation. However, there appears GPS position error due to multipath which is occurred by tall buildings in downtown area. In this paper, GPS position error is corrected by using camera sensor and highly accurate map made with 3D-Lidar. Input image through inverse perspective mapping is converted into top-view image, and it works out map matching with the map which has intensity of 3D-Lidar. Performance comparison was conducted between this method and traditional way which does map matching with input image after conversion of map to pinhole camera image. As a result, longitudinal error declined 49% and complexity declined 90%.

• Progress in Medical Physics
• /
• v.31 no.4
• /
• pp.189-193
• /
• 2020

An MR-based attenuation correction (MRAC) map plays an important role in quantitative positron emission tomography (PET) image evaluation in PET/magnetic resonance imaging (MRI) systems. However, the MRAC map is affected by the magnetic field inhomogeneity of MRIs. This study aims to evaluate the characteristics of MRAC maps of physical phantoms on PET/MRI images. Phantom measurements were performed using the Siemens Biograph mMR. The modular type physical phantoms that provide assembly versatility for phantom construction were scanned in a four-channel Body Matrix coil. The MRAC map was generated using the two-point Dixon-based segmentation method for whole-body imaging. The modular phantoms were scanned in compact and non-compact assembly configurations. In addition, the phantoms were scanned repeatedly to generate MRAC maps. The acquired MRAC maps show differently assigned values for void areas. An incorrect assignment of a void area was shown on a locally compact space between phantoms. The assigned MRAC values were distorted using a wide field-of-view (FOV). The MRAC values also differed after repeated scans. However, the erroneous MRAC values appeared outside of phantom, except for a large FOV. The MRAC map of the phantom was affected by phantom configuration and the number of scans. A quantitative study using a phantom in a PET/MRI system should be performed after evaluation of the MRAC map characteristics.

• The Research Journal of the Costume Culture
• /
• v.20 no.6
• /
• pp.869-882
• /
• 2012

The purpose of this study is to obtain the patent for extracting the color map and color chip from the color image source and to develop color image map for fashion design. For this study, fashion image maps were produced from 210 pictures with Adobe Photoshop CS2 program targeting 200 university students from 2004 to 2006. The procedures for extracting the color map and color chip included providing the color image, the filtering phase, the segmentation phase, the extraction phrase, and the arrangement phase. Based on the results of this study, patent application was made to KIPO(Korean Intellectual Property Office) for this invention. The following effects can be expected from the standpoint of design based on the case study. First, it is a straight forward procedure to extract a color chip and color map from a color image. Second, it can be applied to various art works based on the recombination of colors as representative colors can be extracted from the related color image that combines a variety of colors. Third, desired colors can be selected based on the taste cluster classification or sensibility axis of design by extracting the representative color from the color image.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.4
• /
• pp.13-21
• /
• 2010

Most of traffic management systems include the map-based traffic information services using World Wide Web. Geographic Information System is an efficient tool to build a map-based system. However, many traffic information service systems have own independent maps for graphic/animation softwares such as Adobe Flash. These systems make it difficult to manage modifications of maps. In this paper, we suggest a new GIS-based traffic information service system without these problems. The proposed system makes the efficient use of GIS map data for traffic information service because a map display engine is separated from map data that is transferred after real-time conversion.

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.232-235
• /
• 2010

This paper proposes an efficient depth-map coding method. The adaptive block-based depth-map coding method decides the number of bit planes to be encoded according to the quantization parameters to obtain the desired bit rates. So, the depth-map coding using the block-based decision of the bit-plane to be encoded proposes to free from the constraint of the quantization parameters. Simulation results show that the proposed method, in comparison with the adaptive block-based depth-map coding method, improves the average BD-rate savings by 3.5% and the average BD-PSNR gains by 0.25dB.

• Journal of Korea Multimedia Society
• /
• v.17 no.7
• /
• pp.769-777
• /
• 2014

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. At this point, GIS security techniques focusing on secure network and data encryption have been studied and developed to solve the copyright protection and illegal copy prevention for GIS digital map. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents a novel selective encryption scheme for GIS vector map data protection to store, transmit or distribute to authorized users using K-means algorithm. The proposed algorithm only encrypts a small part of data based on properties of polylines and polygons in GIS vector map but it can change whole data of GIS vector map. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3558-3577
• /
• 2017

In 2D-to-3D video conversion process, the virtual left and right view can be generated from 2D video and its corresponding depth map by depth image based rendering (DIBR). The depth map plays an important role in conversion system, so the copyright protection for depth map is necessary. However, the provided virtual views may be distributed illegally and the depth map does not directly expose to viewers. In previous works, the copyright information embedded into the depth map cannot be extracted from virtual views after the DIBR process. In this paper, a new copyright protection scheme for the depth map is proposed, in which the copyright information can be detected from the virtual views even without the depth map. The experimental results have shown that the proposed method has a good robustness against JPEG attacks, filtering and noise.

• The Journal of Korea Robotics Society
• /
• v.8 no.4
• /
• pp.256-265
• /
• 2013

A local map-based exploration algorithm for mobile robots is presented. Segmented frontiers and their relative transformations constitute a tree structure. By the proposed efficient frontier segmentation and a local map management method, a robot can reduce the unknown area and update the local grid map which is assigned to each frontier node. Although this local map-based exploration method uses only local maps and their adjacent node information, mapping completion and efficiency can be greatly improved by merging and updating the frontier nodes. Also, we suggest appropriate graph search exploration methods for corridor and hall environments. The simulation demonstrates that the entire environment can be represented by well-distributed frontier nodes.