The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Functional map networks for analyzing and exploring large shape collections
Abstract
The construction of networks of maps among shapes in a collection enables a variety of applications in data-driven geometry processing. A key task in network construction is to make the maps consistent with each other. This consistency constraint, when properly defined, leads not only to a concise representation of such networks, but more importantly, it serves as a strong regularizer for correcting and improving noisy initial maps computed between pairs of shapes in isolation. Up-to-now, however, the consistency constraint has only been fully formulated for point-based maps or for shape collections that are fully similar. In this paper, we introduce a framework for computing consistent functional maps within heterogeneous shape collections. In such collections not all shapes share the same structure --- different types of shared structure may be present within different (but possibly overlapping) sub-collections. Unlike point-based maps, functional maps can encode similarities at multiple levels of detail (points or parts), and thus are particularly suitable for coping with such diversity within a shape collection. We show how to rigorously formulate the consistency constraint in the functional map setting. The formulation leads to a powerful tool for computing consistent functional maps, and also for discovering shared structures, such as meaningful shape parts. We also show how to adapt the procedure for handling very large-scale shape collections. Experimental results on benchmark datasets show that the proposed framework significantly improves upon state-of-the-art data-driven techniques. We demonstrate the usefulness of the framework in shape co-segmentation and various shape exploration tasks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Kim, V. G., Lipman, Y., & Funkhouser, T. (2011) · ACM Transactions on Graphics · doi:10.1145/2010324.1964974 · Cited by 298
Cited by
A scalable active framework for region annotation in 3D shape collections
Yi, L., Kim, V. G., Ceylan, D., Shen, I.-C., Yan, M., Su, H., Lu, C., Huang, Q., Sheffer, A., & Guibas, L. (2016) · ACM Transactions on Graphics · doi:10.1145/2980179.2980238 · Cited by 1,231
Self-citationSyncSpecCNN: Synchronized Spectral CNN for 3D Shape Segmentation
Yi, L., Su, H., Guo, X., & Guibas, L. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.697 · Cited by 461
Self-citation3D Shape Segmentation with Projective Convolutional Networks
Kalogerakis, E., Averkiou, M., Maji, S., & Chaudhuri, S. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.702 · Cited by 368
PointSIFT: A SIFT-like Network Module for 3D Point Cloud Semantic Segmentation
Jiang, M., Wu, Y., Zhao, T., Zhao, Z., & Lu, C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.00652 · Cited by 318
Metadata
- Authors
- Huang, Q., Wang, F., & Guibas, L.
- Venue
- ACM Transactions on Graphics
- Published
- 2014-07-27
- Volume
- 33
- Issue
- 4
- Pages
- 1-11
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2144012927
- Cited by
- 171
- References
- 1
- FWCI
- 17.88
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Functional map networks for analyzing and exploring large shape collections. https://app.cochat.ai/papers/10.1145/2601097.2601111
- The paper
- Huang, Q., Wang, F., & Guibas, L. (2014). Functional map networks for analyzing and exploring large shape collections. ACM Transactions on Graphics. https://doi.org/10.1145/2601097.2601111
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.