Abstract
Grouping processes may benefit computationally when simple algorithms are used as part of the grouping process. In this paper we consider a common and extremely fast grouping process based on the connected components algorithm. Relying on a probabilistic model, we focus on analyzing the algorithm's performance. In particular, we derive the expected number of addition errors and the group fragmentation rate. We show that these performance figures depend on a few inherent and intuitive parameters. Furthermore, we show that it is possible to control the grouping process so that the performance may be chosen within the bounds of a given tradeoff. The analytic results are supported by implementing the algorithm and testing it on synthetic and real images.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amir, A. and Lindenbaum, M. 1998. A generic grouping algorithm and its quantitative analysis. PAMI, 20(2):168-185.
Bollobás, B. 1985. Random Graphs. Academic Press: London and Orlando.
Boyer, K.L. and Sarkar, S. 1999. Special issue on perceptual organization in computer vision. Computer Vision and Image Understanding, 76(1).
Broadbent, S. and Hammersley, J. 1957. Percolation process I. Crystals and mazes. Proceedings of the Cambridge Philosophical Society, 53:629-641.
Clemens, D. and Jacobs, D. 1991. Space and time bounds on indexing 3-D models from 2-D images. PAMI, 13(10):1007-1017.
Cormen, T.H., Leiserson, C.E., and Rivest, R.L. 1989. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. MIT Press: Cambridge, USA.
Dubuc, B. and Zucker, S. 1994. Curve-like sets, normal complexity, and representation. In ICPR-94, Jerusalem, Vol. 1, pp. 216-221.
Duda, R.O. and Hart, P.E. 1972. Use of the hough transform to detect lines and curves in pictures. Communications of the ACM, 15(1): 11-15.
Erdós, P. and Rényi, A. 1960. On the evolution of random graphs. Madyar Tud. Akad. Mat. Kut. Int. Kózl, 5:17-61.
Geman, S. and Geman, D. 1984. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. PAMI, 6(6):721-741.
Gradshtein, I. and Ryzhik, I. 1980. Table of Integrals, Series, and Products. Academic Press: New York.
Grimmett, G. 1999. Percolation. Grundlehren der mathematischen Wissenschaften. Springer: Berlin and New York, 2nd edn.
Grimson, E. 1990. Object Recognition by Computer. MIT Press: Cambridge, USA.
Herault, L. and Horaud, R. 1993. Figure-ground discrimination: A combinatorial optimization approach. PAMI, 15(9):899-914.
Huttenlocher, D. and Ullman, S. 1990. Recognizing solid objects by alignment with an image. International Journal of Computer Vision, 5(2):195-212.
Jacobs, D.W. 1988. The use of grouping in visual object recognition. Ph.D. dissertation, M.I.T, Dept. of E.E. and C.S.
Jacobs, D.W. 1996. Robust and efficient detection of salient convex groups. PAMI, 18(1):23-37.
Lowe, D.G. 1985. Perceptual Organization and Visual Recognition. Kluwer Academic Publishers: Norwell, MA.
Mohan, R. and Nevatia, R. 1992. Perceptual organization for scene segmentation and description. PAMI, 14(6):616-635.
Ramesh, V. and Haralick, R. 1997. Random perturbation models for boundary extraction sequence. Machine Vision and Applications, 9(5-6):229-239.
Saint-Marc, P., Rom, H., and Medioni, G. 1993. B-spline contour representation and symmetry detection. PAMI, 15(11):1191-7.
Sarkar, S. and Boyer, K.L. 1993. Perceptual organization in computer vision: A review and proposal for a classifactory structure. IEEE Transactions on System, Man and Cybernetics, 23(2):382-399.
Sarkar, S. and Boyer K.L. (Eds.).2000. Perceptual Organization for Artificial Vision Systems. Kluwer Academic Publishers.
Sha'ashua, A. and Ullman, S. 1988. Structural saliency: The detection of globally salient structures using locally connected network. In ICCV-88, pp. 321-327.
Shapiro, L.G. and Haralick, R.M. 1979. Decomposition of twodimentional shapes by graph-theoretic clustering. PAMI, 1(1):10-20.
Shi, J. and Malik, J. 1997. Normalized cuts and image sementation. In CVPR97, pp. 731-737.
Stauffer, D. and Aharony, A. 1994. Introduction to Percolation Theory. Taylor & Francis: London and Bristol, PA, revised 2nd edn.
Witkin, A.P. and Tenenbaum, J.M. 1983. On the role of structure in vision. In Human and Machine Vision. J. Beck, B. Hope, and A. Rosenfeld (Eds.), Academic Press: New York, pp. 481-543.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Berengolts, A., Lindenbaum, M. On the Performance of Connected Components Grouping. International Journal of Computer Vision 41, 195–216 (2001). https://doi.org/10.1023/A:1011108121495
Issue Date:
DOI: https://doi.org/10.1023/A:1011108121495