The theory of sparse stochastic processes offers a broad class of statistical models to study signals. In this framework, signals are represented as realizations of random processes that are solution of linear stochastic differential equations driven by white L 'evy noises. Among these processes, generalized Poisson processes based on compound-Poisson noises admit an interpretation as random L-splines with random knots and weights. We demonstrate that every generalized L 'evy process-from Gaussian to sparse-can be understood as the limit in law of a sequence of generalized Poisson processes. This enables a new conceptual understanding of sparse processes and suggests simple algorithms for the numerical generation of such objects.
Random processes and random fields are notorious tools to model uncertainty and statistics of signals @cite_3 . Gaussian processes are by far the most studied stochastic models because of their fundamental properties (, stability, finite variance, central-limit theorem) and their relative ease of use. They are the principal actors within the classical'' paradigm in statistical signal processing @cite_23 . Many fractal-type signals are modeled as self-similar Gaussian processes @cite_32 @cite_9 @cite_46 @cite_7 . However, many real-world signals are empirically observed to be inherently sparse, a property that is incompatible with Gaussianity @cite_11 @cite_24 @cite_39 . In order to overcome the limitations of Gaussian model, several other stochastic models has been proposed for the study of sparse signals. They include infinite-variance @cite_46 @cite_35 or piecewise-constant models @cite_11 @cite_28 .
@cite_35 @cite_7 @cite_28 @cite_9 @cite_32 @cite_3 @cite_39 @cite_24 @cite_23 @cite_46 @cite_11
2099205567 2190195640 2061375390 2953076353
We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential equations, or, equivalently, in terms of a suitable innovation model; the latter is analogous conceptually to the classical interpretation of a Gaussian stationary process as filtered white noise. The two specific features of our approach are 1) signal generation is driven by a random stream of Dirac impulses (Poisson noise) instead of Gaussian white noise, and 2) the class of admissible whitening operators is considerably larger than what is allowed in the conventional theory of stationary processes. We provide a complete characterization of these finite-rate-of-innovation signals within Gelfand's framework of generalized stochastic processes. We then focus on the class of scale-invariant whitening operators which correspond to unstable systems. We show that these can be solved by introducing proper boundary conditions, which leads to the specification of random, spline-type signals that are piecewise-smooth. These processes are the Poisson counterpart of fractional Brownian motion; they are nonstationary and have the same 1 ω-type spectral signature. We prove that the generalized Poisson processes have a sparse representation in a wavelet-like basis subject to some mild matching condition. We also present a limit example of sparse process that yields a MAP signal estimator that is equivalent to the popular TV-denoising algorithm. It is well documented that natural images are compressible in wavelet bases and tend to exhibit fractal properties. In this paper, we investigate statistical models that mimic these behaviors. We then use our models to make predictions on the statistics of the wavelet coefficients. Following an innovation modeling approach, we identify a general class of finite-variance self-similar sparse random processes. We first prove that spatially dilated versions of self-similar sparse processes are asymptotically Gaussian as the dilation factor increases. Based on this fundamental result, we show that the coarse-scale wavelet coefficients of these processes are also asymptotically Gaussian, provided the wavelet has enough vanishing moments. Moreover, we quantify the degree of Gaussianity by deriving the theoretical evolution of the kurtosis of the wavelet coefficients across scales. Finally, we apply our analysis to one- and two-dimensional signals, including natural images, and show that the wavelet coefficients ... We compare and contrast from a geometric perspective a number of low-dimensional signal models that support stable information-preserving dimensionality reduction. We consider sparse and compressible signal models for deterministic and random signals, structured sparse and compressible signal models, point clouds, and manifold signal models. Each model has a particular geometrical structure that enables signal information to be stably preserved via a simple linear and nonadaptive projection to a much lower dimensional space; in each case the projection dimension is independent of the signal's ambient dimension at best or grows logarithmically with it at worst. As a bonus, we point out a common misconception related to probabilistic compressible signal models, namely, by showing that the oft-used generalized Gaussian and Laplacian models do not support stable linear dimensionality reduction. This paper provides novel results for the recovery of signals from undersampled measurements based on analysis @math -minimization, when the analysis operator is given by a frame. We both provide so-called uniform and nonuniform recovery guarantees for cosparse (analysis-sparse) signals using Gaussian random measurement matrices. The nonuniform result relies on a recovery condition via tangent cones and the uniform recovery guarantee is based on an analysis version of the null space property. Examining these conditions for Gaussian random matrices leads to precise bounds on the number of measurements required for successful recovery. In the special case of standard sparsity, our result improves a bound due to Rudelson and Vershynin concerning the exact reconstruction of sparse signals from Gaussian measurements with respect to the constant and extends it to stability under passing to approximately sparse signals and to robustness under noise on the measurements.