• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2655-2663
• /
• 2011

Several algorithms have been developed to detect AF which rely either on the form of P waves or the based on the time frequency domain analysis of RR variability. However, locating the P wave fiducial point is very difficult because of the low amplitude of the P wave and the corruption by noise. Also, the time frequency domain analysis of RR variability has disadvantage to get the details of irregular RR interval rhythm. In this study, we describe an atrial fibrillation detection algorithm through non-linear analysis of irregular RR interval rhythm based on the variability, randomness and complexity. We employ a new statistical techniques root mean squares of successive differences(RMSSD), turning points ratio(TPR) and sample entropy(SpEn). The detection algorithm was tested using the optimal threshold on two databases, namely the MIT-BIH Atrial Fibrillation Database and the Arrhythmia Database. We have achieved a high sensitivity(Se:94.5%), specificity(Sp:96.2%) and Se(89.8%), Sp(89.62%) respectively.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.25 no.1
• /
• pp.92-102
• /
• 2017

For an automotive surveillance radar system, fast-chirp train based FMCW (Frequency Modulated Continuous Wave) radar is a very effective method, because clutter and moving targets are easily separated in a 2D range-velocity map. However, pedestrians with low echo signals may be masked by strong clutter in actual field. To address this problem, we proposed in the previous work a clutter cancellation and moving target indication algorithm using the coherent phase method. In the present paper, we initially composed the test set-up using a 24 GHz FMCW transceiver and a real-time data logging board in order to verify this algorithm. Next, we created two indoor test environments consisting of moving human and stationary targets. It was found that pedestrians and strong clutter could be effectively separated when the proposed method is used. We also designed and implemented these algorithms in FPGA (Field Programmable Gate Array) in order to analyze the hardware and time complexities. The results demonstrated that the complexity overhead was nearly zero compared to when the typical method was used.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.913-917
• /
• 2009

Flash memories have asymmetric I/O costs for read and write in terms of latency and energy consumption. However, the ratio of these costs is dependent on the type of storage. Moreover, it is becoming more common to use two flash memories on a system as an internal memory and an external memory card. For this reason, buffer cache replacement algorithms should consider I/O costs of device as well as possibility of reference. This paper presents WWCLOCK(Write-Weighted CLOCK) algorithm which directly uses I/O costs of devices along with recency and frequency of cache blocks to selecting a victim to evict from the buffer cache. WWCLOCK can be used for wide range of storage devices with different I/O cost and for systems that are using two or more memory devices at the same time. In addition to this, it has low time and space complexity comparable to CLOCK algorithm. Trace-driven simulations show that the proposed algorithm reduces the total I/O time compared with LRU by 36.2% on average.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1789-1798
• /
• 2012

IEEE 802.15.4a standard can provide a variety of location-based services for ZigBee or wireless network applications by adapting the time-of-arrival (TOA) ranging technique. The non-line-of-sight (NLOS) condition is the critical problem in the IEEE 802.15.4a networks, and it can significantly degrade the performance of the TOA-based localization. To enhance the location accuracy due to the NLOS problem, this paper proposes an energy-efficient low complexity localization algorithm. The proposed approach performs the ranging with the multicast method, which can reduce the message overhead due to packet exchanges. By limiting the search region for the location of the node, the proposed approach can enhance the location accuracy. Experimental results show that the proposed algorithm outperforms previous algorithms in terms of the energy consumption and the localization accuracy.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.45-50
• /
• 2010

An image interpolation is a technique to use for enhancement of image resolution, it have two problems which are image quality degradation of the interpolated result image and high computation complexity. In this paper, to solve the problem, we propose an image interpolation algorithm using loss information estimation and implement the proposed method on portable device. From reduction image of obtained low resolution image, the proposed method can computes error to use image interpolated and estimate loss information by interpolation of the computed error. The estimated loss information is added to interpolated high resolution image with weight factor. We verified that the proposed method has improved FSNR as 2dB than conventional algorithms by experiments. Also, we implemented the proposed method on portable device and checked up real-time action. The proposed algorithm may be helpful for various application for image enlargement and reconstruction.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.5
• /
• pp.58-65
• /
• 2007

