By Topic

Modified two-dimensional otsu image segmentation algorithm and fast realisation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Chen, Q. ; Sch. of Electron. Sci. & Technol., Nat. Univ. of Defense Technol., Changsha, China ; Zhao, L. ; Lu, J. ; Kuang, G.
more authors

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.

Published in:

Image Processing, IET  (Volume:6 ,  Issue: 4 )