A Frequency Based Hierarchical Fast Search Block Matching Algorithm for Fast Video Communication

Numerous fast-search block motion estimation algorithms have been developed to circumvent the high computational cost required by the full-search algorithm. These techniques however often converge to a local minimum, which makes them subject to noise and matching errors. Hence, many spatial domain block matching algorithms have been developed in literature. These algorithms exploit the high correlation that exists between pixels inside each frame block. However, with the block transformed frequencies, block matching can be used to test the similarities between a subset of selected frequencies that correctly identify each block uniquely; therefore fewer comparisons are performed resulting in a considerable reduction in complexity. In this work, a two-level hierarchical fast search motion estimation algorithm is proposed in the frequency domain. This algorithm incorporates a novel search pattern at the top level of the hierarchy. The proposed hierarchical method for motion estimation not only produces consistent motion vectors within each large object, but also accurately estimates the motion of small objects with a substantial reduction in complexity when compared to other benchmark algorithms.

@article{Al-Najdawi2016,
  title     = {A Frequency Based Hierarchical Fast Search Block Matching Algorithm for Fast Video Communication},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {4},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Nijad Al-Najdawi and Sara Tedmori and Omar A. Alzubi and Osama Dorgham and Jafar A. Alzubi},
  doi       = {10.14569/IJACSA.2016.070459},
  url       = {https://doi.org/10.14569/IJACSA.2016.070459}
}