As multimedia portable devices become popular, the amount of computation for processing data including video compression has significantly increased. Various researches for low power consumption of the mobile devices and real time processing have been reported. Motion Estimation is responsible for 67% of H.264 encoder complexity. In this research, a new circuit is designed for motion estimation. The new circuit uses motion prediction based on approximate SAD, Alternative Row Scan (ARS), DAU, and FDVS algorithms. Our new method can reduce the amount of computation by 75% when compared to multi-frame motion estimation suggested in JM8.2. Furthermore, optimal number and size of reference frame blocks are determined to reduce computation without affecting the PSNR. The proposed Motion Estimation method has been verified by using the hardware and software Co-Simulation with iPROVE. It can process 30 CIF frames/sec at 50MHz.

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.841-851
• /
• 2013

The infectious information hiding system(IIHS) is proposed for secure distribution of high quality video contents by applying optimized watermark embedding and detection algorithms to video codecs. And the watermark as infectious information is transmitted while target video is displayed or edited by codecs. This paper proposes a fast and effective reversible watermarking and infectious information generation for IIHS. Our reversible watermarking scheme enables video decoder to control video quality and watermark strength actively for by adding control code and expiration date with the watermark. Also, we designed our scheme with low computational complexity to satisfy it's real-time processing in a video codec, and to prevent time or frame delay during watermark detection and video restoration, we embedded one watermark and one side information within a macro-block. Experimental results verify that our scheme satisfy real-time watermark embedding and detection and watermark error is 0% after reversible watermark detection. Finally, we conform that the quality of restored video contens is almost same with compressed video without watermarking algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.676-684
• /
• 2008

In digital video broadcasting-terrestrial (DVB-T), which is the European digital terrestrial television standard, the orthogonal frequency division multiplexing (OFDM) has been adopted for signal transmission. The main reasons using OFDM are to increase the robustness against the frequency selective fading and impulse noise, and to use available bandwidth efficiently. However, channel variation within an OFDM symbol destroys orthogonality between subcarriers, resulting in inter-carrier interference (ICI), which increases an error floor in proportional to maximum Doppler spread. This paper provides an ICI analysis in both time and frequency domains while existing literatures analyze the ICI effects mainly in frequency domain and proposes the algorithms that estimate the channel impulse response and channel variation using least square (LS) algorithm which is the most simple channel estimation technique. And we propose adaptive channel estimation algorithm that estimates the velocity of terminals. The simulation results show that proposed algorithm has similar performance with about 1.5% computational complexity of noise and ICI reduction LS algorithm in low speed environments.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.147-155
• /
• 2005

For the last several decades, many researches have been performed to distribute bandwidth fairly between sessions. In this problem, the most important challenge is to realize a scalable implementation and high fairness simultaneously. Here high fairness means that bandwidth is distributed fairly even in short time intervals. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low fairness. In this paper, we propose a scheduling algorithm that can achieve feasible fairness without losing scalability. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR). While H-DRR requires a constant time for implementation, the achievable fairness is similar to that of Packet-by-Packet Generalized Processor Sharing(PGPS) algorithm. PGPS has worse scalability since it uses a sorted-priority queue requiring O(log N) implementation complexity where N is the number of sessions.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.6_1
• /
• pp.545-555
• /
• 2007

3D buildings are the most prominent feature comprising urban scene. A few of mega-cities in the globe are virtually reconstructed in photo-realistic 3D models, which becomes accessible by the public through the state-of-the-art online mapping services. A lot of research efforts have been made to develop automatic reconstruction technique of large-scale 3D building models from remotely sensed data. However, existing methods still produce irregular building polygons due to errors induced partly by uncalibrated sensor system, scene complexity and partly inappropriate sensor resolution to observed object scales. Thus, a geometric regularization technique is urgently required to rectify such irregular building polygons that are quickly captured from low sensory data. This paper aims to develop a new method for regularizing noise building outlines extracted from airborne LiDAR data, and to evaluate its performance in comparison with existing methods. These include Douglas-Peucker's polyline simplication, total least-squared adjustment, model hypothesis-verification, and rule-based rectification. Based on Minimum Description Length (MDL) principal, a new objective function, Geometric Minimum Description Length (GMDL), to regularize geometric noises is introduced to enhance the repetition of identical line directionality, regular angle transition and to minimize the number of vertices used. After generating hypothetical regularized models, a global optimum of the geometric regularity is achieved by verifying the entire solution space. A comparative evaluation of the proposed geometric regulator is conducted using both simulated and real building vectors with various levels of noise. The results show that the GMDL outperforms the selected existing algorithms at the most of noise levels.