• 대한전자공학회논문지
• /
• 제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.

• 제어로봇시스템학회논문지
• /
• 제21권10호
• /
• pp.965-971
• /
• 2015

This paper suggests a feature point-based Iterative Closest Point (ICP) algorithm to compensate for the disparity error in building a two-dimensional map. The ICP algorithm is a typical algorithm for matching a common object in two different images. In the process of building a two-dimensional map using the laser scanner data, warping and distortions exist in the map because of the disparity between the two sensor values. The ICP algorithm has been utilized to reduce the disparity error in matching the scanned line data. For this matching process in the conventional ICP algorithm, pre-known reference data are required. Since the proposed algorithm extracts characteristic points from laser-scanned data, reference data are not required for the matching. The laser scanner starts from the right side of the mobile robot and ends at the left side, which causes disparity in the scanned line data. By finding the matching points between two consecutive frame images, the motion vector of the mobile robot can be obtained. Therefore, the disparity error can be minimized by compensating for the motion vector caused by the mobile robot motion. The validity of the proposed algorithm has been verified by comparing the proposed algorithm in terms of map-building accuracy to conventional ICP algorithm real experiments.

• 한국측량학회지
• /
• 제37권5호
• /
• pp.367-377
• /
• 2019

As an alternative navigation system for the non-GNSS (Global Navigation Satellite System) environment, a new type of DBRN (DataBase Referenced Navigation) which applies both gravity gradient and terrain, and combines filter-based algorithm with profile matching was suggested. To improve the stability of the performance compared to the previous study, both centralized and decentralized EKF (Extended Kalman Filter) were constructed based on gravity gradient and terrain data, and one of filters was selected in a timely manner. Then, the final position of a moving vehicle was determined by combining a position from the filter with the one from a profile matching. In the simulation test, it was found that the overall performance was improved to the 19.957m by combining centralized and decentralized EKF compared to the centralized EKF that of 20.779m. Especially, the divergence of centralized EKF in two trajectories located in the plain area disappeared. In addition, the average horizontal error decreased to the 16.704m by re-determining the final position using both filter-based and profile matching solutions. Of course, not all trajectories generated improved performance but there is not a large difference in terms of their horizontal errors. Among nine trajectories, eights show smaller than 20m and only one has 21.654m error. Thus, it would be concluded that the endemic problem of performance inconsistency in the single geophysical DB or algorithm-based DBRN was resolved because the combination of geophysical data and algorithms determined the position with a consistent level of error.

• Journal of Electrical Engineering and Technology
• /
• 제10권5호
• /
• pp.2189-2196
• /
• 2015

Stereo matching algorithm is usually used to obtain a disparity map from a pair of images. However, the disparity map obtained by using stereo matching contains lots of noise and error regions. In this paper, we propose a virtual-view synthesis algorithm using disparity refinement in order to improve the quality of the synthesized image. First, the error region is detected by examining the consistency of the disparity maps. Then, motion information is acquired by applying optical flow to texture component of the image in order to improve the performance. Then, the occlusion region is found using optical flow on the texture component of the image in order to improve the performance of the optical flow. The refined disparity map is finally used for the synthesis of the virtual view image. The experimental results show that the proposed algorithm improves the quality of the generated virtual-view.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2006년도 추계학술대회 논문집 Vol.19
• /
• pp.357-358
• /
• 2006

Accurate calibration matching for maladjusted stereo cameras with calibrated pixel distance parameter is presented. The camera calibration is a necessary procedure for stereo vision-based depth computation. Intra and extra parameters should be obtain to determine the relation between image and world coordination through experiment. One difficulty is in camera alignment for parallel installation: placing two CCD arrays in a plane. No effective methods for such alignment have been presented before. Some amount of depth error caused from such non-parallel installation of cameras is inevitable. If the pixel distance parameter which is one of Intra parameter is calibrated with known points, such error can be compensated in some amount and showed the variable experiments for accurate effects.

• Journal of Communications and Networks
• /
• 제12권1호
• /
• pp.5-10
• /
• 2010

