• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.64 no.3
• /
• pp.193-198
• /
• 2015

A large number of vision applications rely on matching keypoints across images. Pedestrian detection is under constant pressure to increase both its quality and speed. Such progress allows for new application. A higher speed enables its inclusion into large systems with extensive subsequent processing, and its deployment in computationally constrained scenarios. In this paper, we focus on improving the speed of pedestrian detection using HOG(histogram of oriented gradient) and multi frame operation which is robust to illumination changes in cluttering images. The result of our simulation indicates that the detection rate and speed of the proposed method is much faster than that of conventional HOG and differential images.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.64 no.3
• /
• pp.187-192
• /
• 2015

Detecting human in images is a challenging task owing to their variable appearance and the wide range of poses the they can adopt. The first need is a robust feature set that allows the human form to be discriminated cleanly, even in cluttered background under difficult illumination. A large number of vision application rely on matching keypoints across images. These days, the deployment of vision algorithms on smart phones and embedded device with low memory and computation complexity has even upped the ante: the goal is to make descriptors faster compute, more compact while remaining robust scale, rotation and noise. In this paper we focus on improving the speed of pedestrian(walking person) detection using Histogram of Oriented Gradient(HOG) descriptors provide excellent performance and tracking using kalman filter.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.303-304
• /
• 2011

영역기반 스테레오 매칭의 분야에서 최근 인간의 시각체계(Human Visual System)에 기반하여 영역내의 밝기값과 거리값에 따라 적응적으로 가중치를 부여하는 적응적 영역 가중치(Adaptive Support-Weight) 방법이 좋은 매칭 결과를 보이고 있다. 하지만 이 방법은 영역 윈도우의 크기가 커짐에 따라 기하급수적으로 계산량이 많아지는 단점을 보이고 있다. 이에 Bilateral filter 수식으로 근사화 후 Integral Histogram 기법을 적용하여 영역 윈도우의 크기에 상관없이 상수 시간 O(1) 내에 매칭을 수행하는 연구가 진행되었다. 하지만 이 방법은 근사화 과정에서의 원 ASW 수식을 왜곡하기 때문에 매칭 정확도의 손실을 가져오게 된다. 이에 본 논문에서는 Bilateral 접근 방식, Sub-Block 방식 및 적응적 시차 탐색 방식에 대하여 각 방식에서 필요한 메모리 자원과 소모되는 계산량의 비용과 동시에 매칭 결과 정확도 면에서 비교하고 가장 좋은 접근 방식을 도출하고자 한다.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.6
• /
• pp.307-315
• /
• 2000

For the autonomy of a mobile robot it is first needed to know its position and orientation. Various methods of estimating the position of a robot have been developed. However, it is still difficult to localize the robot without any initial position or orientation. In this paper we present the method how to make the colored map and how to calculate the position and direction of a robot using the angle data of an omnidirectional image. The wall of the map is rendered with the corresponding color images and the color histograms of images and the coordinates of feature points are stored in the map. Then a mobile robot gets the color omnidirectional image at arbitrary position and orientation, segments it and recognizes objects by multiple color indexing. Using the information of recognized objects robot can have enough feature points and localize itself.

• Proceedings of the KSRS Conference
• /
• 2007.03a
• /
• pp.3-7
• /
• 2007

본 논문에서는 1m 공간해상도를 가지는 도시 지역의 위성영상에서 스테레오 정합의 성능을 향상시키기 위해 그레디언트(gradient)의 히스토그램을 이용하여 스테레오 정합 창틀의 크기를 자동적으로 결정하는 방법을 제안한다. 영상의 각 화소에 대해 한 화소 거리의 대각 방향에 놓여진 4 개 화소들의 수직 및 수평 방향에 존재하는 화소간의 밝기값 차로 정의되는 그레디언트를 계산하여 평탄화 지수 영상(Flatness Index Image)을 생성한다. 평탄화 지수 영상에서 에지 등과 같이 주변 화소의 밝기값과 차이가 큰 화소는 상대적으로 높은 평탄화 지수를，비에지 화소의 경우에는 낮은 평탄화 지수를 가지게 된다. 에지와 비에지를 판정하는 평탄화 임계값을 결정하기 위해 평탄화 지수 영상의 히스토그램 분포를 이용한다. 결정된 평탄화 임계값보다 작은 평탄화 지수를 가지는 정합 창틀 내의 화소들이 일정 비율보다 크면 비에지 화소로 판정하고 정합 창틀을 한 단계 더 크게 설정하는 방법으로 정합 창틀의 크기를 각 화소마다 가변적으로 변화시킨다. 제안한 방법을 IKONOS 스테레오 위성영상에 적용하여 고정 크기의 정합 창툴에 비해 정합 성능이 향상되는 것을 보였다.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.113-116
• /
• 2000

