scholarly journals Analysis of hard-thresholding for distributed compressed sensing with one-bit measurements

2019 ◽  
Vol 9 (2) ◽  
pp. 455-471
Author(s):  
Johannes Maly ◽  
Lars Palzer

Abstract A simple hard-thresholding operation is shown to be able to uniformly recover $L$ signals $\textbf{x}_1,...,\textbf{x}_L \in{\mathbb{R}}^n$ that share a common support of size $s$ from $m = \mathscr{O}(s)$ one-bit measurements per signal if $L \geqslant \ln (en/s)$. This result improves the single signal recovery bounds with $m = \mathscr{O}(s\ln (en/s))$ measurements in the sense that asymptotically fewer measurements per non-zero entry are needed. Numerical evidence supports the theoretical considerations.

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Ran Li ◽  
Hongbing Liu ◽  
Yu Zeng ◽  
Yanling Li

In the framework of block Compressed Sensing (CS), the reconstruction algorithm based on the Smoothed Projected Landweber (SPL) iteration can achieve the better rate-distortion performance with a low computational complexity, especially for using the Principle Components Analysis (PCA) to perform the adaptive hard-thresholding shrinkage. However, during learning the PCA matrix, it affects the reconstruction performance of Landweber iteration to neglect the stationary local structural characteristic of image. To solve the above problem, this paper firstly uses the Granular Computing (GrC) to decompose an image into several granules depending on the structural features of patches. Then, we perform the PCA to learn the sparse representation basis corresponding to each granule. Finally, the hard-thresholding shrinkage is employed to remove the noises in patches. The patches in granule have the stationary local structural characteristic, so that our method can effectively improve the performance of hard-thresholding shrinkage. Experimental results indicate that the reconstructed image by the proposed algorithm has better objective quality when compared with several traditional ones. The edge and texture details in the reconstructed image are better preserved, which guarantees the better visual quality. Besides, our method has still a low computational complexity of reconstruction.


Geophysics ◽  
2007 ◽  
Vol 72 (5) ◽  
pp. SM77-SM93 ◽  
Author(s):  
Tim T. Lin ◽  
Felix J. Herrmann

An explicit algorithm for the extrapolation of one-way wavefields is proposed that combines recent developments in information theory and theoretical signal processing with the physics of wave propagation. Because of excessive memory requirements, explicit formulations for wave propagation have proven to be a challenge in 3D. By using ideas from compressed sensing, we are able to formulate the (inverse) wavefield extrapolation problem on small subsets of the data volume, thereby reducing the size of the operators. Compressed sensing entails a new paradigm for signal recovery that provides conditions under which signals can be recovered from incomplete samplings by nonlinear recovery methods that promote sparsity of the to-be-recovered signal. According to this theory, signals can be successfully recovered when the measurement basis is incoherent with the representa-tion in which the wavefield is sparse. In this new approach, the eigenfunctions of the Helmholtz operator are recognized as a basis that is incoherent with curvelets that are known to compress seismic wavefields. By casting the wavefield extrapolation problem in this framework, wavefields can be successfully extrapolated in the modal domain, despite evanescent wave modes. The degree to which the wavefield can be recovered depends on the number of missing (evanescent) wavemodes and on the complexity of the wavefield. A proof of principle for the compressed sensing method is given for inverse wavefield extrapolation in 2D, together with a pathway to 3D during which the multiscale and multiangular properties of curvelets, in relation to the Helmholz operator, are exploited. The results show that our method is stable, has reduced dip limitations, and handles evanescent waves in inverse extrapolation.


Sign in / Sign up

Export Citation Format

Share Document