• Journal of Sensor Science and Technology
• /
• v.29 no.4
• /
• pp.249-254
• /
• 2020

It is difficult to control children who exhibit negative behavior in dental clinics. Various methods are used for preventing pediatric dental patients from being afraid and for eliminating the factors that cause psychological anxiety. However, when it is difficult to apply this routine behavioral control technique, sedation therapy is used to provide quality treatment. When the sleep anesthesia treatment is performed at the dentist's clinic, it is challenging to identify emergencies using the current breath detection method. When a dentist treats a patient that is under the influence of an anesthetic, the patient is unconscious and cannot immediately respond, even if the airway is blocked, which can cause unstable breathing or even death in severe cases. During emergencies, respiratory instability is not easily detected with first aid using conventional methods owing to time lag or noise from medical devices. Therefore, abnormal breathing needs to be evaluated in real-time using an intuitive method. In this paper, we propose a method for identifying abnormal breathing in real-time using an intuitive method. Respiration signals were measured using a 3M Littman electronic stethoscope when the patient's posture was supine. The characteristics of the signals were analyzed by applying the signal processing theory to distinguish abnormal breathing from normal breathing. By applying a short-time Fourier transform to the respiratory signals, the frequency range for each patient was found to be different, and the frequency of abnormal breathing was distributed across a broader range than that of normal breathing. From the wavelet transform, time-frequency information could be identified simultaneously, and the change in the amplitude with the time could also be determined. When the difference between the amplitude of normal breathing and abnormal breathing in the time domain was very large, abnormal breathing could be identified.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.31-39
• /
• 2011

The facial recognition algorithms using Gabor wavelet based face graph produce very good performance while they have some weakness such as a large amount of computation and an irregular result depend on initial location. We proposed a fully automatic facial recognition algorithm using a Gabor feature based geometric deformable face graph matching. The initial location and size of a face graph can be selected using Adaboost detection results for speed-up. To find the best face graph with the face model graph by updating the size and location of the graph, the geometric transformable parameters are defined. The best parameters for an optimal face graph are derived using an optimization technique. The simulation results show that the proposed algorithm can produce very good performance with recognition rate 96.7% and recognition speed 0.26 sec for FERET database.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.577-586
• /
• 2005

