Consistent Partial Matching of Shape Collections via Sparse Modeling
| dc.contributor.author | Cosmo, L. | en_US |
| dc.contributor.author | Rodolà, E. | en_US |
| dc.contributor.author | Albarelli, A. | en_US |
| dc.contributor.author | Mémoli, F. | en_US |
| dc.contributor.author | Cremers, D. | en_US |
| dc.contributor.editor | Chen, Min and Zhang, Hao (Richard) | en_US |
| dc.date.accessioned | 2017-03-13T18:13:03Z | |
| dc.date.available | 2017-03-13T18:13:03Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | Recent efforts in the area of joint object matching approach the problem by taking as input a set of pairwise maps, which are then jointly optimized across the whole collection so that certain accuracy and consistency criteria are satisfied. One natural requirement is cycle‐consistency—namely the fact that map composition should give the same result regardless of the path taken in the shape collection. In this paper, we introduce a novel approach to obtain consistent matches without requiring initial pairwise solutions to be given as input. We do so by optimizing a joint measure of metric distortion directly over the space of cycle‐consistent maps; in order to allow for partially similar and extra‐class shapes, we formulate the problem as a series of quadratic programs with sparsity‐inducing constraints, making our technique a natural candidate for analysing collections with a large presence of outliers. The particular form of the problem allows us to leverage results and tools from the field of evolutionary game theory. This enables a highly efficient optimization procedure which assures accurate and provably consistent solutions in a matter of minutes in collections with hundreds of shapes.Recent efforts in the area of joint object matching approach the problem by taking as input a set of pairwise maps, which are then jointly optimized across the whole collection so that certain accuracy and consistency criteria are satisfied. One natural requirement is cycleconsistency— namely the fact that map composition should give the same result regardless of the path taken in the shape collection. In this paper, we introduce a novel approach to obtain among partially similar shapes consistent matches without requiring initial pairwise solutions to be given as input. | en_US |
| dc.description.number | 1 | |
| dc.description.sectionheaders | Articles | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 36 | |
| dc.identifier.doi | 10.1111/cgf.12796 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12796 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf12796 | |
| dc.publisher | © 2017 The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | shape matching | |
| dc.subject | shape collections | |
| dc.subject | intrinsic geometry | |
| dc.subject | Computer Graphics I.3.5 Computational Geometry and Object Modelling Shape Analysis | |
| dc.title | Consistent Partial Matching of Shape Collections via Sparse Modeling | en_US |