Convergence of unsupervised image segmentation algorithms

Chee Sun Won

doi:10.1117/12.216354

11 August 1995 Convergence of unsupervised image segmentation algorithms

Chee Sun Won

Proceedings Volume 2568, Neural, Morphological, and Stochastic Methods in Image and Signal Processing; (1995) https://doi.org/10.1117/12.216354
Event: SPIE's 1995 International Symposium on Optical Science, Engineering, and Instrumentation, 1995, San Diego, CA, United States

Abstract

This paper presents a comparative study of three deterministic unsupervised image segmentation algorithms. All of the three algorithms basically make use of a Markov random field (MRF) and try to obtain an approximate solution to the maximum likelihood or the maximum a posteriori estimates. Although the three algorithms are based on the same stochastic image models, they adopt different ways to incorporate model parameter estimation into the iterative region label updating procedure. The differences among the three algorithms are identified and the convergence properties are compared both analytically and experimentally.

Citation Download Citation

Chee Sun Won "Convergence of unsupervised image segmentation algorithms", Proc. SPIE 2568, Neural, Morphological, and Stochastic Methods in Image and Signal Processing, (11 August 1995); https://doi.org/10.1117/12.216354

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available