Hierarchical Multiview Rigid Registration

Registration is a key step in the 3D reconstruction of real‐world objects. In this paper, we propose a hierarchical method for the rigid registration of multiple views. The multiview registration problem is solved via hierarchical optimization defined on an undirected graph. Each node or edge in thi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer graphics forum Jg. 34; H. 5; S. 77 - 87
Hauptverfasser: Tang, Yizhi, Feng, Jieqing
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Blackwell Publishing Ltd 01.08.2015
Schlagworte:
3-D graphics
Alignment
Analysis
and systems
Categories and Subject Descriptors (according to ACM CCS)
Errors
Graph theory
Graphs
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Geometric algorithms
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems
Image processing systems
languages
Optimization
Optimization techniques
Registration
Robustness
Studies
Three dimensional
Transformations (mathematics)
ISSN:0167-7055, 1467-8659
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Registration is a key step in the 3D reconstruction of real‐world objects. In this paper, we propose a hierarchical method for the rigid registration of multiple views. The multiview registration problem is solved via hierarchical optimization defined on an undirected graph. Each node or edge in this graph represents a single view or a connection between two overlapped views, respectively. The optimizations are performed hierarchically on the edges, the loops, and the entire graph. First, each overlapped pair of views is locally aligned. Then, a loop‐based incremental registration algorithm is introduced to refine the initial pairwise alignments. After a loop is registered, the views in the loop are merged into a metaview in the graph. Finally, global error diffusion is applied to the entire graph to evenly distribute the accumulated errors to all views. In addition, a new objective function is defined to describe the loop closure problem; it improves the accuracy and robustness of registration by simultaneously considering transformation and registration errors. The experimental results show that the proposed hierarchical approach is accurate, efficient and robust for initial view states that are not well posed.
Bibliographie:Supporting InformationSupporting Information
istex:6C63E7C060884DFAC820F0765D9CB2CC0707322B
ArticleID:CGF12698
ark:/67375/WNG-7L5M9H76-N
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12698