Abstract

This letter extends the idea of regularization to spectral matched filters. It incorporates a quadratic penalization term in the design of spectral matched filters in order to restrict the possible matched filters (models) to a subset which are more stable and have better performance than the non-regularized adaptive spectral matched filters. The effect of regularization depends on the form of the regularization term and the amount of regularization which is controlled by a parameter so-called the regularization coefficient. In this letter, the sum-of-squares of the filter coefficients is used as the regularization term, and different values for the regularization coefficient are tested. A Bayesian-based derivation of the regularized matched filter is also described which provides a procedure for choosing the regularization coefficient. Experimental results for detecting targets in hyperspectral imagery are presented for regularized and non-regularized spectral matched filters.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.