Show simple item record

dc.contributor.advisorLakaemper, Rolf
dc.creatorGeorgiev, Kristiyan
dc.date.accessioned2020-10-19T15:58:03Z
dc.date.available2020-10-19T15:58:03Z
dc.date.issued2014
dc.identifier.other904556427
dc.identifier.urihttp://hdl.handle.net/20.500.12613/590
dc.descriptionAccompanied by two .mp4 files.
dc.description.abstractRobot mapping is a major field of research in robotics. Its basic task is to combine (register) spatial data, usually gained from range devices, to a single data set. This data set is called global map and represents the environment, observed from different locations, usually without knowledge of their positions. Various approaches can be classified into groups based on the type of sensor, e.g. Lasers, Microsoft Kinect, Stereo Image Pair. A major disadvantage of current methods is the fact, that they are derived from hardly scalable 2D approaches that use a small amount of data. However, 3D sensing yields a large amount of data in each 3D scan. Autonomous mobile robots have limited computational power, which makes it harder to run 3D robot mapping algorithms in real-time. To remedy this limitation, the proposed research uses mid-level geometric features (lines and ellipses) to construct 3D geometric primitives (planar patches, cylinders, spheres and cones) from 3D point data. Such 3D primitives can serve as distinct features for faster registration, allowing real-time performance on a mobile robot. This approach works in real-time, e.g. using a Microsoft Kinect to detect planes with 30 frames per second. While previous approaches show insufficient performance, the proposed method operates in real-time. In its core, the algorithm performs a fast model fitting with a model update in constant time (O(1)) for each new data point added to the model using a three stage approach. The first step inspects 1.5D sub spaces, to find lines and ellipses. The next stage uses these lines and ellipses as input by examining their neighborhood structure to form sets of candidates for the 3D geometric primitives. Finally, candidates are fitted to the geometric primitives. The complexity for point processing is O(n); additional time of lower order is needed for working on significantly smaller amount of mid-level objects. The real-time performance suggests this approach as a pre-processing step for 3D real-time higher level tasks in robotics, like tracking or feature based mapping. In this thesis, I will show how these features are derived and used for scene registration. Optimal registration is determined by finding plane-feature correspondence based on mutual similarity and geometric constraints. Our approach determines the plane correspondence in three steps. First step computes the distance between all pairs of planes from the first scan to all pair of planes from the second scan. The distance function captures angular, distance and co-planarity differences. The resulting distances are accumulated in a distance matrix. The next step uses the distance matrix to compute the correlation matrix between planes from the first and second scan. Finally plane correspondence is found by finding the global optimal assignment from the correlation matrix. After finding the plane correspondence, an optimal pose registration is computed. In addition to that, I will provide a comparison to existing state-of-the-art algorithms. This work is part of an industry collaboration effort sponsored by the National Institute of Standards and Technology (NIST), aiming at performance evaluation and modeling of autonomous navigation in unstructured and dynamic environments. Additional field work, in the form of evaluation of real robotic systems in a robot test arena was performed.
dc.format.extent118 pages
dc.language.isoeng
dc.publisherTemple University. Libraries
dc.relation.ispartofTheses and Dissertations
dc.rightsIN COPYRIGHT- This Rights Statement can be used for an Item that is in copyright. Using this statement implies that the organization making this Item available has determined that the Item is in copyright and either is the rights-holder, has obtained permission from the rights-holder(s) to make their Work(s) available, or makes the Item available under an exception or limitation to copyright (including Fair Use) that entitles it to make the Item available.
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subjectComputer Science
dc.subjectRobotics
dc.subjectMid-level Geometric Features
dc.subjectPlane Extraction
dc.subjectRealtime Performance
dc.subjectScan Registration
dc.subjectScene Description
dc.subjectSphere
dc.subjectCylinder and Cone Object Extraction
dc.titleREALTIME MAPPING AND SCENE RECONSTRUCTION BASED ON MID-LEVEL GEOMETRIC FEATURES
dc.typeText
dc.type.genreThesis/Dissertation
dc.contributor.committeememberYates, Alexander
dc.contributor.committeememberLatecki, Longin
dc.contributor.committeememberHsieh, Ani M.
dc.description.departmentComputer and Information Science
dc.relation.doihttp://dx.doi.org/10.34944/dspace/572
dc.ada.noteFor Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu
dc.description.degreePh.D.
refterms.dateFOA2020-10-19T15:58:03Z


Files in this item

Thumbnail
Name:
TETDEDXGeorgiev-temple-0225E-1 ...
Size:
13.26Mb
Format:
PDF
Thumbnail
Name:
TETDEDXGALATEA-RESETAct2.mp4
Size:
3.738Mb
Format:
MPEG-4 video
Description:
Supplemental File
Thumbnail
Name:
TETDEDXRTPAlabama-PromoVideo.mp4
Size:
39.93Mb
Format:
MPEG-4 video
Description:
Supplemental File
Thumbnail
Name:
TETDEDXIROS2013-video-submissi ...
Size:
14.32Mb
Format:
MPEG-4 video
Description:
Supplemental File

This item appears in the following Collection(s)

Show simple item record