scispace - formally typeset
Search or ask a question
Topic

Otsu's method

About: Otsu's method is a research topic. Over the lifetime, 1439 publications have been published within this topic receiving 20654 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: 40 selected thresholding methods from various categories are compared in the context of nondestructive testing applications as well as for document images, and the thresholding algorithms that perform uniformly better over nonde- structive testing and document image applications are identified.
Abstract: We conduct an exhaustive survey of image thresholding methods, categorize them, express their formulas under a uniform notation, and finally carry their performance comparison. The thresholding methods are categorized according to the information they are exploiting, such as histogram shape, measurement space clustering, entropy, object attributes, spatial correlation, and local gray-level surface. 40 selected thresholding methods from various categories are compared in the context of nondestructive testing applications as well as for document images. The comparison is based on the combined performance measures. We identify the thresholding algorithms that perform uniformly better over nonde- structive testing and document image applications. © 2004 SPIE and IS&T. (DOI: 10.1117/1.1631316)

4,543 citations

Journal ArticleDOI
TL;DR: A faster version of Otsu's method for improving the efficiency of computation for the optimal thresholds of an image by determining the modified between-class variance by accessing a look-up table is quicker than that by performing mathematical arithmetic operations.
Abstract: Otsu reference proposed a criterion for maximizing the between-class variance of pixel intensity to perform picture thresholding. However, Otsu's method for image segmentation is very time-consuming because of the inefficient formulation of the be- tween-class variance. In this paper, a faster version of Otsu's method is proposed for improving the efficiency of computation for the optimal thresholds of an image. First, a criterion for maximizing a modified between-class variance that is equivalent to the criterion of maximizing the usual between-class variance is proposed for image segmen- tation. Next, in accordance with the new criterion, a recursive algorithm is designed to efficiently find the optimal threshold. This procedure yields the same set of thresholds as the original method. In addition, the modified between-class variance can be pre-computed and stored in a look-up table. Our analysis of the new criterion clearly shows that it takes less computation to compute both the cumulative probability (zeroth order moment) and the mean (first order moment) of a class, and that determining the modified between-class variance by accessing a look-up table is quicker than that by performing mathematical arithmetic operations. For example, the experimental results of a five-level threshold selection show that our proposed method can reduce down the processing time from more than one hour by the conventional Otsu's method to less than 107 seconds.

933 citations

Journal ArticleDOI
TL;DR: The Otsu method for selecting optimal threshold values for both unimodal and bimodal distributions is revised and the performance of the revised method, the valley-emphasis method, on common defect detection applications is tested.
Abstract: Automatic thresholding has been widely used in the machine vision industry for automated visual inspection of defects. A commonly used thresholding technique, the Otsu method, provides satisfactory results for thresholding an image with a histogram of bimodal distribution. This method, however, fails if the histogram is unimodal or close to unimodal. For defect detection applications, defects can range from no defect to small or large defects, which means that the gray-level distributions range from unimodal to bimodal. For this paper, we revised the Otsu method for selecting optimal threshold values for both unimodal and bimodal distributions, and tested the performance of the revised method, the valley-emphasis method, on common defect detection applications.

494 citations

Journal ArticleDOI
TL;DR: This paper proves that Otsu threshold is equal to the average of the mean levels of two classes partitioned by this threshold, and proposes an improved Otsi algorithm that constrains the search range of gray levels.
Abstract: This paper proves that Otsu threshold is equal to the average of the mean levels of two classes partitioned by this threshold. Therefore, when the within-class variances of two classes are different, the threshold biases toward the class with larger variance. As a result, partial pixels belonging to this class will be misclassified into the other class with smaller variance. To address this problem and based on the analysis of Otsu threshold, this paper proposes an improved Otsu algorithm that constrains the search range of gray levels. Experimental results demonstrate the superiority of new algorithm compared with Otsu method.

381 citations

01 Jan 2013
TL;DR: This paper studies various Otsu algorithms, an automatic threshold selection region based segmentation method, which is one of the most successful methods for image thresholding because of its simple calculation.
Abstract: Image segmentation is the fundamental approach of digital image processing. Among all the segmentation methods, Otsu method is one of the most successful methods for image thresholding because of its simple calculation. Otsu is an automatic threshold selection region based segmentation method. This paper studies various Otsu algorithms.

344 citations


Network Information
Related Topics (5)
Feature extraction
111.8K papers, 2.1M citations
77% related
Image segmentation
79.6K papers, 1.8M citations
77% related
Image processing
229.9K papers, 3.5M citations
76% related
Wireless sensor network
142K papers, 2.4M citations
75% related
Fuzzy logic
151.2K papers, 2.3M citations
75% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202337
202283
202151
202058
201987
201893