Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 91 of the 91 references it cites were found in a registry or an index; 11 of the 72 sources its claims cite were checked for support.

Topological pattern recognition for point cloud data

Open access
Carlsson, Gunnar · 2014 · Acta Numerica

Abstract

In this paper we discuss the adaptation of the methods of homology from algebraic topology to the problem of pattern recognition in point cloud data sets. The method is referred to aspersistent homology, and has numerous applications to scientific problems. We discuss the definition and computation of homology in the standard setting of simplicial complexes and topological spaces, then show how one can obtain useful signatures, called barcodes, from finite metric spaces, thought of as sampled from a continuous object. We present several different cases where persistent homology is used, to illustrate the different ways in which the method can be applied.

Overview

CoChat Summary

TL;DR

This paper reviews persistent homology, adapting algebraic topology’s homology to finite metric spaces and point cloud data, and presents barcodes/persistence diagrams as signatures. It surveys theory, stability, and applications including natural image patches, compound databases, viral evolution, time series, and the cosmic web.

Key findings

  • Persistent homology replaces Betti numbers with barcodes/persistence diagrams; long intervals correspond to larger-scale geometric features, while short intervals are typically treated as noisy.
  • Stability results: the map β_k from finite metric spaces under Gromov-Hausdorff distance to barcodes under bottleneck distance is distance non-increasing (Theorem 4.2), and functional persistence has a stability theorem for tame functions (Theorem 4.3).
  • Natural image patches: 4×10^6 high-contrast 3×3 patches (top 20% D-norm) lie on a seven-dimensional ellipsoid E7 in an eight-dimensional subspace of R9; X(300,30) shows one long 1D bar suggesting a circle, X(15,30) shows five long bars suggesting β1=5, and the full data suggests a Klein bottle, with mod 3 Betti numbers distinguishing torus (1,2,1) from Klein bottle (1,1,0).
  • Applications: a 4000-compound DFHR inhibitor database localized into four groups via Mapper; viral evolution uses homology to detect reassortment/recombination; sliding-window persistence detects periodicity; cosmic web Betti numbers carry more information than the Euler characteristic alone.

Methods

  • Design: expository review of algebraic topology and persistent homology, with definitions, theorems, and worked examples rather than a primary empirical study.
  • Data/sample: illustrative datasets include 4×10^6 high-contrast 3×3 image patches (top 20% D-norm), random subsamples of 5×10^4, a 4000-compound database, viral sequences, time series, and cosmic web data.
  • Analysis: construct Vietoris-Rips, alpha, witness, and functional persistence complexes; compute homology over fields via matrix row/column operations; represent invariants as barcodes/persistence diagrams; compare with bottleneck/Wasserstein and Gromov-Hausdorff metrics; extensions include zigzag and multidimensional persistence.

Limitations

  • Paper-stated: persistent homology computation has the same complexity as Gaussian elimination, n^3 for an n×n matrix, so direct calculation is expensive; Vietoris-Rips complexes are often too large; alpha complexes become intractable as embedding dimension N increases; witness complex accuracy is difficult to assess.
  • Paper-stated: there is no universal or natural choice of scale ρ; multidimensional persistence lacks a complete barcode-like classification; the barcode space (B∞, d_p) is not complete, and Fréchet means may be empty or non-unique.
  • Evident from text: as a review, application results are summarized from cited studies rather than newly validated here.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1017/s0962492914000051

Cites

91 of 91 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

10 Valid · 10 Not valid · 53 Not checked · 155 Own results and interpretations

106 more claims

Create a free account to see all 228 claims and to verify the 27 references still open.

See all claims — free account
  • It may state two separate claims as one. 52
  • Probably not a substantial claim. 81
  • The quote only partly states this claim. 1

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

2 of 2

Citations

Cites

Show all 88 references

Research works printed but not linked: 8

  1. Fréchet, 1944, L'intégrale abstraite d'une fonction abstraite d'une variable abstraite et son application à la moyenne d'un élément aléatoire de nature quelconque, Rev. Sci., 82, 483
  2. Euler, 1758, Demonstratio nonnullarum insignium proprietatum quibus solida hedris planis inclusa sunt praedita, Novi Commentarii Academiae Scien-tiarum Petropolitanae, 4, 140
  3. Dalbec, 1999, Multisymmetric functions, Beiträge Algebra Geom., 40, 27
  4. de Silva, 2004, Proc. First Eurographics Conference on Point-Based Graphics, 157
  5. Singh, 2007, Proc. Eurographics Symposium on Point-Based Graphics 2007
  6. Zomorodian, 2005, Cambridge Monographs on Applied and Computational Mathematics, 16
  7. Robins, 1999, Towards computing homology from finite approximations, Topology Proceedings, 24, 503
  8. Vandermonde, 1774, Mémoires de l'Académie Royale des Sciences pour 1771, 556

Cited by

See all 235

Metadata

Authors
Carlsson, G.
Affiliations
Stanford University (US)
Corresponding author
Carlsson, Gunnar
Venue
Acta Numerica
Published
2014-05
Volume
23
Pages
289-368
ISSN
  • 0962-4929 (ISSN-L)
  • 1474-0508
OpenAlex
W2148676644
Cited by
230
References
88
Citations by year
2026: 7 · 2025: 12 · 2024: 15 · 2023: 28 · 2022: 13 · 2021: 24 · 2020: 27 · 2019: 30 · 2018: 31 · 2017: 14 · 2016: 17 · 2015: 10 · 2014: 2
FWCI
14.80
Type
journal article
Language
en
Open access
Locations
Acta Numerica (publishedVersion)
Funders
  • National Science Foundation
  • University of Cambridge
  • National Institutes of Health
  • Air Force Office of Scientific Research
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
  • Physical Sciences › Mathematics › Mathematical Physics › Homotopy and Cohomology in Algebraic Topology
  • Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
Keywords
persistent homology, point cloud data, pattern recognition, simplicial complexes, barcodes, finite metric spaces, topological signatures, algebraic topology

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).

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: Topological pattern recognition for point cloud data. https://app.cochat.ai/papers/10.1017/s0962492914000051
The paper
Carlsson, G. (2014). Topological pattern recognition for point cloud data. Acta Numerica. https://doi.org/10.1017/s0962492914000051

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.