• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.29-37
• /
• 2006

Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding employed the normalized histogram as a discrete probability density function. Also it utilized a criterion that minimizes the between-class variance of pixel intensity to choose a threshold value for segmentation. However, the Otsu's method has a disadvantage of repeatedly searching optimal thresholds for the entire range. In this paper, a simple but fast multi-level thresholding approach is proposed by means of extending the Otsu's method. Rather than invoke the Otsu's method for the entire gray range, we advocate that the gray-level range of an image be first divided into smaller sub-ranges, and that the multi-level thresholds be achieved by iteratively invoking this dividing process. Initially, in the proposed method, the gray range of the object image is divided into 2 classes with a threshold value. Here, the threshold value for segmentation is selected by invoking the Otsu's method for the entire range. Following this, the two classes are divided into 4 classes again by applying the Otsu's method to each of the divided sub-ranges. This process is repeatedly performed until the required number of thresholds is obtained. Our experimental results for three benchmark images and fifty faces show a possibility that the proposed method could be used efficiently for pattern matching and face recognition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11C
• /
• pp.1140-1151
• /
• 2003

This paper proposes a face recognition method based on modified Otsu's binarization and Hu moment. Proposed method is robust to brightness, contrast, scale, rotation, and translation changes. As the proposed modified Otsu's binarization computes other thresholds from conventional Otsu's binarization, namely we create two binary images, we can extract higher dimensional feature vector. Here the feature vector has properties of robustness to brightness and contrast changes because the proposed method is based on Otsu's binarization. And our face recognition system is robust to scale, rotation, and translation changes because of using Hu moment. In the perspective of brightness, contrast, scale, rotation, and translation changes, experimental results with Olivetti Research Laboratory (ORL) database and the AR database showed that average recognition rates of conventional well-known principal component analysis (PCA) are 93.2% and 81.4%, respectively. Meanwhile, the proposed method for the same databases has superior performance of the average recognition rates of 93.2% and 81.4%, respectively.

• Journal of Korea Multimedia Society
• /
• v.15 no.11
• /
• pp.1305-1318
• /
• 2012

Image segmentation is one of the difficult research problems in machine vision and pattern recognition field. A commonly used segmentation method is the Otsu method. It is simpler and easier to implement but it fails if the histogram is unimodal or similar to unimodal. And if some target area is smaller than background object, then its histogram has the distribution close to unimodal. In this paper, we proposed an improved image segmentation method based on 1D Otsu method for a small target detection. To overcome drawbacks by unimodal histogram effect, we depressed the background histogram using a logarithm function. And to improve a signal to noise ratio, we used a local average value by the neighbor window for thresholding using 1D Otsu method. The experimental results show that our proposed algorithm performs better segmentation result than a traditional 1D Otsu method, and needs much less computational time than that of the 2D Otsu method.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.40-42
• /
• 2009

This paper presents an algorithm, which is based on Otsu's method, for accurate and robust endpoint detection for speech recognition under noisy environments. The features are extracted in time domain, and then an optimal threshold is selected by minimizing the discriminant criterion, so as to maximize the separability of the speech part and environment part. The simulation results show that the method play a good performance in detection accuracy.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.287-287
• /
• 2000

As a method to control the bacteria number in adequate level, a real time control system based on microscope image processing measurement for the bacteria is adopted. For the experiment, Ammonia-oxidizing bacteria such as Acinetobacter sp. are used. This paper proposed hybrid method combined watershed algorithm with adaptive automatic thresholding method to enhance segmentation efficiency of overlapped image. Experiments was done to show the effectiveness of the proposed method compared to traditional Otsu's method, Otsu's method with adaptive automatic thresholding method and human visual method.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.163-169
• /
• 2017

There are various algorithms evaluating a threshold for image segmentation. Among them, Otsu's algorithm sets a threshold based on the histogram. It finds the between-class variance for all over gray levels and then sets the largest one as Otsu's optimal threshold, so we can see that Otsu's algorithm requires a lot of the computation. In this paper, we improved the amount of computational needs by using estimated Otsu's threshold rather than computing for all the threshold candidates. The proposed algorithm is compared with the original one in computation amount and accuracy. we confirm that the proposed algorithm is about 29 times faster than conventional method on single processor and about 4 times faster than on parallel processing architecture machine.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.259-262
• /
• 2012

In this paper, we propose a new fast algorithm for effective scene change detection. The proposed algorithm exploits Otsu threshold matching technique, which was proposed earlier. In this method, the current and the reference frames are divided into square blocks of particular size. After doing so, the pixel histogram of each block is generated. According to Otsu method, every histogram distribution is assumed to be bimodal, i.e. pixel distribution can be divided into two groups, based on within-group variance value. The pixel value that minimizes the within-group variance is said to be Otsu threshold. After Otsu threshold is found, the same procedure is performed at the reference frame. If the difference between Otsu threshold of a block in the current frame and co-located block in the reference frame is larger than predefined threshold, then a scene change between those two blocks is detected.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.368-374
• /
• 2010

Image segmentation is the basic step in the field of the image processing for pattern recognition, environment recognition, and context analysis. The Otsu's automatic threshold selection, which determines the optimal threshold value to maximize the between class scatter using the distribution information of the normalized histogram of a image, is the famous method among the various image segmentation methods. For the automatic threshold selection proposed by Otsu, it is difficult to determine the optimal threshold value by considering the sub-region characteristic of the image because the Otsu's algorithm analyzes the global histogram of a image. In this paper, to alleviate this difficulty of Otsu's image segmentation algorithm and to improve image segmentation capability, the original image is divided into several sub-images by using context fuzzy c-means algorithm. The proposed fuzzy Otsu threshold algorithm is applied to the divided sub-images and the several threshold values are obtained.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.6
• /
• pp.579-586
• /
• 2011

It is very critical for image processing of IIR (Imaging Infrared) seekers to achieve improved guidance performance for missile systems to determine appropriate thresholds in various environments. In this paper, we propose automatic threshold determination methods for proper thresholds to extract definite target signals in an EOCM (Electro-Optical Countermeasures) environment with low SNR (Signal-to-Noise Ratios). In particular, thresholds are found to be too low to extract target signals if one uses the Otsu method so that we suggest a Shifted Otsu method to solve this problem. Also we improve extracting target signal by changing Shifted Otsu thresholds according to the TBR (Target to Background Ratio). The suggested method is tested for real IIR images and the results are compared with the Otsu method. The HPDAF (Highest Probabilistic Data Association Filter) which selects the target originated measurements by taking into account of both signal intensity and statistical distance information is applied in this study.

• The Journal of the Korea Contents Association
• /
• v.11 no.6
• /
• pp.18-25
• /
• 2011

Salient object attracts more and more attention from researchers due to its important role in many fields of multimedia processing like tracking, segmentation, adaptive compression, and content-base image retrieval. Usually, a saliency map is binarized into black and white map, which is considered as the binary mask of the salient object in the image. Still, the threshold is heuristically chosen or parametrically controlled. This paper suggests using the global optimal threshold to perform saliency map thresholding. This work also considers the usage of multi-level optimal thresholds and the local adaptive thresholds in the experiments. These experimental results show that using global optimal threshold method is better than parametric controlled or local adaptive threshold method.