Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/105616
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorParra Bustos, A.en
dc.contributor.authorChin, T.en
dc.contributor.authorEriksson, A.en
dc.contributor.authorLi, H.en
dc.contributor.authorSuter, D.en
dc.date.issued2016en
dc.identifier.citationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2016; 38(11):2227-2240en
dc.identifier.issn0162-8828en
dc.identifier.issn1939-3539en
dc.identifier.urihttp://hdl.handle.net/2440/105616-
dc.description.abstractRegistering two 3D point clouds involves estimating the rigid transform that brings the two point clouds into alignment. Recently there has been a surge of interest in using branch-and-bound (BnB) optimisation for point cloud registration. While BnB guarantees globally optimal solutions, it is usually too slow to be practical. A fundamental source of difficulty lies in the search for the rotational parameters. In this work, first by assuming that the translation is known, we focus on constructing a fast rotation search algorithm. With respect to an inherently robust geometric matching criterion, we propose a novel bounding function for BnB that is provably tighter than previously proposed bounds. Further, we also propose a fast algorithm to evaluate our bounding function. Our idea is based on using stereographic projections to precompute and index all possible point matches in spatial R-trees for rapid evaluations. The result is a fast and globally optimal rotation search algorithm. To conduct full 3D registration, we co-optimise the translation by embedding our rotation search kernel in a nested BnB algorithm. Since the inner rotation search is very efficient, the overall 6DOF optimisation is speeded up significantly without losing global optimality. On various challenging point clouds, including those taken out of lab settings, our approach demonstrates superior efficiency.en
dc.description.statementofresponsibilityAlvaro Parra Bustos, Tat-Jun Chin, Anders Eriksson, Hongdong Li and David Suteren
dc.language.isoenen
dc.publisherIEEE Computer Societyen
dc.rights© 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.en
dc.subjectPoint cloud registration; rotation search; branch-and-bound; stereographic projections; R-trees; three-dimensional displays; optimization; transforms; iterative closest point algorithm; robustness; kernel; search problemsen
dc.titleFast rotation search with stereographic projections for 3D registrationen
dc.typeJournal articleen
dc.identifier.doi10.1109/TPAMI.2016.2517636en
dc.relation.granthttp://purl.org/au-research/grants/arc/DP130102524en
dc.relation.granthttp://purl.org/au-research/grants/arc/DE130101775en
dc.relation.granthttp://purl.org/au-research/grants/arc/DP120103896en
dc.relation.granthttp://purl.org/au-research/grants/arc/DP130104567en
dc.relation.granthttp://purl.org/au-research/grants/arc/CE140100016en
pubs.publication-statusPublisheden
dc.identifier.orcidParra Bustos, A. [0000-0002-2981-0491]en
dc.identifier.orcidSuter, D. [0000-0001-6306-3023]en
Appears in Collections:Electrical and Electronic Engineering publications

Files in This Item:
File Description SizeFormat 
RA_hdl_105616.pdf
  Restricted Access
Restricted Access1.44 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.