Object Completion using k-Sparse Optimization
Abstract
We present a new method for the completion of partial globally-symmetric 3D objects, based on the detection of partial and approximate symmetries in the incomplete input dataset. In our approach, symmetry detection is formulated as a constrained sparsity maximization problem, which is solved efficiently using a robust RANSACbased optimizer. The detected partial symmetries are then reused iteratively, in order to complete the missing parts of the object. A global error relaxation method minimizes the accumulated alignment errors and a nonrigid registration approach applies local deformations in order to properly handle approximate symmetry. Unlike previous approaches, our method does not rely on the computation of features, it uniformly handles translational, rotational and reflectional symmetries and can provide plausible object completion results, even on challenging cases, where more than half of the target object is missing. We demonstrate our algorithm in the completion of 3D scans with varying levels of partiality and we show the applicability of our approach in the repair and completion of heavily eroded or incomplete cultural heritage objects.
BibTeX
@article {10.1111:cgf.12741,
journal = {Computer Graphics Forum},
title = {{Object Completion using k-Sparse Optimization}},
author = {Mavridis, Pavlos and Sipiran, Ivan and Andreadis, Anthousis and Papaioannou, Georgios},
year = {2015},
publisher = {The Eurographics Association and John Wiley & Sons Ltd.},
DOI = {10.1111/cgf.12741}
}
journal = {Computer Graphics Forum},
title = {{Object Completion using k-Sparse Optimization}},
author = {Mavridis, Pavlos and Sipiran, Ivan and Andreadis, Anthousis and Papaioannou, Georgios},
year = {2015},
publisher = {The Eurographics Association and John Wiley & Sons Ltd.},
DOI = {10.1111/cgf.12741}
}