Document Open Access Logo

Sketching Persistence Diagrams

Authors Donald R. Sheehy , Siddharth Sheth



PDF
Thumbnail PDF

File

LIPIcs.SoCG.2021.57.pdf
  • Filesize: 0.78 MB
  • 15 pages

Document Identifiers

Author Details

Donald R. Sheehy
  • North Carolina State University, Raleigh, NC, USA
Siddharth Sheth
  • North Carolina State University, Raleigh, NC, USA

Cite AsGet BibTex

Donald R. Sheehy and Siddharth Sheth. Sketching Persistence Diagrams. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 57:1-57:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.SoCG.2021.57

Abstract

Given a persistence diagram with n points, we give an algorithm that produces a sequence of n persistence diagrams converging in bottleneck distance to the input diagram, the ith of which has i distinct (weighted) points and is a 2-approximation to the closest persistence diagram with that many distinct points. For each approximation, we precompute the optimal matching between the ith and the (i+1)st. Perhaps surprisingly, the entire sequence of diagrams as well as the sequence of matchings can be represented in O(n) space. The main approach is to use a variation of the greedy permutation of the persistence diagram to give good Hausdorff approximations and assign weights to these subsets. We give a new algorithm to efficiently compute this permutation, despite the high implicit dimension of points in a persistence diagram due to the effect of the diagonal. The sketches are also structured to permit fast (linear time) approximations to the Hausdorff distance between diagrams - a lower bound on the bottleneck distance. For approximating the bottleneck distance, sketches can also be used to compute a linear-size neighborhood graph directly, obviating the need for geometric data structures used in state-of-the-art methods for bottleneck computation.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Bottleneck Distance
  • Persistent Homology
  • Approximate Persistence Diagrams

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Henry Adams, Tegan Emerson, Michael Kirby, Rachel Neville, Chris Peterson, Patrick Shipman, Sofya Chepushtanova, Eric Hanson, Francis Motta, and Lori Ziegelmeier. Persistence images: A stable vector representation of persistent homology. J. Mach. Learn. Res., 18(1):218–252, 2017. Google Scholar
  2. Dimitri P. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem. Annals of Operations Research, 14(1):105-123, 1988. Google Scholar
  3. Dimitri P. Bertsekas and David A. Castanon. The auction algorithm for the transportation problem. Annals of Operations Research, 20(1):67-96, December 1989. URL: https://doi.org/10.1007/BF02216923.
  4. Peter Bubenik. Statistical topological data analysis using persistence landscapes. The Journal of Machine Learning Research, 16(1):77-102, 2015. Google Scholar
  5. Mathieu Carrière, Marco Cuturi, and Steve Oudot. Sliced Wasserstein kernel for persistence diagrams. In Doina Precup and Yee Whye Teh, editors, Proceedings of the 34th International Conference on Machine Learning, volume 70 of Proceedings of Machine Learning Research, pages 664-673, International Convention Centre, Sydney, Australia, 06-11 August 2017. PMLR. URL: http://proceedings.mlr.press/v70/carriere17a.html.
  6. Mathieu Carrière, Steve Y. Oudot, and Maks Ovsjanikov. Stable topological signatures for points on 3d shapes. Computer Graphics Forum, 34(5):1–12, August 2015. URL: https://doi.org/10.1111/cgf.12692.
  7. Kenneth L. Clarkson. Nearest neighbor queries in metric spaces. Discrete & Computational Geometry, 22(1):63-93, 1999. Google Scholar
  8. Kenneth L. Clarkson. Nearest neighbor searching in metric spaces: Experimental results for "sb(s)". Preliminary version presented at ALENEX99, 2003. Google Scholar
  9. Kenneth L. Clarkson. Nearest-neighbor searching and metric space dimensions. In Gregory Shakhnarovich, Trevor Darrell, and Piotr Indyk, editors, Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pages 15-59. MIT Press, 2006. Google Scholar
  10. Vincent Divol and Theo Lacombe. Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport. Journal of Applied and Computational Topology, 2020. Google Scholar
  11. M.E. Dyer and A.M. Frieze. A simple heuristic for the p-centre problem. Operations Research Letters, 3(6):285-288, 1985. Google Scholar
  12. A. Efrat, A. Itai, and M. J. Katz. Geometry helps in bottleneck matching and related problems. Algorithmica, 31(1):1–28, September 2001. URL: https://doi.org/10.1007/s00453-001-0016-8.
  13. Brittany Terese Fasy, Xiaozhou He, Zhihui Liu, Samuel Micka, David L. Millman, and Binhai Zhu. Approximate nearest neighbors in the space of persistence diagrams. CoRR, abs/1812.11257, 2018. URL: http://arxiv.org/abs/1812.11257.
  14. Teofilo F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci., 38:293-306, 1985. Google Scholar
  15. Sariel Har-Peled and Manor Mendel. Fast construction of nets in low-dimensional metrics and their applications. SIAM Journal on Computing, 35(5):1148–1184, January 2006. URL: https://doi.org/10.1137/S0097539704446281.
  16. John E. Hopcroft and Richard M. Karp. An n^5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225–231, December 1973. URL: https://doi.org/10.1137/0202019.
  17. Michael Kerber, Dmitriy Morozov, and Arnur Nigmetov. Geometry helps to compare persistence diagrams. ACM Journal of Experimental Algorithmics, 22(1):1.4:1-1.4:20, 2017. Google Scholar
  18. Theo Lacombe, Marco Cuturi, and Steve OUDOT. Large scale computation of means and clusters for persistence diagrams using optimal transport. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 31, pages 9770-9780. Curran Associates, Inc., 2018. URL: https://proceedings.neurips.cc/paper/2018/file/b58f7d184743106a8a66028b7a28937c-Paper.pdf.
  19. Brendan Mumey. Indexing point sets for approximate bottleneck distance queries. CoRR, abs/1810.09482, 2018. URL: http://arxiv.org/abs/1810.09482.
  20. Jan Reininghaus, Stefan Huber, Ulrich Bauer, and Roland Kwitt. A stable multi-scale kernel for topological machine learning. In 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), page 4741–4748. IEEE, June 2015. URL: https://doi.org/10.1109/CVPR.2015.7299106.
  21. Donald R. Sheehy. greedypermutations, 2020. URL: https://github.com/donsheehy/greedypermutation.
  22. Maxime Soler, Melanie Plainchault, Bruno Conche, and Julien Tierny. Lifted wasserstein matcher for fast and robust topology tracking. In 2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV), page 23–33. IEEE, October 2018. URL: https://doi.org/10.1109/LDAV.2018.8739196.
  23. Jules Vidal, Joseph Budin, and Julien Tierny. Progressive wasserstein barycenters of persistence diagrams. IEEE Transactions on Visualization and Computer Graphics, 26:151-161, 2020. Google Scholar
  24. Matthias Zeppelzauer, Bartosz Zieliński, Mateusz Juda, and Markus Seidl. Topological Descriptors for 3D Surface Analysis, volume 9667 of Lecture Notes in Computer Science, page 77–87. Springer International Publishing, 2016. URL: https://doi.org/10.1007/978-3-319-39441-1_8.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail