Fast Recurring Two-dimensional Tsallis-Havrda-Charvat Entropic Thresholding Algorithms
Zhe Pan · Signal Processing · 2009
Thresholding is a simple and efficient technique for image segmentation in digital image processing.It finds wide applications in various areas.The thresholding algorithm based on entropy is one of the most famous methods.The two-dimensional Tsallis -Havrda-Charvat entropic thresholding algorithm has a good performance,but due to its large computation,it is hard to be used in reality. In this paper,two fast recurring two-dimensional Tsallis-Havrda-Charvat entropic thresholding algorithms,whose computational complexities are both only O(L~2 ),are proposed,while the computational complexity of the original algorithm is O(L~4 ).Using these two recurring algorithms,the results and processing time of the two-dimensional Tsallis-Havrda-Charvat entropic thresholding algorithm are given.Experimental results show that these two recurring algorithms can both greatly reduce the processing time of images,which is less than 0.1%of the original algorithm.