High Fidelity Scan Merging

For each scanned object 3D triangulation laser scanners deliver multiple sweeps corresponding to multiple laser motions and orientations. The problem of aligning these scans has been well solved by using rigid and, more recently, non‐rigid transformations. Nevertheless, there are always residual loc...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 29; no. 5; pp. 1643 - 1651
Main Authors: Digne, J., Morel, J.-M., Audfray, N., Lartigue, C.
Format: Journal Article
Language:English
Published: Oxford, UK Blackwell Publishing Ltd 01.07.2010
Subjects:
3-D graphics
Algorithms
Data points
Fuses
I.3.3 [Computer Graphics]: Picture/Image Generation-Digitizing and scanning
Image coding
Lasers
Low frequencies
Merging
Studies
Surface layer
Texture
Three dimensional
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For each scanned object 3D triangulation laser scanners deliver multiple sweeps corresponding to multiple laser motions and orientations. The problem of aligning these scans has been well solved by using rigid and, more recently, non‐rigid transformations. Nevertheless, there are always residual local offsets between scans which forbid a direct merging of the scans, and force to some preliminary smoothing. Indeed, the tiling and aliasing effects due to the tiniest normal displacements of the scans can be dramatic. This paper proposes a general method to tackle this problem. The algorithm decomposes each scan into its high and low frequency components and fuses the low frequencies while keeping intact the high frequency content. It produces a mesh with the highest attainable resolution, having for vertices all raw data points of all scans. This exhaustive fusion of scans maintains the finest texture details. The method is illustrated on several high resolution scans of archeological objects.
Bibliography:ark:/67375/WNG-F9KPBFZK-1
ArticleID:CGF1773
istex:52726587BCE945059F1A9F96E128197F42972F63
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2010.01773.x