• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.5
• /
• pp.243-250
• /
• 2002

In the synthesis of the current source distribution function of an array antenna with the arbitrary radiation pattern, the Woodward-Lawson sampling method has been mainly used for the synthesis of an even function lobe pattern. In this paper, the method is extended to the synthesis of the odd function pattern and then the optimum synthesis method for the nonlinear source distribution function is proposed. The proposed method is applied to the design of nonuniform transmission lines with arbitrary reflection responses. The both dispersive impedance profiles of single and coupled nonuniform lines with arbitrary reflection responses are directly synthesized by the sampled values of a reflected spectral pattern which is optimally shaped by a perturbation of its complex null positions, hence removing the conventional step-by-step segmentation process and global optimization routines. The control problem in the case that all of port impedances are identical is also solved. The generality of the proposed method is verified by a filter design with the controlled arbitrary passband

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.3
• /
• pp.95-101
• /
• 2006

A face detection plays an important role in face recognition, video surveillance, and human computer interaction. In this paper, we propose a progressive threshold method to detect human faces in real time. The consecutive face images are acquired from camera and transformed into YCbCr color space images. The skin color of the input images are separated using a skin color filter in the YCbCr color space and some candidated face areas are decided by connected component analysis. The intensity equalization is performed to avoid the effect of many circumstances and an arbitrary threshold value is applied to get binary images. The eye area can be detected because the area is clearly distinguished from others in the binary image progressive threshold method searches for an optimal eye area by progressively increasing threshold from low values. After progressive thresholding, the eye area is normalized and verified by back propagation algorithm to finalize the face detection.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1995.04a
• /
• pp.240-245
• /
• 1995

제어이론의 역사적 발전사를 고찰해보면 1930년대부터 1960년대까지를 고전 제어(classical control) 시대로 분류되고 이때 주로 사용되었던 용어들은 주파수역(frequency domain)에서 사용된 개념인 극점(pole), 영점(zero), Nyquist, 근궤적(root-Locus) 선도(plot)등으로 대표된다. 그 다음단계인 현대 제어(modern control) 시대 (1960년대-1980년대)때는 새로운 개념들이 도입 되었는데 시간역(time domain)에서 사용되는 상태공간(state-space) 모델, 가제어성(controllability), 가관측성(observability), Kalman 필터, LQG 제어 등이다. 1980년대부터 현재까지를 강인제어(robust control) 시대로 분류하는데 이것의 특징들은 극점이나 영점 대신 상태공간 모델을 사용하여 주파수역에서 정의되는 개념들인 H$_{\infty}$ 합성법, .$\mu$ 해석법, LQG/LTR 및 QFT, Lyapunov 등으로 대표된다. 현대제어시대때는 제어기 K는 공칭 플랜트 모델 G$_{0}$를 기준으로 설계되었으나 실제로 공칭 플랜트 모델은 실제 플랜트와 항상 같을 수가 없었다. 따라서 실제 플랜트 G는 G=G$_{0}$ + .DELTA.G로 표현되며 여기서 .DELTA.G는 플랜트 불 확실성(plant uncertainty), 즉 실제 플랜트와 공칭 플랜트의 차이를 나타낸 다. 이 플랜트 불확실성은 제어기가 실제 응용되어 사용되었을 때 제대로 작동하지 않는 주요 이유중에 하나이다. 이와 같은 상황에서 안정도 강인성 (stability robustness) 및 성능 강인성(performance rosubtness)의 보장은 상 당히 중요한 문제로 대두되었으며 주어진 플랜트 불확실성하에서 이러한 강이성들이 보장되는 제어이론들 중 H$_{\infty}$ 제어이론이 많이 연구/응용 되고 있다. 특히 공칭 플랜트 모델과 함께 사용되는 플랜트 모델과 함께 사용되는 플랜트 불확실성 모델은 직접적으로 성능 및 안정도에 영향을 미치므로 주의 깊게 선정해야 한다.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.455-462
• /
• 2006

Recently, the filtering approach using vector approximation such as VA-file[1] or LPC-file[2] have been proposed to support similarity search in high dimensional data space. This approach filters out many irrelevant vectors by calculating the approximate distance from a query vector using the compact approximations of vectors in database. Accordingly, the total elapsed time for similarity search is reduced because the disk I/O time is eliminated by reading the compact approximations instead of original vectors. However, the search time of the VA-file or LPC-file is not much lessened compared to the brute-force search because it requires a lot of computations for calculating the approximate distance. This paper proposes a new bitmap index structure in order to minimize the calculating time. To improve the calculating speed, a specific value of an object is saved in a bit pattern that shows a spatial position of the feature vector on a data space, and the calculation for a distance between objects is performed by the XOR bit calculation that is much faster than the real vector calculation. According to the experiment, the method that this paper suggests has shortened the total searching time to the extent of about one fourth of the sequential searching time, and to the utmost two times of the existing methods by shortening the great deal of calculating time, although this method has a longer data reading time compared to the existing vector approximation based approach. Consequently, it can be confirmed that we can improve even more the searching performance by shortening the calculating time for filtering of the existing vector approximation methods when the database speed is fast enough.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.5
• /
• pp.43-49
• /
• 1997

