• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.131-142
• /
• 1994

This paper analyzes the properties of such algorithm that corresponds to the nonlinear adaptive algorithm with additional update terns, parameterized by the scalar factors ${\alpha}1,\;and\;{\alpha}2$. The analysis of concergence leads to eigenvalues of the transition matrix for the mean filter coefficient vector. Regions in which the algorithm becomes stable are demonstrated. The time constant is derived and the computational complexity of the QFG algorithm is compared with those of the conventional LMS. sign, and LFG algorithm. The properties of convergence in the mean square error is derived and the neccessary condition for the CFG algorithm to be stable is attaned. In the computer simulation a channel equalization is utilized to demonstrate the performance feature of the QFG algorithm. The QFG algorithm has the more computational complexities but the faster convergence speed than LMS and LFG algorithm. Since the QFG algorithm has smoother convergence, it may be useful in case where error bursting is a problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.6017-6037
• /
• 2017

In a multi-resolution image encoding system, the image is encoded into a single file as a layer of bit streams, and then it is transmitted layer by layer progressively to reduce the transmission time across a low bandwidth connection. This encoding scheme is also suitable for multiple decoders, each with different capabilities ranging from a handheld device to a PC. In our previous work, we proposed an edge adaptive hierarchical interpolation algorithm for multi-resolution image coding system. In this paper, we enhanced its compression efficiency by adding three major components. First, its prediction accuracy is improved using context adaptive error modeling as a feedback. Second, the conditional probability of prediction errors is sharpened by removing the sign redundancy among local prediction errors by applying sign flipping. Third, the conditional probability is sharpened further by reducing the number of distinct error symbols using error remapping function. Experimental results on benchmark data sets reveal that the enhanced algorithm achieves a better compression bit rate than our previous algorithm and other algorithms. It is shown that compression bit rate is much better for images that are rich in directional edges and textures. The enhanced algorithm also shows better rate-distortion performance and visual quality at the intermediate stages of progressive image transmission.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1920-1923
• /
• 2003

This paper presents compression rate improvement for SPIHT algorithm though redundancy bit removing. Proposed SPIHT algorithm uses a method to select of optimized threshold from feature of wavelet transform coefficients and removes sign bit if coefficient of LL area. Experimental results show that the proposed algorithm achieves more improvement bit rate and more fast progressive transmission with low bit rate.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.2
• /
• pp.291-298
• /
• 2020

Sign language was designed for the deaf and dumb people to allow them to communicate with others and connect to the society. However, sign language is uncommon to the rest of the society. The unresolved communication barrier had eventually isolated deaf and dumb people from the society. Hence, this study focused on design and implementation of a wearable sign language interpreter. 6 inertial measurement unit (IMU) were placed on back of hand palm and each fingertips to capture hand and finger movements and orientations. Total of 28 proposed word-based American Sign Language were collected during the experiment, while 156 features were extracted from the collected data for classification. With the used of the long short-term memory (LSTM) algorithm, this system achieved up to 99.89% of accuracy. The high accuracy system performance indicated that this proposed system has a great potential to serve the deaf and dumb communities and resolve the communication gap.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.185-189
• /
• 1987

An analysis and design of large-scale linear multivariable systems often requires to be block triangularized form for good sensitivity of the systems when their poles and zeros are varied. But the decomposition algorithms presented up to now need a procedure of permutation, rescaling and a solution of nonlinear algebraic equations, which are usually burden. To avoid these problem, in this paper we develop a newly alternative block triangular decomposition algorithm which used the generalized matrix sign function on the Z-plane. Also, the decomposition algorithm demonstrated using the fifth order linear model of a distillation tower system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.649-655
• /
• 2009

Mean acquisition time (MAT) is the most important performance measure for code acquisition systems, where a shorter MAT implies a better code acquisition performance. Keshavarzian and Salehi proposed the multiple-shift (MS) algorithm for code acquisition in optical code division multiple access (O-CDMA) systems. Performing two steps acquisition, the MS algorithm has a shorter MAT than that of the conventional serial-search (SS) algorithm. In this paper, we propose a rapid code acquisition algorithm for O-CDMA systems. By using an efficient combination of local signals, correlation value, and the sign of correlation value, the proposed algorithm can provide a shorter MAT compared with that of the MS algorithm. The simulation results show that the proposed algorithm presents a shorter MAT than that of the MS algorithm.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.2
• /
• pp.13-24
• /
• 2008

A next generation video based car navigation is researched to supplement the drawbacks of existed 2D based navigation and to provide the various services for safety driving. The components of this navigation system could be a load object database, identification module for load lines, and crossroad identification module, etc. In this paper, we proposed the traffic lights and road sign recognition method which can be effectively exploited for crossroad recognition in video-based car navigation systems. The method uses object color information and other spatial features in the video image. The results show average 90% recognition rate from 30m to 60m distance for traffic lights and 97% at 40-90m distance for load sign. The algorithm also achieves 46msec/frame processing time which also indicates the appropriateness of the algorithm in real-time processing.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1723-1726
• /
• 2003

Clean and well maintained roadway signs are important for preserving driver's safety. The existing signs on the roadway must be periodically re-painted in order to maintain clean state. However, current sign painting operations are manually performed now. These are very slow and workers are exposed to very dangerous and hazard working environment. In this paper, we present the method for automating this job with gantry robot and spray system. In addition, we suggest two design concepts to resolve the problem that it is impractical to make the gantry system so big as to cover whole lane width. In order to show the validity of this system, the painting operation is simulated and experimentally executed.

• Journal of IKEEE
• /
• v.18 no.4
• /
• pp.485-494
• /
• 2014

Traffic Sign Recognition(TSR) is an important element in an Advanced Driver Assistance System(ADAS). However, many studies related to TSR approaches only in normal daytime environment because a sign's unique color doesn't appear in poor environment such as night time, snow, rain or fog. In this paper, we propose a new TSR algorithm based on machine learning for daytime as well as poor environment. In poor environment, traditional methods which use RGB color region doesn't show good performance. So we extracted sign characteristics using HoG extraction, and detected signs using a Support Vector Machine(SVM). The detected sign is recognized by a decision tree based on 25 reference points in a Normalized RGB system. The detection rate of the proposed system is 96.4% and the recognition rate is 94% when applied in poor environment. The testing was performed on an Intel i5 processor at 3.4 GHz using Full HD resolution images. As a result, the proposed algorithm shows that machine learning based detection and recognition methods can efficiently be used for TSR algorithm even in poor driving environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.552-554
• /
• 2019

Deaf mutism (a hearing-impaired person and speech disorders) communicates using sign language. There are difficulties in communicating by voice. However, sign language can only be limited in communicating with people who know sign language because everyone doesn't use sign language when they communicate. In this paper, a finger language translation system is proposed and implemented as a means for the disabled and the non-disabled to communicate without difficulty. The proposed algorithm recognizes the finger language data by leap motion and self-learns the data using machine learning technology to increase recognition rate. We show performance improvement from the simulation results.