• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.3
• /
• pp.1-10
• /
• 2010

In this paper, we propose a novel way of combining color demosaicing and the auto white balance (AWB) method, which are important parts of image processing. Performance of the AWB is generally affected by demosaicing results because most AWB algorithms are performed posterior to color demosaicing. In order to increase the performance and efficiency of the AWB algorithm, the color constancy problem is considered during the color demosaicing step. Initial estimates of the directional luminance and chrominance values are defined for estimating edge direction and calculating the AWB gain. We propose a modified edge-based AWB method that used a pre-defined achromatic region. The estimation of edge direction is performed region adaptively by using the local statistics of the initial estimates of the luminance and chrominance information. The proposed method shows significant improvements in terms of visual and numerical criteria when compared to conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.58-64
• /
• 2016

In this paper presents Robust k-means clustering-based high-speed bar code decoding method to blur and lighting. for fast operation speed and robust decoding to blur, proposed method uses adaptive local threshold binarization methods that calculate threshold value by dividing blur region and a non-blurred region. Also, in order to prevent decoding fail from the noise, decoder based on k-means clustering algorithm is implemented using area data summed pixel width line of the same number of element. Results of simulation using samples taken at various worst case environment, the average success rate of proposed method is 98.47%. it showed the highest decoding success rate among the three comparison programs.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.477-486
• /
• 2008

Facial expression, which changes face geometry, usually has an adverse effect on the performance of a face recognition system. To improve the face recognition rate, we propose a normalization method of facial expression to diminish the difference of facial expression between probe and gallery faces. Two approaches are used to facial expression modeling and normalization from single still images using a generic facial muscle model without the need of large image databases. The first approach estimates the geometry parameters of linear muscle models to obtain a biologically inspired model of the facial expression which may be changed intuitively afterwards. The second approach uses RBF(Radial Basis Function) based interpolation and warping to normalize the facial muscle model as unexpressed face according to the given expression. As a preprocessing stage for face recognition, these approach could achieve significantly higher recognition rates than in the un-normalized case based on the eigenface approach, local binary patterns and a grey-scale correlation measure.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1254-1259
• /
• 2010

In this paper, Low Computational Adaptive Expanded Block Search Motion Estimation Method is proposed. Proposed method classifies ME blocks as Average Motion Block(AMB) and Local Motion Block(LMB) according to correlation of reference frame. It could reduce the computational complexity with performing Modified Fast Search(MFS). And accuracy of MV is also increased by 4 sub-blocks on LMB and Block Expansion(BE). The experimental results show that the proposed method has better performance that increased 1.8dB than Diamond Search and 0.6dB than Full Search with 7.5 % computation of Full Search. The proposed method could be applied to video compression and Frame Rate Conversion(FRC).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2369-2381
• /
• 1999

In this paper, we propose an iterative algorithm for reducing the blocking artifact in block transform-coded images by using a wavelet transform. In the proposed method, an image is considered as a set of one-dimensional horizontal and vertical signals and one-dimensional wavelet transform is utilized in which the mother wavelet is the first order derivative of a Gaussian like function. The blocking artifact is reduced by removing the blocking component, that causes the variance at the block boundary position in the first scale wavelet domain to be abnormally higher than those at the other positions, using a minimum mean square error (MMSE) filter in the wavelet domain. This filter minimizes the MSE between the ideal blocking component-free signal and the restored signal in the neighborhood of block boundaries in the wavelet domain. It also uses local variance in the wavelet domain for pixel adaptive processing. The filtering and the projection onto a convex set of quantization constraint are iteratively performed in alternating fashion. Experimental results show that the proposed method yields not only a PSNR improvement of about 0.56-1.07 dB, but also subjective quality nearly free of the blocking artifact and edge blur.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.121-130
• /
• 2005

