Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Adaptive Iterative Closest Keypoint
KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.
KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.ORCID iD: 0000-0002-1396-0102
KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.ORCID iD: 0000-0002-7796-1438
KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.ORCID iD: 0000-0002-1170-7162
2013 (English)In: 2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings, New York: IEEE , 2013, p. 80-87Conference paper, Published paper (Refereed)
Abstract [en]

Finding accurate correspondences between overlapping 3D views is crucial for many robotic applications, from multi-view 3D object recognition to SLAM. This step, often referred to as view registration, plays a key role in determining the overall system performance. In this paper, we propose a fast and simple method for registering RGB-D data, building on the principle of the Iterative Closest Point (ICP) algorithm. In contrast to ICP, our method exploits both point position and visual appearance and is able to smoothly transition the weighting between them with an adaptive metric. This results in robust initial registration based on appearance and accurate final registration using 3D points. Using keypoint clustering we are able to utilize a non exhaustive search strategy, reducing runtime of the algorithm significantly. We show through an evaluation on an established benchmark that the method significantly outperforms current methods in both robustness and precision.

Place, publisher, year, edition, pages
New York: IEEE , 2013. p. 80-87
National Category
Robotics
Identifiers
URN: urn:nbn:se:kth:diva-141743DOI: 10.1109/ECMR.2013.6698824ISI: 000330234600014Scopus ID: 2-s2.0-84893242591ISBN: 978-147990263-7 (print)OAI: oai:DiVA.org:kth-141743DiVA, id: diva2:698604
Conference
2013 6th European Conference on Mobile Robots, ECMR 2013; Barcelona; Spain; 25 September 2013 through 27 September 2013
Note

QC 20140224

Available from: 2014-02-24 Created: 2014-02-21 Last updated: 2024-03-18Bibliographically approved

Open Access in DiVA

fulltext(300 kB)335 downloads
File information
File name FULLTEXT01.pdfFile size 300 kBChecksum SHA-512
c1b2baca7379255c20dee11003e429c0764eb53eb2093672c9cc82a5d7da550abb96ea81af38a760e660f4e984daa8f756e0ec0696978fcc1cca28f744a10a44
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ekekrantz, JohanPronobis, AndrzejFolkesson, JohnJensfelt, Patric
By organisation
Computer Vision and Active Perception, CVAPCentre for Autonomous Systems, CAS
Robotics

Search outside of DiVA

GoogleGoogle Scholar
Total: 335 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 340 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf