• Title/Summary/Keyword: MAP algorithm

Search Result 2,002, Processing Time 0.026 seconds

Localization of a Monocular Camera using a Feature-based Probabilistic Map (특징점 기반 확률 맵을 이용한 단일 카메라의 위치 추정방법)

  • Kim, Hyungjin;Lee, Donghwa;Oh, Taekjun;Myung, Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.4
    • /
    • pp.367-371
    • /
    • 2015
  • In this paper, a novel localization method for a monocular camera is proposed by using a feature-based probabilistic map. The localization of a camera is generally estimated from 3D-to-2D correspondences between a 3D map and an image plane through the PnP algorithm. In the computer vision communities, an accurate 3D map is generated by optimization using a large number of image dataset for camera pose estimation. In robotics communities, a camera pose is estimated by probabilistic approaches with lack of feature. Thus, it needs an extra system because the camera system cannot estimate a full state of the robot pose. Therefore, we propose an accurate localization method for a monocular camera using a probabilistic approach in the case of an insufficient image dataset without any extra system. In our system, features from a probabilistic map are projected into an image plane using linear approximation. By minimizing Mahalanobis distance between the projected features from the probabilistic map and extracted features from a query image, the accurate pose of the monocular camera is estimated from an initial pose obtained by the PnP algorithm. The proposed algorithm is demonstrated through simulations in a 3D space.

A Study on the Data Reduction Techniques for Small Scale Map Production (소축적 지도제작을 위한 데이터 감축 기법에 관한 연구)

  • 곽강율;이호남;김명배
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.13 no.1
    • /
    • pp.77-83
    • /
    • 1995
  • This paper is concentrated on map generalization in digital environment for automated multi-scale map pro-duction using conventional hardcopy maps. Line generalization is urgently required process to prepare small scale digital map database when large scale map databases are available. This paper outlines a new approach to the line generalization when preparing small scale map on the basis of existing large scale distal map. Line generalizations are conducted based on zero-crossing algorithm using six sheets of 115,000 scale YEOSU area which produced by National Geographic Institute. The results are compared to Douglas-Peucker algorithm and manual method. The study gives full details of the data reduction rates and alternatives based on the proposed algorithm.

  • PDF

A Study on the Construction of a Drone Safety Flight Map and The Flight Path Search Algorithm (드론 안전비행맵 구축 및 비행경로 탐색 알고리즘 연구)

  • Hong, Ki Ho;Won, Jin Hee;Park, Sang Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.11
    • /
    • pp.1538-1551
    • /
    • 2021
  • The current drone flight plan creation creates a flight path point of two-dimensional coordinates on the map and sets an arbitrary altitude value considering the altitude of the terrain and the possible flight altitude. If the created flight path is a simple terrain such as a mountain or field, or if the user is familiar with the terrain, setting the flight altitude will not be difficult. However, for drone flight in a city where buildings are dense, a safer and more precise flight path generation method is needed. In this study, using high-precision spatial information, we construct a drone safety flight map with a 3D grid map structure and propose a flight path search algorithm based on it. The safety of the flight path is checked through the virtual drone flight simulation extracted by searching for the flight path based on the 3D grid map created by setting weights on the properties of obstacles and terrain such as buildings.

3D Multi-floor Precision Mapping and Localization for Indoor Autonomous Robots (실내 자율주행 로봇을 위한 3차원 다층 정밀 지도 구축 및 위치 추정 알고리즘)

  • Kang, Gyuree;Lee, Daegyu;Shim, Hyunchul
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.1
    • /
    • pp.25-31
    • /
    • 2022
  • Moving among multiple floors is one of the most challenging tasks for indoor autonomous robots. Most of the previous researches for indoor mapping and localization have focused on singular floor environment. In this paper, we present an algorithm that creates a multi-floor map using 3D point cloud. We implement localization within the multi-floor map using a LiDAR and an IMU. Our algorithm builds a multi-floor map by constructing a single-floor map using a LOAM-based algorithm, and stacking them through global registration that aligns the common sections in the map of each floor. The localization in the multi-floor map was performed by adding the height information to the NDT (Normal Distribution Transform)-based registration method. The mean error of the multi-floor map showed 0.29 m and 0.43 m errors in the x, and y-axis, respectively. In addition, the mean error of yaw was 1.00°, and the error rate of height was 0.063. The real-world test for localization was performed on the third floor. It showed the mean square error of 0.116 m, and the average differential time of 0.01 sec. This study will be able to help indoor autonomous robots to operate on multiple floors.

