• 제어로봇시스템학회논문지
• /
• 제13권1호
• /
• pp.52-57
• /
• 2007

In this paper we proposed multi-directional matching windows combined by multi-dimensional feature vector matching, which uses not only intensity values but also multiple feature values, such as variance, first and second derivative of pixels. Multi-dimensional feature vector matching has the advantage of compensating the drawbacks of area-based stereo matching using one feature value, such as intensity. We define matching cost of a pixel by the minimum value among eight multi-dimensional feature vector distances of the pixels expanded in eight directions having the interval of 45 degrees. As best stereo matches, we determine the two points with the minimum matching cost within the disparity range. In the experiment we used aerial imagery and IKONOS satellite imagery and obtained more accurate matching results than that of conventional matching method.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• pp.772-775
• /
• 2006

Muilti-dimensional feature vector matching algorithm uses multiple features such as intensity, gradient, variance, first or second derivative of a pixel to find correspondence pixels in stereo images. In this paper, we proposed a new method for adjusting automatically the weight of feature in multi-dimensional feature vector matching considering sharpeness of a pixel in feature vector distance curve. The sharpeness consists of minimum and maximum vector distances of a small window mask. In the experiment we used IKONOS satellite stereo imagery and obtained accurate matching results comparable to the manual weight-adjusting method.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 추계학술대회
• /
• pp.101-104
• /
• 2015

영상에서 이전 프레임과 현재 프레임을 비교하여 얼마나 움직였는지를 나타내는 모션 벡터(motion vector)라 한다. 이러한 모션 벡터를 이용하여 현재 프레임의 이미지안의 객체들이 이전프레임의 이미지 객체가 있었던 위치로 보정을 한다면 손 떨림이나 카메라의 흔들림에서 오는 작은 떨림을 보정할 수 있다. 본 논문에서는 모션 벡터를 추출하는 방법인 SAD(Sum of Absolute Difference) 방정식을 이용한 블록 정합 매칭 알고리즘, 위상상관을 이용한 매칭, 특징점을 이용한 매칭, Bitplane을 이용한 블록매칭의 성능을 비교하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1457-1460
• /
• 1987

2-D shape matching algorithm is proposed which uses pivot vector and componentwise adaptive convergence factor. It is proved that proposed algorithm has better result than any other algorithm. It is to be expected that this algorithm will work effectively in 3-D shape matching.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 학술대회
• /
• pp.217-220
• /
• 1996

This paper describes a new hierarchial block matching algorithm especially appropriate for a large search area. The proposed algorithm consists of higher level search for an initial motion vector estimate by using a new matching criterion over the evenly subsampled search points, and lower level search for the final motion vector refinement. In the higher level matching criterion, mean absolute differences at the search points (or motion vector candidates) similar to motion vectors of causally neighboring blocks, are weighted properly so that these points can have a higher chance to being selected. The proposed algorithm outperforms existing hierarchical block matching algorithms, and its computational regularity makes hardware implementation simple.

• 대한전자공학회논문지
• /
• 제25권2호
• /
• pp.211-219
• /
• 1988

In this paper effective block matching algorithms are proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e.pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of this algorithm is the reduction of the computation time. In order to reduce the computation time, three mathods are proposed in this paper. These new algorithms are faster than other methods. Compared with the three step algorithm by Koga et al., the average ratio of the computational savings obtained from the proposed algorithm is about 3-4.

• 제어로봇시스템학회논문지
• /
• 제7권12호
• /
• pp.1044-1050
• /
• 2001

This paper presents firstly the method of Euler angle matching designing the transfer alignment using the attitude matching. In this method, the observation directly uses Euler angle difference between MINS and SINS so it needs to describe the rotation vector error to the Euler angle error. The rotation vector error related to the Euler angle error is derive from the direction cosine matrix error equation. The feasibility of the Kalman filter designed for the transfer alignment by Euler angle matching is analyzed by the alignment error results with respect to the roll angle the pitch angle, and the yaw angle matching.

• 대한전자공학회논문지
• /
• 제24권4호
• /
• pp.667-674
• /
• 1987

In this paper an effective block matching algorithm is proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e., pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of a proposed algorithm using integral projections is the reduction of the computation time. While the conventional block matching methods have to be computed in 2-dimensional arrays, the proposed algorithm using integral projections can be computed in 1-dimensional arrays. In comparison with conventional block matching methods, a computer simulation shows that though the prediction error increases 0.23 db, it is not detectable for human eyes and the average reduction ratio of computation time obtained from the proposed algorithm is about 3-4.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.327-328
• /
• 2007

A contour shape matching based pixel motion estimation is proposed. The pixel motion information is very useful to compensate the motion artifact generated at the specific gray level contours in the moving image for subfield gray-scale display devices. In this motion estimation method, the gray level boundary contours are extracted from the input image. Then using contour shape matching, the most similar contour in next frame is found, and the contour is divided into segment unit. The pixel motion vector is estimated from the displacement of the each segment in the contour by segment matching. From this method, more precise motion vector can be estimated and this method is more robust to image motion with rotation or from illumination variations.

• 한국컴퓨터그래픽스학회논문지
• /
• 제29권3호
• /
• pp.159-166
• /
• 2023

이 논문은 실시간 모션 생성 응용분야에서 최근 활발하게 사용되고 있는 모션 매칭 기술을 효과적으로 적용하는 방법에 대해 연구한다. 모션 매칭의 핵심은 간단한 특징 벡터의 정의에 있으나 이 정의의 선택에 따라 결과가 많이 달라지게 된다. 이에 본 연구에서는 보행 동작을 중심으로 사용자가 원하는 궤적을 생성하기 위한 최적의 특징 벡터의 조합을 도출하는 것을 목표로 다양한 조합에 대해 실험하고, 이에 대한 오차 분석을 시행하였다.