• Journal of Digital Convergence
• /
• v.13 no.12
• /
• pp.209-215
• /
• 2015

In the past, there have been many theory and algorithms for vehicle tracking. But the time complexity of many feature point matching methods for vehicle tracking are exponential. Also, object segmentation and detection algorithms presented for vehicle tracking are exhaustive and time consuming. Therefore, we present the fast and efficient two stages method that can efficiently track the many moving vehicles on the road. The first detects the vehicle plate regions and extracts the feature points of vehicle plates. The second associates the feature points between frames using dynamic programming.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.43-52
• /
• 2014

In this paper, we propose the target detection method using image displacement, and classification method using SURF(Speeded Up Robust Features) feature points and BAS(Beam Angle Statistics) in infrared images. The SURF method that is a typical correspondence matching method in the area of image processing has been widely used, because it is significantly faster than the SIFT(Scale Invariant Feature Transform) method, and produces a similar performance. In addition, in most SURF based object recognition method, it consists of feature point extraction and matching process. In proposed method, it detects the target area using the displacement, and target classification is performed by using the geometry of SURF feature points. The proposed method was applied to the unmanned target detection/recognition system. The experimental results in virtual images and real images, we have approximately 73~85% of the classification performance.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.219-220
• /
• 2019

본 논문에서는 특징점 기반의 포인트 클라우드 정합 알고리즘을 제안한다. 컴퓨터 비전 분야에서 각각 다른 카메라에서 획득한 데이터를 하나의 통합된 데이터로 정합하는 문제에 많은 관심을 두고 있다. 기존의 방법들은 큰 오차를 가지고 있거나 많은 카메라 대수나 고가의 RGB-D 카메라를 필요로 한다. 본 논문에서는 깊이 카메라에서 얻은 깊이 영상과 색상 영상을 이용하고 함수 최적화 알고리즘을 적용해 저가의 RGB-D 카메라 8대를 이용하여 오차가 적은 포인트 클라우드 정합 방법을 제안한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.6
• /
• pp.25-37
• /
• 2000

The trajectories of feature points can be defined by the correspondences between points in consecutive frames. The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. The trajectories of feature points are determined by calculating the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights are automatically updated in order to properly reflect the motion characteristics. We solve the correspondence problem as an optimal graph search problem, considering that the existence of false feature points may have serious effect on the correspondence search. The proposed algorithm finds a local optimal correspondence so that the effect of false feature point can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O($m^2n$) in the worst case, where m and n arc the number of feature points in two consecutive frames. By considering false feature points and by properly reflecting motion characteristics, the proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

• Journal of Digital Contents Society
• /
• v.5 no.4
• /
• pp.257-263
• /
• 2004

This paper is related to the object-based stereo matching algorithm which makes it possible to estimate inner-region disparities for each segmented region. First, several sample points are selected for effectively representing the segmented region, Next, stereo matching is applied to the small area within segmented region which existed in the neighborhood or each sample point. Finally, inner-region disparities are interpolated using a plane equation with disparity of each selected sample. According to the proposed method, the problem of feature-based method that the depth estimation is possible only in the feature points can be solved through the propagation of the disparity in the sample point into the inside of the region. Also, as selecting sample points in contour of segmented region we can effectively suppress obscurity which is occurred in the depth estimation of the monotone region in area-based methods.

• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.634-639
• /
• 2012

In this paper, we propose nonlinear optimization method for feature matching from multiple view image. Typical solution of feature matching is by solving linear equation. However this solution has large error due to nonlinearity of image formation model. If typical nonlinear optimization method is used, complexity grows exponentially over the number of features. To make complexity lower, we use sparse Levenberg-Marquardt nonlinear optimization for matching of features over multiple view image.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.444-447
• /
• 2008

사람의 얼굴은 표정, 조명 등에 따라 다양한 형태 변화가 있어 입력 영상마다 대표 특징을 정확히 찾는 것은 어려운 문제이다. 얼굴의 많은 특징 점 중에서 눈동자 부분은 얼굴 인식 등 다양한 부분에 있어서 얼굴 영역의 특징 점으로 가장 많이 이용되는 특징 점들 중 하나이다. 본 논문에서는 다양한 조명하에서의 단일 얼굴 영상에 대해 유전자 알고리즘과 템플릿 정합을 이용하여 빠르게 눈을 검출하는 방법을 제안한다. 조명과 배경에 강건한 검출 성능을 얻기 위해 눈동자 후보점을 찾아서 초기 개체군 생성에 이용하였으며, 각각의 개체는 템플릿의 기하학적 변환 정보로 구성되어 템플릿 정합에 의해 눈동자가 검출된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.493-495
• /
• 2002

다시점 영상 부호화와 함께, 가상물체를 지능형으로 합성하기 위해서는 정합할 위치를 강인하게 추적(tracking)하여야 한다. 기존의 특징추적기법은 시점이 확장된 시스템에서, 광원의 영향과 가려진 영역의 발생으로 인하여, 추적 할 수 없게 되거나 시각적 혼동이 발생하는 등의 많은 문제점을 유발한다. 뿐만 아니라 다시점에 의한 정보의 급격한 증가는 시점간 움직임을 추적하여 정합하는 연산량의 추가적 발생을 초래한다. 이에 본 논문은 광원이나 가려진 영역(occtusion)의 영향이 적은 형상과 정보량이 많은 텍스쳐를 동시에 고려하여 영역의 변형에 따라 발생하는 최적 움직임을 예측하는 파라미터 모델을 결정함으로써 사각영역을 추적한다. 이 때 미리 연산된 카메라 파라미터와 투영관계를 사용해 시점간에 가상 객체를 지속적으로 3차원 정합한다. 결과적으로, 제안된 알고리즘은 기존의 특징추적 알고리즘에 비해 광원의 영향과 가려진 영역에 강인하며 정합의 오류가 적고 추적 할 때 시점간의 대응을 위한 연산을 줄이기 때문에 실감 혼합현실 시스템의 구현에 매우 효율적임을 실험을 통해 증명하였다.

• Journal of Broadcast Engineering
• /
• v.18 no.1
• /
• pp.77-87
• /
• 2013

In this paper, we present a novel method for local image descriptor called exact order based descriptor (EOD) which is robust to illumination changes and Gaussian noise. Exact orders of image patch is induced by changing discrete intensity value into k-dimensional continuous vector to resolve the ambiguity of ordering for same intensity pixel value. EOD is generated from overall distribution of exact orders in the patch. The proposed local descriptor is compared with several state-of-the-art descriptors over a number of images. Experimental results show that the proposed method outperforms many state-of-the-art descriptors in the presence of illumination changes, blur and viewpoint change. Also, the proposed method can be used for many computer vision applications such as face recognition, texture recognition and image analysis.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.2
• /
• pp.12-17
• /
• 2010

An automatic facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features and the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in the image space by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the system.