A joint project of the Graduate School, Peabody College, and the Jean & Alexander Heard Library

Title page for ETD etd-03282011-114536


Type of Document Master's Thesis
Author Okorn, Brian Edward
Author's Email Address brian.e.okorn@vanderbilt.edu
URN etd-03282011-114536
Title Smuggling Tunnel Mapping using Slide Image Registration
Degree Master of Science
Department Computer Science
Advisory Committee
Advisor Name Title
Julie A. Adams Committee Chair
Gautam Biswas Committee Member
Keywords
  • smuggling tunnel
  • SLAM
  • ICP
  • slide image
  • tunnel mapping
  • 3D mapping
  • scan registration
Date of Defense 2011-03-28
Availability unrestricted
Abstract
There exist a large number of unmapped tunnels across the US-Mexican border used primarily for smuggling, which the US Government desires to map using robots. This thesis presents two novel approaches to generate 3D maps of these tunnels. The both algorithms use a frame invariant point descriptor called the Slide Image that was originally developed for underwater SONAR ring localization. The presented algorithms adapt the Slide Images to larger more complex laser scans. Using the Slide Images generated for each 3D laser scan, the first algorithm determines the coordinate transforms needed to fuse the scans. The second algorithm uses the transform generated by the first algorithm as an initial mapping, which the algorithm fine tunes using an Iterative Closest Point approach. This fusion algorithm is able to provide the fine-tuned accuracy of the Iterative Closest Point technique, while retaining the Slide Image’s insensitivity to local minima. Both algorithms are evaluated using a real smuggling tunnel as well as an office environment. The results are compared with the results generated via the existing Iterative Closest Point algorithm. The first algorithm outperformed the Iterative Closest Point algorithm in the smuggling tunnel environment, but encountered difficulty mapping the intersections in the office environment. The Fusion algorithm clearly outperformed both the Slide Image algorithm and the Iterative Closest Point algorithm in both environments because it avoided the local minima the Iterative Closest Point algorithm selected while retaining the fine grain accuracy not possible with the Slide Image algorithm.
Files
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  Slide_Image_Registration_Final.pdf 3.83 Mb 00:17:43 00:09:07 00:07:58 00:03:59 00:00:20

Browse All Available ETDs by ( Author | Department )

If you have more questions or technical problems, please Contact LITS.