• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.358-360
• /
• 2004

The digital images contain a significant amount of redundancy and require a large amount of data for their storage and transmission. Therefore, the image compression is necessary to treat digital images efficiently. The goal of image compression is to reduce the number of bits required for their representation. The image compression can reduce the size of image data using contractive mapping of original image. Among the compression methods, the mapping is affine transformation to find the block(called range block) which is the most similar to the original image. In this paper, we applied the neural network(SOM) in encoding. In order to improve the performance of image compression, we intend to reduce the similarities and unnecesaries comparing with the originals in the codebook. In standard image coding, the affine transform is performed with eight isometries that used to approximate domain blocks to range blocks.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2516-2518
• /
• 2004

This paper proposes a stability condition in discrete-time affine Takagi-Sugeno (T-S) fuzzy systems with parametric uncertainties and then, introduces the design method of a fuzzy-model-based controller which guarantees the stability. The analysis is based on Lyapunov functions that are continuous and piecewise quadratic. The search for a piecewise quadratic Lyapunov function can be represented in terms of linear matrix inequalities (LMIs).

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.1
• /
• pp.42-47
• /
• 2014

This paper investigates an adaptive approximation design problem for the tracking control of output-constrained non-affine pure-feedback systems. To satisfy the desired performance without constraint violation, we employ a barrier Lyapunov function which grows to infinity whenever its argument approaches some limits. The main difficulty in dealing with pure-feedback systems considering output constraints is that the system has a non-affine appearance of the constrained variable to be used as a virtual control. To overcome this difficulty, the implicit function theorem and mean value theorem are exploited to assert the existence of the desired virtual and actual controls. The function approximation technique based on adaptive neural networks is used to estimate the desired control inputs. It is shown that all signals in the closed-loop system are uniformly ultimately bounded.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.3
• /
• pp.238-243
• /
• 2010

A new implementation method for MPDSAP(Maximally Polyphase Decomposed Subband Affine Projection) adaptive filter is proposed. The affine projection(AP) adaptive filter achieves fast convergence speed, however, its implementation is so expensive because of the matrix inversion for a weight-updating of adaptive filter. The maximally polyphase decomposed subband filtering allows the AP adaptive filter to avoid the matrix inversion, moreover, by using a pipelining technique, the simple subband structured AP is suitable for VLSI implementations concerning throughput, power dissipation and area. Computer simulations are presented to verify the performance of the proposed algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.7
• /
• pp.547-555
• /
• 2003

This paper presents an adaptive control against uncertainties in tail-controlled STT (Skid-to-Turn) missiles. We derive an analytic uncertainty model from a parametric affine missile model developed by the authors. Based on this analytic model, an adaptive feedback linearizing control law accompanied by a sliding mode control law is proposed. We provide analyses of stability and output tracking performance of the overall adaptive missile system. The performance and validity of the proposed adaptive control scheme are demonstrated by simulation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.410-416
• /
• 2003

In the affine projection algorithm(APA), the projection dimension depends on a number of projection basis and of elements of input vector used for updating of coefficients of the adaptive filter. The projection dimension is closely related to a convergence speed of the APA, and it determines computational complexity. As the adaptive filter approaches to steady state, convergence speed is decreased. Therefore it is possible to reduce projection dimension that determines convergence speed. In this paper, we proposed the variable dimension affine projection algorithm (VDAPA) that controls the projection dimension and uses the relation between variations of coefficients of the adaptive filter and convergence speed of the APA. The proposed method reduces computational complexity of the APA by modifying the number of projection basis on convergence state. For demonstrating the good performances of the proposed method, simulation results are compared with the APA and normalized LMS algorithm in convergence speed and computational quantity.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.4
• /
• pp.484-490
• /
• 2012

In this paper, we design a digitally pre-distorted RF power amplifier operating in 900 MHz band. The linearity of RF power amplifier is improved by employing the digital pre-distortion(DPD) based on affine projection(AP) algorithm, where the look-up table(LUT) method is used with non-linear indexing. The proposed DPD with AP algorithm is compared with that with normalized least mean square(NLMS) algorithm, applied to the RF power amplifier. A commercial power amplifier module is used for verification of the proposed algorithm which shows improvement of adjacent channel leakage ratio(ACLR) by about 21 dB.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.375-380
• /
• 2014

Under controlled environment, such as fixed viewpoints or consistent illumination, the performance of face recognition is usually high enough to be acceptable nowadays. Face recognition is, however, a still challenging task in real world. SIFT(Scale Invariant Feature Transformation) algorithm is scale and rotation invariant, which is powerful only in the case of small viewpoint changes. However, it often fails when viewpoint of faces changes in wide range. In this paper, we use Affine SIFT (Scale Invariant Feature Transformation; ASIFT) to detect affine invariant local descriptors for face recognition under wide viewpoint changes. The ASIFT is an extension of SIFT algorithm to solve this weakness. In our scheme, ASIFT is applied only to gallery face, while SIFT algorithm is applied to probe face. ASIFT generates a series of different viewpoints using affine transformation. Therefore, the ASIFT allows viewpoint differences between gallery face and probe face. Experiment results showed our framework achieved higher recognition accuracy than the original SIFT algorithm on FERET database.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.42 no.6
• /
• pp.15-22
• /
• 2005

In this paper, we propose a PID-PD controller and its tuning method to be modified form of PID controller that consist of the affine set of PID and PI-PD controller by analyzing relation between these controllers. The proposed tuning method controls the closed-loop system to locate between the step responses of system controlled by PID and PI-PD controller. The controller is designed by the optimum tuning method to minimize the proposed specific cost functions. Its effectiveness is examined by the case studies and their analysis.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.367-370
• /
• 2005

This paper proposes a novel method for content-based watermarking based on feature points of an image. At each feature point, watermark is embedded after affine normalization according to the local characteristic scale and orientation. The characteristic scale is the scale at which the normalized scale-space representation of an image attains a maximum value, and the characteristic orientation is the angle of the principal axis of an image. By binding watermarking with the local characteristics of an image, resilience against affine transformations can be obtained. Experimental results show that the proposed method is robust against various image processing steps including affine transformations, cropping, filtering, and JPEG compression.