DocumentCode :
2542573
Title :
A Fast 2D Otsu Thresholding Algorithm Based on Improved Histogram
Author :
Zhu, Ningbo ; Wang, Gang ; Yang, Gaobo ; Dai, Weiming
Author_Institution :
Sch. of Comput. & Commun., Hunan Univ., Changsha, China
fYear :
2009
fDate :
4-6 Nov. 2009
Firstpage :
1
Lastpage :
5
Abstract :
Otsu adaptive thresholding is widely used in classic image segmentation. Two-dimensional Otsu thresholding algorithm is regarded as an effective improvement of the original Otsu method. To reduce the high computational complexity of 2D Otsu method, a fast algorithm is proposed based on improved histogram. Two-dimensional histogram is projected onto the diagonal, which forms 1D histogram with obvious peak and valley distribution. Then two-dimensional Otsu method is applied on a line that is vertical to the diagonal to find the optimal threshold. Furthermore, three look-up tables are utilized to improve the computational speed by eliminating the redundant computation in original two-dimensional Otsu method. Theoretical analysis and experimental simulation show that the proposed approach greatly enhances the speed of thresholding and has better immunity to salt and pepper noise.
Keywords :
computational complexity; image segmentation; statistical analysis; table lookup; 2D Otsu adaptive thresholding algorithm; computational complexity; image segmentation; look-up table; pepper noise; salt noise; two-dimensional histogram; valley distribution; Analytical models; Computational complexity; Computational efficiency; Computational modeling; Computer vision; Histograms; Image processing; Image segmentation; Information processing; Laboratories;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pattern Recognition, 2009. CCPR 2009. Chinese Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-4199-0
Type :
conf
DOI :
10.1109/CCPR.2009.5344078
Filename :
5344078
Link To Document :
بازگشت