Abstract
Automatic segmentation is performed using watersheds of the gradient magnitude and compression techniques. Linear Scale-Space is used to discover the neighbourhood structure and catchment basins are locally merged with Minimum Description Length. The algorithm can form a basis for a large range of automatic segmentation algorithms based on watersheds, scale-spaces, and compression.
Supported in part by EC Contract No. ERBFMRY-CT96-0049 (VIRGO http://www.ics.forth.gr/virgo) under the TMR Programme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrew Barron, Jorma Rissanen, and Bin Yu. The minimum description length principle in coding and modeling. IEEE Transactions on Information Theory, 44(6):2743–2760, 1998.
Martin C. Cooper. The tractability of segmentation and scene analysis. International Journal of Computer Vision, 30(1):27–42, 1998.
Lewis D. Griffin, Alan C. F. Colchester, and G. P. Robinson. Scale and segmentation of grey-level images using maximum gradient paths. Image and Vision Computing, 10(6):389–402, July/August 1992.
Paul T. Jackway. Gradient watersheds in morphological scale-space. IEEE Transactions on Image Processing, 5(6):913–921, 1996.
Yvan C. Leclerc. Constructing simple stable descriptions for image partitioning. International Journal of Computer Vision, 3:73–102, 1989.
D. Mumford and J. Shah. Optimal approximations by piecewise smooth functions and asociated variational problems. Comm. on Pure and Applied Mathematics, 42, July 1989.
Ole Fogh Olsen. Multi-scale watershed segmentation. In Sporring et al. [13], pages 191–200.
Ole Fogh Olsen and Mads Nielsen. Generic events for the gradient squared with application to multi-scale segmentation. In Scale-Space Theory in Computer Vision, Proc. 1st International Conference, volume 1252 of Lecture Notes in Computer Science, pages 101–112, Utrecht, The Netherlands, July 1997.
N. R. Pal and S. K Pal. A review on image segmentation techniques. Pattern Recognition, 26:1277–1294, 1993.
J. Rissanen. Stochastic Complexity in Statistical Inquiry. World Scientific, Singapore, 1989.
P. J. Rousseeuw and A. M. Leroy. Robust Regression and Outlier Detection. John Wiley & Sons, 1987.
Jon Sporring. Measuring and Modelling Image Structure. PhD thesis, DIKU, Datalogisk Institut ved K_benhavns Universitet, Copenhagen, Denmark, 1999.
Jon Sporring, Mads Nielsen, Luc Florack, and Peter Johansen, editors. Gaussian Scale-Space Theory. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997.
J. Weickert. Efficient image segmentation using partial differential equations and morphology. Technical Report DIKU-98/10, Dept. of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark, 1998.
J. Weickert, S. Ishikawa, and A. Imiya. On the history of Gaussian scale-space axiomatics. In Sporring et al. [13], chapter 4, pages 45–59.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sporring, J., Olsen, O.F. (1999). Segmenting by Compression Using Linear Scale-Space and Watersheds. In: Nielsen, M., Johansen, P., Olsen, O.F., Weickert, J. (eds) Scale-Space Theories in Computer Vision. Scale-Space 1999. Lecture Notes in Computer Science, vol 1682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48236-9_52
Download citation
DOI: https://doi.org/10.1007/3-540-48236-9_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66498-7
Online ISBN: 978-3-540-48236-9
eBook Packages: Springer Book Archive