Many algorithms have been proposed for (ace recognition that is one of the most successful applications in image processing, pattern recognition and computer vision fields. Research for what kind of attribute of face that make harder or easier recognizing the target is going on recently. In flus paper, we propose method to improve recognition performance using relevance of face data and applied algorithms, because recognition performance of each algorithm according to facial attribute(illumination and expression) is change. In the experiment, we use n-tuple classifier, PCA and Gabor wavelet as recognition algorithm. And we propose three vectorization methods. First of all, we estimate the fitnesses of three recognition algorithms about each cluster after clustering the test data using k-means algorithm then we compose new clusters by integrating clusters that select same algorithm. We estimate similarity about a new cluster of test data and then we recognize the target using the nearest cluster. As a result, we can observe that the recognition performance has improved than the performance by a single algorithm without clustering.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.24 no.7
• /
• pp.555-561
• /
• 2014

Acoustic Emission technique is widely applied to develop the early fault detection system, and the problem about a signal processing method for AE signal is mainly focused on. In the signal processing method, envelope analysis is a useful method to evaluate the bearing problems and wavelet transform is a powerful method to detect faults occurred on rotating machinery. However, exact method for AE signal is not developed yet for the rotating machinery diagnosis. Therefore, in this paper two methods which are processed by Hilbert transform and DET for feature extraction. In addition, we evaluate the classification performance with varying the parameter from 2 to 15 for feature selection DET, 0.01 to 1.0 for the RBF kernel function of SVR, and the proposed algorithm achieved 94 % classification of averaged accuracy with the parameter of the RBF 0.08, 12 feature selection.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.35-44
• /
• 2009

The emerging notion of data stream has brought many new challenges to the research communities as a consequence of its conceptual difference with conventional concepts of just data. One typical example is data stream processing in sensor networks. The range of data processing considerations in a sensor network is very wide, from physical resource restrictions such as bandwidth, energy, and memory to the peculiarities of query processing including continuous and specific types of queries. In this paper, as one of the physical constraints in data stream processing, we consider the problem of limited memory and propose a new scheme for data stream reduction based on the Principal Component Analysis (PCA) technique. PCA can transform a number of (possibly) correlated variables into a (smaller) number of uncorrelated variables. We adapt PCA for the data stream of a sensor network assuming the cooperation of a query engine (or application) with a network base station. Our method exploits the spatio-temporal correlation among multiple measurements from different sensors. Finally, we present a new framework for data processing and describe a number of experiments under this framework. We compare our scheme with the wavelet transform and observe the effect of time stamps on the compression ratio. We report on some of the results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.403-409
• /
• 2007

Contourlet transform is an extention of the wavelet transform in two dimensions using the multiscale and directional fillet banks. The contourlet transform has the advantages of multiscale and time-frequency-localization properties of wavelets, but also provides a high degree of directionality. In this paper, we propose a face recognition system based on fusion methods using contourlet transform and PCA. After decomposing a face image into directional subband images by contourlet, features are obtained in each subband by PCA. Finally, face recognition is performed by fusion technique that effectively combines similarities calculated respectively In each local subband. To show the effectiveness of the proposed method, we performed experiments for ORL and CBNU dataset, and then we obtained better recognition performance in comparison with the results produced by conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1193-1200
• /
• 2005

In this paper, we proposed an image hiding method which decreases the amount of calculation encrypting partial data rather than the whole image data using a discrete wavelet transform and a linear scalar quantization which have been adopted as the main technique in JPEG2000 standard and then implemented the proposed algorithm to hardware. A chaotic system was used instead of encryption algorithms to reduce further amount of calculation. It uses a method of random changing method using the chaotic system of the data in a selected subband. For ciphering the quantization index it uses a novel image encryption algorithm of cyclical shifting to the right or left direction and encrypts two quantization assignment method (Top-down coding and Reflection coding), made change of data less. The experiments have been performed with the proposed methods implemented in software for about 500 images. The hardware encryption system was synthesized to find the gate-level circuit with the Samsung $0.35{\mu}m$ Phantom-cell library and timing simulation was performed, which resulted in the stable operation in the frequency above 100MHz.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.59-68
• /
• 2009

This paper addresses a hybrid multi-focus image fusion scheme using the recent curvelet transform constructions. Hybridization is obtained by combining the MS fusion rule with a novel "copy" method. The proposed scheme use MS rule to fuse the m most significant terms in spectrum of an image at each decomposition level. The scheme is dubbed in this work as m-term fusion in adherence to its use of the MSC (most significant coefficients) in the transform set at any given scale, orientation, and translation. We applied the edge-sensitive objective quality measure proposed by Xydeas and Petrovic to evaluate the method. Experimental results show that the proposed scheme is a potential alternative to the redundant, shift-invariant Dual-Tree Complex Wavelet transforms. In particular, it was confirmed that a 50% m-term fusion produces outputs with no visible quality degradation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2586-2594
• /
• 2009

A digital watermarking technique used as a protection and certifying mechanism of copyrighted creations including music, still images, and videos in terms of finding any loss in data, reproduction and pursuit. This study suggests using a selected geometric invariant point through the whole processing procedure of an image and inserting and extracting based on the invariant point so that it will be robust in a geometric transformation attack. The introduced algorithm here is based on a watershed splitting method in order to make medical images strong against RST(Rotation Scale, Translation) transformation and other processing. It also helps to maintain the watermark in images that are compressed and stored for a period of time. This algorithm also proved that is has robustness against not only JPEG compression attack, but also RST attack and filtering attack.

• Journal of Broadcast Engineering
• /
• v.8 no.4
• /
• pp.473-480
• /
• 2003

In this paper, we propose a new quadtree coding a1gorithm to improve the performance of the old one. The new algorithm can process any frame of size in standard and reduce encoding and decoding time by decreasing computational load. It also improves the image quality comparing with any old quantizer based on quadtree and zerotree structure. In order for the new algorithm to be applied for real video codec, we analyze the statistical characteristics of coefficients of differential image and add a function that makes It deal with an arbitrary size of image by using new technique while the old one process by block unit. We can also improve the image quality by scaling the coefficient's value from a differential image. By comparing the performance of the new algorithm with quadtree and SPIHT, it Is shown that PSNR is improved, that the computational load is not reduced in encoding and decoding.