Fast algorithm for 2D entropic thresholding of image segmentation

Jianzhong Su; Jinwen Tian; Jianguo Liu; Zailong Sun

doi:10.1117/12.441482

21 September 2001 Fast algorithm for 2D entropic thresholding of image segmentation

Jianzhong Su, Jinwen Tian, Jianguo Liu, Zailong Sun

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.

Citation Download Citation

Jianzhong Su, Jinwen Tian, Jianguo Liu, and Zailong Sun "Fast algorithm for 2D entropic thresholding of image segmentation", Proc. SPIE 4550, Image Extraction, Segmentation, and Recognition, (21 September 2001); https://doi.org/10.1117/12.441482

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available