• Journal of Multimedia Information System
• /
• v.9 no.2
• /
• pp.87-92
• /
• 2022

In this study, we aimed to illustrate that the thresholding method gives different results when tested on the original and the refined histograms. We use the global thresholding method, the well-known image segmentation method for separating objects and background from the image, and the refined histogram is created by the neighborhood distinction metric. If the original histogram of an image has some large bins which occupy the most density of whole intensity distribution, it is a problem for global methods such as segmentation and contrast enhancement. We refined the histogram to overcome the big bin problem in which sub-bins are created from big bins based on distinction metric. We suggest the refined histogram for preprocessing of thresholding in order to reduce the big bin problem. In the test, we use Otsu and median-based thresholding techniques and experimental results prove that their results on the refined histograms are more effective compared with the original ones.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.77-80
• /
• 2000

In this paper, we present a new automatic thresholding algorithm based on maximum entropy of two-dimensional pixel histogram. While most of the previous algorithms select thresholds depending only on the histogram of gray level itself in the image, the presented algorithm considers 2D relational histogram of gray levels of two adjacent pixels in the image. Thus, the new algorithm tends to leave salient edge features on the image after thresholding. The experimental results show the good performance of the presented algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2113-2128
• /
• 2019

Image thresholding techniques introducing spatial information are widely used image segmentation. Some methods are used to calculate the optimal threshold by building a specific histogram with different parameters, such as gray value of pixel, average gray value and gradient-magnitude, etc. However, these methods still have some limitations. In this paper, an entropic thresholding method based on Gabor histogram (a new 2D histogram constructed by using Gabor filter) is applied to image segmentation, which can distinguish foreground/background, edge and noise of image effectively. Comparing with some methods, including 2D-KSW, GLSC-KSW, 2D-D-KSW and GLGM-KSW, the proposed method, tested on 10 realistic images for segmentation, presents a higher effectiveness and robustness.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.189-194
• /
• 2017

In this study, we propose a method which is based on "Image segmentation by histogram thresholding using hierarchical cluster analysis"/HCA/ and "A nonparametric approach for histogram segmentation"/NHS/. HCA method uses that all histogram bins are one cluster then it reduces cluster numbers by using distance metric. Because this method has too many clusters, it is more computation. In order to eliminate disadvantages of "HCA" method, we used "NHS" method. NHS method finds all local minima of histogram. To reduce cluster number, we use NHS method which is fast. In our approach, we combine those two methods to eliminate disadvantages of Arifin method. The proposed method is not only less computational than "HCA" method because combined method has few clusters but also it uses local minima of histogram which is computed by "NHS".

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.543-548
• /
• 2011

Entropy measuring the richness in details of the image is generally obtained by using the histogram of gray levels in an image, and has been widely used as an index for thresholding of the image. In this paper, we propose an entropy-based thresholding method, where the entropy is obtained not by the histogram but by the variance of the gray levels, to binalize a given image. The effectiveness of the proposed method is demonstrated by thresholding experiments on nine test images and comparison with conventional two thresholding methods, that is, Otsu method and entropy-based method using the histogram.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.488-491
• /
• 1987

In this paper. a heuristic multi-thresholding algorithm is proposed to extract objects from background. Specifically the proposed algorithm finds out multi valleys from gray level histogram automatically and non-recursively. Some experimental result for various types of image. are presented, to show the effectiveness of the proposed algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.466-471
• /
• 2007

Conventional thresholding methods including Otsu's thresholding method are based on the gray levels frequency histogram. But the gray levels frequency histogram is obtained by recomposing only frequency information from an input image, where frequency histogram dose not contain any other informations such as the distribution of gray levels and relation between gray levels. Therefore the methods using the gray levels frequency histogram occasionally present inappropriate threshold values because it cannot reflect informations of the given image sufficiently. In this paper, we define a correlation function of gray levels and propose a novel thresholding method using the gray levels frequency histogram and the spatial correlation information. The effectiveness of the proposed method will be shown through comparison with Otsu's thresholding method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.156-160
• /
• 2014

Thresholding in frequency domain is a simple and effective noise reduction technique. Determination of the threshold is critical to the image quality. The optimal threshold minimizing the Mean Square Error (MSE) is chosen adaptively in the wavelet domain; we utilize an equation of the MSE for the soft-thresholded signal and the histogram of wavelet coefficients of the original image and noisy image. The histogram of the original signal is estimated through the deconvolution assuming that the probability density functions (pdfs) of the original signal and the noise are statistically independent. The proposed method is quite general in that it does not assume any prior for the source pdf.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.649-654
• /
• 2003

Most of the conventional image thresholding methods are based on the histogram function of the gray values. In this paper, we present a simple but effective example showing that the histogram-based thresholding methods do not perform well. To overcome the difficulty, the authors propose a new gray level threshold selection method based on the distribution of gray levels in images. Finally, we provide simulation results showing the effectiveness of the proposed threshold selection method through several examples.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.352-355
• /
• 2000

In this paper, we propose an adaptive thresholding for edge detection. first, we got histograms for background image and image with moving object, respectively. Then we make difference histogram between histograms of background and object image. A thresholding value is decided using gradient of peak to peak in the difference histogram. The experimentation is processed using a moving car in the road. The result is that edge is detected well regardless of the brightness.