• Title/Summary/Keyword: Fast Block Matching Algorithm

Search Result 158, Processing Time 0.018 seconds

A Study on the New Motion Estimation Algorithm of Binary Operation for Real Time Video Communication (실시간 비디오 통신에 적합한 새로운 이진 연산 움직임 추정 알고리즘에 관한 연구)

  • Lee, Wan-Bum;Shim, Byoung-Sup;Kim, Hwan-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.418-423
    • /
    • 2004
  • The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

A Content Adaptive Fast PDE Algorithm for Motion Estimation Based on Matching Error Prediction

  • Lee, Sang-Keun;Park, Eun-Jeong
    • 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.

Fast Variable-size Block Matching Algorithm for Motion Estimation Based on Bit-patterns (비트패턴 기반 움직임 추정을 위한 고속의 가변 블록 정합 알고리즘)

  • Kwon, Heak-Bong;Song, Young-Jun
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.2
    • /
    • pp.11-18
    • /
    • 2003
  • In this paper, we propose a fast variable block matching algorithm for motion estimation based on bit-patterns. Motion estimation in the proposed algorithm is peformed after the representation of image sequence is transformed 8-bit pixel values into 1-bit ones by the mean pixel value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating unnecessary searching processes of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides bettor performance - average 0.5dB PSNR improvement and about 99% savings in the number of operations - than full search Hock matching algorithm with a fixed block size.

  • PDF

Fast Motion Estimation Algorithm Using Early Detection of Optimal Candidates with Priority and a Threshold (우선순위와 문턱치를 가지고 최적 후보 조기 검출을 사용하는 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.21 no.2
    • /
    • pp.55-60
    • /
    • 2020
  • In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.

Fast Detection of Copy-Move Forgery Image using DCT

  • Shin, Yong-Dal
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.4
    • /
    • pp.411-417
    • /
    • 2013
  • In this paper, we proposed a fast detection method of copy-move forgery image based on low frequency coefficients of the DCT coefficients. We proposed a new matching criterion of copy-moved forgery image detection (MCD) using discrete cosine transform. For each $8{\times}8$ pixel block, the DCT transform is calculated. Our algorithm uses low frequency four (DC, 3 AC coefficient) and six coefficients (DC, 5 AC coefficients) of DCT per $8{\times}8$ pixel block. Our algorithm worked block matching for DCT coefficients of the $8{\times}8$ pixel block is slid by one pixel along the image from the upper left corner to the lower right corner. Our algorithm can reduce computational complexity more than conventional copy moved forgery detection algorithms.

A study on variable block matching algorithm using differential image and quad tree (차영상과 4진트리 구조를 이용한 가변 블럭정합 알고리즘에 관한 연구)

  • 정일화;이대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2768-2775
    • /
    • 1996
  • VariableBlock Matching algorithm is effective for the estimation of motion vector at complexor edge region by means of using variable block size with respect to the image block. But since VBM algorithm requires considerable number of operations, to solve this problem, we present an algorithm which uses difference images and quad tree structure, and estimates motion using various fast block matching algorithms.

  • PDF

A Flat Hexagon-based Search Algorithm for Fast Block Matching Motion Estimation (고속 블록 정합 움직임 예측을 위한 납작한 육각 패턴 기반 탐색 알고리즘)

  • Nam, Hyeon-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.1 s.45
    • /
    • pp.57-65
    • /
    • 2007
  • In the fast block matching algorithm. search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image qualify. In this paper, we propose a new fast block matching algorithm using the flat-hexagon search pattern that ate solved disadvantages of the diamond pattern search algorithm(DS) and the hexagon-based search algorithm(HEXBS). Our proposed algorithm finds mainly the motion vectors that not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the DS and HEXBS, the proposed f)at-hexagon search algorithm(FHS) improves about $0.4{\sim}21.3%$ in terms of average number of search point per motion vector estimation and improves about $0.009{\sim}0.531dB$ in terms of PSNR(Peak Signal to Noise Ratio).

  • PDF

A Fast Block Matching Motion Estimation Algorithm by using the Enhanced Cross-Hexagonal Search Pattern (개선된 크로스-육각 패턴을 이용한 고속 블록 정합 움직임 추정 알고리즘)

  • Nam Hyeon-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.77-85
    • /
    • 2006
  • There is the spatial correlation of the video sequence between the motion vector of current blocks. In this paper, we propose the enhanced fast block matching algorithm using the spatial correlation of the video sequence and the center-biased properly of motion vectors. The proposed algorithm determines an exact motion vector using the predicted motion vector from the adjacent macro blocks of the current frame and the Cross-Hexagonal search pattern. From the of experimental results, we can see that our proposed algorithm outperforms both the prediction search algorithm (NNS) and the fast block matching algorithm (CHS) in terms of the search speed and the coded video's quality. Using our algorithm, we can improve the search speed by up to $0.1{\sim}38%$ and also diminish the PSNR (Peak Signal Noise Ratio) by at nst $0.05{\sim}2.5dB$, thereby improving the video qualify.

  • PDF

Adaptive Selection of Fast Block Matching Algorithms for Efficient Motion Estimation (효율적인 움직임 추정을 위한 고속 블록 정합 알고리듬의 적응적 선택)

  • Kim, Jung-Jun;Jeon, Gwang-Gil;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1C
    • /
    • pp.19-33
    • /
    • 2008
  • A method that is adaptively selecting among previous fast motion estimation algorithms and a newly proposed fast motion estimation algorithm(UCDS) is presented in this paper. The algorithm named AUDC and a newly proposed fast motion estimation algorithms are based on the Diamond Search(DS) algorithm and Three Step Search(TSS). Although many previous fast motion estimation algorithms have lots of advantages, those have lots of disadvantages. So we thought better adaptive selection of fast motion estimation algorithms than only using one fast motion estimation algorithm. Therefore, we propose AUDC that is using length of the MV, Search Point, SAD of the neighboring block and adaptively selecting among Cross Three Step Search(CTSS), Diamond Search(DS) and Ungraded Cross Diamond Search(UCDS). Experimental results show that the AUDC is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching at algorithms.

Fast block matching algorithm for constrained one-bit transform-based motion estimation using binomial distribution (이항 분포를 이용한 제한된 1비트 변환 움직임 예측의 고속 블록 정합 알고리즘)

  • Park, Han-Jin;Choi, Chang-Ryoul;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.16 no.5
    • /
    • pp.861-872
    • /
    • 2011
  • Many fast block-matching algorithms (BMAs) in motion estimation field reduce computational complexity by screening the number of checking points. Although many fast BMAs reduce computations, sometimes they should endure matching errors in comparison with full-search algorithm (FSA). In this paper, a novel fast BMA for constrained one-bit transform (C1BT)-based motion estimation is proposed in order to decrease the calculations of the block distortion measure. Unlike the classical fast BMAs, the proposed algorithm shows a new approach to reduce computations. It utilizes the binomial distribution based on the characteristic of binary plane which is composed of only two elements: 0 and 1. Experimental results show that the proposed algorithm keeps its peak signal-to-noise ratio (PSNR) performance very close to the FSA-C1BT while the computation complexity is reduced considerably.