• Title, Summary, Keyword: Block Matching Algorithm

Search Result 406, Processing Time 0.051 seconds

Improved Sub-block Matching Algorithm (개선된 서브블록 정합 알고리즘)

  • Oh, Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7C
    • /
    • pp.628-633
    • /
    • 2010
  • This paper proposes a block matching algorithm to improve the sub-block matching algorithm that uses partial sub-blocks being a great contribution to the block matching. Unlike the conventional algorithm using the one sub-block group the proposed algorithm uses two sub-block groups. The matching using the small group selects a candidate block to be a good possibility of a similar block with a small computation cost and the additional matching using the large group in the selected block decreases a wrong matching. Simulation results show that the proposed algorithm always has good image quality at the same computation cost as compared to the conventional algorithm and it has an outstanding performance at the matching using a few sub-blocks.

A Study on the Fast Block Matching Algorithm (고속 Block Matching 알고리즘에 관한 연구)

  • 이인홍;박래홍
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.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.

  • PDF

Block Matching Algorithm Using Sub-blocks (서브블록을 이용한 블록 정합 알고리즘)

  • Kim, Seong-Hee;Oh, Jeong-Su
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.655-658
    • /
    • 2005
  • This paper proposes a modified block matching algorithm which reduces an amount of matching computation by using only pixels contributing greatly to block matching. In consideration of algorithm implementation and additional information, the proposed algorithm divides a matching block into sub-blocks, selects some sub-blocks using their complexities, and execute the block mating with them. Simulation results show that the proposed algorithm performs a valid block matching with some sub-blocks.

  • PDF

Block Matching Algorithm Using Pixels Selected by Image Complexity (영상 복잡도에 따라 선택된 화소들을 이용한 블록 정합 알고리즘)

  • Kim Seong-hee;Oh Jeong-su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1703-1708
    • /
    • 2005
  • This paper proposes a modified block matching algorithm which reduces an amount of matching computation by using only pixels contributing greatly to block matching. In consideration of algorithm implementation and additional informatirm, the proposed algorithm divides a matching block into sub-blocks, selects some sub-blocks using their complexities, and execute the block mating with them. Simulation results show that the proposed algorithm performs a valid block matching, diminishing computation cost.

Block Matching Algorithm Using an Adaptive Matching Block for Object Tracking (객체추적을 위한 적응적 정합 블록을 이용한 블록정합 알고리즘)

  • Kim, Jin-Tea;Ahn, Soo-Hong;Oh, Jeong-Su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.2
    • /
    • pp.455-461
    • /
    • 2011
  • In object tracking using the block mating algorithm, it is not proper to use a fixed matching block to track an object of which size may be various and can be changed at any time. This paper defines an adaptive matching block for the dynamic environment and proposes a block matching algorithm for it. The matching block is composed of a main-block of $10{\times}10$ pixels and 8 sub-blocks of $6{\times}6$ pixels in a wide area of $42{\times}42$ pixels, the main-block located its center is used as an object block, and the sub-blocks located its boundary are used as candidates for the object block. The proposed algorithm extracts the object blocks from the sub-blocks by using their motion vectors for 10 previous frames and performs the block matching with the main block and them. The experiments for perform estimation show that the proposed algorithm extracts just valid object blocks from the matching block and keeps an object having free movement in image center area.

Adaptive Matching Scan Algorithm Based on Gradient Magnitude and Sub-blocks in Fast Motion Estimation of Full Search (전영역 탐색의 고속 움직임 예측에서 기울기 크기와 부 블록을 이용한 적응 매칭 스캔 알고리즘)

  • 김종남;최태선
    • Proceedings of the IEEK Conference
    • /
    • /
    • pp.1097-1100
    • /
    • 1999
  • Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

  • PDF

A Study on Fast Block Matching Algorithm for the Motion Vector Estimation (이동벡터 추정을 위한 고속 Block Matching Algorithm에 관한 연구)

  • 이인홍;박래홍
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.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.

  • PDF

A Fast Full-Search Motion Estimation Algorithm using Adaptive Matching Scans based on Image Complexity (영상 복잡도와 다양한 매칭 스캔을 이용한 고속 전영역 움직임 예측 알고리즘)

  • Kim Jong-Nam
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.10
    • /
    • pp.949-955
    • /
    • 2005
  • In this Paper, we propose fast block matching algorithm by dividing complex areas based on complexity order of reference block and square sub-block to reduce an amount of computation of full starch(FS) algorithm for fast motion estimation, while keeping the same prediction quality compared with the full search algorithm. By using the fact that matching error is proportional to the gradient of reference block, we reduced unnecessary computations with square sub-block adaptive matching scan based image complexity instead of conventional sequential matching scan and row/column based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination(PDE) algorithm without any prediction quality, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

An Adaptive and Fast Motion Estimation Algorithm using Initial Matching Errors (초기 매칭 에러를 통한 적응적 고속 움직임 예측 알고리즘)

  • Jeong, Tae-Il
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1439-1445
    • /
    • 2007
  • In this paper, we propose a fast motion estimation algorithm using initial matching errors by sorting square sub-blocks to find complex sub-block area adaptively based on partial calculation of SAD(sum of absolute difference) while keeping the same prediction quality compared with the PDE(partial distortion elimination) algorithm. We reduced unnecessary calculations with square sub-block adaptive matching scan based initial SAD calculation of square sub-block in each matching block. Our algorithm reduces about 45% of computations for block matching error compared with conventional PDE(partial distortion elimination) algorithm without any degradation of prediction quality, and for algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.

  • PDF

A 16:1 Subsampling Block-Matching Algorithm and Its Hardware Design (16:1 부분 표본 추출 블럭 정합 알고리즘과 이의 하드웨어 설계)

  • 김양훈;임종석;민병기
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.12
    • /
    • pp.1624-1634
    • /
    • 1995
  • Conventional full search block matching algorithm for motion estimation is computationally intensive and the resulting hardware cost is very high. In this paper, we present an efficient block matching algorithm using a 16:1 subsampling technique, and describe its hardware design. The algorithm reduces the number of pixels in calculating the mean absolute difference at each search location, instead of reducing the search locations.The algorithm is an extension of the block mating algorithm with 4:1 subsampling proposed by Liu and Zaccarin such that the amount of computation is reduced by a fact of 4(16 compared to the full search block matching algorithm) while producing similar performance.The algorithm can efficiently be designed into a hardware for real-time applications.

  • PDF