The computational complexity of the traditional 2D entropic algorithm is bounded by O(L 4) .In this paper,a fast 2D entropic thresholding method whose computational complexity is only O(L 2) is proposed.Experimental results show that the processing time of each image is reduced from more than 2 h to less than 10 s.The required memory space is also reduced.
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
