37,111 research outputs found
Optimal Rates of Convergence for Noisy Sparse Phase Retrieval via Thresholded Wirtinger Flow
This paper considers the noisy sparse phase retrieval problem: recovering a
sparse signal from noisy quadratic measurements , , with independent sub-exponential
noise . The goals are to understand the effect of the sparsity of
on the estimation precision and to construct a computationally feasible
estimator to achieve the optimal rates. Inspired by the Wirtinger Flow [12]
proposed for noiseless and non-sparse phase retrieval, a novel thresholded
gradient descent algorithm is proposed and it is shown to adaptively achieve
the minimax optimal rates of convergence over a wide range of sparsity levels
when the 's are independent standard Gaussian random vectors, provided
that the sample size is sufficiently large compared to the sparsity of .Comment: 28 pages, 4 figure
SZ and CMB reconstruction using Generalized Morphological Component Analysis
In the last decade, the study of cosmic microwave background (CMB) data has
become one of the most powerful tools to study and understand the Universe.
More precisely, measuring the CMB power spectrum leads to the estimation of
most cosmological parameters. Nevertheless, accessing such precious physical
information requires extracting several different astrophysical components from
the data. Recovering those astrophysical sources (CMB, Sunyaev-Zel'dovich
clusters, galactic dust) thus amounts to a component separation problem which
has already led to an intense activity in the field of CMB studies. In this
paper, we introduce a new sparsity-based component separation method coined
Generalized Morphological Component Analysis (GMCA). The GMCA approach is
formulated in a Bayesian maximum a posteriori (MAP) framework. Numerical
results show that this new source recovery technique performs well compared to
state-of-the-art component separation methods already applied to CMB data.Comment: 11 pages - Statistical Methodology - Special Issue on Astrostatistics
- in pres
ICA-based sparse feature recovery from fMRI datasets
Spatial Independent Components Analysis (ICA) is increasingly used in the
context of functional Magnetic Resonance Imaging (fMRI) to study cognition and
brain pathologies. Salient features present in some of the extracted
Independent Components (ICs) can be interpreted as brain networks, but the
segmentation of the corresponding regions from ICs is still ill-controlled.
Here we propose a new ICA-based procedure for extraction of sparse features
from fMRI datasets. Specifically, we introduce a new thresholding procedure
that controls the deviation from isotropy in the ICA mixing model. Unlike
current heuristics, our procedure guarantees an exact, possibly conservative,
level of specificity in feature detection. We evaluate the sensitivity and
specificity of the method on synthetic and fMRI data and show that it
outperforms state-of-the-art approaches
Gaussian Process Structural Equation Models with Latent Variables
In a variety of disciplines such as social sciences, psychology, medicine and
economics, the recorded data are considered to be noisy measurements of latent
variables connected by some causal structure. This corresponds to a family of
graphical models known as the structural equation model with latent variables.
While linear non-Gaussian variants have been well-studied, inference in
nonparametric structural equation models is still underdeveloped. We introduce
a sparse Gaussian process parameterization that defines a non-linear structure
connecting latent variables, unlike common formulations of Gaussian process
latent variable models. The sparse parameterization is given a full Bayesian
treatment without compromising Markov chain Monte Carlo efficiency. We compare
the stability of the sampling procedure and the predictive ability of the model
against the current practice.Comment: 12 pages, 6 figure
Poisson noise reduction with non-local PCA
Photon-limited imaging arises when the number of photons collected by a
sensor array is small relative to the number of detector elements. Photon
limitations are an important concern for many applications such as spectral
imaging, night vision, nuclear medicine, and astronomy. Typically a Poisson
distribution is used to model these observations, and the inherent
heteroscedasticity of the data combined with standard noise removal methods
yields significant artifacts. This paper introduces a novel denoising algorithm
for photon-limited images which combines elements of dictionary learning and
sparse patch-based representations of images. The method employs both an
adaptation of Principal Component Analysis (PCA) for Poisson noise and recently
developed sparsity-regularized convex optimization algorithms for
photon-limited images. A comprehensive empirical evaluation of the proposed
method helps characterize the performance of this approach relative to other
state-of-the-art denoising methods. The results reveal that, despite its
conceptual simplicity, Poisson PCA-based denoising appears to be highly
competitive in very low light regimes.Comment: erratum: Image man is wrongly name pepper in the journal versio
Sparse and Non-Negative BSS for Noisy Data
Non-negative blind source separation (BSS) has raised interest in various
fields of research, as testified by the wide literature on the topic of
non-negative matrix factorization (NMF). In this context, it is fundamental
that the sources to be estimated present some diversity in order to be
efficiently retrieved. Sparsity is known to enhance such contrast between the
sources while producing very robust approaches, especially to noise. In this
paper we introduce a new algorithm in order to tackle the blind separation of
non-negative sparse sources from noisy measurements. We first show that
sparsity and non-negativity constraints have to be carefully applied on the
sought-after solution. In fact, improperly constrained solutions are unlikely
to be stable and are therefore sub-optimal. The proposed algorithm, named nGMCA
(non-negative Generalized Morphological Component Analysis), makes use of
proximal calculus techniques to provide properly constrained solutions. The
performance of nGMCA compared to other state-of-the-art algorithms is
demonstrated by numerical experiments encompassing a wide variety of settings,
with negligible parameter tuning. In particular, nGMCA is shown to provide
robustness to noise and performs well on synthetic mixtures of real NMR
spectra.Comment: 13 pages, 18 figures, to be published in IEEE Transactions on Signal
Processin
- …