DiscoMatch: Fast Discrete Optimisation for Geometrically Consistent 3D Shape Matching
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916495431303168 |
|---|---|
| author | Roetzer, Paul Abbas, Ahmed Cao, Dongliang Bernard, Florian Swoboda, Paul |
| author_facet | Roetzer, Paul Abbas, Ahmed Cao, Dongliang Bernard, Florian Swoboda, Paul |
| contents | In this work we propose to combine the advantages of learningbased and combinatorial formalisms for 3D shape matching. While learningbased methods lead to state-of-the-art matching performance, they do not ensure geometric consistency, so that obtained matchings are locally non-smooth. On the contrary, axiomatic, optimisation-based methods allow to take geometric consistency into account by explicitly constraining the space of valid matchings. However, existing axiomatic formalisms do not scale to practically relevant problem sizes, and require user input for the initialisation of non-convex optimisation problems. We work towards closing this gap by proposing a novel combinatorial solver that combines a unique set of favourable properties: our approach (i) is initialisation free, (ii) is massively parallelisable and powered by a quasi-Newton method, (iii) provides optimality gaps, and (iv) delivers improved matching quality with decreased runtime and globally optimal results for many instances. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_08230 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | DiscoMatch: Fast Discrete Optimisation for Geometrically Consistent 3D Shape Matching Roetzer, Paul Abbas, Ahmed Cao, Dongliang Bernard, Florian Swoboda, Paul Computer Vision and Pattern Recognition In this work we propose to combine the advantages of learningbased and combinatorial formalisms for 3D shape matching. While learningbased methods lead to state-of-the-art matching performance, they do not ensure geometric consistency, so that obtained matchings are locally non-smooth. On the contrary, axiomatic, optimisation-based methods allow to take geometric consistency into account by explicitly constraining the space of valid matchings. However, existing axiomatic formalisms do not scale to practically relevant problem sizes, and require user input for the initialisation of non-convex optimisation problems. We work towards closing this gap by proposing a novel combinatorial solver that combines a unique set of favourable properties: our approach (i) is initialisation free, (ii) is massively parallelisable and powered by a quasi-Newton method, (iii) provides optimality gaps, and (iv) delivers improved matching quality with decreased runtime and globally optimal results for many instances. |
| title | DiscoMatch: Fast Discrete Optimisation for Geometrically Consistent 3D Shape Matching |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2310.08230 |