Skip to main content
Springer Nature Link
Log in

Convergence of fuzzy-pyramid algorithms

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

Pyramid linking is an important technique for segmenting images and has many applications in image processing and computer vision. The algorithm is closely related to the ISODATA clustering algorithm and shares some of its properties. This paper investigates this relationship and presents a proof of convergence for the pyramid linking algorithm. The convergence of the hard-pyramid linking algorithm has been shown in the past; however, there has been no proof of the convergence of fuzzy-pyramid linking algorithms. The proof of convergence is based on Zangwill's theorem, which describes the convergence of an iterative algorithm in terms of a “descent function” of the algorithm. We show the existence of such a descent function of the pyramid algorithm and, further, show that all the conditions of Zangwill's theorem are met; hence the algorithm converges.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.C. Bezdek, “A convergence theorem for the fuzzy ISODATA clustering algorithms,”IEEE Trans. Patt. Anal. Mach. Intell. vol. PAMI-2, pp. 1–8, 1980.

    Google Scholar 

  2. W.I. Zangwill,Nonlinear Programming: A Unified Approach, Prentice-Hall: Englewood Cliffs, NJ, 1969.

    Google Scholar 

  3. P.J. Burt, T.H. Hong, and A. Rosenfeld, “Segmentation and estimation of image region properties through cooperative hierarchical computation,”IEEE Trans. Systems, Man, Cybernet. vol. SMC-11, pp. 802–809, 1981.

    Google Scholar 

  4. F. Arman, B. Sabata, and J.A. Pearce, “Classification of complex cell images using pyramid node linking,”Proc. Soc. Photo.-Opt. Instrum. Eng., vol. 914, pp. 476–483, 1988.

    Google Scholar 

  5. F. Arman, B. Sabata, and J.K. Aggarwal “Hierarchical segmentation of 3-D range images,” inProc. 1989 IEEE International Conference on Systems Man, and Cybernetics, Cambridge, MA, 1989, pp. 156–161.

  6. F. Arman and J. Pearce, “Unsupervised classification of cell images using pyramid node linking,”IEEE Trans. Biomed. Eng. vol. BME-37, pp. 647–650, 1990.

    Google Scholar 

  7. J. Cibulskis and C.R. Dyer, “Node linking strategies in pyramid for image segmentation,” inMultiresolution Image Processing and Analysis, A. Rosenfeld, ed., Springer-Verlag: Berlin, 1984, pp. 109–120.

    Google Scholar 

  8. T. Ichikawa, “A pyramid representation of images and its feature extraction facility,”IEEE Trans. Patt. Anal. Mach. Intell., vol. PAMI-3, pp. 257–264, 1981.

    Google Scholar 

  9. B.P. Kjell and C.R. Dyer, “Segmentation of textured images by pyramid linking,” inPyramidal Systems for Computer Vision, V. Cantoni and S. Levialdi, eds., NATO ASI Series, vol. F-25, Springer-Verlag: Berlin, 1986, pp. 273–288.

    Google Scholar 

  10. A. Rosenfeld,Multiresolution Image Processing and Analysis, Springer-Verlag: Berlin, 1984.

    Google Scholar 

  11. A. Rosenfeld, “Some pyramid techniques for image segmentation,” inPyramidal Systems for Computer Vision, V. Cantoni and S. Levialdi, eds., NATO ASI Series, vol. F-25, Springer-Verlag: Berlin, pp. 261–272, 1986.

    Google Scholar 

  12. B.J. Schacher, L.S. Davis, and A. Rosenfeld, “Some experiments in image segmentation by clustering of local feature values,”Patt. Recog. vol. 11, pp. 19–28, 1979.

    Google Scholar 

  13. M. Pietikainen and A. Rosenfeld, “Image segmentation by texture using pyramid node linking,”IEEE Trans. Systems Man, Cybernet. vol. SMC-11, pp. 822–825, 1981.

    Google Scholar 

  14. T.H. Hong and A. Rosenfeld, “Compact region extraction using weighted pixel linking in a pyramid,”IEEE Trans. Patt. Anal. Mach. Intell., vol. PAMI-6, pp. 222–229, 1984.

    Google Scholar 

  15. T.H. Hong and M. Shneier, “Extracting compact objects using linked pyramids,”IEEE Trans. Anal. Mach. Intell. vol. PAMI-6, pp. 229–237, 1984.

    Google Scholar 

  16. T.H. Hong, M. Shneier, and A. Rosenfeld, “Border extraction using linked edge pyramids,”IEEE Trans. Patt. Systems, Man, Cybernet. vol. SMC-12, pp. 660–668, 1982.

    Google Scholar 

  17. B. Sabata, F. Arman, and J.K. Aggarwal, “Segmentation of 3-D range images using pyramidal data structures,”in Proc, 3rd International Conference on Computer Vision, Osaka, Japan, 1990, pp. 662–666.

  18. B. Sabata, F. Arman, and J.K. Aggarwal, “Segmentation of 3-D range images using pyramidal data structures,”CVGIP: Image Understanding, vol. 57, No. 3, pp. 373–387, May 1993.

    Google Scholar 

  19. J.C. Dunn, “A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters,”J. Cybernet. vol. 3, pp. 32–57, 1974.

    Google Scholar 

  20. S. Kasif and A. Rosenfeld, “Pyramid linking is a special case of ISODATA,”IEEE Trans. Systems, Man, Cybernet. vol. SMC-13, pp. 84–85, 1983.

    Google Scholar 

  21. T.H. Hong, K.A. Narayanan, S. Peleg, and A. Rosenfeld, “Image Smoothing and segmentation by multiresolution pixel linking: further experiments and extensions,”IEEE Trans. Systems, Man, Cybernet., vol. SMC-12, pp. 611–622, 1982.

    Google Scholar 

  22. W.J. Grosky and R. Jain, “A pyramid-based approach to segmentation applied to region matching,”IEEE Trans. Patt. Anal. Mach. Intell., vol. PAMI-8, pp. 639–650, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Wayne State University, 431 State Hall, 48202, Detroit, MI, USA

    Bikash Sabata

  2. Siemens Corporate Research, 755 College Road East, 08540, Princeton, NJ, USA

    Farshid Arman

  3. Computer and Vision Research Center, Department of Electrical and Computer Engineering, University of Texas at Austin, 78712, Austin, TX, USA

    J. K. Aggarwal

Authors
  1. Bikash Sabata
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Farshid Arman
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. J. K. Aggarwal
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This research was supported by the U.S. Army Research Office under contract DAAL 03-91-G0050.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sabata, B., Arman, F. & Aggarwal, J.K. Convergence of fuzzy-pyramid algorithms. J Math Imaging Vis 4, 291–302 (1994). https://doi.org/10.1007/BF01254104

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01254104

Key words