Sparse Iterative Closest Point. (19th August 2013)

• Record Type: Journal Article
• Authors: Bouaziz, Sofien; Tagliasacchi, Andrea; Pauly, Mark
• Is Part Of: Computer graphics forum. Volume 32:Number 5(2013)
• Page Start: 113
• Page End: 123
• Publication Date: 2013-08-19
• Subjects: Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.12178
• Languages: English
• ISSNs: 0167-7055

Abstract

<abstract abstract-type="main" xml:lang="en"> <title>Abstract</title> <p>Rigid registration of two geometric data sets is essential in many applications, including robot navigation, surface reconstruction, and shape matching. Most commonly, variants of the Iterative Closest Point (ICP) algorithm are employed for this task. These methods alternate between closest point computations to establish correspondences between two data sets, and solving for the optimal transformation that brings these correspondences into alignment. A major difficulty for this approach is the sensitivity to outliers and missing data often observed in 3D scans. Most practical implementations of the ICP algorithm address this issue with a number of heuristics to prune or reweight correspondences. However, these heuristics can be unreliable and difficult to tune, which often requires substantial manual assistance. We propose a new formulation of the ICP algorithm that avoids these difficulties by formulating the registration optimization using sparsity inducing norms. Our new algorithm retains the simple structure of the ICP algorithm, while achieving superior registration results when dealing with outliers and incomplete data. The complete source code of our implementation is provided at http://lgg.epfl.ch/sparseicp.</p> </abstract>