1 April 2005 On improvement of the computation speed of Otsu's image thresholding
Kun Chin Lin
Author Affiliations +
Abstract
Many previous methods for image thresholding focused on developing automatic algorithms to determine thresholds. However, most of the methods suffer from time-consuming computation for multilevel thresholding. Therefore, a fast and automatic thresholding method is desired for real-time applications. This paper proposes a new and faster method for bilevel as well as multilevel image thresholding. Taking (partial) derivatives of image between-class variance with respect to gray levels develops the proposed method. For bilevel thresholding, a nonlinear equation is derived to solve for an optimal threshold. For multilevel thresholding, a set of nonlinear equations is derived to solve for a set of optimal thresholds. A parameter is introduced to determine the class number for image classification by subjective determination of the ratio of image features to be kept after classification. Statistical performance analysis of the proposed method versus the Baysian classifier is included in this paper. Thresholding computation for the proposed method and Otsu's [N. Otsu, "A threshold selection method from gray-level histograms," IEEE Trans. Syst. Man, Cyber. SMC-9, 62–66 (1979)] is discussed. There are also several examples to illustrate the feasibility of the proposed method and its superiority in computation speed.
©(2005) Society of Photo-Optical Instrumentation Engineers (SPIE)
Kun Chin Lin "On improvement of the computation speed of Otsu's image thresholding," Journal of Electronic Imaging 14(2), 023011 (1 April 2005). https://doi.org/10.1117/1.1902997
Published: 1 April 2005
Lens.org Logo
CITATIONS
Cited by 21 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image classification

Statistical analysis

Algorithm development

Image processing

Bismuth

Image segmentation

Image analysis

Back to Top