• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.5
• /
• pp.335-344
• /
• 2003

The image compression based on discrete wavelet transform has been widely accepted in industry since it shows no block artifacts and provides a better image quality when compressed to low bits per pixel, compared to the traditional JPEG. The coefficients generated by discrete wavelet transform are quantized to reduce the number of code bits to represent them. After quantization, lossless coding processes are usually applied to make further reduction. This paper presents a new and efficient lossless coding algorithm for quantified wavelet coefficients based on the statistical properties of the coefficients. Combined with discrete wavelet transform and quantization processes, our algorithm has been implemented as an image compression chip, using 0.5${\mu}{\textrm}{m}$ standard cells. The experimental results show the efficiency and performance of the resulting chip.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.11-23
• /
• 2002

Computational models up to now for Korean morphology have been linear in that it deal with only segmentation of morphemes rather than formation of the internal structure of a word. When integrating a linear computational model with syntax analysis, it requires an additional interface component between this model and the syntax to bind morphemes into sentence constituents. Furthermore the linear model is not semantically intuitive. In this paper, based on word-syntactical viewpoint, we propose an integrated computational model that deals with morpheme segmentation, formation of syntactic element (sentence constituent), and even internal structure of word. Formalism of two-level morphology is employed to cope with morpheme segmentation and alternation problems, and functional diacritics are proposed to incorporate categorial context into the two-level formalism. A modified GLR-based algorithm is also proposed to check syntactical constraint of morphemes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.61-74
• /
• 2012

In this paper, we propose a illumination-robust face recognition system using MCS-LBP and 2D-PCA algorithm. A binary pattern transform which has been used in the field of the face recognition and facial expression, has a characteristic of robust to illumination. Thus, this paper propose MCS-LBP which is more robust to illumination than previous LBP, and face recognition system fusing 2D-PCA algorithm. The performance evaluation of proposed system was performed by using various binary pattern images and well-known face recognition features such as PCA, LDA, 2D-PCA and ULBP histogram of gabor images. In the process of performance evaluation, we used a YaleB face database, an extended YaleB face database, and a CMU-PIE face database that are constructed under varying lighting condition, and the proposed system which consists of MCS-LBP image and 2D-PCA feature show the best recognition accuracy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.236-241
• /
• 2009

Information integration for distributed and heterogeneous data sources is still an open challenging, and schema matching is critical in this process. This paper presents and approach to automatic elements matching between XML application schemas using similarity measure and relaxation labeling. The semantic modeling of XML application schema has also been presented. The similarity measure method considers element categories and their properties. In an effort to achieve an optimal matching, contextual constraints are used in the relaxation labeling method. Based on the semantic modeling of XML application schemas, the compatible constraint coefficients are devised in terms of the structures and semantic relationships as defined in the semantic model. To examine the effectiveness of the proposed methods, an algorithm for XML schema matching has been developed, and corresponding computational experiments show changes of calculated values.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1867-1872
• /
• 2016

In the area of digital signal processing, it is necessary to improve the quality of the speech signal after removing the background noise which exists in a various real environments. The important thing to consider when removing the background noise acoustically is that to solve the problem, depending on the information of the human auditory mechanism is mainly the amplitude spectrum of the speech signal. This paper introduces the characteristics of a frequency-weighted spectrum shaping filter for the extraction of the amplitude spectrum of the speech signal with the primary purpose. Therefore, this paper proposes an algorithm using the methods of a Wiener filter and the frequency-weighted spectrum shaping filter according to the acoustic model, after extracted the amplitude spectral information in the noisy speech signal. The spectral distortion (SD) output of the proposed algorithm is experimentally improved more than 5.28 dB compared to a conventional method.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.4
• /
• pp.424-429
• /
• 2014

This paper investigates the problem of synchronization of the Pehlivan chaotic system based on sliding mode control and GA. For this, a brief overview of the Pehlivan chaotic system is given. Then, the conventional sliding mode control technique is described and a synchronization method using GA strategy is proposed. The proposed method is that the GA searched the parameters including sliding plane and control gains) selected by the designer in the sliding mode control are searched optimally through the GA. The GA in the MATLAB Toolbox was used and simulation work is shown to illustrate the effectiveness of the synchronization schemes for the chaotic system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.48-55
• /
• 2009

Prior research works in indoor-outdoor classification have been conducted based on a simple combination of low-level features. However, since there are many challenging problems due to the extreme variability of the scene contents, most methods proposed recently tend to combine the low-level features with high-level information such as the presence of trees and sky. To extract these regions from videos, we need to conduct additional tasks, which may yield the increasing number of feature dimensions or computational burden. Therefore, an efficient indoor-outdoor scene classification method is proposed in this paper. First, the video is divided into the five same-sized blocks. Then we define and use the edge and color orientation histogram (ECOH) descriptors to represent each sub-block efficiently. Finally, all ECOH values are simply concatenated to generated the feature vector. To justify the efficiency and robustness of the proposed method, a diverse database of over 1200 videos is evaluated. Moreover, we improve the classification performance by using different weight values determined through the learning process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.519-536
• /
• 2007

In this paper, we combine the Hybrid-Automatic Repeat reQuest (HARQ) algorithm with joint Tx and Rx antenna selection based on the reliability of the individual antennas links. The cyclic redundancy check (CRC) is applied on the data before being encoded using the Turbo encoder. In the receiver the CRC is used to detect errors of each antenna stream and to decide whether a retransmission is required or not. The receiver feeds back the transmitter with the Tx antennas ordering and the acknowledgement of each antenna (ACK or NACK). If the number of ACK antennas is higher than the NACK antennas, then the retransmission takes place from the ACK antennas using the Chase Combining (CC). If the number of the NACK antennas is higher than the ACK antennas then the ACK antennas are used to retransmit the data streams using the CC algorithm and additional NACK antennas are used to retransmit the remaining streams using Incremental Redundancy (IR, i.e. the encoder rate is reduced). Furthermore, the HARQ is used with the I-BLAST (Iterative-BLAST) which grantees a high transmission rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.477-480
• /
• 2005

CMA-DD is proposed to improve the steady-state performance of CMA and its performance is depending on switching time between two modes of operation. Castro et al. who proposed a concurrent equalizer for solving problem of CMA-DD, which reduced the sensibility of switching time. However, concurrent algorithm has a problem that it keeps working after convergence. In this paper, we propose concurrent MCMA-DD equalizer combined modified CMA(MCMA) and DD mode for making better concurrent algorithm. The proposed equalizer is better than previous algorithm in convergence speed and steady-state performance. Also, the proposed algorithm decides optimum switching time using residual ISI of the equalizer output.

• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1569-1580
• /
• 2004

One commonly used approach to deal with uncertainty is Bayesian network which represents joint probability distributions of domain. There are some attempts to team the structure of Bayesian networks automatically and recently many researchers design structures of Bayesian network using evolutionary algorithm. However, most of them use the only one fittest solution in the last generation. Because it is difficult to combine all the important factors into a single evaluation function, the best solution is often biased and less adaptive. In this paper, we present a method of generating diverse Bayesian network structures through fitness sharing and combining them by Bayesian method for adaptive inference. In order to evaluate performance, we conduct experiments on learning Bayesian networks with artificially generated data from ASIA and ALARM networks. According to the experiments with diverse conditions, the proposed method provides with better robustness and adaptation for handling uncertainty.