2009
DOI: 10.1007/978-3-642-10631-6_74
|View full text |Cite
|
Sign up to set email alerts
|

Computing Multidimensional Persistence

Abstract: The theory of multidimensional persistence captures the topology of a multifiltration -a multiparameter family of increasing spaces. Multifiltrations arise naturally in the topological analysis of scientific data. In this paper, we give a polynomial time algorithm for computing multidimensional persistence. We recast this computation as a problem within computational commutative algebra, and utilize algorithms from this area to solve it. While the resulting problem is Expspace-complete and the standard algorit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
80
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
5
3
2

Relationship

1
9

Authors

Journals

citations
Cited by 70 publications
(81 citation statements)
references
References 20 publications
1
80
0
Order By: Relevance
“…The part of that methodology which is relevant is the multigraded version of the notion of a Gröbner basis for a submodule of a free finitely generated module, the Buchberger algorithm for constructing such a basis, and the algorithm for constructing syzygies attached to homomorphisms of free multigraded modules (Schreyer's algorithm). These results are developed in [14]. The Gröbner basis provides a very compact description which contains all the information about the multidimensional persistence problem.…”
Section: Proposition 44 In the Case N = 1 The Rank Invariant Is A mentioning
confidence: 99%
“…The part of that methodology which is relevant is the multigraded version of the notion of a Gröbner basis for a submodule of a free finitely generated module, the Buchberger algorithm for constructing such a basis, and the algorithm for constructing syzygies attached to homomorphisms of free multigraded modules (Schreyer's algorithm). These results are developed in [14]. The Gröbner basis provides a very compact description which contains all the information about the multidimensional persistence problem.…”
Section: Proposition 44 In the Case N = 1 The Rank Invariant Is A mentioning
confidence: 99%
“…This is due to the fact that a complete, discrete and stable representation for the Persistent Topology shape descriptors seems not to be available in the multidimensional setting, differently from what happens in the 1-dimensional situation. The arising computational difficulties have been faced following different strategies [1,5,10], but not completely solved.…”
mentioning
confidence: 99%
“…Then, instead of building graph filtration over 1D, we need to build it over 2D sparse parameter space. This is related to multidimensional persistent homology [4,12]. Extending the proposed method to triple image setting is left as a future study.…”
Section: Discussionmentioning
confidence: 99%