FFT-based full-search block matching using overlap-add method

@article{Sasaki2010FFTbasedFB,
  title={FFT-based full-search block matching using overlap-add method},
  author={Hidetake Sasaki and Zhen Li and Hitoshi Kiya},
  journal={28th Picture Coding Symposium},
  year={2010},
  pages={586-589}
}
One category of fast full-search block matching algorithms (BMAs) is based on the fast Fourier transformation (FFT). In conventional methods in this category, the macroblock size must be adjusted to the search window size by zero-padding. In these methods, the memory consumption and computational complexity heavily depend on the size difference between the macroblock and the search window. Thus, we propose a novel FFT-based BMA to solve this problem. The proposed method divides the search… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Kiya,“An FFT-based full-search block-matching algorithm with SSD criterion,

  • Z. Li, A. Uemura
  • in Proc. APSIPA ASC,
  • 2009
Highly Influential
8 Excerpts

Simple noncircular correlation method for exhaustive sum square difference matching

  • F. Essannouni, R.O.H. Thami, D. Aboutajdine, A. Salam
  • Opt. Eng., vol.46, pp.107004-1–107004-4, Oct…
  • 2007
2 Excerpts

Willson,“Some efficient digital prefilter structure,

  • A.N.J.W. Adams
  • IEEE Trans. Circuits Syst., vol.31,
  • 1984
1 Excerpt

A new approach to FIR digital filter design with fewer multipliers and reduced sensitivity

  • J. W. Adams, A. N. Willson
  • IEEE Trans. Circuits Syst., vol.30, pp.277– 283…
  • 1983
1 Excerpt

Similar Papers

Loading similar papers…