KEYWORDS: Scattering, Matrices, Signal to noise ratio, Super resolution, Space based lasers, Algorithm development, Pulse signals, Detection and tracking algorithms, Radar signal processing, Image resolution
We are focused on improving the resolution of images of moving targets in inverse synthetic aperture radar (ISAR) imaging. This can be achieved by recovering the scattering points of a target that have stronger reflections than other target points, resulting in a higher radar cross section of a target. However, these points are sparse and moving targets cannot be correctly detected in ISAR images. To increase the resolution in ISAR imaging, we propose the fast reweighted trace minimization (FRWTM) method to retrieve frequencies of sparse scattering points in both range and azimuth directions. This method is a two-dimensional gridless super-resolution method that does not depend on fitting the scattering point on the grids. Using computer simulations, the proposed algorithm is compared with fast reweighted atomic norm minimization (FRANM), sparse Bayesian learning (SBL), and SL0 algorithms in terms of mean squared error (MSE). The results show that FRWTM performs better than the other methods, especially SBL and SL0 at low signal-to-noise ratio (SNR) and fewer samples.
We present a semisupervised hyperspectral unmixing solution that incorporates the spatial information between neighbor pixels in the abundance estimation procedure. The proposed method is applied to a polynomial postnonlinear mixing model in which each pixel reflection is characterized by a nonlinear function of pure spectral signatures corrupted by additive white Gaussian noise. The image is partitioned into different classes containing similar materials with the same abundance vectors. We model the spatial correlation of pixels of each class by the Markov random field. A Bayesian framework is used to iteratively estimate each class and its corresponding abundance vector. Here, we propose the sparse Dirichlet prior for abundance vectors to demonstrate a semisupervised scenario. A Markov chain Monte Carlo algorithm is used to estimate abundance vectors. The major contribution of this work is based on combination of spatial correlation with nonlinear mixing models in a semisupervised scenario. The proposed approach is compared to linear mixing model, generalized bilinear mixing model, and the conventional polynomial postnonlinear mixing model algorithms. The results on both simulated and real data show the outperformance of the proposed algorithm by achieving lower errors in unmixing and reconstruction of hyperspectral images.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.