This paper introduces a new fast motion estimation based on estimating a block matching error (i.e., sum of absolute difference (SAD)) between blocks which can eliminate an impossible candidate block much earlier than a conventional partial distortion elimination (PDE) scheme. The basic idea of the proposed scheme is based on predicting the total SAD of a candidate block using its partial SAD. In particular, in order to improve prediction accuracy and computational efficiency, a sub-sample based block matching and a selective pixel-based approaches are employed. In order to evaluate the proposed scheme, several baseline approaches are described and compared. The experimental results show that the proposed algorithm can reduce the computations by about 44% for motion estimation at the cost of 0.0005 dB quality degradation versus the general PDE algorithm.

• 한국통신학회논문지
• /
• 제32권5C호
• /
• pp.487-495
• /
• 2007

에러가 존재하는 전송 환경에서 압축된 영상을 전송하는 경우, 일정한 화질을 유지하기 위해서는 에러 은닉 기법이 필요하다. 본 논문에서는 블록 기반의 영상 압축에 있어서 공간적 에러 은닉 기법을 제안한다. 제안된 기법은 공간 영역에서 슬라이스 단위의 에러가 발생했을 경우, 에러가 발생한 블록에 이웃하는 상 하 블록의 경계 화소를 이용하여 손상된 블록의 상 하 외곽 영역의 세밀한 에지 방향성을 찾아 각각 부분 복원을 한다. 그리고 복원되지 않은 내부 영역은 이웃한 경계 화소를 이용하여 블록 내의 전체적인 에지 방향성을 찾아 적응적으로 최종 복원 영상을 만들어 내는 2단계의 경계 정합 기법이다. 이 기법은 기존의 에러 은닉 방식보다 복잡도가 낮을 뿐만 아니라 에지를 흐름을 잘 복원하여 객관적 주관적으로 우수한 복원 영상을 얻게 해준다.

• 전기학회논문지
• /
• 제68권3호
• /
• pp.471-479
• /
• 2019

This research proposes a indoor magnetic map matching algorithm that improves the position accuracy by employing multiple magnetic sensors and probabilistic candidate weighting function. Since the magnetic field is easily distorted by the surrounding environment, the distorted magnetic field can be used for position mapping, and multiple sensor configuration is useful to improve mapping accuracy. Nevertheless, the position error is likely to increase because the external magnetic disturbances have repeated pattern in indoor environment and several points have similar magnetic field distortion characteristics. Those errors cause large position error, which reduces the accuracy of the position detection. In order to solve this problem, we propose a method to reduce the error using multiple sensors and likelihood boundaries that uses human walking characteristics. Also, to reduce the maximum position error, we propose an algorithm that weights according to their importance. We performed indoor walking tests to evaluate the performance of the algorithm and analyzed the position detection error rate and maximum distance error. From the results we can confirm that the accuracy of position detection is greatly improved.

• 전자공학회논문지
• /
• 제50권1호
• /
• pp.276-284
• /
• 2013

본 논문에서는 관성항법시스템의 전달정렬시 속도정합 알고리듬에 대하여 지렛대 거리 오차의 가관측성 분석을 수행하였다. 이를 위해 지렛대 거리 오차를 포함한 칼만필터 상태 변수를 모델링하였고 측정 방정식을 구성하였다. 가관측성 분석 방법으로는 SOM을 이용하였고 다양한 항체의 운항 조건들에 대하여 가관측성 분석을 수행하였다. 기존의 지렛대 거리 오차를 포함한 가관측성 분석 기법들은 시뮬레이션을 통한 분석이 주를 이룬 반면에 본 논문에서는 상태 변수들이 완전 가관측하기 위한 항체의 운항 조건을 해석적으로 제시하였다. 그리고 시뮬레이션을 수행하여 분석 결과를 검증하였다.

• ETRI Journal
• /
• 제8권1호
• /
• pp.3-5
• /
• 1986

본 고는 image의 pattern을 identify하기 위해 그 image data의 FFT(Fast Fourier Transform)를 취한 후 에너지 스펙트럼의 크기를 폐적분한 값으로 부터 original input object와 비교대상의 object에 대한 mean square error 값의 차이를 시뮬레이션한 결과 얻은 threshold value와 비교함으로써 matching 을 구현하기 위함이다. Vax11-780/vms와 Fortran77 Language를 사용하여 시뮬레이션을 수행하였으며 Tektronix graphic terminal이 digitized된 이미지의 모니터용으로 사용되었다.