An FFT-Based Full-Search Block Matching Algorithm with Sum of Squared Differences Criterion
Summary :
An FFT-based full-search block matching algorithm (BMA) is described that uses the sum of squared differences (SSD) criterion. The proposed method does not have to extend a real signal into complex one. This reduces the computational load of FFT approaches. In addition, if two macroblocks share the same search window, they can be matched at the same time. In a simulation of motion estimation, the proposed method achieved the same performance as a direct SSD full search and its processing speed is faster than other FFT-based BMAs.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.10 pp.1748-1754
- Publication Date
- 2010/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.1748
- Type of Manuscript
- PAPER
- Category
- Digital Signal Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Zhen LI, Atushi UEMURA, Hitoshi KIYA, "An FFT-Based Full-Search Block Matching Algorithm with Sum of Squared Differences Criterion" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 10, pp. 1748-1754, October 2010, doi: 10.1587/transfun.E93.A.1748.
Abstract: An FFT-based full-search block matching algorithm (BMA) is described that uses the sum of squared differences (SSD) criterion. The proposed method does not have to extend a real signal into complex one. This reduces the computational load of FFT approaches. In addition, if two macroblocks share the same search window, they can be matched at the same time. In a simulation of motion estimation, the proposed method achieved the same performance as a direct SSD full search and its processing speed is faster than other FFT-based BMAs.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1748/_p
Copy
@ARTICLE{e93-a_10_1748,
author={Zhen LI, Atushi UEMURA, Hitoshi KIYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An FFT-Based Full-Search Block Matching Algorithm with Sum of Squared Differences Criterion},
year={2010},
volume={E93-A},
number={10},
pages={1748-1754},
abstract={An FFT-based full-search block matching algorithm (BMA) is described that uses the sum of squared differences (SSD) criterion. The proposed method does not have to extend a real signal into complex one. This reduces the computational load of FFT approaches. In addition, if two macroblocks share the same search window, they can be matched at the same time. In a simulation of motion estimation, the proposed method achieved the same performance as a direct SSD full search and its processing speed is faster than other FFT-based BMAs.},
keywords={},
doi={10.1587/transfun.E93.A.1748},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - An FFT-Based Full-Search Block Matching Algorithm with Sum of Squared Differences Criterion
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1748
EP - 1754
AU - Zhen LI
AU - Atushi UEMURA
AU - Hitoshi KIYA
PY - 2010
DO - 10.1587/transfun.E93.A.1748
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2010
AB - An FFT-based full-search block matching algorithm (BMA) is described that uses the sum of squared differences (SSD) criterion. The proposed method does not have to extend a real signal into complex one. This reduces the computational load of FFT approaches. In addition, if two macroblocks share the same search window, they can be matched at the same time. In a simulation of motion estimation, the proposed method achieved the same performance as a direct SSD full search and its processing speed is faster than other FFT-based BMAs.
ER -
English
