We study unique recovery of cosparse signals from limited-angle tomographic measurements of two- and three-dimensional domains. Admissible signals belong to the union of subspaces defined by all cosupports of maximal cardinality @math with respect to the discrete gradient operator. We relate @math both to the number of measurements and to a nullspace condition with respect to the measurement matrix, so as to achieve unique recovery by linear programming. These results are supported by comprehensive numerical experiments that show a high correlation of performance in practice and theoretical predictions. Despite poor properties of the measurement matrix from the viewpoint of compressed sensing, the class of uniquely recoverable signals basically seems large enough to cover practical applications, like contactless quality inspection of compound solid bodies composed of few materials.
Empirical evidence for the recovery of piecewise constant functions from few tomographic measurements was already observed in @cite_13 @cite_20 @cite_23 . The first theoretical guarantees that have been obtained for recovery from noiseless samples of images with exactly sparse gradients via total variation minimization, date back to the beginnings of CS @cite_12 @cite_10 . However, the measurements considered were incomplete Fourier samples, and images were not sampled along lines in the spatial domain, but along few radial lines in the frequency domain. Such measurements ensembles are known to have good CS properties as opposed to the CT setup, and are almost isometric on sparse signals for a sufficient number of samples. As a result, recovery is stable in such scenarios. Stable recovery of the image gradient from incomplete Fourier samples was shown in @cite_7 , while Needell @cite_6 showed that stable image reconstruction via total variation minimization is possible also beyond the Fourier setup, provided the measurement ensemble satisfies the RIP condition.
@cite_13 @cite_7 @cite_6 @cite_23 @cite_20 @cite_10 @cite_12
2147276092 2056283746 1977252496 2953076353
Traditional sampling theories consider the problem of reconstructing an unknown signal x from a series of samples. A prevalent assumption which often guarantees recovery from the given measurements is that x lies in a known subspace. Recently, there has been growing interest in nonlinear but structured signal models, in which x lies in a union of subspaces. In this paper, we develop a general framework for robust and efficient recovery of such signals from a given set of samples. More specifically, we treat the case in which x lies in a sum of k subspaces, chosen from a larger set of m possibilities. The samples are modeled as inner products with an arbitrary set of sampling functions. To derive an efficient and robust recovery algorithm, we show that our problem can be formulated as that of recovering a block-sparse vector whose nonzero elements appear in fixed blocks. We then propose a mixed lscr2 lscr1 program for block sparse recovery. Our main result is an equivalence condition under which the proposed convex algorithm is guaranteed to recover the original signal. This result relies on the notion of block restricted isometry property (RIP), which is a generalization of the standard RIP used extensively in the context of compressed sensing. Based on RIP, we also prove stability of our approach in the presence of noise and modeling errors. A special case of our framework is that of recovering multiple measurement vectors (MMV) that share a joint sparsity pattern. Adapting our results to this context leads to new MMV recovery methods as well as equivalence conditions under which the entire set can be determined efficiently. Abstract Compressive sensing (CS) theory makes it possible – under certain assumptions – to recover a signal or an image sampled below the Nyquist sampling limit. In medical ultrasound imaging, CS could allow lowering the amount of acquired data needed to reconstruct the echographic image. CS thus offers the perspective of speeding up echographic acquisitions and could have many applications, e.g. triplex acquisitions for CFM B-mode Doppler imaging, high-frame-rate echocardiography, 3D imaging using matrix probes, etc. The objective of this paper is to study the feasibility of CS for the reconstruction of channel RF data, i.e. the 2D set of raw RF lines gathered at the receive elements. Successful application of CS implies selecting a representation basis where the data to be reconstructed have a sparse expansion. Because they consist mainly in warped oscillatory patterns, channel RF data do not easily lend themselves to a sparse representation and thus represent a specific challenge. Within this perspective, we propose to perform and assess CS reconstruction of channel RF data using the recently introduced wave atoms [1] representation, which exhibit advantageous properties for sparsely representing such oscillatory patterns. Reconstructions obtained using wave atoms are compared with the reconstruction performed with two conventional representation bases, namely Fourier and Daubechies wavelets. The first experiment was conducted on simulated channel RF data acquired from a numerical cyst phantom. The quality of the reconstructions was quantified through the mean absolute error at varying subsampling rates by removing 50–90 of the original samples. The results obtained for channel RF data reconstruction yield error ranges of [0.6–3.0] × 10−2, [0.2–2.6] × 10−2, [0.1–1.5] × 10−2, for wavelets, Fourier and wave atoms respectively. The error ranges observed for the associated beamformed log-envelope images are [2.4–20.6] dB, [1.1–12.2] dB, and [0.5–8.8 dB] using wavelets, Fourier, and wave atoms, respectively. These results thus show the superiority of the wave atom representation and the feasibility of CS for the reconstruction of US RF data. The second experiment aimed at showing the experimental feasibility of the method proposed using a data set acquired by imaging a general-purpose phantom (CIRS Model 054GS) using an Ultrasonix MDP scanner. The reconstruction was performed by removing 80 of the initial samples and using wave atoms. The reconstructed image was found to reliably preserve the speckle structure and was associated with an error of 5.5 dB. We study the notion of compressed sensing (CS) as put forward by Donoho, Candes, Tao and others. The notion proposes a signal or image, unknown but supposed to be compressible by a known transform, (e.g. wavelet or Fourier), can be subjected to fewer measurements than the nominal number of data points, and yet be accurately reconstructed. The samples are nonadaptive and measure 'random' linear combinations of the transform coefficients. Approximate reconstruction is obtained by solving for the transform coefficients consistent with measured data and having the smallest possible l1 norm.We present initial 'proof-of-concept' examples in the favorable case where the vast majority of the transform coefficients are zero. We continue with a series of numerical experiments, for the setting of lp-sparsity, in which the object has all coefficients nonzero, but the coefficients obey an lp bound, for some p ∈ (0, 1]. The reconstruction errors obey the inequalities paralleling the theory, seemingly with well-behaved constants.We report that several workable families of 'random' linear combinations all behave equivalently, including random spherical, random signs, partial Fourier and partial Hadamard.We next consider how these ideas can be used to model problems in spectroscopy and image processing, and in synthetic examples see that the reconstructions from CS are often visually "noisy". To suppress this noise we postprocess using translation-invariant denoising, and find the visual appearance considerably improved.We also consider a multiscale deployment of compressed sensing, in which various scales are segregated and CS applied separately to each; this gives much better quality reconstructions than a literal deployment of the CS methodology.These results show that, when appropriately deployed in a favorable setting, the CS framework is able to save significantly over traditional sampling, and there are many useful extensions of the basic idea. 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.