%0 Electronic Article
%A Q. Chen
%A L. Zhao
%A J. Lu
%A G. Kuang
%A N. Wang
%A Y. Jiang
%K diagonal quadrants probabilities
%K fast realisation
%K 2D Otsu method
%K computation complexity
%K off-diagonal quadrants probabilities
%K recursive algorithm
%K modified two-dimensional Otsu image segmentation algorithm
%K 2D histogram
%X Traditional two-dimensional (2D) Otsu method supposes that the sum of probabilities of diagonal quadrants in 2D histogram is approximately one. This studies experiments and theory prove that the sum of probabilities of off-diagonal quadrants in 2D histogram is not always very small and this could not be neglected. Therefore the assumption mentioned above in 2D Otsu method is inadequately reasonable. In this study, an improved 2D Otsu segmentation method and recursive algorithm are proposed. By calculating probabilities of diagonal quadrants in 2D histogram separately, modified method is acquired. Experimental results show that proposed method can obtain better performance of segmentation than the traditional 2D Otsu method. The computation complexity of improved 2D Otsu method is equal to traditional 2D Otsu method.
%@ 1751-9659
%T Modified two-dimensional Otsu image segmentation algorithm and fast realisation
%B IET Image Processing
%D June 2012
%V 6
%N 4
%P 426-433
%I Institution of Engineering and Technology
%U https://digital-library.theiet.org/;jsessionid=2akp2t4wadq7m.x-iet-live-01content/journals/10.1049/iet-ipr.2010.0078
%G EN