• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.1
• /
• pp.51-59
• /
• 2013

This paper researches location estimating method in CDMA system. Previously proposed positioning algorithms are difficult to estimate accurate position in indoor environments, and possible to limited position. This paper proposes enhanced algorithm using received PN pilot signals from base stations to enhance previous algorithms. For estimating position, we set the threshold value and use over the threshold value in received signals. After selecting signals, we estimate position using TDOA algorithm. And the cases which TDOA algorithm cannot use to estimate position, we use Pattern Matching algorithm. The proposed method system showed the improved performance in estimating parameters and locating positions by computer simulations.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.47-50
• /
• 2000

In this paper, we propose a new destage algorithms, called the Dynamic Adaptive Threshold which determines turn-on and turn-off thresholds dynamically depending on the current write cache occupancy level and the differential rate of the host write requests. For performance evaluation, the proposed algorithm is compared with the wellknown High-Low Water Mark (HLWM) algorithm. Performance tests are fulfilled with our cached RAID 5 simulator. The simulation results show that the proposed algorithm outperforms the HLWM algorithm in terms of response time of host reads and write cache hit ratio under various workloads.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.8 no.6
• /
• pp.259-266
• /
• 2000

Crash test data from different impact modes and threshold speeds were used to assess the effects of impact conditions on air bag electronic single point sensing (ESPS) activation requirements. The requirements are expressed in terms of the desired sensor activation time based on unbelted driver dummy kinematics. A crash discriminator pre-displacement is introduced to crash recognition algorithm to the ESPS. The new crash recognition algorithm named Velocity Energy Pre-displacement(VEPD) method is developed and the ESPS algorithm based on the VEPD technique is used to assess the ESPS system performance. It is shown that VEPD method correlates very well with desired sensor activation time and meets the activation requirement.

• Proceedings of the KOSOMBE Conference
• /
• v.1992 no.05
• /
• pp.98-101
• /
• 1992

A new algorithm using entropy operater with variable threshold for edge detection from 2D short axis echocardiogram is proposed. This algorithm is based on brightness, mean value of entropy, and variance value of entropy in local window. This algorithm is effective to process complex echocardiographic images due to the speckle noises, echo dropouts and characteristics of 2D echocardiographic constituents. Results of computer simulation of the proposed algorithm show excellent edge detection performance comparing wi th other edge operators which have been applied to 2D echocardiograms.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.5 no.1
• /
• pp.186-194
• /
• 1997

The objective of this study is to develope knock control algorithms which can increase engine power without causing frequent knock occurrence. A four cylinder spark-ignition engine is used for the experiments to develop knock control algorithms which use block vibration signals. Knock occurrence is detected accurately by using knock threshold values which consider the difference of transmission path of each cylinder. Spark timing is controlled both simultaneously and individually. With the simultaneous control, torque gain is achieved by retarding the spark timing on knock occurrence in propotion to the knock intensity. The individual knock control algorithm results in higher torque gain than the simultaneous knock control algorithm. The knock occurrence frequency of the individual knock control algorithm is about twice the value of the simultaneous knock control algorithm results. Both control algorithms give similar torque gain of about 3% when they are optimized.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.2
• /
• pp.166-171
• /
• 2013

The method proposed in this paper can improve the performance of the Boosting algorithm in machine learning. The proposed Boundary AdaBoost algorithm can make up for the weak points of Normal binary classifier using threshold boundary concepts. The new proposed boundary can be located near the threshold of the binary classifier. The proposed algorithm improves classification in areas where Normal binary classifier is weak. Thus, the optimal boundary final classifier can decrease error rates classified with more reasonable features. Finally, this paper derives the new algorithm's optimal solution, and it demonstrates how classifier accuracy can be improved using the proposed Boundary AdaBoost in a simulation experiment of pedestrian detection using 10-fold cross validation.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.4
• /
• pp.65-70
• /
• 2018

This paper describes a effective information compressor algorithm for the fourth industrial technology. One of the difficult problems for outdoor is to obtain effective updating process of background images. Because input images generally contain the shadows of buildings, trees, moving clouds and other objects, they are changed by lapse of time and variation of illumination. They provide the lowering of performance for surveillance system under outdoor. In this paper, a effective information algorithm for variable environment variable under outdoor is proposed, which apply the Kalman Estimation Modeling and adaptive threshold on pixel level to separate foreground and background images from current input image. In results, the better SNR of about 3dB~5dB and about 10%~25% noise distribution rate in the proposed method. Furthermore, it was showed that the moving objects can be detected on various shadows under outdoor and better result Information.

• Journal of the Korean Magnetic Resonance Society
• /
• v.6 no.1
• /
• pp.12-19
• /
• 2002

A shift-averaged Haar wavelet transform was introduced as a new and excellent tool to distinguish real peaks from the noise contaminated NMR signals. It is based on Haar wavelet transform and translation-invariant denoising process. Donoho＇s universal threshold was newly introduced to the shift-averaged Haar wavelet transform for the purpose of automated noise suppression, and was quantitatively compared with the conventional uniform threshold method in terms or threshold and signal to noise ratio (SNR). New algorithm was combined with a routine to suppress a large solvent peak by singular value decomposition (SVD). Combined algorithm was applied to the real spectrum that containing large solvent peak.

• Journal of Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.483-491
• /
• 2009

In this paper, we propose a fast motion estimation algorithm using adaptive elimination of sub-block partial coefficients. The proposed algorithm predicts an adaptive threshold for each sub-block by using relationship of an initial sum of absolute difference(SAD) and a minimum SAD at the current point, and efficiently reduces unnecessary calculation time of the conventional partial distortion elimination(PDE) algorithm with the predicted threshold. Our algorithm reduces about 60% of computations of the conventional PDE algorithm without any degradation of prediction quality compared with the con ventional full search. Additionally, the proposed algorithm can be applied to other fast motion estimation 떠gorithms. the proposed Our proposing algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2828-2835
• /
• 1996

In this paper we propose a new shaping algorithm which can control the shaping delay and the output buffer size based on the leaky bucket counter with a threshold value. This paper assumes that input traffic of the proposed shaping algorithm is the worst case traffic tolerated by the continuous leaky bucket algorithm and claracterizes traffic patterns that can depart from our shaping algorithm. We also compare shaping delay and output buffer size of the proposed algorithm with the existing shaping algorithm without a threshold value. Our results show that the proposed shaping algorithm can easily manage the shaping delay and output buffer size than any other mechanism.