Abstract
An iterative image segmentation algorithm that segments an image on a pixel-by-pixel basis is described. The observation information to be utilized is the joint gray level values of the pixel to be segmented and those of its neighborhood pixels. The iterative process is initialized by thresholding the image with Otsu's method. Each pixel is segmented into a class when the a posteriori probability, conditioned on the observation information, that it belongs to this class is maximum. The newly segmented image is employed to re-estimate the a posteriori probabilities and the segmentation process is repeated until there is no further pixel classification change in a particular run. Among those segmented images generated in the iterative process, the best segmented image is chosen according to a maximum entropy criterion. Simulation studies demonstrate that the proposed algorithm can achieve very significant improvement in segmentation performance as compared to the more popular thresholding approach. Furthermore, the performance is neither sensitive to the initial threshold value nor the form of the probability density function of the image. Segmentation of practical images also demonstrates that the proposed algorithm is capable of good segmentation results for real-life images.
Original language | English |
---|---|
Title of host publication | IEEE Region 10 Annual International Conference, Proceedings/TENCON |
Publisher | IEEE |
Pages | 141-146 |
Number of pages | 6 |
Publication status | Published - 1 Dec 1996 |
Event | Proceedings of the 1996 IEEE Region 10 TENCON - Digital Signal Processing Applications Conference. Part 2 (of 2) - Perth, Australia Duration: 26 Nov 1996 → 29 Nov 1996 |
Conference
Conference | Proceedings of the 1996 IEEE Region 10 TENCON - Digital Signal Processing Applications Conference. Part 2 (of 2) |
---|---|
Country/Territory | Australia |
City | Perth |
Period | 26/11/96 → 29/11/96 |
ASJC Scopus subject areas
- Computer Science Applications
- Electrical and Electronic Engineering