Target Detection Using Nonsingular Approximations for a Singular Covariance Matrix
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...
Saved in:
| Main Authors: | Nir Gorelik, Dan Blumberg, Stanley R. Rotman, Dirk Borghys |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Journal of Electrical and Computer Engineering |
| Online Access: | http://dx.doi.org/10.1155/2012/628479 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Evaluating Subpixel Target Detection Algorithms in Hyperspectral Imagery
by: Yuval Cohen, et al.
Published: (2012-01-01) -
Numerical approximations of groundwater flow problem using fractional variational iteration method with fractional derivative of singular and nonsingular kernels
by: Pravindra Kumar, et al.
Published: (2024-12-01) -
Newton’s Method for the Matrix Nonsingular Square Root
by: Chun-Mei Li, et al.
Published: (2014-01-01) -
A test on the location of tangency portfolio for small sample size and singular covariance matrix
by: Svitlana Drin, et al.
Published: (2024-07-01) -
Construction of a Sparse Covariance Matrix Based on Statistical Data Analysis and Its Use in Choosing an Optimal Portfolio of Securities
by: V. A. Gorelik, et al.
Published: (2025-01-01)