Hierarchical Shape Segmentation and Registration via Topological Features of Laplace-Beltrami Eigenfunctions
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
This work introduces a method to hierarchically segment articulated shapes into meaningful parts and to register these parts across populations of near-isometric shapes (e.g. head, arms, legs and fingers of humans in different body postures). The method exploits the isometry invariance of eigenfunctions of the Laplace-Beltrami operator and uses topological features (level sets at important saddles) for the segmentation. Concepts from persistent homology are employed for a hierarchical representation, for the elimination of topological noise and for the comparison of eigenfunctions. The obtained parts can be registered via their spectral embedding across a population of near isometric shapes. This work also presents the highly accurate computation of eigenfunctions and eigenvalues with cubic finite elements on triangle meshes and discusses the construction of persistence diagrams from the Morse-Smale complex as well as the relation to size functions.
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
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Stability of persistence diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2005) · Proceedings of the twenty-first annual symposium on Computational geometry · doi:10.1145/1064092.1064133 · Cited by 251 · cited 1×
“A good way to represent the topology of the function h is given by the persistence diagram [42,43], where the persistence pairs are plotted as a set of points ( x, y ) = ( h ( a ) , h ( b )) for each minimum/saddle or saddle/maximum pair ( a, b ).”
BackgroundDeformation transfer for triangle meshes
Sumner, R. W., & Popović, J. (2004) · ACM SIGGRAPH 2004 Papers · doi:10.1145/1186562.1015736 · Cited by 203
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
Cited by
FastSurfer - A fast and accurate deep learning based neuroimaging pipeline
Henschel, L., Conjeti, S., Estrada, S., Diers, K., Fischl, B., & Reuter, M. (2020) · NeuroImage · doi:10.1016/j.neuroimage.2020.117012 · Cited by 660
Self-citationOne 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
“Spectral invariants such as the eigenfunctions of the Laplace-Beltrami operator have been used for near-isometric shape matching by Mateus et al. [MHK + 08] and Jain et al. [JZvK07] as well as for segmentation [dGGV08,Reu10] and intrinsic symmetry detection [OSG08] among many others.”
Metadata
- Authors
- Reuter, M.
- Venue
- International Journal of Computer Vision
- Published
- 2009-08-14
- Volume
- 89
- Issue
- 2-3
- Pages
- 287-308
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W2030797443
- Cited by
- 161
- References
- 4
- FWCI
- 13.52
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hierarchical Shape Segmentation and Registration via Topological Features of Laplace-Beltrami Eigenfunctions. https://app.cochat.ai/papers/10.1007/s11263-009-0278-1
- The paper
- Reuter, M. (2010). Hierarchical Shape Segmentation and Registration via Topological Features of Laplace-Beltrami Eigenfunctions. International Journal of Computer Vision. https://doi.org/10.1007/s11263-009-0278-1
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.