• Journal of Satellite, Information and Communications
• /
• v.8 no.4
• /
• pp.100-104
• /
• 2013

In this paper, we present an optimal threshold setting method for flame detection of infrared thermal image. Conventional infrared flame detection methods used fixed intensity threshold to segment candidate flame regions and further processing is performed to decide correct flame detection. So flame region segmentation step using the threshold is important processing for fire detection algorithm. The threshold should be change in input image depends on camera types and operation conditions. We have analyzed the conventional thresholds composed of fixed-intensity, average, standard deviation, maximum value. Finally, we extracted that the optimal threshold value is more than summation of average and standard deviation, and less than maximum value. it will be enhance flame detection rate than conventional fixed-threshold method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1420-1428
• /
• 2017

It is difficult to guarantee the reliability of the algorithm due to the difference of the sampling frequency among the various ECG databases used for the R wave detection in case of applying to different environments. In this study, we propose an optimal threshold setting method for R wave detection according to the sampling frequency of ECG signals. For this purpose, preprocessing process was performed using moving average and the squaring function based the derivative. The optimal value for the peak threshold was then detected according to the sampling frequency by changing the threshold value according to the variation of the signal and the previously detected peak value. The performance of R wave detection is evaluated by using 48 record of MIT-BIH arrhythmia database. When the optimal values of the differential section, window size, and threshold coefficient for the MIT-BIH sampling frequency of 360 Hz were 7, 8, and 6.6, respectively, the R wave detection rate was 99.758%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.216-224
• /
• 2013

The within-class variance of Otsu's method is moderate but improper in expressing class statistical distributions. Otsu's method uses a variance to represent the distribution of each class. The variance utilizes a distance square from the mean to a data. This process is not proper in denoting a real class statistical distribution because of the distance square. In this paper, to express more exact class statistical distributions, the within-class standard deviation as a criterion for threshold selection is proposed and then the optimal threshold is determined by minimizing it. In order to have validity, it is shown through the experimental results that the proposed method was more superior to the counterparts.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.4
• /
• pp.199-205
• /
• 2018

So many fast motion estimation algorithms for prediction quality and computational reduction have been published due to tremendous computations of full search algorithm. In the paper, we suggest an algorithm that reduces computation effectively, while keeping prediction quality as almost same as that of the full search. The proposed algorithm based on multiple threshold filter calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, removes impossible candidates, and calculates optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain the better performance of calculation speed by reducing unnecessary computations. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

• Journal of the Institute of Convergence Signal Processing
• /
• v.20 no.2
• /
• pp.84-90
• /
• 2019

Tremendous computation of full search or lossless motion estimation algorithms for video coding has led development of many fast motion estimation algorithms. We still need proper control of computation and prediction quality. In the paper, we suggest an algorithm that reduces computation effectively and controls computational amount and prediction quality, while keeping prediction quality as almost the same as that of the full search. The proposed algorithm uses multiple thresholds for partial block sum and times of counting unchanged minimum position for each step. It also calculates the partial block matching error, removes impossible candidates early, implements fast motion estimation by comparing times of keeping the position of minimum error for each step, and controls prediction quality and computation easily by adjusting the thresholds. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

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

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.51-57
• /
• 1999

In this paper, an adaptive thresholding of the nonuniformly contrasted images is proposed through using the contrast pre-enhancement of the local regions and the bilinear interpolation between the local threshold values. The nonuniformly contrasted image is decomposed into 9${\times}$9 sized local regions, and the contrast is enhanced by intensifying the gray level difference of each low contrasted or blurred region. Optimal threshold values are obtained by iterative method from the gray level distribution of each contrast-enhanced local region. Discontinuities are reduced at the region of interest or at the characters by using bilinear interpolation between the neighboring threshold surfaces. Character recognition experiments are conducted using backpropagation neural network on the characters extracted from the nonuniformly contrasted document, PCB, and wafer images binarized through using the proposed thresholding and the conventional thresholding methods, and the results prove the relative effectiveness of the proposed scheme.

• Journal of Biomedical Engineering Research
• /
• v.16 no.3
• /
• pp.337-344
• /
• 1995

Because of the high energy of the treatment beam, contrast of portal films is very poor. Many image processing techniques have been applied to the portal images but a significant drawback is the loss of definition on the edges of the treatment field. Analysis of this problem shows that it may be remedied by separating the treatment field from the background prior to enhancement and uslng only the pixels within the field boundary in the enhancement procedure. A new edge extraction algorithm for accurate extraction of the radiation field boundary from portal Images has been developed for contrast enhancement of portal images. In this paper, portal image segmentation algorithm based on Sobel filtration, labelling processes and morphological thinning has been presented. This algorithm could automatically search the optimal threshold value which is sensitive to the variation of the type and quality of portal images.

• Progress in Medical Physics
• /
• v.7 no.2
• /
• pp.79-90
• /
• 1996

In this paper, we present an automatic threshold decision method to detect the contour of the a 2-D echocarodiogram by using the Bayes estimator for the boundary-like region. The boundary-like region is constructed from the conduction coefficient of the heat anisotro-pic diffusion method which enforces the blurred image during the preprocessing step. For the boundary-like region, we used the Bayes estimator to select an optimal threshold level. From this threshold value, the contour of the echocardigrams can be detected automatically Finally by overlapping the estimated contour to the original echocardiogram, we can obtain the contour enforced ultrasound echocardiogram.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.84-90
• /
• 2010

In this paper, we propose a quadratic discriminant analysis based approach for improving the discriminating strength of weak classifiers based on simple Haar-like features that were used in the Viola-Jones object detection framework. Viola and Jones built a strong classifier using a boosted ensemble of weak classifiers. However, their single threshold (or decision boundary) based weak classifier is sub-optimal and too weak for efficient discrimination between object class and background. A quadratic discriminant analysis based approach is presented which leads to hyper-quadric boundary between the object class and background class, thus realizing multiple thresholds based weak classifiers. Experiments carried out for car detection using 1000 positive and 3000 negative images for training, and 500 positive and 500 negative images for testing show that our method yields higher classification performance with fewer classifiers than single threshold based weak classifiers.