2011
DOI: 10.1109/tpami.2011.95
|View full text |Cite
|
Sign up to set email alerts
|

Theory and Algorithms for Constructing Discrete Morse Complexes from Grayscale Digital Images

Abstract: We present an algorithm for determining the Morse complex of a two or three-dimensional grayscale digital image. Each cell in the Morse complex corresponds to a topological change in the level sets (i.e., a critical point) of the grayscale image. Since more than one critical point may be associated with a single image voxel, we model digital images by cubical complexes. A new homotopic algorithm is used to construct a discrete Morse function on the cubical complex that agrees with the digital image and has exa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
263
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 230 publications
(263 citation statements)
references
References 27 publications
0
263
0
Order By: Relevance
“…Cubical complexes have been promoted in particular by V. Kovalevsky [33] in order to provide a sound topological basis for image analysis. Recent advances in this framework includes the design of new image processing operators [19,36,48] as well as applications in different fields such as computer graphics [43] or medical imaging [12,13]. In order to ease the reading this article is selfcontained.…”
Section: Introductionmentioning
confidence: 99%
“…Cubical complexes have been promoted in particular by V. Kovalevsky [33] in order to provide a sound topological basis for image analysis. Recent advances in this framework includes the design of new image processing operators [19,36,48] as well as applications in different fields such as computer graphics [43] or medical imaging [12,13]. In order to ease the reading this article is selfcontained.…”
Section: Introductionmentioning
confidence: 99%
“…One particularly useful version looks at the so-called sublevelset filtration of an image, which builds up the simplicial complexes using the values at the pixels rather than starting with a collection of points (Kaczynski, Mischaikow, & Mrozek, 2006;Robins, Wood, & Sheppard, 2011). There are also many variants of persistent homology that may be of interest depending on the application.…”
Section: Further Readingmentioning
confidence: 99%
“…There are many algorithms available in the literature to compute the 3D Morse-Smale complex. The algorithms are primarily based on either the quasi Morse-Smale complex formulation [61], [62] or Forman's [63] discrete Morse theory [64], [65], [66], [67]. We use a parallel algorithm based on the latter approach [67] resulting in fast computation even for large datasets.…”
Section: Density Estimation and Filament Modelingmentioning
confidence: 99%