Abstract
A performance analysis procedure that analyses the properties of a class of iterative image thresholding algorithms is described. The image under consideration is modeled as consisting of two maximum-entropy primary images, each of which has a quasi-Gaussian probability density function. Three iterative thresholding algorithms identified to share a common iteration architecture are employed for thresholding 4595 synthetic images and 24 practical images. The average performance characteristics including accuracy, stability, speed and consistency are analysed and compared among the algorithms. Both analysis and practical thresholding results are presented.
| Original language | English |
|---|---|
| Pages (from-to) | 1523-1530 |
| Number of pages | 8 |
| Journal | Pattern Recognition |
| Volume | 29 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 1 Sept 1996 |
Keywords
- Image segmentation
- Image thresholding
- Iterative algorithm
- Maximum entropy
- Performance analysis
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence