16 September 1994 Efficient algorithm for two-dimensional finite impulse response (FIR) filtering and system identification
Author Affiliations +
Proceedings Volume 2308, Visual Communications and Image Processing '94; (1994) https://doi.org/10.1117/12.185963
Event: Visual Communications and Image Processing '94, 1994, Chicago, IL, United States
Abstract
In this paper a novel algorithm is presented for the efficient 2D Least Squares FIR filtering and system identification. Filter masks of general boundaries are allowed. Efficient order updating recursions are developed by exploiting the spatial shift invariance property of the 2D data set. In contrast to the existing column (row)-wise 2D recursive schemes based on the Levinson-Wiggins-Robinson's multichannel algorithm, the proposed technique offers the greatest maneuverability in the 2D index space in a computational efficient way. This flexibility can be taken into advantage if the shape of the 2D mask is not a priori known and has to be dynamically configured. The recursive character of the algorithm allows for a continuous reshaping of the filter mask. Search for the optimal filter mask, essentially reconfigures the filter mask to achieve an optimal match. The optimum determination of the mask shape offers important advantages in 2D system modeling, filtering and image restorations.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
George-Othon Glentis, Cornelis H. Slump, Otto E. Herrmann, "Efficient algorithm for two-dimensional finite impulse response (FIR) filtering and system identification", Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185963; https://doi.org/10.1117/12.185963
PROCEEDINGS
12 PAGES


SHARE
Back to Top