Edge-preserving nonlocal weighting scheme for total variation based compressive sensing recovery (original) (raw)
Related papers
Total variation reconstruction for Kronecker compressive sensing with a new regularization
Recovery algorithm based on total variation (TV) has shown its capability to recover high quality image in compressive sensing by preserving edges well but not fine details and textures. Recently, to improve this deficiency, characteristics of natural images are further utilized by adding some regularization terms into its recovery problem. In these efforts, this paper proposes a new regularization exploiting nonlocal properties of image using the nonlocal means filter in the gradient domain instead of the spatial domain. The Split Bregman method is applied to solve a combination of total variation and a new regularization term under the framework of Kronecker compressive sensing. Numerical experiments with the proposed and related regularizations verify significant improvement of the proposed method in term of both objective and subjective qualities. I.
Compressive sensing with modified Total Variation minimization algorithm
2010 IEEE International Conference on Acoustics, Speech and Signal Processing, 2010
In this paper, the reconstruction problem of compressive sensing algorithm that is exploited for image compression, is investigated. Considering the Total Variation (TV) minimization algorithm, and by adding some new constraints compatible with typical image properties, the performance of the reconstruction is improved. Using DCT and contourlet transforms, sparse expansion of the image are exploited to provide new constraints to remove irrelevant vectors from the feasible set of the optimization problem while keeping the problem as a standard Second Order Cone Programming (SOCP) one. Experimental results show that, the proposed method, with new constraints, outperforms the conventional TV minimization method by up to 2 dB in PSNR.
Non-local Compressive Sampling Recovery
International Conference on Computational Photography (ICCP), 2014
Compressive sampling (CS) aims at acquiring a signal at a sampling rate below the Nyquist rate by exploiting prior knowledge that a signal is sparse or correlated in some domain. Despite the remarkable progress in the theory of CS, the sampling rate on a single image required by CS is still very high in practice. In this paper, a non-local compressive sampling (NLCS) recovery method is proposed to further reduce the sampling rate by exploiting non-local patch correlation and local piecewise smoothness present in natural images. Two non-local sparsity measures, i.e., non-local wavelet sparsity and non-local joint sparsity, are proposed to exploit the patch correlation in NLCS. An efficient iterative algorithm is developed to solve the NLCS recovery problem, which is shown to have stable convergence behavior in experiments. The experimental results show that our NLCS significantly improves the state-of-the-art of image compressive sampling.
Review of Algorithms for Compressive Sensing of Images
We provide a comprehensive review of leading algorithms for compressive sensing of images, focused on Total variation methods, with a view to application in LiDAR systems. Our primary focus is providing a full review for beginners in the field, as well as simulating the kind of noise found in real LiDAR systems. To this end, we provide an overview of the theoretical background, a brief discussion of various considerations that come in to play in compressive sensing, and a standardized comparison of off-the-shelf methods, intended as a quick-start guide to choosing algorithms for compressive sensing applications.
Detail-preserving compressive sensing recovery based on cartoon texture image decomposition
IEEE Conf. Image Process. (ICIP), 2014
In this paper, we propose a detail-preserving reconstruction method for total variation-based recovery in low subrate compressive sensing using cartoon texture image decomposition and residual reconstruction. It iteratively decomposes and reconstructs cartoon and texture image components separately. A nonlocal structure-preserving filter is utilized to reduce staircase artifacts while preserving nonlocal structures of image in the spatial domain. Experimental results show that the proposed method outperforms the conventional ones in terms of preserving small scale details of image.
Compressive sensing reconstruction via decomposition
Signal Processing-image Communication, 2016
When recovering images from a small number of Compressive Sensing (CS) measurements, a problem arises whereby image features (e.g., smoothness, edges, textures) cannot be preserved well in reconstruction, especially textures at small-scale. Since the missing information still remains in the residual measurement, we propose a novel Decomposition-based CS-recovery framework (DCR) which utilizes residual reconstruction and state-of-the-art filters. The proposed method iteratively refines residual measurement which is closely related to the denoise-boosting techniques. DCR is further incorporated with a weighted total variation and nonlocal structures in the gradient domain as priors to form the proposed DEcomposition based TExture preserving Reconstruction (DETER). We subsequently demonstrate robustness of the proposed framework to noise and its superiority over the other state-of-the-art methods, especially at low subrates. Its fast implementation based on the split Bregman technique is also presented.
Nonlocal Gradient Sparsity Regularization for Image Restoration
IEEE Transactions on Circuits and Systems for Video Technology, 2017
Total variation (TV) regularization is widely used in image restoration to exploit the local smoothness of image content. Essentially, the TV model assumes a zero-mean Laplacian distribution for the gradient at all pixels. However, real-world images are non-stationary in general and the zeromean assumption of pixel gradient might be invalid, especially for the regions with strong edges or rich textures. This paper introduces a non-local extension of TV regularization, which models the sparsity of the image gradient with pixel-wise contentadaptive distributions, reflecting the non-stationary nature of image statistics. Taking advantage of the non-local similarity of natural images, the proposed approach estimates the image gradient statistics at a particular pixel from a group of nonlocally searched patches which are similar to the patch located at the current pixel. The gradient data in these non-local similar patches are regarded as samples of the gradient distribution to be learned. In this way, more accurate estimation of gradient is achieved. Experimental results demonstrate that the proposed method outperforms the conventional TV and several other anchors remarkably and produces better objective and subjective image qualities.
Enhanced Compressed Sensing Recovery With Level Set Normals
— We propose a compressive sensing algorithm that exploits geometric properties of images to recover images of high quality from few measurements. The image reconstruction is done by iterating the two following steps: 1) estimation of normal vectors of the image level curves, and 2) reconstruction of an image fitting the normal vectors, the compressed sensing measurements, and the sparsity constraint. The proposed technique can naturally extend to nonlocal operators and graphs to exploit the repetitive nature of textured images to recover fine detail structures. In both cases, the problem is reduced to a series of convex minimization problems that can be efficiently solved with a combination of variable splitting and augmented Lagrangian methods, leading to fast and easy-to-code algorithms. Extended experiments show a clear improvement over related state-of-the-art algorithms in the quality of the reconstructed images and the robustness of the proposed method to noise, different kind of images, and reduced measurements.
Signal Processing: Image Communication, 2017
Although block compressive sensing (BCS) makes it tractable to sense large-sized images and video, its recovery performance has yet to be significantly improved because its recovered images or video usually suffer from blurred edges, loss of details, and high-frequency oscillatory artifacts, especially at a low subrate. This paper addresses these problems by designing a modified total variation technique that employs multi-block gradient processing, a denoised Lagrangian multiplier, and patch-based sparse representation. In the case of video, the proposed recovery method is able to exploit both spatial and temporal similarities. Simulation results confirm the improved performance of the proposed method for compressive sensing of images and video in terms of both objective and subjective qualities.