Please use this identifier to cite or link to this item:

Improved Fast Block Matching Algorithm in Feature Domain

Authors FOK, YH
AU, OC HKUST affiliated (currently or previously)
Issue Date 1994
Source VISUAL COMMUNICATIONS AND IMAGE PROCESSING '94, PTS 1-3 , v. 2308, 1994, p. 1826-1837
Summary A fast block matching algorithm in the feature domain was proposed by Fok and Au with a computation reduction factor of N/2 for a search block size of NxN. Although the algorithm can achieve close-to-optimal result, it requires a large amount of memory to store the features. This paper presents three improved fast block matching algorithms in the integral projections feature domain which can also reduce the computation significantly but with a considerably lower memory requirement. With a search block size of NxN, two of our algorithms retain a computation reduction factor of N/2 while the other one can achieve a computation reduction factor of N. The three algorithms can achieve close-to-optimal performance in mean absolute difference(MAD) sense.
Rights Copyright 1994 Society of Photo-Optical Instrumentation Engineers. This paper was published in Visual Communications and Image Processing '94, Aggelos K. Katsaggelos, Editor, Proceedings of SPIE Vol. 2308, p. 1826-1833 (1994) and is made available as an electronic reprint with permission of SPIE. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distirbution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
2308.pdf 1673468 B Adobe PDF