A fast full search algorithm using directional oriented search order

  • Lim, Dongyoung
  • Park, Sang-Jun
  • Kim, Taeyang
  • Jeong, Jechang
Citations

SCOPUS

0

초록

We propose a fast full search algorithm that reduces the computation of block matching algorithm which is used for motion estimation in the video coding. The conventional spiral search algorithm is good for slow motion picture because it starts searching at the center of the search region and moves the search point pixel-bypixel. The proposed algorithm, however, is the efficient motion estimation method which is good for fast and slow motion picture. It estimates the motion in the new search order after partitioning the search window and adapts the directional search order in the re-divided search window. At the result, we can check that the proposed algorithm, which is based on MSEA, reduces the computation by up to 99% for block matching error, compared with the conventional full search algorithm, without any loss of image quality.

키워드

BMAFast algorithmFull searchMotion estimationMSEAAlgorithmsColor image processingDigital image storageImage codingImage processingImage qualityImaging systemsLearning algorithmsMotion compensationMotion picturesProgramming theoryVisual communicationVisualizationWindowsBlock matchingBMAConventional spiralsDirectional searchesFast algorithmFast full searchesFull searchFull search algorithmsMSEASearch AlgorithmsSearch pointsSearch regionsVideo codingMotion estimation
제목
A fast full search algorithm using directional oriented search order
저자
Lim, DongyoungPark, Sang-JunKim, TaeyangJeong, Jechang
DOI
10.5555/1659167.1659209
발행일
2007-08
유형
Conference Paper
저널명
Proceedings of the 7th IASTED International Conference on Visualization, Imaging, and Image Processing, VIIP 2007
페이지
219 ~ 223