Brittany Terese Fasy, David L. Millman, Anna Schenfisch
{"title":"Ordering Topological Descriptors","authors":"Brittany Terese Fasy, David L. Millman, Anna Schenfisch","doi":"arxiv-2402.13632","DOIUrl":null,"url":null,"abstract":"Recent developments in shape reconstruction and comparison call for the use\nof many different types of topological descriptors (persistence diagrams, Euler\ncharacteristic functions, etc.). We establish a framework that allows for\nquantitative comparisons of topological descriptor types and therefore may be\nused as a tool in more rigorously justifying choices made in applications. We\nthen use this framework to partially order a set of six common topological\ndescriptor types. In particular, the resulting poset gives insight into the\nadvantages of using verbose rather than concise topological descriptors. We\nthen provide lower bounds on the size of sets of descriptors that are complete\ndiscrete invariants of simplicial complexes, both tight and worst case. This\nwork sets up a rigorous theory that allows for future comparisons and analysis\nof topological descriptor types.","PeriodicalId":501570,"journal":{"name":"arXiv - CS - Computational Geometry","volume":"50 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2402.13632","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Recent developments in shape reconstruction and comparison call for the use
of many different types of topological descriptors (persistence diagrams, Euler
characteristic functions, etc.). We establish a framework that allows for
quantitative comparisons of topological descriptor types and therefore may be
used as a tool in more rigorously justifying choices made in applications. We
then use this framework to partially order a set of six common topological
descriptor types. In particular, the resulting poset gives insight into the
advantages of using verbose rather than concise topological descriptors. We
then provide lower bounds on the size of sets of descriptors that are complete
discrete invariants of simplicial complexes, both tight and worst case. This
work sets up a rigorous theory that allows for future comparisons and analysis
of topological descriptor types.