• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.6
• /
• pp.1048-1057
• /
• 2008

This paper represents a design method for PID or low-order controllers cascaded with a linear plant in the unit feedback system where it is required to meet the given time response specifications such as overshoot and settling time. This problem is difficult to solve because the zeros of the controller appear in the numerator of the overall system and thus those zeros may make the time response design difficult. In this paper, we propose a new approach based on the partial model matching and the so called K-polynomial. The partial matching problem is formulated to an optimization problem in which a quadratic function of coefficient errors between a target model and the resulting closed loop system is minimized. For the sake of satisfying the closed loop stability, a set of quadratic constraints associated with the cost function is introduced. As a result, the controller designed meets both time response requirements and the closed loop stability, if any. It is shown through several examples that the present method can be easily applied to these problems.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.6
• /
• pp.716-723
• /
• 2019

Fingerprint matching accuracy is essential in deploying a music search service. This paper deals with a method to improve fingerprint matching accuracy by utilizing an auxiliary information which is called power weight. Power weight is an expected robustness of each hash bit. While the previous power mask binarizes the expected robustness into strong and weak bits, the proposed method utilizes a real-valued function of the expected robustness as weights for fingerprint matching. As a countermeasure to the increased storage cost, we propose a compression method for the power weight which has strong temporal correlation. Experiments on the publicly-available music datasets confirmed that the proposed power weight is effective in improving fingerprint matching performance.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1115-1127
• /
• 2010

In order to increase the productivity in manufacturing TFT-LCD(thin film transistor-liquid crystal display), it is essential to classify defects that occur during the production and make an appropriate decision on whether the product with defects is scrapped or not. The decision mainly depends on classifying the defects accurately. In this paper, we present an effective classification method for film defects acquired in the panel production line by analyzing the intensity distribution and shape feature of the defects. We first generate a binary image for each defect by separating defect regions from background (non-defect) regions. Then, we extract various features from the defect regions such as the linearity of the defect, the intensity distribution, and the shape characteristics considering intensity, and construct a referential image database that stores those feature values. Finally, we determine the type of a defect by matching a defect image with a referential image in the database through the matching cost function between the two images. To verify the effectiveness of our method, we conducted a classification experiment using defect images acquired from real TFT-LCD production lines. Experimental results show that our method has achieved highly effective classification enough to be used in the production line.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.530-535
• /
• 2007

Disparity space image (DSI) technique is a method of establishing correspondence between a pair of images. It has a merit of generating a dense disparity map for each pixel. DSI has a cost function to be minimized, and it needs empirical weighting factors for occlusion penalty and match reward. This paper provides theoretical basis for the weighting factors, which depend on image noise and contrast between an object and background.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.707-714
• /
• 2002

This paper presents a real-time Hausdorff matching algorithm for tracking of moving object acquired from an active camera. The proposed method uses the edge image of object as its model and uses Hausdorff distance as the cost function to identify hypothesis with the model. To enable real-time processing, a high speed approach to calculate Hausdorff distance and half cross matching method to improve performance of existing search methods are also presented. the experimental results demonstrate that the proposed method can accurately track moving object in real-time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.121-127
• /
• 2010

This paper relates with the improved CMA blind adaptive equalization algorithm which uses the constellation matching method that improve the inverse modelling efficiency of a communication channel compared to the present CMA blind adaptive equalizer. The amplitude distortion can be compensated in the present CMA blind adaptive equalizer which is used for the reduction of intersymbol interference by distortion that generate such as a band limited wireless mobile channel, but in the improved adaptive alogorithm operates with the minimize the amplitude phase distortion in the output of equalizer by applying the cost function that is composition of additional signal constellation matching error terms. In order to evaluation of the inverse modeling efficiency of improved algorithm, the residual intersymbol interference and recovered signal constellation were compared by computer simulation. As a result of comparion of computer simulation, the improved algorithm has a good stability in the residual intersymbol interference in the steady state, but it has a slow convergence rate in the adaptation state in initial state.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.12-18
• /
• 2012

Stereo correspondence is the central problem of stereo vision. In this paper, we propose a stereo matching scheme based on a genetic algorithm using a multi-resolution method and AD-Census. The proposed approach considers the matching environment as an optimization problem and finds the disparity by using a genetic algorithm And adaptive chronosome structure using edge pixels and crossover mechanism are employed in this technique. A cost function is composes of certain constraints whice are commonly used in stereo matching. AD-Census measure is applied to reduce disparity error. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement using local feature vector. We valid our method not only reduces the search time for correspondence compared with conventional GA-based method but also ensures the validity of matching.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.79-84
• /
• 2019

This paper compare the performance of CM-MMA (Constellation Matching-MMA) and RMMA (Region-based MMA) blind equalization algorithm for improve the QoS by minimizing the intersymbol interference that is occurred in nonlinear communication channel when transmitting the QAM signal. In the tap coefficient update for adaptive, CM-MMA use the error of nonconstant modulus signal adding the current MMA cost fuction and constellation matching error terms of sinusoidal power function, and the RMMA use the error by transfoms the nonconstant modulus signal of equalizer output constellation to 4-QAM constant modulus signal. They has different equalization performance by these error signal, it were compared in this paper by simulation, and performance index such as output signal constellation of equalizer, residual isi, maximum distortion, SER curves are applied for this. As a result of computer simulation, the RMMA has more better performance in the every performance index, convergence speed, residual value, noise robustness compared to CM-MMA.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.360-365
• /
• 1993

In this paper, we propose a new design procedure of the Robust Model Matching(RM) using the Normalized Left Coprime Factorization (NLCF) approach. The RMM aims at reducing the sensitivity of a given control system, but standard design procedures are not for robust stability. Therefore we try applying the robust stability condition based on NLCF to RMM procedure. We first formulate the RMM using the robust stability condition of NLCF approach, then we propose the new procedure of the RMM. The point is that the condition includes the measure of sensitivity of the RMM. In the proposed procedure, a cost function is determined through the condition and solved by H$_{\infty}$ contro technique. Finally we show a design example and check the performance..

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.529-532
• /
• 1988

This paper proposes a graph matching algorithm based on simulated annealing, which assures the globally optimal solution for circuit partitioning for the placement in the rectilinear region occurring as a result of the pre-placement of some macro cells, or onto the nonplanar surface in some military or space applications. The circuit graph ($G_{C}$) denoting the circuit topology is formed by a hierarchical bottom-up clustering of cells, while another graph called region graph ($G_{R}$) represents the geometry of a planar rectilinear region or a nonplanar surface for circuit placement. Finding the optimal many-to-one vertex mapping function from $G_{C}$ to $G_{R}$, such that the total mismatch cost between two graphs is minimal, is a combinatorial optimization problem which was solved in this work for various examples using simulated annealing.