• Title/Summary/Keyword: Block Matching Algorithm

Search Result 419, Processing Time 0.039 seconds

Reduced-bit transform based block matching algorithm via SAD (영상의 저 비트 변환을 이용한 SAD 블록 정합 알고리즘)

  • Kim, Sang-Chul;Park, Soon-Yong;Chien, Sung-Il
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.1
    • /
    • pp.107-115
    • /
    • 2014
  • The reduced-bit transform based bit-plane matching algorithm (BPM) can obtain the block matching result through its simple calculation and hardware design compared to the conventional block matching algorithms (BMAs), but the block matching accuracy of BPMs is somewhat low. In this paper, reduced-bit transform based sum of the absolute difference (R-SAD) is proposed to improve the block matching accuracy in comparison with the conventional BPMs and it is shown that the matching process can be obtained using the logical operations. Firstly, this method transforms the current and the reference images into their respective 2-bit images and then a truth table is obtained from the relation between input and output 2-bit images. Next, a truth table is simplified by Karnaugh map and the absolute difference is calculated by using simple logical operations. Finally, the simulation results show that the proposed R-SAD can obtain higher accuracy in block matching results compared to the conventional BPMs through the PSNR analysis in the motion compensation experiments.

Fast Hierarchical Block Matching Algorithm by Adaptively Using Spatial Correlation of Motion Field (운동영역의 상관성을 선택적으로 이용한 고속 움직임 추정 기법)

  • 임경원;송병철;나종범
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1996.06a
    • /
    • 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.

  • PDF

Block-based Disparity Estimation Algorithm Using Edge information (영상의 경계 정보를 이용한 블록기반 시차 예측기법)

  • 이병진;유지상
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2C
    • /
    • pp.121-128
    • /
    • 2003
  • In this paper, we propose a new disparity estimation method called object based block matching algorithm(OBMA) for stereoscopic images which is able to reduce the blocking artifact. In the proposed algorithm, edge information of the given image is first extracted and then we estimate the disparity of each segmented object to remove the blocking artifact. In the experimental results, it is proven that the proposed algorithm has about the same performance as the old BMA algorithm while it achieves much better subjective quality.

Motion Estimation with Optical Flow-based Adaptive Search Region

  • Kim, Kyoung-Kyoo;Ban, Seong-Won;Won Sik cheong;Lee, Kuhn-Il
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.843-846
    • /
    • 2000
  • An optical flow-based motion estimation algorithm is proposed for video coding. The algorithm uses block-matching motion estimation with an adaptive search region. The search region is computed from motion fields that are estimated based on the optical flow. The algorithm is based on the fact that true block-motion vectors have similar characteristics to optical flow vectors. Thereafter, the search region is computed using these optical flow vectors that include spatial relationships. In conventional block matching, the search region is fixed. In contrast, in the new method, the appropriate size and location of the search region are both decided by the proposed algorithm. The results obtained using test images show that the proposed algorithm can produce a significant improvement compared with previous block-matching algorithms.

  • PDF

A Systolic Array for High-Speed Computing of Full Search Block Matching Algorithm

  • Jung, Soon-Ho;Woo, Chong-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.10
    • /
    • pp.1275-1286
    • /
    • 2011
  • This paper proposes a high speed systolic array architecture for full search block matching algorithm (FBMA). The pixels of the search area for a reference block are input only one time to find the matched candidate block and reused to compute the sum of absolute difference (SAD) for the adjacent candidate blocks. Each row of designed 2-dimensional systolic array compares the reference block with the adjacent blocks of the same row in search area. The lower rows of the designed array get the pixels from the upper row and compute the SAD with reusing the overlapped pixels of the candidate blocks within same column of the search area. This designed array has no data broadcasting and global paths. The comparison with existing architectures shows that this array is superior in terms of throughput through it requires a little more hardware.

Block matching algorithm using quantization (양자화를 이용한 블록 정합 알고리즘에 대한 연구)

  • Lee, Young;Park, Gwi-Tae
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.2
    • /
    • pp.43-51
    • /
    • 1997
  • In this paper, we quantize the image data to simplify the systolic array architecture for block matching algorithm. As the number of bits for pixel data to be processed is reduced by quantization, one can simplify the hardware of systolic array. Especially, if the bit serial input is used, one can even more simplify the structure of processing element. First, we analize the effect of quantization to a block matching. then we show the structure of quantizer and processing element when bit serial input is used. The simulation results applied to standard images have shown that the proposed block matching method has less prediction error than the conventional high speed algorithm.

  • PDF

A Fast Block Sum Pyramid Algorithm (빠른 블록 합 피라미드 알고리즘)

  • 정수목
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.4
    • /
    • pp.11-16
    • /
    • 2003
  • In this paper, a Fast Block Sum Pyramid Algorithm (FBSPA) is presented for motion estimation in video coding. PBSPA is based on Block Sum Pyramid Algorithm(BSPA), Efficient Multilevel Successive Elimination Algorithms for Block Matching Motion Estimation, and Fast Algorithms for the Estimation of Motion Vectors. FBSPA reduces the computations for motion estimation of BSPA 29% maximally using partial distortion elimination(PDE) scheme.

  • PDF

Fast adaptive block matching algorithm for motion vector estimation (움직임 벡터 추정을 위한 고속 적응 블럭 정합 알고리즘)

  • 신용달;이승진;김경규;정원식;김영춘;이봉락;장종국;이건일
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.9
    • /
    • pp.77-83
    • /
    • 1997
  • We present a fast adaptive block matching algorithm using variable search area and subsampling to estimate motion vector more exactly. In the presented method, the block is classified into one of three motion categories: zero motion vector block, medium-motion bolck or high-motion block according to mean absolute difference of the block. By the simulation, the computation amount of the presented methoe comparable to three step search algorithm and new three step search algorithm. In the fast image sequence, the PSNR of our algorithm increased more than TSS and NTSS, because our algorithm estimated motion vector more accurately.

  • PDF

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.

CLASSIFIED ELGEN BLOCK: LOCAL FEATURE EXTRACTION AND IMAGE MATCHING ALGORITHM

  • Hochul Shin;Kim, Seong-Dae
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2108-2111
    • /
    • 2003
  • This paper introduces a new local feature extraction method and image matching method for the localization and classification of targets. Proposed method is based on the block-by-block projection associated with directional pattern of blocks. Each pattern has its own eigen-vertors called as CEBs(Classified Eigen-Blocks). Also proposed block-based image matching method is robust to translation and occlusion. Performance of proposed feature extraction and matching method is verified by the face localization and FLIR-vehicle-image classification test.

  • PDF