Human face recognition and 3D human face reconstruction has been studied in this paper. To find the facial feature points, find edge from input image and analysis the accumulated histogram of edge information. This paper use a Generic Face Model to display the 3D human face model which was implement with OpenGL and generated with 500 polygons. For reality of 3D human face model, we propose Group matching mapping method between facial feature points and the one of Generic Face Model. The personalized 3D human face model which resembles real human face can be generated automatically in less than 5 seconds on Pentium PC.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.161-164
• /
• 2011

영상 매칭은 컴퓨터 비전에서 기초적인 기술로써 영상 추적, 물체인식 등 다양한 분양에서 많이 사용되고 있다. 하지만 스케일, 시점변화, 조명 변화에 강인한 매칭점을 찾는 것은 어려운 일이다. 이러한 문제점을 보완하기 위해 SURF(Scale Invariant Feature Transform), SIFT(Speed up Robust Features) 등의 알고리즘이 제안 되었지만, 여전히 조명변화에 불안정하고 정확하지 못한 성능을 보인다. 본 논문에서는 이러한 조명변화에 대한 문제점을 해결하기 위해 히스토그램 평활화를 이용하여 영상을 보정 후, SURF를 통한 영상 매칭을 하였다. 열악한 조명환경 내에서 촬영된 영상에서 SURF를 이용하여 표현자(Descriptor)를 생성 할 때 특징점이 잘 추출되지 않는 문제점을 해결하기 위하여 히스토그램 평활화를 이용하였고, 보정 후 특징점 개수가 많이 증가하는 것을 보여 확인하였다. 기존의 SURF와 개량된 SURF를 조명이 서로 다른 영상간의 매칭 성능을 비교함으로써 제안한 알고리즘의 우수성을 확인하였다

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.7
• /
• pp.509-516
• /
• 2004

This paper proposes an image processing algorithm for detecting obstacles on road using DLI(disparity of lane-related information) that is generated by stereo images acquired from dual cameras mounted on a moving vehicle. The DLI is a disparity that is acquired using a single lane information from road lane detection. For the purpose to reduce processing time, we use small block of edge-histogram based blocking logic. This algorithm detects moving objects such as preceding vehicles and obstacles. The proposed algorithm has been implemented in a personal computer with the road image data of a typical highway. We successfully performed experiments under a wide variety of road conditions without changing parameter values or adding human intervention. Experimental results also showed that the proposed DLI is quite successful.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.5
• /
• pp.418-422
• /
• 2005

In this paper, a novel algorithm capable of detecting generic obstacles on a flat surface is proposed. The algorithm fundamentally exploits a distortion phenomena taken place in remapping process of original stereo images to a virtual top-view. Based on the distortion phenomena, we construct stereo polar histograms of edge maps, detect peaks on them, and search for matched peaks on both histograms using a Dynamic Programming (DP). Eventually, the searched corresponding peaks lead to estimate obstacles' positions. The advantages of the proposed algorithm are that it is not largely affected by an intensity difference between a pair of stereo images and does not depend on the typical stereo matching methodologies. Furthermore, the algorithm identifies the obstacles' positions quite robustly.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.1025-1031
• /
• 2000

Pre-existing pattern recognition techniques, in the case of character recognition, have limited on the application field. But CAI character learning system and writer's recognition system are very important parts. The application field of pre-existing system can be expanded in the content that the learning of characters and the recognition of writers in the proposed paper. In order to achieve these goals, the development contents are the following: Firstly, pre-processing method by understanding the image structure is proposed, secondly, recognition of characters are accomplished b the histogram distribution characteristics. Finally, similarity measure functions are defined from standard character pattern for matching of the input character pattern. Also the effectiveness of this system is demonstrated by experimenting the standard primitive image.