The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A stable multi-scale kernel for topological machine learning
Abstract
Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack a theoretically sound connection to popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In this work, we establish such a connection by designing a multi-scale kernel for persistence diagrams, a stable summary representation of topological features in data. We show that this kernel is positive definite and prove its stability with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets for 3D shape classification/retrieval and texture recognition show considerable performance gains of the proposed method compared to an alternative approach that is based on the recently introduced persistence landscapes.
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
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302 · cited 4×
“Since then, several authors have demonstrated that TDA can capture characteristics of the data that other methods often fail to provide, c.f .”
BackgroundInfluentialLearning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.848998 · Cited by 2,225
A Completed Modeling of Local Binary Pattern Operator for Texture Classification
Guo, Z., Zhang, L., & Zhang, D. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2044957 · Cited by 2,115
Computational topology an introduction
Edelsbrunner, H., & Harer, J. (2010) · Cited by 1,718
Multiple Kernel Learning Algorithms
Gönen, M., & Alpaydın, E. (2011) · doi:10.5555/1953048.2021071 · Cited by 1,688
A Concise and Provably Informative Multi‐Scale Signature Based on Heat Diffusion
Sun, J., Ovsjanikov, M., & Guibas, L. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01515.x · Cited by 1,450
Shilane, P., Min, P., Kazhdan, M., & Funkhouser, T. (2004) · Proceedings Shape Modeling Applications, 2004. · doi:10.1109/smi.2004.1314504 · Cited by 1,419
Stability of Persistence Diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-006-1276-5 · Cited by 1,280
Edelsbrunner, H., & Harer, J. (2009) · American Mathematical Society eBooks · doi:10.1090/mbk/069 · Cited by 820
Outex - new framework for empirical evaluation of texture analysis algorithms
Ojala, T., Maenpaa, T., Pietikainen, M., Viertola, J., Kyllonen, J., & Huovinen, S. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1044854 · Cited by 695
Nonnegative Matrices and Applications
Bapat, R. B., & Raghavan, T. E. S. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511529979 · Cited by 588
The Kernel Trick for Distances
Schölkopf, B. (2000) · Cited by 505
Greengard, L., & Strain, J. (1991) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0912004 · Cited by 491
Statistical topological data analysis using persistence landscapes
Bubenik, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.6437 · Cited by 476
Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions
Berg, C., Christensen, J. P., & Ressel, P. (1984) · Medical Entomology and Zoology · Cited by 420
Lipschitz Functions Have L p -Stable Persistence
Cohen-Steiner, D., Edelsbrunner, H., Harer, J., & Mileyko, Y. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9060-6 · Cited by 284
Fourier Analysis and Partial Differential Equations
Iório, R. J., & Iorio, V. D. M. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511623745 · Cited by 243
Persistence-Based Clustering in Riemannian Manifolds
Chazal, F., Guibas, L. J., Oudot, S. Y., & Skraba, P. (2013) · Journal of the ACM · doi:10.1145/2535927 · Cited by 217
Persistence Diagrams of Cortical Surface Data
Chung, M., Bubenik, P., & Kim, P. T. (2009) · Information Processing in Medical Imaging · doi:10.1007/978-3-642-02498-6_32 · Cited by 146
Distributed Computation of Persistent Homology
Bauer, U., Kerber, M., & Reininghaus, J. (2013) · Workshop on Algorithm Engineering and Experimentation · doi:10.1137/1.9781611973198.4 · Cited by 131
Self-citationThe ring of algebraic functions on persistence bar codes
Adcock, A., Carlsson, E., & Carlsson, G. (2016) · Homology Homotopy and Applications · doi:10.4310/hha.2016.v18.n1.a21 · Cited by 125
Persistence-based segmentation of deformable shapes
Škraba, P., Ovsjanikov, M., Chazal, F., & Guibas, L. J. (2010) · 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops · doi:10.1109/cvprw.2010.5543285 · Cited by 115
Efficient Computation of Persistent Homology for Cubical Data
Wagner, H., Chen, C., & Vuçını, E. (2011) · Mathematics and visualization · doi:10.1007/978-3-642-23175-9_7 · Cited by 112
Persistence-Based Structural Recognition
Li, C., Ovsjanikov, M., & Chazal, F. (2014) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2014.257 · Cited by 106
Topology-Based Kernels With Application to Inference Problems in Alzheimer's Disease
Pachauri, D., Chris Hinrichs, A., Chung, M. K., Johnson, S. C., & Singh, V. (2011) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2011.2147327 · Cited by 96
SHREC'14 Track: Shape retrieval of non-rigid 3D human models
Pickup, D., Martin, R. R., Rosin, P. L., Sun, X., Cheng, Z., Lian, Z., Aono, M., Hamza, A. B., Bronstein, A. M., Bronstein, M. M., et al. (2014) · ORCA Online Research @Cardiff (Cardiff University) · doi:10.2312/3dor.20141056 · Cited by 75
Persistence-based clustering in riemannian manifolds
Chazal, F., Guibas, L. J., Oudot, S., & Škraba, P. (2011) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1998196.1998212 · Cited by 51
Enforcing topological constraints in random field image segmentation
Chen, C., Freedman, D., & Lampert, C. H. (2011) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2011.5995503 · Cited by 50
Gao, M., Chen, C., Zhang, S., et al. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38868-2_16 · Cited by 34
Cited by
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists
Chazal, F., & Michel, B. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2021.667963 · Cited by 581
Persistent homology analysis of brain artery trees
Bendich, P., Marron, J. S., Miller, E., Pieloch, A., & Skwerer, S. (2016) · The Annals of Applied Statistics · doi:10.1214/15-aoas886 · Cited by 261
Metadata
- Authors
- Reininghaus, J., Huber, S., Bauer, U., & Kwitt, R.
- Venue
- 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
- Publisher
- IEEE
- Published
- 2015-06
- Pages
- 4741-4748
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W1960384938
- Cited by
- 299
- References
- 33
- FWCI
- 19.61
- Type
- conference paper
- 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
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.