Multi Point Search Pattern for Fast Search Motion Estimation of High Resolution Video Coding
Author(s) -
Nehal N. Shah,
Upena D. Dalal,
Priyank H. Prajapati
Publication year - 2015
Publication title -
international journal of image graphics and signal processing
Language(s) - English
Resource type - Journals
eISSN - 2074-9082
pISSN - 2074-9074
DOI - 10.5815/ijigsp.2015.07.07
Subject(s) - computer science , motion estimation , coding (social sciences) , beam stack search , computer vision , block matching algorithm , artificial intelligence , search algorithm , inter frame , frame (networking) , reference frame , algorithm , beam search , video processing , video tracking , incremental heuristic search , mathematics , telecommunications , statistics
Block matching algorithm (BMA) based motion estimation (ME) is most accepted method for removal of temporal redundancy between frames in video coding. With recent advancement in resolution of video, the need of search pattern covering most of macroblocks within search area in frame is increasing. Existing search patterns are tiny and take plenty of time to reach at edge or corner of the search window. With aim of covering nearly every probable candidate macroblocks in all direction and to speed up the search process, multipoint search patterns are presented in this paper. Initial candidate macroblocks are chosen on grid of 12x12 and then search progresses like traditional diamond or hexagon search. Due to multipoint, chances of trapping in incorrect direction is very less and method can exhibit better quality of encoding with optimum number of search points. Index Terms—Motion Estimation, Fast search block matching algorithm, Multi point search, H.265, HD video sequences.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom