• Journal of Communications and Networks
• /
• v.12 no.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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.367-369
• /
• 2001

멀티미디어 환경의 발전에 따라 동영상에 대한 효과적인 검색 및 관리와 CG와 일반 영상의 합성을 위하여 영상 내의 카메라 동작 요소 검출 기법이 필요하다. 본 논문에서는 sub-block당 투영 영상을 이용만 카메라 동작 요소 검출 방법을 제안한다. 제안한 방법은 sub-block당 평균값을 이용만 투영 영상상에서 각 sub-block 내에서의 x, y 방향 이동 성분을 구하여 이를 통한 Optical flow를 얻는다. 제안하는 방법은 기존의 block-matching을 통하여 optical flow를 얻는 방법보다 계산량의 감소와 계산 속도의 증가를 나타낸다. 실험 결과에서는 제안하는 방법에 의하여 얻은 optical flow를 보여주며 예측도의 증가를 보여준다.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.393-396
• /
• 2000

본 논문에서는 영상의 화소값으로부터 추출된 유사 특징점(quasi-feature point)을 이용한 이미지 모자이킹 알고리즘을 제안한다. 유사 특징점의 선택은 전역 정합(global matching)의 결과로부터 중첩된 영역을 4개의 부영역(sub-area)으로 분할하고, 각각의 분할된 부 영역에서 국부 분산(local variance)의 크기가 큰 블록을 선정, 이 블록의 중심 화소를 유사 특징점으로 선택한다. 유사 특징점에 대한 정합은 카메라 이동에 따른 왜곡(distortion)과 조명의 변화를 고려한 블록 정합 알고리즘(block matching algorithm)을 이용한다.

• Journal of Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.483-491
• /
• 2009

In this paper, we propose a fast motion estimation algorithm using adaptive elimination of sub-block partial coefficients. The proposed algorithm predicts an adaptive threshold for each sub-block by using relationship of an initial sum of absolute difference(SAD) and a minimum SAD at the current point, and efficiently reduces unnecessary calculation time of the conventional partial distortion elimination(PDE) algorithm with the predicted threshold. Our algorithm reduces about 60% of computations of the conventional PDE algorithm without any degradation of prediction quality compared with the con ventional full search. Additionally, the proposed algorithm can be applied to other fast motion estimation 떠gorithms. the proposed Our proposing algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.785-793
• /
• 2009

This paper proposes a signature using dominant singular values for video sequence matching. By considering the input image as matrix A, a partition procedure is first performed to separate the matrix into non-overlapping sub-images of a fixed size. The SVD(Singular Value Decomposition) process decomposes matrix A into a singular value-singular vector factorization. As a result, singular values are obtained for each sub-image, then k dominant singular values which are sufficient to discriminate between different images and are robust to image size variation, are chosen and normalized as the signature for each block in an image frame for matching between the reference video clip and the query one. Experimental results show that the proposed video signature has a better performance than ordinal signature in ROC curve.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.902-915
• /
• 2011

Recently in the area-based stereo matching field, Adaptive Support-Weight (ASW) method that weights matching cost adaptively according to the luminance intensity and the geometric difference shows promising matching performance. However, ASW requires more computational cost than other matching algorithms do and its real-time implementation becomes impractical. By applying Integral Histogram technique after approximating to the Bilateral filter equation, the computational time of ASW can be restricted in constant time regardless of the support window size. However, Integral Histogram technique causes loss of the matching accuracy during approximation process of the original ASW equation. In this paper, we propose a novel algorithm that maintains the ASW algorithm's matching accuracy while reducing the computational costs. In the proposed algorithm, we propose Sub-Block method that groups the pixels within the support area. We also propose the method adjusting the disparity search range depending on edge information. The proposed technique reduces the calculation time efficiently while improving the matching accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1405-1409
• /
• 2004

This paper is studied new block mode decision algorithm for H.264/AVC. The fast block mode decision algorithm is consist of block range decision algorithm. The block range decision algorithm classifies the block over 8$\times$8 size or below for 16${\times}$16 macroblock to decide the size and type of sub blocks. As the sub blocks of 8$\times$8, 8r4, 4$\times$8 and 4$\times$4, which are the blocks below 8$\times$8 size, include important motion information, the exact sub block decision is required. RDC(RDO cost) is used as the matching parameter for the exact sub block decision. RDC is calculated with motion strength which is the mean value of neighbor pixels of each sub block. The sub block range decision reduces encoding arithmetic amount by 34.62% on the average more than the case not using block range decision. The block mode decision using motion strength shows improvement of PSNR of 0.05[dB].

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.273-277
• /
• 2009

A compressed video stream is very sensitive to transmission errors that may severely degrade the reconstructed image. Therefore, error resilience is an essential problem in video communications. In this paper, we propose novel temporal error concealment techniques for recovering lost or erroneously received macroblock (MB). To reduce the computational complexity, the proposed method adaptively determines the search range for each lost MB to find best matched block in the previous frame. And the original corrupted MB split into for $8{\times}8$ sub-MBs, and estimates motion vector (MV) of each sub-MB using its boundary information. Then the estimated MVs are utilized to reconstruct the damaged MB. In simulation results, the proposed method shows better performance than conventional methods in both aspects of PSNR.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.98-113
• /
• 2002

In this paper, we present advanced algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced multi-level successive elimination algorithms(AMSEA) are based on the Multi-level successive elimination algorithm(MSEA)[1]. The first algorithm is that when we calculate the sum of absolute difference (SAD) between the sum norms of sub-blocks in MSEA, we use the partial distortion elimination technique. By using the first algorithm, we can reduce the computations of MSEA further. In the second algorithm, we calculate SAD adaptively from large value to small value according to the absolute difference values between pixels of blocks. By using the second algorithm, the partial distortion elimination in SAD calculation can occur early. So, the computations of MSEA can be reduced. In the third algorithm, we can estimate the elimination level of MSEA. Accordingly, the computations of the MSEA related to the level lower than the estimated level can be reduced. The fourth algorithm is a very fast block matching algorithm with nearly 100% motion estimation accuracy. Experimental results show that AMSEA are very efficient algorithms for the estimation of motion vectors.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.10 no.1
• /
• pp.1-9
• /
• 2006

Three categories such as the design of a machine, control and software are necessary in the development of the photomask inspection machine with high resolution. Among them, the design of a software detects inferiority through the comparison of CAD data and real data read by camera from photomask. The block matching algorithm is used since the domain is large and the comparison of data by pixel is accomplished. To correct the error arising from the assembly of a machine, calibration algorithm is used and prefocusing algorithm is suggested to correct the surface of the photomask.