ON A HOPPING-POINTS SVD AND HOUGH TRANSFORM-BASED LINE DETECTION ALGORITHM FOR ROBOT LOCALIZATION AND MAPPING

On a Hopping-Points SVD and Hough Transform-Based Line Detection Algorithm for Robot Localization and Mapping

On a Hopping-Points SVD and Hough Transform-Based Line Detection Algorithm for Robot Localization and Mapping

Blog Article

Line detection is an important problem in computer vision, graphics and autonomous robot navigation.Lines detected using a laser range sensor (LRS) mounted on a robot can be used as features to build a map of the environment, and later to localize the robot in the map, in a process known as Simultaneous Localization and Mapping (SLAM).We propose an efficient algorithm for line detection from LRS data using a novel hopping-points Singular Value Decomposition (SVD) and Hough transform-based algorithm, in which SVD is applied THONGS to intermittent LRS points to accelerate the algorithm.

A reverse-hop mechanism ensures that the end points of the line segments are accurately extracted.Line segments extracted from the proposed algorithm are used to form a map and, subsequently, LRS data points are matched with the line segments to localize the robot.The proposed algorithm eliminates the drawbacks of point-based matching algorithms like the Iterative Closest Points (ICP) algorithm, the performance of which degrades with an increasing number of points.

We tested the E-Z REST PETS proposed algorithm for mapping and localization in both simulated and real environments, and found it to detect lines accurately and build maps with good self-localization.

Report this page