• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.1
• /
• pp.41-51
• /
• 2017

This Paper Describes a Method for the Evaluation of Sleep Apnea, Namely, the Peak Signal-to-noise ratio (PSNR) of Wavelet Transformed Electroencephalography (EEG) Data. The Purpose of this Study was to Investigate EEG Properties with Regard to Differences between Sleep Spindles and K-complexes and to Characterize Obstructive Sleep Apnea According to Sleep Stage. We Examined Non-REM and REM Sleep in 20 Patients with OSA and Established a New Approach for Detecting Sleep Apnea Base on EEG Frequency Changes According to Sleep Stage During Sleep Apnea Events. For Frequency Bands Corresponding to A3 Decomposition with a Sampling Applied to the KC and the Sleep Spindle Signal. In this Paper, the KC and Sleep Spindle are Ccalculated using MSE and PSNR for 4 Types of Mother Wavelets. Wavelet Transform Coefficients Were Obtained Around Sleep Spindles in Order to Identify the Frequency Information that Changed During Obstructive Sleep Apnea. We also Investigated Whether Quantification Analysis of EEG During Sleep Apnea is Valuable for Analyzing Sleep Spindles and The K-complexes in Patients. First, Decomposition of the EEG Signal from Feature Data was Carried out using 4 Different Types of Wavelets, Namely, Daubechies 3, Symlet 4, Biorthogonal 2.8, and Coiflet 3. We Compared the PSNR Accuracy for Each Wavelet Function and Found that Mother Wavelets Daubechies 3 and Biorthogonal 2.8 Surpassed the other Wavelet Functions in Performance. We have Attempted to Improve the Computing Efficiency as it Selects the most Suitable Wavelet Function that can be used for Sleep Spindle, K-complex Signal Processing Efficiently and Accurate Decision with Lesser Computational Time.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.283-294
• /
• 2006

In this paper, we propose a real-time face detection/tracking methodology with Haar wavelets and skin color. The proposed method boosts face detection and face tracking performance by combining skin color and Haar wavelets in an efficient way. The proposed method resolves the problem such as rotation and occlusion due to the characteristic of the condensation algorithm based on sampling despite it uses same features in both detection and tracking. In particular, it can be applied to a variety of applications such as face recognition and facial expression recognition which need an exact position and size of face since it not only keeps track of the position of a face, but also covers the size variation. Our test results show that our method performs well even in a complex background, a scene with varying face orientation and so on.

• Korean Journal of Cognitive Science
• /
• v.14 no.1
• /
• pp.10-10
• /
• 2003

This paper extracts the edge of main components of face with Gabor wavelets transformation in facial expression images. FCM(Fuzzy C-Means) clustering algorithm then extracts the representative feature points of low dimensionality from the edge extracted in neutral face. The feature-points of the neutral face is used as a template to extract the feature-points of facial expression images. To match point to Point feature points on an expression face against each feature point on a neutral face, it consists of two steps using a dynamic linking model, which are called the coarse mapping and the fine mapping. This paper presents an automatic extraction of feature-points by dynamic linking model based on Gabor wavelets and fuzzy C-means(FCM) algorithm. The result of this study was applied to extract features automatically in facial expression recognition based on dimension[1].

• Korean Journal of Remote Sensing
• /
• v.22 no.1
• /
• pp.49-61
• /
• 2006

The lifting scheme has been found to be a flexible method for constructing scalar wavelets with desirable properties. In this paper, it is extended to the UDAR data compression. A newly developed data compression approach to approximate the UDAR surface with a series of non-overlapping triangles has been presented. Generally a Triangulated Irregular Networks (TIN) are the most common form of digital surface model that consists of elevation values with x, y coordinates that make up triangles. But over the years the TIN data representation has become an important research topic for many researchers due its large data size. Compression of TIN is needed for efficient management of large data and good surface visualization. This approach covers following steps: First, by using a Delaunay triangulation, an efficient algorithm is developed to generate TIN, which forms the terrain from an arbitrary set of data. A new interpolation wavelet filter for TIN has been applied in two steps, namely splitting and elevation. In the splitting step, a triangle has been divided into several sub-triangles and the elevation step has been used to 'modify' the point values (point coordinates for geometry) after the splitting. Then, this data set is compressed at the desired locations by using second generation wavelets. The quality of geographical surface representation after using proposed technique is compared with the original UDAR data. The results show that this method can be used for significant reduction of data set.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.20-30
• /
• 2003

In a conventional method based on quadrature 2D Gator wavelets to extract iris features, the iris recognition is performed by a 256-byte iris code, which is computed by applying the Gabor wavelets to a given area of the iris. However, there is a code redundancy because the iris code is generated by basis functions without considering the characteristics of the iris texture. Therefore, the size of the iris code is increased unnecessarily. In this paper, we propose a new feature extraction algorithm based on the ICA (Independent Component Analysis) for a compact iris code. We implemented the ICA to generate optimal basis functions which could represent iris signals efficiently. In practice the coefficients of the ICA expansions are used as feature vectors. Then iris feature vectors are encoded into the iris code for storing and comparing an individual's iris patterns. Additionally, we introduce two methods to enhance the recognition performance of the ICA. The first is to reorganize the ICA bases and the second is to use a different ICA bases set. Experimental results show that our proposed method has a similar EER (Equal Error Rate) as a conventional method based on the Gator wavelets, and the iris code size of our proposed methods is four times smaller than that of the Gabor wavelets.

• Communications for Statistical Applications and Methods
• /
• v.8 no.3
• /
• pp.859-866
• /
• 2001

The problem of wavelet density estimation is studied when the sample observations are contaminated with random noise. In this paper a linear wavelet estimator based on Meyer-type wavelets is shown to be L$_1$ strongly consistent for f(x) with bounded support when Fourier transform of random noise has polynomial descent or exponential descent.

• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.129-140
• /
• 2000

Wavelets constitute a new orthogonal system which has direct application in density estimation. We introduce a brief wavelet density estimation and summarize some asymptotic results. An application to mixture normal distributions is implemented with S-Plus.

• Journal of Broadcast Engineering
• /
• v.5 no.1
• /
• pp.23-30
• /
• 2000

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.423-431
• /
• 2002

In this paper, we find $n^{th}$ order wavelet derivatives of a sufficiently smooth function using biorthogonal wavelet bases and derive the order of convergence of the $n^{th}$ order wavelet derivatives.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.4
• /
• pp.91-101
• /
• 2001

This paper is to develop replacement models under minimal repair with exponential polynomial wavelet failure rate function. Wavelets have good time-frequency localization, fast algorithms and parsimonious representation. Also this study is presented along with numerical examples using sensitivity analysis for exponential polynomial trigonometric failure rate function.