• Journal of Digital Contents Society
• /
• v.8 no.3
• /
• pp.329-339
• /
• 2007

In this paper we present a facial region detection algorithm for real-time image with complex background and various illumination using spatial and temporal methods. For Detecting Human region It used summation of Edge-Difference Image between continuous image sequences. Then, Detected facial candidate region is vertically divided two objected. Non facial region is reduced using Analysis of Major Color Component. Non facial region has not available Major Color Component. And then, Background is reduced using boundary information. Finally, The Facial region is detected through horizontal, vertical projection of Images. The experiments show that the proposed algorithm can detect robustly facial region with complex background various illumination images.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2003.09a
• /
• pp.77-77
• /
• 2003

CT와 MRI의 단면 영상을 대상으로 영상분할 (Image segmentation)과 Image registration방법을 이용하여 인체 모델을 개발 하고자 한다. 우선 인체의 Head와 Neck부분의 CT와 MR 영상을 얻어 뼈, 근육, 인대, 그리고 그 밖의 장기의 해부학적 영상 특징을 분석하였다. 인체의 Head와 Neck 부분에 대한 CT와 MR 영상에 대해 각 부위별로 ROI(region-of-interrest)를 설정하였고, 각 volxel 마다 3차원 좌표를 계산할 수 있는 소프트웨어를 개발하였다. 특히 각 해부학적 영상에서 부위별로 CT 번호를 분석하고, pulse sequence에 따른 MRI 영상의 부위별 특정을 분석하였다. 이 분석한 자료를 바탕으로 영상 분할을 하였다. 영상 분할전에 각종 잡음(noise) 제거 및 영상 분할을 효과적으로 처리하기 위해 기본적인 영상처리 (filtering)를 구현하였고, 대조도(contrast) 및 밝기(brightness)를 조절할 수 있게 프로그램을 구현하였다. 영상 분할 방법 중 선(line) 및 에지(edge) 의 검출 방법, 문턱치화(threshold) 방법, 영역확대(region growing) 방법으로 영상 분할을 해봄으로써 우리의 인체 모델링 개발에 가장 적합한 영상 분할 알고리듬 방법을 찾도록 시도하였다. 결과적으로 말하면, 한가지 방법의 알고리듬을 쓰는 것보다는 인체의 부위에 따라 두 가지 이상의 알고리듬 방법을 쓰는 것이 원하고자 하는 부위를 영상 분할하는데 더 효과적이다는 것을 알게 되었다. 우리의 연구 과제에서는 영역확대(region growing) 방법과 문턱치화 방법, 모드법(피크니스, 밸리)의 알고리듬을 이용하여 영상 분할을 한 결과 우리가 얻고자 하는 인체 부위별 중 근육과 뼈를 구별하는데는 별 무리가 없었으나, 인대 및 기타 장기를 구별하는데는 어려움을 겪게 되었다. 이후에 좀더 알고리듬을 연구하여 이번 연구에서 구별하기 어려운 장기 부분도 구별 할 수 있도록 노력하겠다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2000.11a
• /
• pp.207-217
• /
• 2000

In this paper, we describe an image processing algorithm which is able to recognize the road lane. This algorithm performs to recognize the interrelation between AGV and the other vehicle. We experimented on AGV driving test with color CCD camera which is setup on the top of vehicle and acquires the digital signal. This paper is composed of two parts. One is image preprocessing part to measure the condition of the lane and vehicle. This finds the information of lines using RGB ratio cutting algorithm, the edge detection and Hough transform. The other obtains the situation of other vehicles using the image processing and viewport. At first, 2 dimension image information derived from vision sensor is interpreted to the 3 dimension information by the angle and position of the CCD camera. Through these processes, if vehicle knows the driving conditions which are angle, distance error and real position of other vehicles, we should calculate the reference steering angle.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.750-753
• /
• 2007

According to the increase of demand for diverse multimedia services, techniques to use images as the tool of information transmission have been rapidly developed. However, impulse noise affecting the reception of image and signal error occurs in the process of digitalization and transmission of images. In order to remove this impulse noise, a nonlinear filter is generally applied and a standard median (SM) filter is representative. However, SM filter degrades the qualify of overall image by error of the edge component. Therefore, in this paper, to restore the corrupted image by impulse noise, a nonlinear spatial filter based on Min-max operation was proposed and was compared with conventional methods through simulations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.209-212
• /
• 2007

