The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Vector diffusion maps and the connection Laplacian
Open accessAbstract
We introduce vector diffusion maps (VDM), a new mathematical framework for organizing and analyzing massive high‐dimensional data sets, images, and shapes. VDMis a mathematical and algorithmic generalization of diffusion maps and other nonlinear dimensionality reduction methods, such as LLE, ISOMAP, and Laplacian eigenmaps. While existing methods are either directly or indirectly related to the heat kernel for functions over the data, VDM is based on the heat kernel for vector fields. VDM provides tools for organizing complex data sets, embedding them in a low‐dimensional space, and interpolating and regressing vector fields over the data. In particular, it equips the data with a metric, which we refer to as the vector diffusion distance. In the manifold learning setup, where the data set is distributed on a low‐dimensional manifold ${\cal M}^d$ embedded in $\font\open=msbm10 at 10pt\def\R{\hbox{\open R}}\R^p$, we prove the relation between VDM and the connection Laplacian operator for vector fields over the manifold. © 2012 Wiley Periodicals, Inc.
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 Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Least-Squares Fitting of Two 3-D Point Sets
Arun, K. S., Huang, T. S., & Blostein, S. D. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767965 · Cited by 3,952 · cited 1×
“This minimization problem has a simple solution [13, 25, 21, 1] via the SVD of O i Oj .”
MethodFinding the homology of submanifolds with high confidence from random samples
Niyogi, P., Smale, S., & Weinberger, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9053-2 · Cited by 523
On the Local Behavior of Spaces of Natural Images
Carlsson, G., Ishkhanov, T., de Silva, V., & Zomorodian, A. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0056-x · Cited by 477
Angular synchronization by eigenvectors and semidefinite programming
Singer, A. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.001 · Cited by 329
Self-citationThe Nonlinear Statistics of High-Contrast Patches in Natural Images
Lee, A. B., Pedersen, K. S., & Mumford, D. (2003) · International Journal of Computer Vision · doi:10.1023/a:1023705401078 · Cited by 234
Cited by
Functional 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
SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
Rosen, D. M., Carlone, L., Bandeira, A. S., & Leonard, J. J. (2019) · The International Journal of Robotics Research · doi:10.1177/0278364918784361 · Cited by 282
Exact and stable recovery of rotations for robust synchronization
Wang, L., & Singer, A. (2013) · Information and Inference · doi:10.1093/imaiai/iat005 · Cited by 178
Self-citationMagnetic eigenmaps for community detection in directed networks
Fanuel, M., Alaíz, C. M., & Suykens, J. A. K. (2017) · Physical Review E · doi:10.1103/physreve.95.022302 · Cited by 50
Magnetic Eigenmaps for the visualization of directed networks
Fanuel, M., Alaíz, C. M., Fernández, Á., & Suykens, J. A. K. (2018) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2017.01.004 · Cited by 35
Metadata
- Authors
- Singer, A., & Wu, H. ‐.
- Venue
- Communications on Pure and Applied Mathematics
- Publisher
- Wiley
- Published
- 2012-03-30
- Volume
- 65
- Issue
- 8
- Pages
- 1067-1144
- ISSN
- 0010-3640 (ISSN-L)
- 1097-0312
- OpenAlex
- W2962936676
- Cited by
- 251
- References
- 6
- FWCI
- 19.68
- 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.