• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.2
• /
• pp.175-181
• /
• 2014

In this paper, we propose a robust clutter pre-thresholding method using background adaptive Threshold Map for the clutter rejection in the complex coastal environment. The proposed algorithm is composed of the use of Threshold Map's and method of its calculation. Additionally we also suggest an automatic decision method of Thresold Map's update. Experimental results on some sets of real infrared image sequence show that the proposed method could remove clutters effectively without any loss of detection rate for the aim target and reduce processing time dramatically.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.1
• /
• pp.1-11
• /
• 2023

Deep-learning-based image segmentation is one of the most widely employed lane detection approaches, and it requires a post-process for extracting the key points on the lanes. A general approach for key-point extraction is using a fixed threshold defined by a user. However, finding the best threshold is a manual process requiring much effort, and the best one can differ depending on the target data set (or an image). We propose a novel key-point extraction algorithm that automatically adapts to the target image without any manual threshold setting. In our adaptive key-point extraction algorithm, we propose a line-level normalization method to distinguish the lane region from the background clearly. Then, we extract a representative key point for each lane at a line (row of an image) using a kernel density estimation. To check the benefits of our approach, we applied our method to two lane-detection data sets, including TuSimple and CULane. As a result, our method achieved up to 1.80%p and 17.27% better results than using a fixed threshold in the perspectives of accuracy and distance error between the ground truth key-point and the predicted point.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.91-97
• /
• 2004

Difference image scheme is widely used for motion estimation in moving object tracking system. This scheme contains a binarization step which segments image into background and moving object regions, referring to threshold value. In this paper, we propose a decision algorithm of tracking the threshold value with a differential image. The key idea is analyzing the histogram of the differential image. In addition we evaluate the performance of this method in comparison with conventional scheme. As an experimental result with 60 images, it is found that threshold by the proposed algorithm is very close to optimal threshold selected manually.

• Journal of Sensor Science and Technology
• /
• v.22 no.5
• /
• pp.338-345
• /
• 2013

Premature ventricular contractions are the most common of all arrhythmias and may cause more serious situation like ventricular fibrillation and ventricular tachycardia in some patients. Therefore, the detection of this arrhythmia becomes crucial in the early diagnosis and the prevention of possible life threatening cardiac diseases. Most methods for detecting arrhythmia require pp interval, or the diversity of P wave morphology, but they are difficult to detect the p wave signal because of various noise types. Thus, it is necessary to use noise-free R wave. So, the new approach for the detection of PVC is presented based on the rhythm analysis and the beat matching in this paper. For this purpose, we removed baseline wandering of low frequency band and made summed signals that are composed of two high frequency bands including the frequency component of QRS complex using the wavelet filter. And then we designed R wave detection algorithm using the adaptive threshold and window through RR interval. Also, we developed algorithm to classify PVC using RR interval. The performance of R wave and PVC detection is evaluated by using MIT-BIH arrhythmia database. The achieved scores indicate average detection rate of 99.76%, sensitivity of 99.30% and specificity of 98.66%; accuracy respectively for R wave and PVC detection.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.31-41
• /
• 2000

This paper proposes a block-based motion detection algorithm for digital video surveillance system which adaptively decides the threshold according to the kinds of images We first compute the features of a block after dividing each Image into small sub-block regions, and analyze performance of the motion detection algorithm based on statistic features by using the proposed threshold-decision method. Motion vectors are used to analyze motion degree and adaptively determine the threshold The simulation results show the performances of motion detection algorithms according to sub-block size, statistic features, noise, and threshold.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4603-4624
• /
• 2016

In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.205-211
• /
• 2012

By using an adaptive threshold and weight based on the wavelet transform and Haar transform, a novel image enhancement algorithm is proposed. First, a medical image was decomposed with wavelet transform and all high-frequency sub-images were decomposed with Haar transform. Secondly, noise in the frequency domain was reduced by the proposed soft-threshold method. Thirdly, high-frequency coefficients were enhanced by the proposed weight values in different sub-images. Then, the enhanced image was obtained through the inverse Haar transform and wavelet transform. But the pixel range of the enhanced image is narrower than a normal image. Lastly, the image's histogram was stretched by nonlinear histogram equalization. Experiments showed that the proposed method can be not only enhance an image's details but can also preserve its edge features effectively.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2331-2334
• /
• 2003

Generally, skin color information has been widely used at the face region extraction step of the face region recognition process. But many experimental results show that they are very sensitive to the given threshold range which is used to extract the face regions at the input image. In this paper, we propose a face region extraction algorithm based on an adaptive range decision for skin color. First we extract the pixels which are regarded as the candidate skin color pixels by using the given range for skin color extraction. Then, the ratio between the total pixels and the extracted pixels is calculated. According to the ratio, we adaptively decide the range of the skin color and extract face region. From the experiment results for the various images, the proposed algorithm shows more accurate results than the conventional algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.57-64
• /
• 2006

Motion estimation plays an important role for the compression of video signals. The proposed method utilizes an adaptive threshold and characteristics of a distribution of SAD (sum of absolute difference). Generally, the more complex the SAD distribution is, the larger SAD value tends to be. This proposed algorithm tries to reduce the search points in a simple distribution but increase them in a complex distribution to avoid local minima. A macro block is divided into 9 areas. One of them chosen using spatio-temporal correlation is called the primary area and the others are called the secondary area that will be searched to avoid local minima. The proposed algorithm decides if just one area (the primary area or the secondary area) will be enough to be searched or both areas should be searched, using adaptive threshold. Compared with famous motion estimation algorithms, the simulation result shows that the searching points per macro block and MSE decreases about 16.4% and 32.83 respectively on the average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.2012-2018
• /
• 2001

This paper proposes the adaptive suboptimal iterative algorithm using threshold to reduce system complexity in the PTS\`s. Performance of the proposed adaptive suboptimal iteration algorithm is represented in terms of iteration number and CDF. In the case of the number of sub-block is 4, the 10-3 PAPR of the proposed method and P S improved this by 0.4dB compared to Cimini\`s. And the complexity of the proposed method was reduced to nearly 22% for the PTS\`s and 44% for the Cimini\`s for 8dB threshold. For the 8 sub-blocks, the 10$\^$-3/ PAPR of the proposed method reduced by 0.7dB compared to PTS\`s, but improved by 0.4dB compared to Cimini\`s. And the complexity of the proposed method was reduced to nearly 2.4% for the PTS\`s and 39% for the Cimini\`s.