The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Entropic metric alignment for correspondence problems
Open accessAbstract
Many shape and image processing tools rely on computation of correspondences between geometric domains. Efficient methods that stably extract "soft" matches in the presence of diverse geometric structures have proven to be valuable for shape retrieval and transfer of labels or semantic information. With these applications in mind, we present an algorithm for probabilistic correspondence that optimizes an entropy-regularized Gromov-Wasserstein (GW) objective. Built upon recent developments in numerical optimal transportation, our algorithm is compact, provably convergent, and applicable to any geometric domain expressible as a metric measure matrix. We provide comprehensive experiments illustrating the convergence and applicability of our algorithm to a variety of graphics tasks. Furthermore, we expand entropic GW correspondence to a framework for other matching problems, incorporating partial distance matrices, user guidance, shape exploration, symmetry detection, and joint analysis of more than two domains. These applications expand the scope of entropic GW correspondence to major shape analysis problems and are stable to distortion and noise.
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
A graduated assignment algorithm for graph matching
Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090 · cited 1×
“While we derived it for GWα matching, iteration (7) with η = 1 is similar to the “softassign” algorithm in machine learning for quadratic assignment [Gold and Rangarajan 1996; Rangarajan et al. 1996].”
MethodOne 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
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 · cited 1×
“While it has been applied to geometry processing [Bronstein et al. 2010], GH is costly to optimize and prioritizes one distance value at a time.”
MethodSufficient conditions for the convergence of monotonic mathematicalprogramming algorithms
Meyer, R. R. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80021-9 · Cited by 113
Cited by
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Self-citation3D-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
Self-citationIlluminating protein space with a programmable generative model
Ingraham, J., Baranov, M., Costello, Z., Frappier, V., Ismail, A., Tie, S., Wang, W., Xue, V., Obermeyer, F., Beam, A., et al. (2022) · doi:10.1101/2022.12.01.518682 · Cited by 83
Alignment of Partially Overlapping Cryo-EM Maps Using Unbalanced Gromov-Wasserstein Divergence
Tajmir Riahi, A., Zhang, C., Condon, A., Chen, J., & Dao Duc, K. (2025) · PRX Life · doi:10.1103/prxlife.3.023003 · Cited by 5
Metadata
- Authors
- Solomon, J., Peyré, G., Kim, V. G., & Sra, S.
- Venue
- ACM Transactions on Graphics
- Published
- 2016-07-11
- Volume
- 35
- Issue
- 4
- Pages
- 1-13
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2474265885
- Cited by
- 184
- References
- 5
- FWCI
- 28.75
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Entropic metric alignment for correspondence problems. https://app.cochat.ai/papers/10.1145/2897824.2925903
- The paper
- Solomon, J., Peyré, G., Kim, V. G., & Sra, S. (2016). Entropic metric alignment for correspondence problems. ACM Transactions on Graphics. https://doi.org/10.1145/2897824.2925903
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.