ZoomOut: spectral upsampling for efficient shape correspondence
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
We present a simple and efficient method for refining maps or correspondences by iterative upsampling in the spectral domain that can be implemented in a few lines of code. Our main observation is that high quality maps can be obtained even if the input correspondences are noisy or are encoded by a small number of coefficients in a spectral basis. We show how this approach can be used in conjunction with existing initialization techniques across a range of application scenarios, including symmetry detection, map refinement across complete shapes, non-rigid partial shape matching and function transfer. In each application we demonstrate an improvement with respect to both the quality of the results and the computational speed compared to the best competing methods, with up to two orders of magnitude speed-up in some applications. We also demonstrate that our method is both robust to noisy input and is scalable with respect to shape complexity. Finally, we present a theoretical justification for our approach, shedding light on structural properties of functional maps.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Loper, M., Mahmood, N., Romero, J., Pons-Moll, G., & J, B. M. (2015) · ACM Transactions on Graphics · doi:10.1145/2816795.2818013 · Cited by 3,734
SCAPE: shape completion and animation of people
Anguelov, D., Srinivasan, P., Koller, D., Thrun, S., Rodgers, J., & Davis, J. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073207 · Cited by 1,489
Unique Signatures of Histograms for Local Surface Description
Tombari, F., Salti, S., & Di Stefano, L. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15558-1_26 · Cited by 1,480
One Point Isometric Matching with the Heat Kernel
Ovsjanikov, M., Mérigot, Q., Mémoli, F., & Guibas, L. (2010) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2010.01764.x · Cited by 301
Self-citationGeometric modeling in shape space
Kilian, M., Mitra, N. J., & Pottmann, H. (2007) · ACM SIGGRAPH 2007 papers · doi:10.1145/1275808.1276457 · Cited by 224 · cited 2×
“Shape matching is a task that occurs in countless applications in computer graphics, including shape interpolation [Kilian et al. 2007], statistical shape analysis [Bogo et al.”
MethodExact and stable recovery of rotations for robust synchronization
Wang, L., & Singer, A. (2013) · Information and Inference · doi:10.1093/imaiai/iat005 · Cited by 178
Robust 3D Shape Correspondence in the Spectral Domain
Jain, V., & Zhang, H. (2006) · IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06) · doi:10.1109/smi.2006.31 · Cited by 148
Minimum-Distortion Isometric Shape Correspondence Using EM Algorithm
Sahillioglu, Y., & Yemez, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.26 · Cited by 53
Metadata
- Authors
- Melzi, S., Ren, J., Rodolà, E., Sharma, A., Wonka, P., & Ovsjanikov, M.
- Venue
- ACM Transactions on Graphics
- Published
- 2019-11-08
- Volume
- 38
- Issue
- 6
- Pages
- 1-14
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2987431950
- Cited by
- 169
- References
- 8
- FWCI
- 12.64
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.