• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.362-371
• /
• 2003

In this paper, we propose an optimal interest point extraction method to support shape-base image classification and indexing for image database by applying a dynamic threshold that reflects the characteristics of the shape contour. The threshold is determined dynamically by comparing the contour length ratio of the original shape and the approximated polygon while the algorithm is running. Because our algorithm considers the characteristics of the shape contour, it can minimize the number of interest points. For n points of the contour, the proposed algorithm has O(nlogn) computational cost on an average to extract the number of m optimal interest points. Experiments were performed on the 70 synthetic shapes of 7 different contour types and 1100 fish shapes. It shows the average optimization ratio up to 0.92 and has 14% improvement, compared to the fixed threshold method. The shape features extracted from our proposed method can be used for shape-based image classification, indexing, and similarity search via normalization.

• Journal of the Institute of Convergence Signal Processing
• /
• v.21 no.2
• /
• pp.55-60
• /
• 2020

In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.

• The Journal of the Korea Contents Association
• /
• v.12 no.1
• /
• pp.1-8
• /
• 2012

In this paper, a method of determining the optimal threshold in image binarization for the marker recognition is suggested to resolve the problem that the performances of marker recognition are quite different according to the changes of indoor lighting. The suggested method determines the optimal threshold by considering the average brightness, the standard deviation and the maximum deviation of video image under the various indoor lighting circumstances, such as bright light, dim light, and shadow by unspecified obstacles. In particular, the recognition under the gradation lighting by shadow is improved by applying the weighted value that depends on the brightness of image. The suggested method is experimented to process $720{\times}480$ resolution video images under the various lighting environments, and it shows the fast and high performance, which is suitable for mobile indoor navigation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.253-263
• /
• 2015

Lately, spectrum sensing performance has been improved by using cooperate spectrum sensing which each results of sensing of several secondary users are reported to the fusion center. Using Cognitive Radio, secondary user is able to share a bandwidth allocated to primary user. In this paper, we propose a new decentralized cooperative spectrum sensing scheme which compensates the performance degradation of existing decentralized cooperative spectrum sensing considering the error probability of the channel which sensed result of the secondary user is delivered to the fusion center in decentralized cooperative spectrum sensing. In addition, a sensing threshold optimization of minimizing the error probability of decentralized cooperative spectrum sensing is introduced by deriving the equation and the optimal sensing threshold has been confirmed to maximize the decentralized cooperative spectrum sensing performance.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.66-75
• /
• 2010

The authors argues that the current road updating system based on traditional aerial photograph or multi-spectral satellite image appears to be non-user friendly due to lack of the frequent cartographic representation for the new construction sites. Google Earth are currently being emerged as one of important places to extract road features since the RGB satellite image with high multi-temporal resolution can be accessed freely over large areas. This paper is primarily intended to evaluate optimal threshold of RGB pixel values to extract road features from Google Earth. An empirical study for five experimental sites was conducted to confirm how a RGB picture provided Google Earth can be used to extact the road feature. The results indicate that optimal threshold of RGB pixel values to extract road features was identified as 126, 125, 127 for manual operation which corresponds to 25%, 30%, 19%. Also, it was found that display scale difference of Google Earth was not very influential in tracking required RGB pixel value. As a result the 61cm resolution of Quickbird RGB data has shown the potential to realistically identified the major type of road feature by large scale spatial precision while the typical algorithm revealed successfully the area-wide optimal threshold of RGB pixel for road appeared in the study area.

• Korean Journal of Food Science and Technology
• /
• v.36 no.5
• /
• pp.693-700
• /
• 2004

Viscometry was applied to identify irradiated corn starch (CS), sweet potato starch (SS), and potato starch (PS) from non-irradiated controls using Brookfield DV-III programmable rheometer. Effects of starch suspension concentration (7.0-9.5%) and spindle speed (25-125 rpm) were investigated. Established optimal viscosity-measuring conditions showed the highest correlation coefficient between irradiation dose (0-6.0 kGy) and corresponding viscosities for CS, SS, and PS. Threshold values for identifying irradiated starches were suggested. Viscosities of all samples significantly decreased with increasing irradiation dose (p<0.05) and spindle speed, while increased as suspension concentration increased. Optimal conditions for suspension concentration and spindle speed were 7.5% (6.7%, d.b.) and 125rpm in CS, 8.5% (7.3%, d.b.) and 125 rpm in SS, and 9.0% (7.3%, d.b.) and 100rpm in PS, respectively. Under these measuring conditions, threshold values for discriminating unknown samples were 0.313, 0.345, and 0.811 for CS, SS, and PS in 1.5 kGy-irradiated samples, compared with 0.521, 0.798, and 1.693 in non-irradiated samples, respectively, enabling identification of irradiated from non-irradiated starches.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.2
• /
• pp.75-82
• /
• 2002

It is useful to detect the tracking error with an optimal view in the presence of measurement origin uncertainty. In this paper, after the investigation of the targer error dependent on the detection threshold as well as the detection and false alarm probabilities in a clutter environment, a new algorothm that optimizes the threshold of validation region for target trackinf is proposed. The performance of the algorithm is demonstrated through computer simulations.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.263-271
• /
• 2004

In this paper, we proposed a new buffer management algorithm using perVC-Queuing discipline. Proposed algorithm uses service rate estimation and assigns dynamic perVC threshold to each VCs. Service rate estimation and dynamic perVC threshold combined with global threshold provide nearly optimal throughput and improve fairness performance of network resource among GFR VCs as well as guarantee MCR of all VCs. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.725-730
• /
• 2007

Gray-level histogram-based threshold selection methods such as Otsu's method, Huang and Wang's method, and etc. have been widely used for the threshold selection in image processing. They are simple and effective, but take too much time to determine the optimal multilevel threshold values as the number of thresholds are increased. In this paper, we measure correlation between gray-levels by using the Gaussian function and define a Gaussian-type finite mixture distribution which is combination of the Gaussian distribution function with the gray-level histogram, and propose a fast and effective threshold selection method using it. We show the effectiveness of the proposed through experimental results applied it to three images and the efficiency though comparison of the computational complexity of the proposed with that of Otsu's method.