Target detection using nonsingular approximations for a singular covariance matrix
Summary: Accurate covariance matrix estimation for high-dimensional data can be a difficult problem. A good approximation of the covariance matrix needs in most cases a prohibitively large number of pixels, that is, pixels from a stationary section of the image whose number is greater than several times the number of bands. Estimating the covariance matrix with a number of pixels that is on the order of the number of bands or less will cause not only a bad estimation of the covariance matrix but also a singular covariance matrix which cannot be inverted. In this paper we will investigate two methods to give a sufficient approximation for the covariance matrix while only using a small number of neighboring pixels. The first is the quasilocal covariance matrix (QLRX) that uses the variance of the global covariance instead of the variances that are too small and cause a singular covariance. The second method is sparse matrix transform (SMT) that performs a set of K-givens rotations to estimate the covariance matrix. We will compare results from target acquisition that are based on both of these methods. An improvement for the SMT algorithm is suggested.
- Covariance matrix estimation for CFAR detection in correlated heavy tailed clutter.
- Covariance matrix estimation for CFAR detection in correlated heavy tailed clutter
- An efficient numerical method for condition number constrained covariance matrix approximation
- Eigendecomposition of the multi-channel covariance matrix with applications to SAR-GMTI
- Estimation of a sparse and spiked covariance matrix
This page was built for publication: Target detection using nonsingular approximations for a singular covariance matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693838)
