465 research outputs found
Non-Local Compressive Sensing Based SAR Tomography
Tomographic SAR (TomoSAR) inversion of urban areas is an inherently sparse
reconstruction problem and, hence, can be solved using compressive sensing (CS)
algorithms. This paper proposes solutions for two notorious problems in this
field: 1) TomoSAR requires a high number of data sets, which makes the
technique expensive. However, it can be shown that the number of acquisitions
and the signal-to-noise ratio (SNR) can be traded off against each other,
because it is asymptotically only the product of the number of acquisitions and
SNR that determines the reconstruction quality. We propose to increase SNR by
integrating non-local estimation into the inversion and show that a reasonable
reconstruction of buildings from only seven interferograms is feasible. 2)
CS-based inversion is computationally expensive and therefore barely suitable
for large-scale applications. We introduce a new fast and accurate algorithm
for solving the non-local L1-L2-minimization problem, central to CS-based
reconstruction algorithms. The applicability of the algorithm is demonstrated
using simulated data and TerraSAR-X high-resolution spotlight images over an
area in Munich, Germany.Comment: 10 page
Deep learning for inverse problems in remote sensing: super-resolution and SAR despeckling
L'abstract è presente nell'allegato / the abstract is in the attachmen
Characterization and Reduction of Noise in Manifold Representations of Hyperspectral Imagery
A new workflow to produce dimensionality reduced manifold coordinates based on the improvements of landmark Isometric Mapping (ISOMAP) algorithms using local spectral models is proposed. Manifold space from nonlinear dimensionality reduction better addresses the nonlinearity of the hyperspectral data and often has better per- formance comparing to the results of linear methods such as Minimum Noise Fraction (MNF). The dissertation mainly focuses on using adaptive local spectral models to fur- ther improve the performance of ISOMAP algorithms by addressing local noise issues and perform guided landmark selection and nearest neighborhood construction in local spectral subsets. This work could benefit the performance of common hyperspectral image analysis tasks, such as classification, target detection, etc., but also keep the computational burden low. This work is based on and improves the previous ENH- ISOMAP algorithm in various ways. The workflow is based on a unified local spectral subsetting framework. Embedding spaces in local spectral subsets as local noise models are first proposed and used to perform noise estimation, MNF regression and guided landmark selection in a local sense. Passive and active methods are proposed and ver- ified to select landmarks deliberately to ensure local geometric structure coverage and local noise avoidance. Then, a novel local spectral adaptive method is used to construct the k-nearest neighbor graph. Finally, a global MNF transformation in the manifold space is also introduced to further compress the signal dimensions. The workflow is implemented using C++ with multiple implementation optimizations, including using heterogeneous computing platforms that are available in personal computers. The re- sults are presented and evaluated by Jeffries-Matsushita separability metric, as well as the classification accuracy of supervised classifiers. The proposed workflow shows sig- nificant and stable improvements over the dimensionality reduction performance from traditional MNF and ENH-ISOMAP on various hyperspectral datasets. The computa- tional speed of the proposed implementation is also improved
Recommended from our members
Recursive conditional means image denoising
Methods and composition for denoising digital camera images are provided herein. The method is based on directly measuring the local statistical structure of natural images in a large training set that has been corrupted with noise mimicking digital camera noise. The measured statistics are conditional means of the ground truth pixel value given a local context of input pixels. Each conditional mean is the Bayes optimal (minimum mean squared error) estimate given the specific local context. The conditional means are measured and applied recursively (e.g., the second conditional mean is measured after denoising with the first conditional mean). Each local context vector consists of only three variables, and hence the conditional means can be measured directly without prior assumptions about the underlying probability distributions, and they can be stored in fixed lookup tables.Board of Regents, University of Texas Syste
- …