No abstract

Fractional Gaussian noise (fGn) provides a parsimonious model for stationary increments of a self-similar process parameterised by the Hurst exponent, H, and variance, sigma2. Fractional Gaussian noise with H < 0.5 demonstrates negatively autocorrelated or antipersistent behaviour; fGn with H > 0.5 demonstrates 1/f, long memory or persistent behaviour; and the special case of fGn with H = 0.5 corresponds to classical Gaussian white noise. We comparatively evaluate four possible estimators of fGn parameters, one method implemented in the time domain and three in the wavelet domain. We show that a wavelet-based maximum likelihood (ML) estimator yields the most efficient estimates of H and sigma2 in simulated fGn with 0 < H < 1. Applying this estimator to fMRI data acquired in the "resting" state from healthy young and older volunteers, we show empirically that fGn provides an accommodating model for diverse species of fMRI noise, assuming adequate preprocessing to correct effects of head movement, and that voxels with H > 0.5 tend to be concentrated in cortex whereas voxels with H < 0.5 are more frequently located in ventricles and sulcal CSF. The wavelet-ML estimator can be generalised to estimate the parameter vector beta for general linear modelling (GLM) of a physiological response to experimental stimulation and we demonstrate nominal type I error control in multiple testing of beta, divided by its standard error, in simulated and biological data under the null hypothesis beta = 0. We illustrate these methods principally by showing that there are significant differences between patients with early Alzheimer's disease (AD) and age-matched comparison subjects in the persistence of fGn in the medial and lateral temporal lobes, insula, dorsal cingulate/medial premotor cortex, and left pre- and postcentral gyrus: patients with AD had greater persistence of resting fMRI noise (larger H) in these regions. Comparable abnormalities in the AD patients were also identified by a permutation test of local differences in the first-order autoregression AR(1) coefficient, which was significantly more positive in patients. However, we found that the Hurst exponent provided a more sensitive metric than the AR(1) coefficient to detect these differences, perhaps because neurophysiological changes in early AD are naturally better described in terms of abnormal salience of long memory dynamics than a change in the strength of association between immediately consecutive time points. We conclude that parsimonious mapping of fMRI noise properties in terms of fGn parameters efficiently estimated in the wavelet domain is feasible and can enhance insight into the pathophysiology of Alzheimer's disease.

Abstract. This paper introduces a generalized forward-backward splitting algorithm for finding a zero of a sum of maximal monotone operators B + n i=1 A i , where B is cocoercive. It involves the computation of B in an explicit (forward) step and of the parallel computation of the resolvents of the A i 's in a subsequent implicit (backward) step. We prove its convergence in infinite dimension, and robustness to summable errors on the computed operators in the explicit and implicit steps. In particular, this allows efficient minimization of the sum of convex functions f + n i=1 g i , where f has a Lipschitz-continuous gradient and each g i is simple in the sense that its proximity operator is easy to compute. The resulting method makes use of the regularity of f in the forward step, and the proximity operators of the g i 's are applied in parallel in the backward step. While the forwardbackward algorithm cannot deal with more than n = 1 non-smooth function, we generalize it to the case of arbitrary n. Examples on inverse problems in imaging demonstrate the advantage of the proposed methods in comparison to other splitting algorithms.

Abstract-This paper describes the undecimated wavelet transform and its reconstruction. In the first part, we show the relation between two well known undecimated wavelet transforms, the standard undecimated wavelet transform and the isotropic undecimated wavelet transform. Then we present new filter banks specially designed for undecimated wavelet decompositions which have some useful properties such as being robust to ringing artifacts which appear generally in wavelet-based denoising methods. A range of examples illustrates the results.

Abstract-In order to denoise Poisson count data, we introduce a variance stabilizing transform (VST) applied on a filtered discrete Poisson process, yielding a near Gaussian process with asymptotic constant variance. This new transform, which can be deemed as an extension of the Anscombe transform to filtered data, is simple, fast, and efficient in (very) low-count situations. We combine this VST with the filter banks of wavelets, ridgelets and curvelets, leading to multiscale VSTs (MS-VSTs) and nonlinear decomposition schemes. By doing so, the noise-contaminated coefficients of these MS-VST-modified transforms are asymptotically normally distributed with known variances. A classical hypothesis-testing framework is adopted to detect the significant coefficients, and a sparsity-driven iterative scheme reconstructs properly the final estimate. A range of examples show the power of this MS-VST approach for recovering important structures of various morphologies in (very) low-count images. These results also demonstrate that the MS-VST approach is competitive relative to many existing denoising methods.

In this paper we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present a new class of convex optimization programs, or decoders, coined Basis Pursuit DeQuantizer of moment p (BPDQ p ), that model the quantization distortion more faithfully than the commonly used Basis Pursuit DeNoise (BPDN) program. Our decoders proceed by minimizing the sparsity of the signal to be reconstructed subject to a data-fidelity constraint expressed in the p -norm of the residual error for 2 p ∞.We show theoretically that, (i) the reconstruction error of these new decoders is bounded if the sensing matrix satisfies an extended Restricted Isometry Property involving the p norm, and (ii), for Gaussian random matrices and uniformly quantized measurements, BPDQ p performance exceeds that of BPDN by dividing the reconstruction error due to quantization by √ p + 1. This last effect happens with high probability when the number of measurements exceeds a value growing with p, i.e., in an oversampled situation compared to what is commonly required by BPDN = BPDQ 2 . To demonstrate the theoretical power of BPDQ p , we report numerical simulations on signal and image reconstruction problems.

The discrete wavelet transform (DWT) is widely used for multiresolution analysis and decorrelation or "whitening" of nonstationary time series and spatial processes. Wavelets are naturally appropriate for analysis of biological data, such as functional magnetic resonance images of the human brain, which often demonstrate scale invariant or fractal properties. We provide a brief formal introduction to key properties of the DWT and review the growing literature on its application to fMRI. We focus on three applications in particular: (i) wavelet coefficient resampling or "wavestrapping" of 1-D time series, 2- to 3-D spatial maps and 4-D spatiotemporal processes; (ii) wavelet-based estimators for signal and noise parameters of time series regression models assuming the errors are fractional Gaussian noise (fGn); and (iii) wavelet shrinkage in frequentist and Bayesian frameworks to support multiresolution hypothesis testing on spatially extended statistic maps. We conclude that the wavelet domain is a rich source of new concepts and techniques to enhance the power of statistical analysis of human fMRI data.

In a recent paper, a method called morphological component analysis (MCA) has been proposed to separate the texture from the natural part in images. MCA relies on an iterative thresholding algorithm, using a threshold which decreases linearly towards zero along the iterations. This paper shows how the MCA convergence can be drastically improved using the mutual incoherence of the dictionaries associated to the different components. This modified MCA algorithm is then compared to basis pursuit, and experiments show that MCA and BP solutions are similar in terms of sparsity, as measured by the l1 norm, but MCA is much faster and gives us the possibility of handling large scale data sets.