A Robot Coverage Algorithm Integrated with SLAM for Unknown Environments (미지의 환경에서 동작하는 SLAM 기반의 로봇 커버리지 알고리즘)

  • Park, Jung-Kyu;Jeon, Heung-Seok;Noh, Sam-H.
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.1
    • /
    • pp.61-69
    • /
    • 2010
  • An autonomous robot must have a global workspace map in order to cover the complete workspace. However, most previous coverage algorithms assume that they have a grid workspace map that is to be covered before running the task. For this reason, most coverage algorithms can not be applied to complete coverage tasks in unknown environments. An autonomous robot has to build a workspace map by itself for complete coverage in unknown environments. Thus, we propose a new DmaxCoverage algorithm that allows a robot to carry out a complete coverage task in unknown environments. This algorithm integrates a SLAM algorithm for simultaneous workspace map building. Experimentally, we verify that DmaxCoverage algorithm is more efficient than previous algorithms.

Recovering the Original Form of Ancient Relics'Letters Using Z-map and Morphological Filters (Z-map과 모폴로지 필터를 이용한 문화재 문자 복원)

  • Moon, Ho-Seok;Sohn, Myung-Ho
    • KSCI Review
    • /
    • v.14 no.2
    • /
    • pp.141-146
    • /
    • 2006
  • In this paper, we propose a new algorithm for recovering the broken letters of relics into an original form by using Z-map and image processing. The letters of relics may have been broken by a lot of rubbed copy and a long time and tide. They need to be restored. But the manual reconstruction is a very tedious and laborious task. Thus, it is necessary to automate the restoration process. This paper presents a realistic algorithm with an application to Tripitaka Koreana by using Z-map and morphological filter.

  • PDF

Fast Path Planning Algorithm for Mobile Robot Navigation (모바일 로봇의 네비게이션을 위한 빠른 경로 생성 알고리즘)

  • Park, Jung Kyu;Jeon, Heung Seok;Noh, Sam H.
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.9 no.2
    • /
    • pp.101-107
    • /
    • 2014
  • Mobile robots use an environment map of its workspace to complete the surveillance task. However grid-based maps that are commonly used map format for mobile robot navigation use a large size of memory for accurate representation of environment. In this reason, grid-based maps are not suitable for path planning of mobile robots using embedded board. In this paper, we present the path planning algorithm that produce a secure path rapidly. The proposed approach utilizes a hybrid map that uses less memory than grid map and has same efficiency of a topological map. Experimental results show that the fast path planning uses only 1.5% of the time that a grid map based path planning requires. And the results show a secure path for mobile robot.

Development of Map Building Algorithm for Mobile Robot by Using RFID (모바일 로봇에서 RFID를 이용한 지도작성 알고리즘 개발)

  • Kim, Si-Seup;Seon, Jeong-An;Kee, Chang-Doo
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.20 no.2
    • /
    • pp.133-138
    • /
    • 2011
  • RFID system can be used to improve object recognition, map building and localization for robot area. A novel method of indoor navigation system for a mobile robot is proposed using RFID technology. The mobile robot With a RFID reader and antenna is able to find what obstacles are located where in circumstance and can build the map similar to indoor circumstance by combining RFID information and distance data obtained from sensors. Using the map obtained, the mobile robot can avoid obstacles and finally reach the desired goal by $A^*$ algorithm. 3D map which has the advantage of robot navigation and manipulation is able to be built using z dimension of products. The proposed robot navigation system is proved to apply for SLAM and path planning in unknown circumstance through numerous experiments.

Selective Encryption Algorithm Using Hybrid Transform for GIS Vector Map

  • Van, Bang Nguyen;Lee, Suk-Hwan;Kwon, Ki-Ryong
    • Journal of Information Processing Systems
    • /
    • v.13 no.1
    • /
    • pp.68-82
    • /
    • 2017
  • Nowadays, geographic information system (GIS) is developed and implemented in many areas. A huge volume of vector map data has been accessed unlawfully by hackers, pirates, or unauthorized users. For this reason, we need the methods that help to protect GIS data for storage, multimedia applications, and transmission. In our paper, a selective encryption method is presented based on vertex randomization and hybrid transform in the GIS vector map. In the proposed algorithm, polylines and polygons are focused as the targets for encryption. Objects are classified in each layer, and all coordinates of the significant objects are encrypted by the key sets generated by using chaotic map before changing them in DWT, DFT domain. Experimental results verify the high efficiency visualization by low complexity, high security performance by random processes.

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.