165 research outputs found
Linear Convergence of Adaptively Iterative Thresholding Algorithms for Compressed Sensing
This paper studies the convergence of the adaptively iterative thresholding
(AIT) algorithm for compressed sensing. We first introduce a generalized
restricted isometry property (gRIP). Then we prove that the AIT algorithm
converges to the original sparse solution at a linear rate under a certain gRIP
condition in the noise free case. While in the noisy case, its convergence rate
is also linear until attaining a certain error bound. Moreover, as by-products,
we also provide some sufficient conditions for the convergence of the AIT
algorithm based on the two well-known properties, i.e., the coherence property
and the restricted isometry property (RIP), respectively. It should be pointed
out that such two properties are special cases of gRIP. The solid improvements
on the theoretical results are demonstrated and compared with the known
results. Finally, we provide a series of simulations to verify the correctness
of the theoretical assertions as well as the effectiveness of the AIT
algorithm.Comment: 15 pages, 5 figure
Recommended from our members
Overview of compressed sensing: Sensing model, reconstruction algorithm, and its applications
With the development of intelligent networks such as the Internet of Things, network scales are becoming increasingly larger, and network environments increasingly complex, which brings a great challenge to network communication. The issues of energy-saving, transmission efficiency, and security were gradually highlighted. Compressed sensing (CS) helps to simultaneously solve those three problems in the communication of intelligent networks. In CS, fewer samples are required to reconstruct sparse or compressible signals, which breaks the restrict condition of a traditional Nyquist-Shannon sampling theorem. Here, we give an overview of recent CS studies, along the issues of sensing models, reconstruction algorithms, and their applications. First, we introduce several common sensing methods for CS, like sparse dictionary sensing, block-compressed sensing, and chaotic compressed sensing. We also present several state-of-the-art reconstruction algorithms of CS, including the convex optimization, greedy, and Bayesian algorithms. Lastly, we offer recommendation for broad CS applications, such as data compression, image processing, cryptography, and the reconstruction of complex networks. We discuss works related to CS technology and some CS essentials. © 2020 by the authors
Adaptive gradient-based block compressive sensing with sparsity for noisy images
This paper develops a novel adaptive gradient-based block compressive sensing (AGbBCS_SP) methodology for noisy image compression and reconstruction. The AGbBCS_SP approach splits an image into blocks by maximizing their sparsity, and reconstructs images by solving a convex optimization problem. In block compressive sensing, the commonly used square block shapes cannot always produce the best results. The main contribution of our paper is to provide an adaptive method for block shape selection, improving noisy image reconstruction performance. The proposed algorithm can adaptively achieve better results by using the sparsity of pixels to adaptively select block shape. Experimental results with different image sets demonstrate that our AGbBCS_SP method is able to achieve better performance, in terms of peak signal to noise ratio (PSNR) and computational cost, than several classical algorithms
Performance analysis of compressive sensing recovery algorithms for image processing using block processing
The modern digital world comprises of transmitting media files like image, audio, and video which leads to usage of large memory storage, high data transmission rate, and a lot of sensory devices. Compressive sensing (CS) is a sampling theory that compresses the signal at the time of acquiring it. Compressive sensing samples the signal efficiently below the Nyquist rate to minimize storage and recoveries back the signal significantly minimizing the data rate and few sensors. The proposed paper proceeds with three phases. The first phase describes various measurement matrices like Gaussian matrix, circulant matrix, and special random matrices which are the basic foundation of compressive sensing technique that finds its application in various fields like wireless sensors networks (WSN), internet of things (IoT), video processing, biomedical applications, and many. Finally, the paper analyses the performance of the various reconstruction algorithms of compressive sensing like basis pursuit (BP), compressive sampling matching pursuit (CoSaMP), iteratively reweighted least square (IRLS), iterative hard thresholding (IHT), block processing-based basis pursuit (BP-BP) based onmean square error (MSE), and peak signal to noise ratio (PSNR) and then concludes with future works
- …