• 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.

• Journal of Power System Engineering
• /
• v.20 no.4
• /
• pp.32-37
• /
• 2016

This paper proposes two measurement methods for injured rate of fish surface using color image segmentation method based on K-means clustering algorithm and Otsu's threshold algorithm. To do this task, the following steps are done. Firstly, an RGB color image of the fish is obtained by the CCD color camera and then converted from RGB to HSI. Secondly, the S channel is extracted from HSI color space. Thirdly, by applying the K-means clustering algorithm to the HSI color space and applying the Otsu's threshold algorithm to the S channel of HSI color space, the binary images are obtained. Fourthly, morphological processes such as dilation and erosion, etc. are applied to the binary image. Fifthly, to count the number of pixels, the connected-component labeling is adopted and the defined injured rate is gotten by calculating the pixels on the labeled images. Finally, to compare the performances of the proposed two measurement methods based on the K-means clustering algorithm and the Otsu's threshold algorithm, the edge detection of the final binary image after morphological processing is done and matched with the gray image of the original RGB image obtained by CCD camera. The results show that the detected edge of injured part by the K-means clustering algorithm is more close to real injured edge than that by the Otsu' threshold algorithm.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• 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.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1062-1075
• /
• 2010

In the medical image application the difference of intensity is widely used for the image segmentation and feature extraction, and a well known method is the threshold technique that determines a threshold value and generates a binary image based on the threshold. A frequently-used threshold technique is the Otsu algorithm that provides efficient processing and effective selection criterion for choosing the threshold value. However, we cannot get good segmentation results by applying the Otsu algorithm to chest X-ray images. It is because there are various organic structures around lung regions such as ribs and blood vessels, causing unclear distribution of intensity levels. To overcome the ambiguity, we propose in this paper an effective algorithm to extract pulmonary regions that utilizes the Otsu algorithm after removing the background of an X-ray image, constructs intensity-level maps, and uses them for segmenting the X-ray image. To verify the effectiveness of our method, we compared it with the existing 1-dimensional and 2-dimensional Otsu algorithms, and also the results by expert's naked eyes. The experimental result showed that our method achieved the more accurate extraction of pulmonary regions compared to the Otsu methods and showed the similar result as the naked eye's one.

• International Journal of Automotive Technology
• /
• v.7 no.2
• /
• pp.227-235
• /
• 2006

In this paper a robust image processing method with modified Otsu algorithm to recognize the road lane for a real-time controlled autonomous vehicle is presented. The main objective of a proposed method is to drive an autonomous vehicle safely irrespective of road image qualities. For the steering of real-time controlled autonomous vehicle, a detection area is predefined by lane segment, with previously obtained frame data, and the edges are detected on the basis of a lane width. For stable as well as psudo-robust autonomous driving with "good", "shady" or even "bad" road profiles, the variable threshold with modified Otsu algorithm in the image histogram, is utilized to obtain a binary image from each frame. Also Hough transform is utilized to extract the lane segment. Whether the image is "good", "shady" or "bad", always robust and reliable edges are obtained from the algorithms applied in this paper in a real-time basis. For verifying the adaptability of the proposed algorithm, a miniature vehicle with a camera is constructed and tested with various road conditions. Also, various highway road images are analyzed with proposed algorithm to prove its usefulness.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.3
• /
• pp.224-230
• /
• 2002

In this paper, a counting algorithm hybridized with an adaptive automatic thresholding method based on Otsu's method and the algorithm that elongates markers obtained by the well-known watershed algorithm is proposed to enhance the exactness of the microcell counting in microscopic images. The proposed counting algorithm can be stated as follows. The transformed full image captured by CCD camera set up at microscope is divided into cropped images of m$\times$n blocks with an appropriate size. The thresholding value of the cropped image is obtained by Otsu's method and the image is transformed into binary image. The microbial cell images below prespecified pixels are regarded as noise and are removed in tile binary image. The smoothing procedure is done by the area opening and the morphological filter. Watershed algorithm and the elongating marker algorithm are applied. By repeating the above stated procedure for m$\times$n blocks, the m$\times$n segmented images are obtained. A superposed image with the size of 640$\times$480 pixels as same as original image is obtained from the m$\times$n segmented block images. By labeling the superposed image, the counting result on the image of microbial cells is achieved. To prove the effectiveness of the proposed mettled in counting the microbial cell on the image, we used Acinetobacter sp., a kind of ammonia-oxidizing bacteria, and compared the proposed method with the global Otsu's method the traditional watershed algorithm based on global thresholding value and human visual method. The result counted by the proposed method shows more approximated result to the human visual counting method than the result counted by any other method.

• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.670-675
• /
• 2001

This paper is to propose image segmentation method based on chamfer algorithm. First, we get original image from CCD camera and transform it into gray image. Second, we extract maximum gray value of background and reconstruct and eliminate the background using surface fitting method and bilinear interpolation. Third, we subtract the reconstructed background from gray image to remove noises in gray image. Fourth, we transform the subtracted image into binary image using Otsu's optimal thresholding method. Fifth, we use morphological filters such as areaopen, opening, filling filter etc. to remove noises and isolated points. Sixth, we use chamfer distance or Euclidean distance to this filtered image. Finally, we use watershed algorithm and count microorganisms in image by labeling. To prove the effectiveness, we apply the proposed algorithm to one of Ammonia-oxidizing bacteria, Acinetobacter sp. It is shown that both Euclidean algorithm and chamfer algorithm show over-segmentation. But Chamfer algorithm shows less over-segmentation than Euclidean algorithm.

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

In this paper, we focus on the issue of automatic selection for multi-level threshold, and we greatly improve the efficiency of Otsu's method for image segmentation based on genetic algorithm. We have investigated and evaluated the performance of the Otsu and Valley-emphasis threshold methods. Based on this observation we propose a method for automatic threshold method that segments an image into more than two regions with high performance and processing in real-time. Our paper introduced new peak detection, combines with evolution algorithm using MAGA (Modified Adaptive Genetic Algorithm) and HCA (Hill Climbing Algorithm), to find the best threshold automatically, accurately, and quickly. The experimental results show that the proposed evolutionary algorithm achieves a satisfactory segmentation effect and that the processing time can be greatly reduced when the number of thresholds increases.