Considerations Regarding the Minimum Spanning Tree Pyramid Segmentation Method
The minimum spanning tree pyramid is a hierarchical image segmentation method. We study it’s properties and the regions it produces. We show the similarity with the watershed transform and present the method in a domain in which this is easy to understand. For this, a short overview of both methods is given. Catchment basins are contracted before their neighbouring local maximas. Smooth regions surrounded by borders with maximal local variation are selected. The maximum respectively minimum variation on the border of a region is larger than the maximum respectively minimum variation inside the region.
KeywordsEdge Graph Catchment Basin Statistical Pattern Recognition Minimal Span Tree Problem Small Edge
Unable to display preview. Download preview PDF.
- 6.Haxhimusa, Y., Ion, A., Kropatsch, W.G.: Evaluating graph-based segmentation algorithms. In: Proceedings of the 18th Internation Conference on Pattern Recognition, Hong Kong (2006)Google Scholar
- 10.Haxhimusa, Y.: Structurally Optimal Dual Graph Pyramid and its Application in Image Partitioning. PhD thesis, Vienna University of Technology, Faculty of Informatics, Institute of Computer Aided Automation, Pattern Recognition and Image Processing Group (2006)Google Scholar
- 11.Meyer, F.: Graph based morphological segmentation. In: Kropatsch, W.G., Jolion, J.-M. (eds.) 2nd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, Vienna, Austria, vol. 126, pp. 51–60. OCG (1999)Google Scholar