• Journal of the Korea Society of Computer and Information
• /
• v.5 no.2
• /
• pp.60-70
• /
• 2000

As a result of remarkable developments in computer technology, the image retrieval system that can efficiently retrieve image data becomes a core technology of information-oriented society. In this paper, we implemented the Hierarchical Image Retrieval System for content-based image data retrieval. At the first level, to get color information, with improving the indexing method using color distribution characteristic suggested by Striker et al., i.e. the indexing method considering local color distribution characteristics, the system roughly classifies images through the improved method. At the second level, the system finally retrieves the most similar image from the image queried by the user using the shape information about the image groups classified at the first level. To extract the shape information, we use the Improved Moment Invariants(IMI) that manipulates only the pixels on the edges of objects in order to overcome two main problems of the existing Moment Invariant methods large amount of processing and rotation sensitiveness which can frequently be seen in the Directive Histogram Intersection technique suggested by Jain et al. Experiments have been conducted on 300 automobile images And we could obtain the more improved results through the comparative test with other methods.

• The Journal of the Korea Contents Association
• /
• v.12 no.6
• /
• pp.9-20
• /
• 2012

In computer vision, it is very important to obtain reliable corresponding feature points. However, we know it is not easy to find the corresponding feature points exactly considering by scaling, lighting, viewpoints, etc. Lots of SIFT methods applies the invariant to image scale and rotation and change in illumination, which is due to the feature vector extracted from corners or edges of object. However, SIFT could not find feature points, if edges do not exist in the area when we extract feature points along edges. In this paper, we present a new placement method of marker to improve the performance of SIFT feature detection and matching between different view of an object or scene. The shape of the markers used in the proposed method is formed in a semicircle to detect dominant direction vector by SIFT algorithm depending on direction placement of marker. We applied De Bruijn sequence for the markers direction placement to improve the matching performance. The experimental results show that the proposed method is more accurate and effective comparing to the current method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.179-191
• /
• 2013

The quincunx lattice is a non-separable sampling method in image processing. It treats the different directions more homogeneously and good frequency property than the separable two dimensional schemes. The high density discrete wavelet transformation is one that expands an N point signal to M transform coefficients with M > N. In two dimensions, this transform outperforms the standard discrete wavelet transformation in terms of shift-invariant. Although the transformation utilizes more wavelets, sampling rates are high costs. This paper proposed the high density discrete wavelet transform using quincunx sampling, which is a discrete wavelet transformation that combines the high density discrete transformation and non-separable processing method, each of which has its own characteristics and advantages. Proposed wavelet transformation can service good performance in image processing fields.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.87-95
• /
• 2006

In this paper, we propose a novel feature extraction method for face recognition, based on Discrete Cosine Transform (DCT), Energy Probability (EP), and Linear Discriminant Analysis (LDA). We define an energy probability as magnitude of effective information and it is used to create a frequency mask in OCT domain. The feature extraction method consists of three steps; i) the spatial domain of face images is transformed into the frequency domain called OCT domain; ii) energy property is applied on DCT domain that acquire from face image for the purpose of dimension reduction of data and optimization of valid information; iii) in order to obtain the most significant and invariant feature of face images, LDA is applied to the data extracted using frequency mask. In experiments, the recognition rate is 96.8% in ETRI database and 100% in ORL database. The proposed method has been shown improvements on the dimension reduction of feature space and the face recognition over the previously proposed methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.285-290
• /
• 2007

In this paper, we presents robust digital redesign (DR) method for observer-based linear time-invariant (LTI) system. The term of DR involves converting an analog controller into an equivalent digital one by considering two condition: state-matching and stability. The design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between interpolated linear operators to be matched. Also, by using the bilinear and inverse bilinear approximation method, we analyzed the uncertain parts of given observer-based system more precisely, When a sampling period is sufficiently small, the conversion of a analog structured uncertain system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the state-matching of the digitally controlled system are formulated in terms of linear matrix inequalities (LMIs).

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.1
• /
• pp.142-149
• /
• 2011

This paper presents a new state of charge(SOC) estimation of large capacity of Li-ion battery (LIB) based on the multiple model adaptive estimation(MMAE) method. We first introduce an equivalent circuit model of LIB. The relationship between the terminal voltage and the open circuit voltage(OCV) is nonlinear and may vary depending on the changes of temperature and C-rate. In this paper, such behaviors are described as a set of multiple linear time invariant impedance models. Each model is identified at a temperature and a C-rate. These model set must be obtained a priori for a given LIB. It is shown that most of impedances can be modeled by first-order and second-order transfer functions. For the real time estimation, we transform the continuous time models into difference equations. Subsequently, we construct the model banks in the manner that each bank consists of four adjacent models. When an operating point of cell temperature and current is given, the corresponding model bank is directly determined so that it is included in the interval generated by four operating points of the model bank. The MMAE of SOC at an arbitrary operating point (T $^{\circ}C$, $I_{bat}$[A]) is performed by calculating a linear combination of voltage drops, which are obtained by four models of the selected model bank. The demonstration of the proposed method is shown through simulations using DUALFOIL.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.495-504
• /
• 2008

Aspect Oriented Programming(AOP) is a relatively new programming paradigm and has properties that other programming paradigms don't have. This new programming paradigm provides new modularization of software systems by cross-cutting concerns. In this paper, we propose a regression test method for program evolution by AOP. By using JoinPoint, we can catch a pointcut-name which makes it possible to test the incorrect pointcut strength fault and the incorrect aspect precedence fault. Through extending proof rules to aspect, we can recognize failures to establish expected postconditions faults. We can also trace variables using set() and get() pointcut and test failures to preserve state invariant fault. Using control flow graph, we can test incorrect changes in control dependencies faults. In order to show the correctness of our proposed method, channel management system is implemented and tested by using proposed methods.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.3
• /
• pp.156-162
• /
• 2018

The LMF (Least Mean Fourth) algorithm is well known for its fast convergence and low steady-state error especially in non-Gaussian noise environments. Recently, there has been increasing interest in the LMS (Least Mean Square) algorithms with self-adjusted step size. It is because the self-adjusted step-size LMS algorithms have shown to outperform the conventional fixed step-size LMS in the various situations. In this paper, a self-adjusted step-size LMF algorithm is proposed, which adopts an averaged gradient based step size as a self-adjusted step size. It is expected that the proposed algorithm also outperforms the conventional fixed step-size LMF. The superiority of the proposed algorithm is confirmed by the simulations in the time invariant and time variant channels.

• Progress in Medical Physics
• /
• v.7 no.1
• /
• pp.9-17
• /
• 1996

The response function of ionization chambers are measured in the narrow radiation field Nominal photon energies are 4MV, 6MV and 15MV. the Radii of the chambers are 0.5cm～3.05cm and the field size is 0.2$\times$20$\textrm{cm}^2$. The measurements are taken in the water phantom at 10cm depth. The beam kernel (radiation distribution profile) for narrow radiation field in the phantom are obtained from Monte Carlo simulation (EGS4, Electron Gamma Shower 4). The beam kernel components in the measured chamber response function are deconvolved in order to get the ideal chamber response function of the $\delta$-shaped function radiation field. The chamber response functions have energy dependent tendency before deconvolution, while they show energy invariant properties, after the components of beam kernels are removed by deconvolution method.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.203-211
• /
• 2005

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps; preprocessing, classification, and matching, in the classification. we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.