Share Email Print

Proceedings Paper

Fast algorithm for 2D entropic thresholding of image segmentation
Author(s): Jianzhong Su; Jinwen Tian; Jianguo Liu; Zailong Sun
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

2-D entropic thresholding method is a very effective approach for image segmentation. But the computational complexity up to O(L4) greatly limits its application. Wu et al. proposed a fast recursive algorithm based on Abutaleb's 2-D entropic thresholding method, which reduced the computational complexity to O(L2) with the memory cost of 2*L floating words. This paper should present a novel fast searching algorithm for optimal thresholding vector, which reduces the computational complexity to about (3*L+w*w), where w is less than 10,with very little memory cost.

Paper Details

Date Published: 21 September 2001
PDF: 6 pages
Proc. SPIE 4550, Image Extraction, Segmentation, and Recognition, (21 September 2001); doi: 10.1117/12.441482
Show Author Affiliations
Jianzhong Su, Huazhong Univ. of Science and Technology (China)
Jinwen Tian, Huazhong Univ. of Science and Technology (China)
Jianguo Liu, Huazhong Univ. of Science and Technology (China)
Zailong Sun, Institute for Technological Physics of Jinhang (China)

Published in SPIE Proceedings Vol. 4550:
Image Extraction, Segmentation, and Recognition
Tianxu Zhang; Bir Bhanu; Ning Shu, Editor(s)

© SPIE. Terms of Use
Back to Top