Gradient vector fields of discrete Morse functions and watershed-cuts

From MaRDI portal
Publication:6160786



Abstract: In this paper, we study a class of discrete Morse functions, coming from Discrete Morse Theory, that are equivalent to a class of simplicial stacks, coming from Mathematical Morphology. We show that, as in Discrete Morse Theory, we can see the gradient vector field of a simplicial stack (seen as a discrete Morse function) as the only relevant information we should consider. Last, but not the least, we also show that the Minimum Spanning Forest of the dual graph of a simplicial stack is induced by the gradient vector field of the initial function. This result allows computing a watershed-cut from a gradient vector field.


In the present paper the authors explore the recently discovered connections between Mathematical Morphology (MM) to Discrete Morse Theory (DMT). Their first important result is the fact that discrete Morse functions (DMF), are equivalent, under certain constraints, to a class of spaces called \textit{simplicial stacks}, which are a class of weighted simplicial complexes whose upper threshold sets are also complexes. They show that, in fact (again under some constraints) any DMF is the opposite of a simplicial stack, and vice versa. Furthermore, they prove that, as in Discrete Morse Theory, the gradient vector field of a simplicial stack (seen as a discrete Morse function) can be viewed as the only relevant information to be considered. Moreover, the authors also show that the Minimum Spanning Forest of the dual graph of a simplicial stack is induced by the gradient vector field of the initial function, a result that allows for the computation of a watershed-cut from a gradient vector field. For the entire collection see [Zbl 1511.68008].











This page was built for publication: Gradient vector fields of discrete Morse functions and watershed-cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160786)