EchoMatch: Partial-to-Partial Shape Matching via Correspondence Reflection

Yizheng Xie, Viktoria Ehm, Paul Roetzer, Nafie El Amrani, Maolin Gao +2 more
2/10/2026

No official code found. Best implementation: vikiehm/echo-match (16 stars, MIT, last commit 2025-07-29).

Abstract

Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics. While most research has focused on finding correspondences in settings where at least one of the shapes is complete, the realm of partial-to-partial shape matching remains under-explored. Yet, it is important since in many applications shapes are only observed partially due to occlusion or scanning. Finding correspondences between partial shapes comes with an additional challenge: We not only want to identify correspondences between points on either shape but also have to determine which points of each shape actually have a partner. To tackle this challenging problem, we present EchoMatch, a novel framework for partial-to-partial shape matching that incorporates the concept of correspondence reflection to enable an overlap prediction within a functional map framework. With this approach, we show that we can outperform current SOTA methods in challenging partial-to-partial shape matching problems. Our code is available at https://echo-match.github.io.

DOISemantic Scholar

Code Implementations(1)

vikiehm/echo-matchCommunity64%
MIT

CVPR 2025, EchoMatch: Partial-to-Partial Shape Matching via Correspondence Reflection

164Shell, PythonJun 13, 20251 years agoMIT
3dcorrespondencesgeometry-processingmatchingshape

Cite this paper

@article{xie2026echomatch,
  title  = {EchoMatch: Partial-to-Partial Shape Matching via Correspondence Reflection},
  author = {Yizheng Xie and Viktoria Ehm and Paul Roetzer and Nafie El Amrani and Maolin Gao and Florian Bernard and Daniel Cremers},
  year   = {2026},
  doi    = {10.1109/CVPR52734.2025.01089},
  url    = {https://doi.org/10.1109/CVPR52734.2025.01089},
  journal = {CVPR 2025 2025}
}

Discussion