Digital images are corrupted by noises, during signal acquisition and transmission. Amount those noises, additive white Gaussian noise (AWGN) and impulse noise are most representative. The conventional image restoration algorithms are mostly taken in simple noise environment, but they didn't perform very well in tempter noises environment. So a modified image restoration algorithm, which can remove complex noises by using the intensity differences and spatial distances between center pixel and its neighbor pixels as parameters, is proposed in this paper. Simulation results demonstrate that the proposed algorithm can't only remove AWGN and impulse noise separately, but also performs well in preserving details of images as edge.

• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.205-214
• /
• 2015

In this paper, we propose a new approach to learning a discriminative model for figure/ground segmentation by incorporating the bag-of-features and conditional random field (CRF) techniques. We advocate the use of image patches instead of superpixels as the basic processing unit. The latter has a homogeneous appearance and adheres to object boundaries, while an image patch often contains more discriminative information (e.g., local image structure) to distinguish its categories. We use pixel-level sparse coding to represent an image patch. With the proposed feature representation, the unary classifier achieves a considerable binary segmentation performance. Further, we integrate unary and pairwise potentials into the CRF model to refine the segmentation results. The pairwise potentials include color and texture potentials with neighborhood interactions, and an edge potential. High segmentation accuracy is demonstrated on three benchmark datasets: the Weizmann horse dataset, the VOC2006 cow dataset, and the MSRC multiclass dataset. Extensive experiments show that the proposed approach performs favorably against the state-of-the-art approaches.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.4
• /
• pp.253-261
• /
• 2017

In this paper, a corner detection method based on a new non-cornerness measure is presented. Rather than evaluating local gradients or surface curvatures, as done in previous approaches, a non-cornerness function is developed that can identify stable corners by testing an image region against a set of desirable corner criteria. The non-cornerness function is comprised of two steps: 1) eliminate any pixel located in a flat region and 2) remove any pixel that is positioned along an edge in any orientation. A pixel that passes the non-cornerness test is considered a reliable corner. The proposed method also adopts the idea of non-maximum suppression to remove multiple corners from the results of the non-cornerness function. The proposed method is compared with previous popular methods and is tested with an artificial test image covering several corner forms and three real-world images that are universally used by the community to evaluate the accuracy of corner detectors. The experimental results show that the proposed method outperforms previous corner detectors with respect to accuracy, and that it is suitable for real-time processing.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.4
• /
• pp.495-502
• /
• 2003

This paper focuses on the implementation of an efficient tracking method of a moving object using optimal representative blocks by way of a pan-tilt camera. The key idea is derived from the fact that when the image size of a moving object is shrunk in an image frame according to the distance between the mobile robot camera and the object in motion, the tracking performance of a moving object can be improved by reducing the size of representative blocks according to the object image size. Motion estimations using Edge Detection (ED) and Block-Matching Algorithm (BMA) are regularly employed to track objects by vision sensors. However, these methods often neglect the real-time vision data since these schemes suffer from heavy computational load. In this paper, a representative block able to significantly reduce the amount of data to be computed, is defined and optimized by changing the size of representative blocks according to the size of the object in the image frame in order to improve tracking performance. The proposed algorithm is verified experimentally by using a two degree-of- freedom active camera mounted on a mobile robot.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.1
• /
• pp.81-86
• /
• 2004

This paper describes self-localization of a mobile robot from the multiple candidates of landmarks in outdoor environment. Our robot uses omnidirectional vision system for efficient self-localization. This vision system acquires the visible information of all direction views. The robot uses feature of landmarks whose size is bigger than that of others in image such as building, sculptures, placard etc. Robot uses vertical edges and those merged regions as the feature. In our previous work, we found the problem that landmark matching is difficult when selected candidates of landmarks belonging to region of repeating the vertical edges in image. To overcome these problems, robot uses the merged region of vertical edges. If interval of vertical edges is short then robot bundles them regarding as the same region. Thus, these features are selected as candidates of landmarks. Therefore, the extracted merged region of vertical edge reduces the ambiguity of landmark matching. Robot compares with the candidates of landmark between previous and current image. Then, robot is able to find the same landmark between image sequences using the proposed feature and method. We achieved the efficient self-localization result using robust landmark matching method through the experiments implemented in our campus.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.359-362
• /
• 2007

According to the development of information and communication technology, a great deal of researches have been taken in image digital processing field. And for earning the standard level of images, to remove noises such as impulse noise has became a essential demand. In those algorithms which remove impulse noise effectively, the standard median (SM) filter is representative. However, it has a disadvantage to degrade the quality of overall image by occurring errors in the edge domain. Therefore, in this paper, to restore the corrupted image by impulse noise, a nonlinear spatial filter based on Min-max operation was proposed and it was compared with conventional methods through simulations.