Generally, echo cancelers of a TV conference system or a audio conference system are to carry out a real time processing in the case of the closed room having long reverberation time because the system requires much time to modify filter coefficients to environmental changes. Therefore this paper proposes a new subband adaptive filtering method using polyphase filter banks of MPEG(Moving Picture Experts Group) audio system to solve the problems. This method divides signal spectra of input and output into several frequency bands, and each band is adaptively filtered by using ES-NLMS (Exponential Step-Normalized Least Mean Square) algorithm. The optimal number of subband is determined by computational simulations. According to the results of simulation, ERLE of the subband model is 2dB smaller than general full band, calculation rate's of the subband model is decreased about 88%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.117-123
• /
• 2018

In this study, we suggest a fast image reconstruction scheme using Poisson equation from image gradient domain. In this approach, using the Poisson equation, a guided vector field is created by employing source and target images within a selected region at the first step. Next, the guided vector is used in generating the result image. We analyze the problem of reconstructing a two-dimensional function that approximates a set of desired gradients and a data term. The joined data and gradients are able to work like modifying the image gradients while staying close to the original image. Starting with this formulation, we have a screened Poisson equation known in physics. This equation leads to an efficient solution to the problem in FFT domain. It represents the spatial filters that solve the two-dimensional screened Poisson model and shows gradient scaling to be a well-defined sharpen filter that generalizes Laplace sharpening. We demonstrate the results using a discrete cosine transformation based this Poisson model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.867-880
• /
• 2007

We derive a modified version of cubic convolution interpolation for the enlargement or reduction of digital images by arbitrary scaling factors. The proposed scaling scheme is used to resize various format pictures in the transcoding system, which transforms the bitstream compressed at a bit rate, such as the HD bitstream, into another bit rate stream. In many applications such as the transcoder, the resolution conversion is very important for changing the image size while the scaled image maintains high quality. We focus on the modification of the scaler kernel according to the relation between formats of the original and the resized image. In the modification, various formats defined in MPEG standards are considered. We show experimental results that demonstrate the effectiveness of the proposed interpolation method.

• Korean Journal of Optics and Photonics
• /
• v.9 no.4
• /
• pp.264-269
• /
• 1998

The Measurement of concentration patterns for $C_2$, CH and OH radicals in the premixed propane-air flame could be managed through an image processing technique. This technique was applied to the three kinds of flames on a bunsen burner-mixtures of fuel to be lean, optimum and excessive respectively. The image processing system was complished by treating single wavelength flame images around the eac radical luminescence band, which was obtained by using a set of narrow band pass filters, an image intensifier, CCD and PC. It was possible to observe and predict the reaction zone and the concentration distribution of the radicals, Spatial distribution of each radicals in the raaction zone gave us enough informations to analyze the reaction mechanisms in $C_mH_n$ combustion process. According to this informations, the image of $C_2$ radical exists at front zone, following the images of CH and OH radicals at downstream.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.7
• /
• pp.1122-1130
• /
• 2001

In this paper, by applying the spectral domain wavelet concept to Green function, a fast spectral domain calculation of scattered fields is proposed to get the solution for the radiation integral. The spectral domain wavelet transform to represent Green function is implemented equivalently in space via the constant-Q windowing technique. The radiation integral can be calculated efficiently in the spectral domain using the windowed Green function expanded by its eigen functions around the observation region. Finally, the same formulation as that of the conventional fast multipole method (FMM) is obtained through the windowed Green function and the spectral domain calculation of the radiation integral.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.1
• /
• pp.57-67
• /
• 2008

In this paper, we present an adaptive block matching motion estimation using optical flow. In the proposed algorithm, we calculate the temporal and spatial gradient value for each pixel value from tile differential filter, and estimate the optical flow which is used to decide the location and the size of the search region from the gradient values by least square optical flow algorithm. In particular, the proposed algorithm showed a excellent performance with fast and complex motion sequences. From the computer simulation for various motion characteristic sequences. The proposed algorithm shows a significant enhancement of PSNR over previous blocking matching algorithms.