21 September 2001 Fast algorithm for 2D entropic thresholding of image segmentation
Author Affiliations +
Proceedings Volume 4550, Image Extraction, Segmentation, and Recognition; (2001) https://doi.org/10.1117/12.441482
Event: Multispectral Image Processing and Pattern Recognition, 2001, Wuhan, China
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.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jianzhong Su, Jianzhong Su, Jinwen Tian, Jinwen Tian, Jianguo Liu, Jianguo Liu, Zailong Sun, Zailong Sun, } "Fast algorithm for 2D entropic thresholding of image segmentation", Proc. SPIE 4550, Image Extraction, Segmentation, and Recognition, (21 September 2001); doi: 10.1117/12.441482; https://doi.org/10.1117/12.441482
PROCEEDINGS
6 PAGES


SHARE
Back to Top