Modified two-dimensional Otsu image segmentation algorithm and fast realisation

Access Full Text

Modified two-dimensional Otsu image segmentation algorithm and fast realisation

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Image Processing — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

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.

Inspec keywords: computational complexity; image segmentation

Other keywords: diagonal quadrants probabilities; fast realisation; 2D Otsu method; computation complexity; off-diagonal quadrants probabilities; recursive algorithm; modified two-dimensional Otsu image segmentation algorithm; 2D histogram

Subjects: Computational complexity; Optical, image and video signal processing; Computer vision and image processing techniques

References

    1. 1)
    2. 2)
    3. 3)
      • Zhang, J., Hu, J.L.: `Image segmentation based on 2D Otsu method with histogram analysis', IEEE Int. Conf. on Computer Science and Software Engineering. Wuhan, 2008, China, p. 105–108.
    4. 4)
    5. 5)
    6. 6)
      • Y.Q. Wu , Z. Pan , W.Y. Wu . Image thresholding based on two-dimensional histogram oblique segmentation and its fast recurring algorithm. J. Commun. (in Chinese) , 4 , 77 - 84
    7. 7)
      • Y.M. Hao , F. Zhu . Fast algorithm for two-dimensional Otsu adaptive threshold algorithm. J. Image Graph. (in Chinese) , 4 , 484 - 488
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • Z. Hui-qin . A new algorithm for water area extracting from the remote sensing image based on morphologic method. Sci. Surv. Mapp. (in Chinese) , 1 , 22 - 25
    12. 12)
    13. 13)
      • T. Pun . Entropic thresholding: a new approach, CVGIP: graphical models. Image Process. , 210 - 239
    14. 14)
      • J.L. Fan , F. Zhao . Two-dimensional Otsu's curve thresholding segmentation method for gray-level images. Acta Electron. Sin. (in Chinese) , 4 , 751 - 755
    15. 15)
      • Sun, F.J., Wang, H., Fan, J.Q.: `2D Otsu segmentation algorithm based on simulated annealing genetic algorithm for iced-cable images', IEEE Int. Forum on Information Technology and Applications, 2009, p. 600–602.
    16. 16)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ipr.2010.0078
Loading

Related content

content/journals/10.1049/iet-ipr.2010.0078
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading