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.
This paper was supported by the Austrian Science Fund under grants FSP-S9103-N04 and P18716-N13.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient graph-based image segmentation. International Journal of Computer Vision 59, 167–181 (2004)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 888–905 (2000)
Haxhimusa, Y., Kropatsch, W.G.: Segmentation graph hierarchies. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol. 3138, pp. 343–351. Springer, Heidelberg (2004)
Keselman, Y., Dickinson, S.J.: Generic model abstraction from examples. IEEE Trans. Pattern Anal. Mach. Intell. 27, 1141–1156 (2005)
Kropatsch, W.G., Haxhimusa, Y., Pizlo, Z., Langs, G.: Vision pyramids that do not grow too high. Pattern Recognition Letters 26, 319–337 (2005)
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)
Roerdink, J.B.T.M., Meijster, A.: The watershed transform: Definitions, algorithms and parallelization strategies. Fundamenta Informaticae 41, 187–228 (2000)
Brun, L., Kropatsch, W.G.: Irregular Pyramids with Combinatorial Maps. In: Amin, A., Pudil, P., Ferri, F.J., Iñesta, J.M. (eds.) SPR 2000 and SSPR 2000. LNCS, vol. 1876, pp. 256–265. Springer, Heidelberg (2000)
Neštřil, J., Miklovà, E., Neštřilova, H.: Otakar Boro̊vka on minimal spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics 233, 3–36 (2001)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ion, A., Kropatsch, W.G., Haxhimusa, Y. (2006). Considerations Regarding the Minimum Spanning Tree Pyramid Segmentation Method . In: Yeung, DY., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2006. Lecture Notes in Computer Science, vol 4109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11815921_19
Download citation
DOI: https://doi.org/10.1007/11815921_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37236-3
Online ISBN: 978-3-540-37241-7
eBook Packages: Computer ScienceComputer Science (R0)