Fast algorithm for 2D entropic thresholding of image segmentation
Jianzhong Su, Jinwen Tian, Jianguo Liu, Zailong Sun · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2001
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.