Framework for efficient optimal multilevel image thresholding

Image thresholding is a very common image processing operation, since almost all image processing schemes need some sort of separation of the pixels into different classes. In order to determine the thresholds, most methods analyze the histogram of the image. The optimal thresholds are often found by either minimiz- ing or maximizing an objective function with respect to the values of the thresholds. By defining two classes of objective functions for which the optimal thresholds can be found by efficient algorithms, this paper provides a framework for determining the solution ap- proach for current and future multilevel thresholding algorithms. We show, for example, that the method proposed by Otsu and other well-known methods have objective functions belonging to these classes. By implementing the algorithms in ANSI C and comparing their execution times, we can also make quantitative statements about their performance. © 2009 SPIE and IS&T.

[1]  Josef Kittler,et al.  Minimum error thresholding , 1986, Pattern Recognit..

[2]  Joel Max,et al.  Quantizing for minimum distortion , 1960, IRE Trans. Inf. Theory.

[3]  Kaizhong Zhang,et al.  Quantizer monotonicities and globally optimal scalar quantizer design , 1993, IEEE Trans. Inf. Theory.

[4]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[5]  New Results on Efficient Optimal Multilevel Image Thresholding , 2006, 2006 International Conference on Image Processing.

[6]  Rainer E. Burkard,et al.  Perspectives of Monge Properties in Optimization , 1996, Discret. Appl. Math..

[7]  Bülent Sankur,et al.  Survey over image thresholding techniques and quantitative performance evaluation , 2004, J. Electronic Imaging.

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[9]  Ku Chin Lin.  Fast thresholding computation by searching for zero derivatives of image between-class variance , 2001, IECON'01. 27th Annual Conference of the IEEE Industrial Electronics Society (Cat. No.37243).

[10]  Pasi Fränti,et al.  Fast pairwise nearest neighbor based algorithm for multilevel thresholding , 2003, J. Electronic Imaging.

[11]  Subhash Suri,et al.  Matrix searching with the shortest path metric , 1993, SIAM J. Comput..

[12]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[13]  O. Virmajoki,et al.  PAIRWISE NEAREST NEIGHBOR METHOD REVISITED , 2004 .

[14]  Shu-Kai S. Fan,et al.  Optimal multi-thresholding using a hybrid optimization approach , 2005, Pattern Recognit. Lett..

[15]  Nikhil R. Pal,et al.  On minimum cross-entropy thresholding , 1996, Pattern Recognit..

[16]  Pau-Choo Chung,et al.  A Fast Algorithm for Multilevel Thresholding , 2001, J. Inf. Sci. Eng..

[17]  Xiaolin Wu,et al.  An O(KN lg N) algorithm for optimum K-level quantization on histograms of N points , 1989, CSC '89.

[18]  Amir Said,et al.  On the Reduction of Entropy Coding Complexity via Symbol Grouping: I - Redundancy Analysis and Optimal Alphabet Partition , 2004 .

[19]  N Otsu,et al.  An automatic threshold selection method based on discriminate and least squares criteria , 1979 .

[20]  Ku Chin Lin.  On improvement of the computation speed of Otsu's image thresholding , 2005, J. Electronic Imaging.

[21]  Nabih N. Abdelmalek,et al.  Maximum likelihood thresholding based on population mixture models , 1992, Pattern Recognit..

[22]  Andrew K. C. Wong,et al.  A new method for gray-level picture thresholding using the entropy of the histogram , 1985, Comput. Vis. Graph. Image Process..

[23]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.