We present a novel approach to the computation of dense correspondence maps between shapes in a non-rigid setting. The problem is defined in terms of functional correspondences. We deal with the non-injectivity of the solution of the functional map framework due to the under-determinedness of the original problem. Key to our approach is the injectivity constraint plugged directly into the problem to optimize, achieved casting it as an assignment problem. This leads to an iterative process which yields a high quality bijective map between the shapes. In the experimental section we present both quantitative and qualitative results, showing that the proposed approach is competitive with the current state-of-the-art on quasi-isometric shape matching benchmarks.
|Data di pubblicazione:||2016|
|Titolo:||Non-Rigid Dense Bijective Maps|
|Rivista:||INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION|
|Titolo del libro:||Proceedings - International Conference on Pattern Recognition|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1109/ICPR.2016.7900223|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|