Share Email Print

Proceedings Paper

Optimal separable correlation filters
Author(s): Frank E. McFadden
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Separable filters, because they are specified separately in each dimension, require less memory space and present opportunities for faster computation. Mahalanobis and Kumar1 presented a method for deriving separable correlation filters, but the filters were required to satisfy a restrictive assumption, and were thus not fully optimized. In this work, we present a general procedure for deriving separable versions of any correlation filter, using singular value decomposition (SVD), and prove that this is optimal for separable filters based on the Maximum Average Correlation Height (MACH) criterion. Further, we show that additional separable components may be used to improve the performance of the filter, with only a linear increase in computational and memory space requirements. MSTAR data is used to demonstrate the effects on sharpness of correlation peaks and locational precision, as the number of separable components is varied.

Paper Details

Date Published: 25 July 2002
PDF: 11 pages
Proc. SPIE 4726, Automatic Target Recognition XII, (25 July 2002); doi: 10.1117/12.477014
Show Author Affiliations
Frank E. McFadden, General Dynamics Advanced Information Systems (United States)

Published in SPIE Proceedings Vol. 4726:
Automatic Target Recognition XII
Firooz A. Sadjadi, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?