|
|
|
| Improved Two-Dimensional Otsu Image Segmentation Method and Fast Recursive Realization |
| Chen Qi; Xiong Bo-li; Lu Jun; Kuang Gang-yao |
| School of Electronic Science and Technology, National University of Defense Technology, Changsha 410073, China |
|
|
|
|
Abstract Traditional 2D Otsu’s method supposes that the sum of probabilities of main- diagonal distinct in 2D histogram is approximately one. This paper’s experiments and theory prove that the sum of probabilities of counter-diagonal distinct in 2D histogram is not always very small and this could not be neglected. Therefore, the assumption mentioned above in 2D Otsu’s method is inadequately reasonable. In this paper, an improved 2D Otsu’s segmentation method and recursive algorithm are proposed. By separately calculates probabilities of objects area and background area in 2D histogram main-diagonal distinct, modified method is acquired. Experimental results show that proposed method can obtain better segmentation effect than the traditional 2D Otsu’s method. The computation complexity of improved 2D Otsu’s method corresponds to traditional 2D Otsu’s method.
|
|
Received: 28 April 2009
|
|
|
|
Corresponding Authors:
Chen Qi
|
|
|
|
|
|
|
2010, Vol. 32 
