An equivalent 3D Otsu's thresholding method

19Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Due to unsatisfactory segmentation results when images contain noise by the Otsu's thresholding method. Two-dimensional (2D) and three-dimensional (3D) Otsu's methods thus were proposed. These methods utilize not only grey levels of pixels but also their spatial informations such as mean and median values. The 3D Otsu's methods use both kinds of spatial information while 2D Otsu's methods use only one. Consequently the 3D Otsu's methods more resist to noise, but also require more computational time than the 2D ones. We thus propose a method to reduce computational time and still provide satisfactory results. Unlike the 3D Otsu's methods, our method selects each threshold component in the threshold vector independently instead of one threshold vector. The experimental results show that our method is more robust against noise, and its computational time is very close to that of the 2D Otsu's methods. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Sthitpattanapongsa, P., & Srinark, T. (2011). An equivalent 3D Otsu’s thresholding method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7087 LNCS, pp. 358–369). https://doi.org/10.1007/978-3-642-25367-6_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free