• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.67-72
• /
• 2005

Most of image binarization algorithms analyzes the intensity distribution using the histogram for the determination of threshold value. When the intensity difference between the foreground object and the background is great, the histogram shows the tendency to be bimodal and the selection of the histogram valley as the threshold value shows the good result. On the other side. when the intensity difference is not great and the histogram doesn't show the bimodal property, the histogram analysis doesn't support the selection of the proper threshold value. This Paper Proposed the novel binarization method that applies the fuzzy membership function to each color value on the RGB color model and, by using the operation results, separates the features having the great readability from the background. The proposed method prevents the loss of information incurred by the gray scale conversion by using the RGB color model and extracts effectively the readable features by using the fuzzy inference Compared with the traditional binarization methods, the proposed method is able to remove the majority of noise areas and show the improved results on the image of transport containers , etc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1113-1119
• /
• 2006

For a multi-user OFDM system in mobile channels which requires low-complexity in adaptive resource allocations, resource allocation algorithm using multi-threshold is proposed. The allocation scheme, which is performed by the multi-threshold values in descending order, considers only subcarriers over each threshold level. Moreover, some subcarriers with the lowest channel gain can be· removed in the present threshold level within the constraint of satisfaction of the required data rate, in order to allocate them to the other users when the allocation process of next threshold is executed. As a result, the proposed bandwidth and subcarrier algorithm has better system performances than the conventional allocation schemes in terms of required power and processing time, which is expected as a technique that improves the spectral efficiency of OFDM systems in a mobile environment.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1117-1124
• /
• 2007

In this paper, an algorithm that can define the threshold value automatically proposed in order to detect a brain ventricle in MRI brain images. After the wavelet transform, edge sharpness, which means the average magnitude of detail signals on the contour of the object, was computed by using the magnitude of horizontal and vertical detail signals. The contours of a brain ventricle were detected by increasing the threshold value repeatedly and computing edge sharpness. When the edge sharpness became maximal, the optimal threshold was determined, and the detection of a brain ventricle was accomplished finally. In this paper, we compared the proposed algorithm with the geodesic active contour model numerically and verified the efficiency of the proposed algorithm by applying real MRI brain images.

• Korean Journal of Remote Sensing
• /
• v.20 no.4
• /
• pp.235-244
• /
• 2004

This study focuses on the assessment for proposed algorithm to discriminate cloudy pixels from snowy pixels through use of visible, near infrared, and short wave infrared channel data in VEGETATION-1 sensor embarked on SPOT-4 satellite. Traditional threshold algorithms for cloud and snow masks did not show very good accuracy. Instead of these independent masking procedures, K-Means clustering scheme is employed for cloud/snow discrimination in this study. The pixels used in clustering were selected through an integration of two threshold algorithms, which group ensemble the snow and cloud pixels. This may give a opportunity to simplify the clustering procedure and to improve the accuracy as compared with full image clustering. This paper also compared the results with threshold methods of snow cover and clouds, and assesses discrimination capability in VEGETATION channels. The quality of the cloud and snow mask even more improved when present algorithm is implemented. The discrimination errors were considerably reduced by 19.4% and 9.7% for cloud mask and snow mask as compared with traditional methods, respectively.

• Korean Journal of Remote Sensing
• /
• v.19 no.6
• /
• pp.465-478
• /
• 2003

This paper presents two methods for automatic estimation of threshold values in unsupervised change detection of multi-temporal remote sensing images. The proposed methods consist of two analytical steps. The first step is to compute the parameters of a 3-component Gaussian mixture model from difference or ratio images. The second step is to determine a threshold value using Bayesian rule for minimum error. The first method which is an extended version of Bruzzone and Prieto' method (2000) is to apply an Expectation-Maximization algorithm for estimation of the parameters of the Gaussian mixture model. The second method is based on an iterative thresholding algorithm that successively employs thresholding and estimation of the model parameters. The effectiveness and applicability of the methods proposed here were illustrated by two experiments and one case study including the synthetic data sets and KOMPSAT-1 EOC images. The experiments demonstrate that the proposed methods can effectively estimate the model parameters and the threshold value determined shows the minimum overall error.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.4
• /
• pp.705-712
• /
• 2009

Histogram is the oldest and most widely used density estimator for presentation and exploration of observed univariate data. The structure of a histogram really depends on the number of bins and the width of the bins, so that slight changes on bins can produce totally different shape of a histogram. In order to solve this problem the fuzzy histogram was introduced and the result was good enough (Loquin and Strauss, 2008). In particular, when estimating loss distribution related with operational risk a histogram has been widely used. In this article, instead of an ordinary histogram we try to use a fuzzy histogram for estimating loss distribution and show that a fuzzy histogram provide more stable results.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.7-12
• /
• 2003

This paper propose the 1-pass spatially adaptive wavelet thresholding for image denosing. The method of wavelet thresholding for denosing, has been concentrated on finding the best uniform threshold or best basis. However, not much has been done to make this method adaptive to spatially changing statistics which is typical of a large class of images. This spatially adaptive thresholding is extended to the overcomplete wavelet expansion, which yields better results than the orthogonal transform. Experiments show that this proposed method does indeed remove noise significantly, especially for large noise power. Experimental results show that the proposed method outperforms level dependent thresholding techniques and is comparable to spatial Wiener filtering method, 2-pass spatially adaptive wavelet thresholding method in matlab.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05a
• /
• pp.251-256
• /
• 1996

일반화된 다군의 material 단면적 라이브러리 형식인 MATXS와 이를 각종 수송계산 코드에 적용할 수 있도록 하는 TRANSX 코드 체제를 소개하고 그 유용성을 검토하였다. 이를 위해 ENDF/B-VI.2를 이용하여 열 및 고속 임계노심 해석을 위한 각각의 라이브러리를 생산하고, 수송계산 코드인 ONEDANT를 이용하여 검증계산을 수행하였다. 열중성자 임계노심 해석결과 유효증배계수에서 약 0.3% 내외로 실험치에 근사한 결과를 얻었으며, 고속임계노심에서도 임계도 및 중심반응율비 결과가 실험치에 접근하고 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.313-315
• /
• 2005

본 논문은 이동 애드혹 네트워크에서 이동 에이전트를 이용하여 동적으로 클러스터링을 구성하는 기법에 관한 것이다. 기존에 제안된 이동 애드혹 네트워크에서의 클러스터링 기법은 클러스터의 크기가 고정되어 있기 때문에 네트워크의 상태나 노드들의 이동성에 따라 클러스터 재구성의 오버헤드가 발생하였다. 본 제안 기법에서는 네트워크의 상태에 따라 클러스터 크기의 최대 임계치와 최소 임계치를 설정하고 이에 따라 이동 에이전트를 이용하여 클러스터를 병합 흑은 분할하면서 클러스터의 크기를 임계치 내에서 일정하게 유지시킴으로써, 클러스터 재구성의 오버헤드라 클러스터 내부의 경로 탐색의 오버헤드를 줄일 수 있다.

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