Considerations regarding the minimum spanning tree pyramid segmentation method

Authors:
Adrian Ion;Walter G. Kropatsch;Yll Haxhimusa
Affiliations:
Pattern Recognition and Image Processing Group, Vienna University of Technology, Vienna, Austria;Pattern Recognition and Image Processing Group, Vienna University of Technology, Vienna, Austria;Pattern Recognition and Image Processing Group, Vienna University of Technology, Vienna, Austria
Venue:
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2006

Citing 8
Cited 1

The watershed transform: definitions, algorithms and parallelization strategies

Fundamenta Informaticae - Special issue on mathematical morphology
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Otakar Borůvka on minimum spanning tree problem translation of both the 1926 papers, comments, history

Discrete Mathematics
Irregular Pyramids with Combinatorial Maps

Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Efficient Graph-Based Image Segmentation

International Journal of Computer Vision
Vision pyramids that do not grow too high

Pattern Recognition Letters - Special issue: In memoriam Azriel Rosenfeld
Generic Model Abstraction from Examples

IEEE Transactions on Pattern Analysis and Machine Intelligence
Evaluating Hierarchical Graph-based Segmentation

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02

Combining boundary and region features inside the combinatorial pyramid for topology-preserving perceptual image segmentation

Pattern Recognition Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.