• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.77-84
• /
• 2012

Face classification has wide applications in intelligent video surveillance, content retrieval, robot vision, and human-machine interface. Pose and expression changes, and arbitrary illumination are typical problems for face recognition. When the face is captured at a distance, the image quality is often degraded by blurring and noise corruption. This paper investigates the efficacy of multi-classifier decision level fusion for face classification based on the photon-counting linear discriminant analysis with two different cost functions: Euclidean distance and negative normalized correlation. Decision level fusion comprises three stages: cost normalization, cost validation, and fusion rules. First, the costs are normalized into the uniform range and then, candidate costs are selected during validation. Three fusion rules are employed: minimum, average, and majority-voting rules. In the experiments, unfocusing and motion blurs are rendered to simulate the effects of the long distance environments. It will be shown that the decision-level fusion scheme provides better results than the single classifier.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.47-55
• /
• 2012

In this paper, we propose a method to reconstruct accurate 3D shape object by using multi-view images which are disturbed by motion blur. In multi-view deblurring, more precise PSF estimation can be done by using the geometric relationship between multi-view images. The proposed method first estimates initial 2D PSFs from individual input images. Then 3D PSF candidates are projected on the input images one by one to find the best one which are mostly consistent with the initial 2D PSFs. 3D PSF consists with direction and density and it represents the 3D trajectory of object motion. 야to restore 3D shape by using multi-view images computes the similarity map and estimates the position of 3D point. The estimated 3D PSF is again projected to input images and they replaces the intial 2D PSFs which are finally used in image deblurring. Experimental result shows that the quality of image deblurring and 3D reconstruction improves significantly compared with the result when the input images are independently deblurred.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.6
• /
• pp.84-90
• /
• 2020

As the uploading and downloading of data through the Internet is becoming more common, data including personal information are easily exposed to unauthorized users. In this study, we detect a target area in images that contain personal information, except for the background, and we protect the detected target area by using a blocking method suitable for the surrounding situation. In this method, only the target area from color image input containing personal information is segmented based on skin color. Subsequently, blurring of the corresponding area is performed in multiple stages based on the surrounding situation to effectively block the detected area, thereby protecting the personal information from being exposed. Experimental results show that the proposed method blocks the object region containing personal information 2.3% more accurately than an existing method. The proposed method is expected to be utilized in fields related to image processing, such as video security, target surveillance, and object covering.

• The Journal of the Korea Contents Association
• /
• v.14 no.12
• /
• pp.555-564
• /
• 2014

The boundary noise in image syntheses using DIBR consists of noisy pixels that are separated from foreground objects into background region. It is generated mainly by edge misalignment between the reference image and depth map or blurred edge in the reference image. Since hole areas are generally filled with neighboring pixels, boundary noise adjacent to the hole is the main cause of quality degradation in synthesized images. To solve this problem, a new boundary noise removal algorithm using a preprocessing of the depth map is proposed in this paper. The most common way to eliminate boundary noise caused by boundary misalignment is to modify depth map so that the boundary of the depth map can be matched to that of the reference image. Most conventional methods, however, show poor performances of boundary detection especially in blurred edge, because they are based on a simple boundary search algorithm which exploits signal gradient. In the proposed method, a two-step hierarchical approach for boundary detection is adopted which enables effective boundary detection between the transition and background regions. Experimental results show that the proposed method outperforms conventional ones subjectively and objectively.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.10
• /
• pp.454-460
• /
• 2020

In recent years, the rapid increases in video distribution and viewing over the Internet have increased the risk of personal information exposure. In this paper, a method is proposed to robustly identify areas in images where a person's privacy is compromised and simultaneously blocking the object area by blurring it while rapidly tracking it using a prediction algorithm. With this method, the target object area is accurately identified using artificial neural network-based learning. The detected object area is then tracked using a location prediction algorithm and is continuously blocked by blurring it. Experimental results show that the proposed method effectively blocks private areas in images by blurring them, while at the same time tracking the target objects about 2.5% more accurately than another existing method. The proposed blocking method is expected to be useful in many applications, such as protection of personal information, video security, object tracking, etc.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.10
• /
• pp.1255-1261
• /
• 2020

Currently, the spread of mobile devices is gradually increasing. Accordingly, various techniques using images or photos are actively being researched. However, image data generates noise for complex reasons, and the accuracy of image processing increases according to the performance of removing noise. Therefore, noise reduction is one of the essential steps. Salt and pepper noise is a typical impulse noise in the image, and various studies are being conducted to remove the noise. However, existing algorithms have poor noise rejection performance in high frequency areas, and average filters have blurring. Therefore, in this paper, we propose an algorithm that effectively removes salt and pepper noise in the high frequency region as well as the low frequency region using entropy. For objective and accurate judgment of proposed algorithms, MSE and PSNR were used to compare and analyze existing algorithms.

• Convergence Security Journal
• /
• v.13 no.3
• /
• pp.9-15
• /
• 2013

Calculating of matching cost is an important for efficient stereo matching. To investigate the performance of matching process, the concepts of the existing methods are introduced. Also we analyze the performance and merits of them. The simplest matching costs assume constant intensities at matching image locations. We consider matching cost functions which can be distinguished between pixel-based and window-based approaches. The Pixel-based approach includes absolute differences (AD) and sampling-intensitive absolute differences (BT). The window-based approach includes the sum of the absolute differences, the sum of squared differences, the normalized cross-correlation, zero-mean normalized cross-correlation, census transform, and the absolute differences census transform (AD-Census). We evaluate matching cost functions in terms of accuracy and time complexity. In terms of the accuracy, AD-Census method shows the lowest matching error ratio (the best solution). The ZNCC method shows the lowest matching error ratio in non-occlusion and all evaluation part. But it performs high matching error ratio at the discontinuities evaluation part due to blurring effect in the boundary. The pixel-based AD method shows a low complexity in terms of time complexity.