Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
Open accessThe DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
An efficient algorithm for isometry-invariant matching of surfaces is presented. The key idea is computing the minimum-distortion mapping between two surfaces. For this purpose, we introduce the generalized multidimensional scaling, a computationally efficient continuous optimization algorithm for finding the least distortion embedding of one surface into another. The generalized multidimensional scaling algorithm allows for both full and partial surface matching. As an example, it is applied to the problem of expression-invariant three-dimensional face recognition.
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
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Burago, D., Burago, Y., & Ivanov, S. (2001) · Graduate Studies in Mathematics · doi:10.1090/gsm/033 · Cited by 2,598
Iterative point matching for registration of free-form curves and surfaces
Zhang, Z. (1994) · International Journal of Computer Vision · doi:10.1007/bf01427149 · Cited by 2,402
Modern Multidimensional Scaling: Theory and Applications
Borg, I., & Groenen, P. (2003) · Journal of Educational Measurement · doi:10.1111/j.1745-3984.2003.tb01108.x · Cited by 2,197
Modern Multidimensional Scaling
Borg, I., & Groenen, P. (1997) · Springer Series in Statistics · doi:10.1007/978-1-4757-2711-1 · Cited by 1,728
Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
Donoho, D. L., & Grimes, C. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1031596100 · Cited by 1,661
Computing geodesic paths on manifolds
Kimmel, R., & Sethian, J. A. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.15.8431 · Cited by 1,049
Self-citationThe farthest point strategy for progressive image sampling
Eldar, Y., Lindenbaum, M., Porat, M., & Zeevi, Y. Y. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.623193 · Cited by 693
Structures métriques pour les variétés riemanniennes
Gromov, M. (1981) · Medical Entomology and Zoology · Cited by 518
Cited by
Geometric Deep Learning: Going beyond Euclidean data
Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., & Vandergheynst, P. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2693418 · Cited by 3,661
“[102], [103], [104], [105], [106]) have been devoted to designing local and global features e.”
BackgroundSelf-citationImage Matching from Handcrafted to Deep Features: A Survey
Ma, J., Jiang, X., Fan, A., Jiang, J., & Yan, J. (2021) · International Journal of Computer Vision · doi:10.1007/s11263-020-01359-2 · Cited by 990
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Shape google: Geometric words and expressions for invariant shape retrieval
Bronstein, A. M., Bronstein, M. M., Guibas, L. J., & Ovsjanikov, M. (2011) · ACM Transactions on Graphics · doi:10.1145/1899404.1899405 · Cited by 810
Self-citationFunctional maps: a flexible representation of maps between shapes
Ovsjanikov, M., Ben-Chen, M., Solomon, J., Butscher, A., & Guibas, L. (2012) · ACM Transactions on Graphics · doi:10.1145/2185520.2185526 · Cited by 735
Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid
Tam, G. K. L., Cheng, Z.-Q., Lai, Y.-K., Langbein, F. C., Liu, Y., Marshall, D., Martin, R. R., Sun, X.-F., & Rosin, P. L. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.310 · Cited by 679
FAUST: Dataset and Evaluation for 3D Mesh Registration
Bogo, F., Romero, J., Loper, M., & Black, M. J. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.491 · Cited by 689
Scale-invariant heat kernel signatures for non-rigid shape recognition
Bronstein, M. M., & Kokkinos, I. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539838 · Cited by 686
Self-citationActive printed materials for complex self-evolving deformations
Raviv, D., Zhao, W., McKnelly, C., Papadopoulou, A., Kadambi, A., Shi, B., Hirsch, S., Dikovsky, D., Zyracki, M., Olguin, C., et al. (2014) · Scientific Reports · doi:10.1038/srep07422 · Cited by 568
A Realization-Theoretic Foundation for Fault Diagnosis, with Diagnosability Equivalence Predictions
Bronstein, M. M., Bruna, J., Cohen, T., & Veličković, P. (2021) · arXiv (Cornell University) · doi:10.4230/oasics.dx.2026.1 · Cited by 519
Self-citationGromov–Wasserstein Distances and the Metric Approach to Object Matching
Mémoli, F. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9093-5 · Cited by 515
The internet of things for smart manufacturing: A review
Yang, H., Kumara, S., Bukkapatnam, S. T. S., & Tsung, F. (2019) · IISE Transactions · doi:10.1080/24725854.2018.1555383 · Cited by 449
Global Correspondence Optimization for Non‐Rigid Registration of Depth Scans
Li, H., Sumner, R. W., & Pauly, M. (2008) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2008.01282.x · Cited by 399
Multiple Nose Region Matching for 3D Face Recognition under Varying Facial Expression
Chang, K. I., Bowyer, K. W., & Flynn, P. J. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.210 · Cited by 359
Robust single-view geometry and motion reconstruction
Li, H., Adams, B., Guibas, L. J., & Pauly, M. (2009) · ACM Transactions on Graphics · doi:10.1145/1618452.1618521 · Cited by 334
Möbius voting for surface correspondence
Lipman, Y., & Funkhouser, T. (2009) · ACM Transactions on Graphics · doi:10.1145/1531326.1531378 · Cited by 332
Kim, V. G., Lipman, Y., & Funkhouser, T. (2011) · ACM SIGGRAPH 2011 papers · doi:10.1145/1964921.1964974 · Cited by 307
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
Kim, V. G., Lipman, Y., & Funkhouser, T. (2011) · ACM Transactions on Graphics · doi:10.1145/2010324.1964974 · Cited by 298
3D-CODED: 3D Correspondences by Deep Deformation
Groueix, T., Fisher, M., Kim, V. G., Russell, B. C., & Aubry, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01216-8_15 · Cited by 293
Deep Functional Maps: Structured Prediction for Dense Shape Correspondence
Litany, O., Remez, T., Rodola, E., Bronstein, A., & Bronstein, M. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.603 · Cited by 291
Self-citationBronstein, A. M., Bronstein, M. M., Kimmel, R., Mahmoudi, M., & Sapiro, G. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0301-6 · Cited by 267
Self-citationIntrinsic Shape Matching by Planned Landmark Sampling
Tevs, A., Berner, A., Wand, M., Ihrke, I., & Seidel, H. ‐. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01879.x · Cited by 64
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
“We have conducted experiments on the Nonrigid World shape database to compare our method with the GMDS method of [24].”
BackgroundMethodInfluentialIntrinsic dense 3D surface tracking
Zeng, Y., Wang, C., Wang, Y., Gu, X., Samaras, D., & Paragios, N. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995513 · Cited by 19
“, the geodesics distance [4], the diffusion distance [5] and distances based on the conformal factor [15, 30].”
BackgroundLearning Weighted Submanifolds With Variational Autoencoders and Riemannian Variational Autoencoders
Miolane, N., & Holmes, S. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.01451 · Cited by 16
Metadata
- Authors
- Bronstein, A. M., Bronstein, M. M., & Kimmel, R.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2006-01-23
- Volume
- 103
- Issue
- 5
- Pages
- 1168-1172
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2098578926
- Cited by
- 538
- References
- 21
- FWCI
- 22.39
- Type
- journal article
- Language
- en
- Open access
- green
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.