• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.6
• /
• pp.257-264
• /
• 2013

In this study, we have designed the variable amplitude threshold algorithm that can enhance the accuracy of step count using variable amplitude. This algorithm converts the x, y, z sensor values into a single energy value($E_t$) by using SVM(Signal Vector Magnitude) algorithm and can pick step count out over 99% of accuracy through the peak data detection algorithm and fixed peak threshold. To prove the results, We made the noise filtering with the fixed amplitude threshold from the amplitude of energy value that found out the detection error was increasing, and it's the key idea of the variable amplitude threshold that can be adapted on the continuous data evaluation. The experiment results shows that the variable amplitude threshold algorithm can improve the average step count accuracy up to 98.9% at 10 Hz sampling rate and 99.6% at 20Hz sampling rate.

• Journal of the Optical Society of Korea
• /
• v.14 no.1
• /
• pp.22-27
• /
• 2010

Bit error rate (BER) monitoring is the ultimate goal of performance monitoring in all digital transmission systems as well as optical fiber transmission systems. To achieve this goal, optimization of the decision threshold must also be considered because BER is dependent on the level of decision threshold. In this paper, we analyze a pseudo-error counting scheme and propose an algorithm to achieve both BER monitoring and adaptive decision threshold optimization in optical fiber transmission systems. To verify the effectiveness of the proposed algorithm, we conduct computer simulations in both Gaussian and non-Gaussian distribution cases. According to the simulation results, BER and the optimum decision threshold can be estimated with the errors of < 20% and < 10 mV, respectively, within 0.1-s processing time in > 40-Gb/s transmission systems.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.26-34
• /
• 2000

This paper presents a new adaptive impulse noise cancelling technique based on the adaptive nonlinear suppressing function. The proposed "adaptive threshold algorithm (ATA)" is controlled by the normalized power prior input data term, and this adaptive threshold makes the cancelling system highly robust against additive impulse noise. For the performance evaluation, we have tested the proposed algorithm with the observed signals simulated in various impulsive noise environments and real EMG signals. As a result the proposed algorithm shows superior performance of 51.7% to the available techniques in the points of SNR and MSE.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.105-110
• /
• 2015

This paper deals with a newly proposed algorithm for stable marriage problem, which I coin threshold algorithm. The proposed algorithm firstly constructs an $n{\times}n$ matrix of the sum of each sex's preference over the members of the opposite sex. It then selects the minimum value from each row and column to designate the maximum value of the selected as the sum threshold $p^*_{ij}$. It subsequently deletes the maximum preference $_{mzx}p_{ij}$ from a matrix derived from deleting $p_{ij}$ > $p^*_{ij}$, until ${\mid}c_i{\mid}=1$ or ${\mid}c_j{\mid}=1$. Finally, it undergoes an optimization process in which the sum preference is minimized. When tested on 7 stable marriage problems, the proposed algorithm has proved to improve on the existing solutions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.368-374
• /
• 2010

Image segmentation is the basic step in the field of the image processing for pattern recognition, environment recognition, and context analysis. The Otsu's automatic threshold selection, which determines the optimal threshold value to maximize the between class scatter using the distribution information of the normalized histogram of a image, is the famous method among the various image segmentation methods. For the automatic threshold selection proposed by Otsu, it is difficult to determine the optimal threshold value by considering the sub-region characteristic of the image because the Otsu's algorithm analyzes the global histogram of a image. In this paper, to alleviate this difficulty of Otsu's image segmentation algorithm and to improve image segmentation capability, the original image is divided into several sub-images by using context fuzzy c-means algorithm. The proposed fuzzy Otsu threshold algorithm is applied to the divided sub-images and the several threshold values are obtained.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.7
• /
• pp.55-62
• /
• 2001

In this paper, we propose a new adaptative pruning algorithm which effectively reduces the search space during the recognition process. As maximum probabilities between neighbor frames are highly interrelated, an efficient pruning threshold value can be obtained from the maximum probabilities of previous frames. The main idea is to update threshold at the present frame by a combination of previous maximum probability and hypotheses probabilities. As present threshold is obtained in on-going recognition process, the algorithm does not need any pre-experiments to find threshold values even when recognition tasks are changed. In addition, the adaptively selected threshold allows an improvement of recognition speed under different environments. The proposed algorithm has been applied to a Korean Address recognition system. Experimental results show that the proposed algorithm reduces the search space of average 14.4% and 9.14% respectively while preserving the recognition accuracy, compared to the previous method of using fixed pruning threshold values and variable pruning threshold values.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.91-96
• /
• 2014

This paper proposed an adaptive threshold method for detecting flame candidate regions in a infrared image and it adapts according to the contrast and intensity changes in the image. Conventional flame detection systems uses fixed threshold method since surveillance environment does not change, once the system installed. But it needs a adaptive threshold method as requirements of surveillance system has changed. The proposed adaptive threshold algorithm uses the dynamic behavior of flame as featured parameter. The test result is analysed by comparing test result of proposed adaptive threshold algorithm and conventional fixed threshold method. The analysed data shows, the proposed method has 91.42% of correct detection rate and false detection is reduced by 20% comparing to the conventional method.

• Computers and Concrete
• /
• v.22 no.6
• /
• pp.551-561
• /
• 2018

The percolation of interfacial transition zone (ITZ) in cementitious materials is of great importance to the transport properties and durability issues. This paper presents numerical simulation research on the ITZ percolation threshold of mortar specimens at meso-scale. To simulate the meso-scale model of mortar as realistically as possible, the aggregates are simplified as ellipsoids with arbitrary orientations. Major and minor aspect ratios are defined to represent the global shape characteristics of aggregates. Some algorithms such as the burning algorithm, Dijkstra's algorithm and Connected-Component Labeling (CCL) algorithm are adopted for identification of connected ITZ clusters and percolation detection. The effects of gradation and aspect ratios of aggregates on ITZ percolation threshold are quantitatively studied. The results show that (1) the ITZ percolation threshold is mainly affected by the specific surface area (SSA) of aggregates and shows a global decreasing tendency with an increasing SSA; (2) elongated ellipsoidal particles can effectively bridge isolated ITZ clusters and thus lower the ITZ percolation threshold; (3) as ITZ volume fraction increases, the bridging effect of elongated particles will be less significant, and has only a minor effect on ITZ percolation threshold; (4) it is the ITZ connectivity that is essentially responsible for ITZ percolation threshold, while other factors such as SSA and ITZ volume fraction are only the superficial reasons.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.163-164
• /
• 2015

In order to decode the bar code image binarization process is indispensable. The traditional binarization method is a global threshold binarization and local threshold binarization. Global threshold binarization method using a single threshold. In some cases there is a blur, or if the brightness is different from the bar code image. Therefore, binary pattern information is not retained. Local threshold method is binaized pattern information is maintained but processing speed is slow than global threshold binarization. The algorithm for solving this problem, there is modified binary algorithm. In this paper, we proposed hardware IP implemented by Vivado of modified binary algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11C
• /
• pp.1161-1168
• /
• 2003

In this paper, we propose an improved statistical model-based voice activity detection algorithm and threshold update method. We first improve signal-to-noise ratio by using speech enhancement preprocessing algorithm combined power subtraction method and matched filter, then apply it to LLR test optimum decision rule for improving the performance even in low SNR conditions. And we propose an adaptive threshold update method that was not concerned in any papers. We also perform extensive computer simulations to demonstrate the performance improvement of the proposed VAD algorithm employing the proposed speech enhancement preprocessing algorithm and adaptive threshold update method under various background noise environments. Finally we verify our results by comparing ITU-T G.729 Annex B.