• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.9
• /
• pp.663-669
• /
• 2004

The mobile tole-cardiology system is the new research area that support an ubiquitous health care based on mobile telecommunication networks. Although there are many researches presenting the modeling concepts of a GSM-based mobile telemedical system, practical application needs to be considered both compression performance and error corruption in the mobile environment. This paper evaluates three wavelet ECG compression algorithms over CDMA networks. The three selected methods are Rajoub using EPE thresholding, Embedded Zerotree Wavelet(EZW) and Wavelet transform Higher Order Statistics Coding(WHOSC) with linear prediction. All methodologies protected more significant information using Forward Error Correction coding and measured not only compression performance in noise-free but also error robustness and delay profile in CDMA environment. In addition, from the field test we analyzed the PRD for movement speed and the features of CDMA 1X. The test results show that Rajoub has low robustness over high error attack and EZW contributes to more efficient exploitation in variable bandwidth and high error. WHOSC has high robustness in overall BER but loses performance about particular abnormal ECG.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.476-483
• /
• 2010

If the data are pre-whitened, then gradient adaptive algorithms which are simpler than higher order statistics algorithms can be used in adaptive blind signal estimation. In this paper, we propose a blind subband affine projection algorithm for multiple-input multiple-output adaptive equalization in the blind environments. All of the adaptive filters in subband affine projection equalization are decomposed to polyphase components, and the coefficients of the decomposed adaptive sub-filters are updated by defining the multiple cost functions. An infinite impulse response filter bank is designed for the data pre-whitening. Pre-whitening procedure through subband filtering can speed up the convergence rate of the algorithm without additional computation. Simulation results are presented showing the proposed algorithm's convergence rate, blind equalization and blind signal separation performances.

• Journal of Korean Society for Quality Management
• /
• v.48 no.3
• /
• pp.421-431
• /
• 2020

Purpose: The purpose of this study is to compare and analyze the tokenizer in natural language processing for customer satisfaction in sentiment analysis. Methods: In this study, a supervised learning-based tokenizer Mecab-Ko and an unsupervised learning-based tokenizer SentencePiece were used for comparison. Three algorithms: Naïve Bayes, k-Nearest Neighbor, and Decision Tree were selected to compare the performance of each tokenizer. For performance comparison, three metrics: accuracy, precision, and recall were used in the study. Results: The results of this study are as follows; Through performance evaluation and verification, it was confirmed that SentencePiece shows better classification performance than Mecab-Ko. In order to confirm the robustness of the derived results, independent t-tests were conducted on the evaluation results for the two types of the tokenizer. As a result of the study, it was confirmed that the classification performance of the SentencePiece tokenizer was high in the k-Nearest Neighbor and Decision Tree algorithms. In addition, the Decision Tree showed slightly higher accuracy among the three classification algorithms. Conclusion: The SentencePiece tokenizer can be used to classify and interpret customer sentiment based on online reviews in Korean more accurately. In addition, it seems that it is possible to give a specific meaning to a short word or a jargon, which is often used by users when evaluating products but is not defined in advance.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.168-178
• /
• 2005

The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.

• Journal of IKEEE
• /
• v.21 no.4
• /
• pp.420-423
• /
• 2017

In this paper, we propose an implementation of a neural network accelerator for reducing the rendering noise. Among the rendering algorithms, we selects a ray tracing to assure a high-definition graphics. Ray tracing rendering uses ray to render. Less use of the ray will result in noise, and if used too much, it will produce a higher quality image, but will take longer. In order to quickly process such lace rendering, an algorithm is used that uses less rays and removes the noise generated. Among such algorithms, there is an algorithm using a neural network, and a neural network accelerator which obtains a filter parameter used in an operation is implemented in order to speed up the operation speed. The time it takes to calculate the parameters used for a pixel is 11.44us.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06a
• /
• pp.680-685
• /
• 1994

The acoustic phenomena in the actual sound systems involve a variety of compound problems. In this paper, the well-known Bayes' theorem is first employed and expanded into orthonormal and non-orthonomal series forms matched to the digital processing of lower and higher order statistical informations and the noisy observations. Proposed on-line algorithms of digital filter type are applied to the actual state estimation for a reverberation characteristics in a room under contamination of background noises.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.1
• /
• pp.7-13
• /
• 2003

Numerous investigations have demonstrated that diffused reflection is one of the most important factors in predicting room acoustics by computer simulation. Recent studies have suggested several computational algorithms in order to account for diffused reflections in the ray tracing or beam tracing method. In this study, a computational algorithm for the calculation of diffuse sound reflections in the image method is suggested and a computer simulation system is developed based on the suggested algorithm. The methodology adopted in our computer simulation system is similar to the extended radiosity method, which is developed for the computer graphics. In a real room, sound energy is reflected in a partially diffused manner which results in four reflection combinations: diffuse-diffuse, specular-specular, diffuse-specular and specular-diffuse. In this study, higher order form factor is introduced to handle the four types of reflection combinations so that the partially diffused reflection could be modeled. In this paper, the concept of extended radiosity method is described and the approximate method of calculating higher order form factor is suggested. Finally, the effect of higher order form factors on the simulation of reverberation time is investigated.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.3
• /
• pp.63-73
• /
• 1997

For the practical applications of the EIT technology, it is essential to reconstruct sttic images iwth a higher spatial resolution in a reasonalble amount of processing time. Using the conventional EIT static image reconstruction algorithms, however, the processing time increases exponential with poor convergence characteristics as we try to get a higher spatial resolution. In order to overcome this problem, we developed a recursive mesh grouping method based on the Fuzzy-GA like algorithm. Computational simulation using the well-known improve dewton-raphson method with the proposed recursive mesh grouping algorithm shows a promising result that we can significantly reduce the processing time in the reconstruction of EIT static images of a higher spatial resolution.

• Journal of Sensor Science and Technology
• /
• v.8 no.1
• /
• pp.45-52
• /
• 1999

In this raper, an enhanced learning method is proposed for improving the learning speed of the error back propagation learning algorithm. In order to cope with the premature saturation phenomenon at the initial learning stage, a variation scheme of active functions is introduced by using higher order functions, which does not need much increase of computation load. It naturally changes the learning rate of inter-connection weights to a large value as the derivative of sigmoid function abnormally decrease to a small value during the learning epoch. Also, we suggest the hybrid learning method incorporated the proposed method with the momentum training algorithm. Computer simulation results show that the proposed learning algorithm outperforms the conventional methods such as momentum and delta-bar-delta algorithms.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.189-197
• /
• 2009

Top-k queries are important to many wireless sensor applications. Conventional Top-k query processing algorithms install a filter at each sensor node and suppress unnecessary sensor updates. However, they have some drawbacks that the sensor nodes consume energy extremely to probe sensor reading or update filters. Especially, it becomes worse, when the variation ratio of top-k result is higher. In this paper, we propose a novel Top-k query processing algorithm for energy-efficiency. First, each sensor determines its priority as the order of data gathering. Next, sensor nodes that have higher priority transmit their sensor readings to the base station until gathering k sensor readings. In order to show the superiority of our query processing algorithm, we simulate the performance with the existing query processing algorithms. As a result, our experimental results show that the network lifetime of our method is prolonged largely over the existing method.