.png){kind=icon}
.png){kind=icon}
Return
On the dynamics
.png){kind=icon}
PRE
AI
DOI：10.1016/j.imavis.2006.04.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We show several properties of the ordered dynamics. In particular, we give necessary and sufficient conditions which indicate when a transformation preserves the dynamics of the regional maxima. We also establish a link between the dynamics, minimum spanning trees, and component trees. At last, we propose a linear time algorithm for computing, given the component tree of a function, the dynamics of all its maxima. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
mathematical morphology
dynamics
graph
watershed
minimum spanning tree
component tree
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.2
Papers:
4.0K
Citations:
6.7K
Organization
No organization information available