In this paper, we propose a feature extraction method for iris recognition using wavelet transforms. The wavelet transform is fast and has a good localization characteristic. In particular, the low frequency band can be used as an effective feature vector. In iris recognition, the noise caused by eyelid the eyebrow, glint, etc may be included in iris. The iris pattern is distorted by noises by itself, and a feature extraction algorithm based on filter such as Wavelets, Gabor transform spreads noises into whole iris region. Namely, such noises degrade the performance of iris recognition systems a major problem. This kind of noise has adverse effect on performance. In order to solve these problems, we propose to divide the iris image into a number of sub-region and apply the wavelet transform to each sub-region. Experimental results show that the performance of proposed method is comparable to existing methods using Gabor transform and region division noticeably improves recognition performance. However, it is noted that the processing time of the wavelet transform is much faster than that of the existing methods.

• Journal of Broadcast Engineering
• /
• v.25 no.5
• /
• pp.672-684
• /
• 2020

Restoring a low resolution and motion blurred light field has become essential due to the growing works on parallax-based image processing. These tasks are known as light-field enhancement process. Unfortunately, only a few state-of-the-art methods are introduced to solve the multiple problems jointly. In this work, we design a framework that jointly solves light field spatial super-resolution and motion deblurring tasks. Particularly, we generate a straight-forward neural network that is trained under low-resolution and 6-degree-of-freedom (6-DOF) motion-blurred light field dataset. Furthermore, we propose the strategy of local region optimization on the adversarial network to boost the performance. We evaluate our method through both quantitative and qualitative measurements and exhibit superior performance compared to the state-of-the-art methods.

• Journal of Biomedical Engineering Research
• /
• v.26 no.6
• /
• pp.357-363
• /
• 2005

Active contour models have been extensively used to segment, match, and track objects of interest in computer vision and image processing applications, particularly to locate object boundaries. With conventional methods an object boundary can be extracted by controlling the internal energy and external energy based on energy minimization. However, this still leaves a number of problems, such as initialization and poor convergence in concave regions. In particular, a contour is unable to enter a concave region based on the stretching and bending characteristic of the internal energy. Therefore, this study proposes a method that controls the internal energy by moving the local perpendicular bisector point of each control point on the contour, and determines the object boundary by minimizing the energy relative to the external energy. Convergence at a concave region can then be effectively implemented as regards the feature of interest using the internal energy, plus several objects can be detected using a multi-detection method based on the initial contour. The proposed method is compared with other conventional methods through objective validation and subjective consideration. As a result, it is anticipated that the proposed method can be efficiently applied to the detection of the pulmonary parenchyma region in medical images.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.211-218
• /
• 2011

Because antique Korean Peninsula maps have many historical signification, we can estimate historical evidences by analyzing them. However, it is very difficult to compare antique maps with modern maps because the antique maps were made by arranging local regions. To resolve this difficulty, we transform antique maps by rotating, scaling and translating to compare with a reference map. Each antique map is rotated in the difference of principal axis angles of the target and the reference maps, and its width and height are scaled asymmetrically using width and height ratios of bounding boxes. Finally, the two regions are overlaid by adjusting their centroids, and then the antique map is evaluated by two similarity equations. Experimental results show that the similarities of region ratio and different angle are properly computed according to era. Therefore, the proposed method can be widely used to analyze the antique Korean Peninsula maps.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.321-330
• /
• 2002

A 2-D median filter has many applications in various image and video signal processing areas. The rapid development in VLSI technology makes it possible to implement a real-time or near real-time 2-D median filter with reasonable cost. For the efficient VLSI implementation, the algorithm should have characteristics such as small memory requirements, regular computations, and local data transfers. This paper presents an architecture of the real-time two-dimensional separable median filter which has appropriate characteristics for the VLSI implementation. For the efficient two-dimensional median filter, a separable two-dimensional median filtering structure and a bit-sliced pipelined median searching algorithm are used. A behavioral simulator is implemented with C language and used for the analysis of the presented architecture.