Performance analysis for a class of iterative image thresholding algorithms
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 itera...
Saved in:
Published in: | Pattern recognition Vol. 29; no. 9; pp. 1523 - 1530 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
Oxford
Elsevier Ltd
01-09-1996
Elsevier Science |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 0031-3203 1873-5142 |
DOI: | 10.1016/0031-3203(96)00009-X |