Abstract
Dominant sets are a new graph-theoretic concept that has proven to be relevant in clustering as well as image segmentation problems. However, due to the computational loads of this approach, applications to large problems such as high resolution imagery have been unfeasible. In this paper we provide a method that substantially reduces the computational burden of the dominant set framework, making it possible to apply it to very large grouping problems. Our approach is based on a heuristic technique that allows one to obtain the complete grouping solution using only a small number of samples.
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.
Similar content being viewed by others
References
Forsyth, D., Ponce, J.: Computer Vision: A Modern Approach. Prentice-Hall, Englewood Cliffs (2002)
Luenberger, D.G.: Linear and Nonlinear Programming. Addison-Wesley, Reading (1984)
Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. of the IEEE Int. Conf. on Computer Vision, vol. 2, pp. 416–424 (2001)
Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Turán. Canad. J. Math. 17, 533–540 (1965)
Pavan, M., Pelillo, M.: A new graph-theoretic approach to clustering and segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 145–152 (2003)
Pavan, M., Pelillo, M.: Unsupervised texture segmentation by dominant sets and game dynamics. In: Proc. IEEE Int. Conf. on Image Analysis and Processing, pp. 302–307 (2003)
Weibull, J.W.: Evolutionary Game Theory. MIT Press, Cambridge (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pavan, M., Pelillo, M. (2004). Efficiently Segmenting Images with Dominant Sets. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2004. Lecture Notes in Computer Science, vol 3211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30125-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-30125-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23223-0
Online ISBN: 978-3-540-30125-7
eBook Packages: Springer Book Archive