8 research outputs found
Spatially Directional Predictive Coding for Block-based Compressive Sensing of Natural Images
A novel coding strategy for block-based compressive sens-ing named spatially
directional predictive coding (SDPC) is proposed, which efficiently utilizes
the intrinsic spatial cor-relation of natural images. At the encoder, for each
block of compressive sensing (CS) measurements, the optimal pre-diction is
selected from a set of prediction candidates that are generated by four
designed directional predictive modes. Then, the resulting residual is
processed by scalar quantiza-tion (SQ). At the decoder, the same prediction is
added onto the de-quantized residuals to produce the quantized CS measurements,
which is exploited for CS reconstruction. Experimental results substantiate
significant improvements achieved by SDPC-plus-SQ in rate distortion
performance as compared with SQ alone and DPCM-plus-SQ.Comment: 5 pages, 3 tables, 3 figures, published at IEEE International
Conference on Image Processing (ICIP) 2013 Code Avaiable:
http://idm.pku.edu.cn/staff/zhangjian/SDPC
Improved Total Variation based Image Compressive Sensing Recovery by Nonlocal Regularization
Recently, total variation (TV) based minimization algorithms have achieved
great success in compressive sensing (CS) recovery for natural images due to
its virtue of preserving edges. However, the use of TV is not able to recover
the fine details and textures, and often suffers from undesirable staircase
artifact. To reduce these effects, this letter presents an improved TV based
image CS recovery algorithm by introducing a new nonlocal regularization
constraint into CS optimization problem. The nonlocal regularization is built
on the well known nonlocal means (NLM) filtering and takes advantage of
self-similarity in images, which helps to suppress the staircase effect and
restore the fine details. Furthermore, an efficient augmented Lagrangian based
algorithm is developed to solve the above combined TV and nonlocal
regularization constrained problem. Experimental results demonstrate that the
proposed algorithm achieves significant performance improvements over the
state-of-the-art TV based algorithm in both PSNR and visual perception.Comment: 4 Pages, 1 figures, 3 tables, to be published at IEEE Int. Symposium
of Circuits and Systems (ISCAS) 201
Deep Networks for Compressed Image Sensing
The compressed sensing (CS) theory has been successfully applied to image
compression in the past few years as most image signals are sparse in a certain
domain. Several CS reconstruction models have been recently proposed and
obtained superior performance. However, there still exist two important
challenges within the CS theory. The first one is how to design a sampling
mechanism to achieve an optimal sampling efficiency, and the second one is how
to perform the reconstruction to get the highest quality to achieve an optimal
signal recovery. In this paper, we try to deal with these two problems with a
deep network. First of all, we train a sampling matrix via the network training
instead of using a traditional manually designed one, which is much appropriate
for our deep network based reconstruct process. Then, we propose a deep network
to recover the image, which imitates traditional compressed sensing
reconstruction processes. Experimental results demonstrate that our deep
networks based CS reconstruction method offers a very significant quality
improvement compared against state of the art ones.Comment: This paper has been accepted by the IEEE International Conference on
Multimedia and Expo (ICME) 201
Image Restoration Using Joint Statistical Modeling in Space-Transform Domain
This paper presents a novel strategy for high-fidelity image restoration by
characterizing both local smoothness and nonlocal self-similarity of natural
images in a unified statistical manner. The main contributions are three-folds.
First, from the perspective of image statistics, a joint statistical modeling
(JSM) in an adaptive hybrid space-transform domain is established, which offers
a powerful mechanism of combining local smoothness and nonlocal self-similarity
simultaneously to ensure a more reliable and robust estimation. Second, a new
form of minimization functional for solving image inverse problem is formulated
using JSM under regularization-based framework. Finally, in order to make JSM
tractable and robust, a new Split-Bregman based algorithm is developed to
efficiently solve the above severely underdetermined inverse problem associated
with theoretical proof of convergence. Extensive experiments on image
inpainting, image deblurring and mixed Gaussian plus salt-and-pepper noise
removal applications verify the effectiveness of the proposed algorithm.Comment: 14 pages, 18 figures, 7 Tables, to be published in IEEE Transactions
on Circuits System and Video Technology (TCSVT). High resolution pdf version
and Code can be found at: http://idm.pku.edu.cn/staff/zhangjian/IRJSM
Image Compressive Sensing Recovery Using Adaptively Learned Sparsifying Basis via L0 Minimization
From many fewer acquired measurements than suggested by the Nyquist sampling
theory, compressive sensing (CS) theory demonstrates that, a signal can be
reconstructed with high probability when it exhibits sparsity in some domain.
Most of the conventional CS recovery approaches, however, exploited a set of
fixed bases (e.g. DCT, wavelet and gradient domain) for the entirety of a
signal, which are irrespective of the non-stationarity of natural signals and
cannot achieve high enough degree of sparsity, thus resulting in poor CS
recovery performance. In this paper, we propose a new framework for image
compressive sensing recovery using adaptively learned sparsifying basis via L0
minimization. The intrinsic sparsity of natural images is enforced
substantially by sparsely representing overlapped image patches using the
adaptively learned sparsifying basis in the form of L0 norm, greatly reducing
blocking artifacts and confining the CS solution space. To make our proposed
scheme tractable and robust, a split Bregman iteration based technique is
developed to solve the non-convex L0 minimization problem efficiently.
Experimental results on a wide range of natural images for CS recovery have
shown that our proposed algorithm achieves significant performance improvements
over many current state-of-the-art schemes and exhibits good convergence
property.Comment: 31 pages, 4 tables, 12 figures, to be published at Signal Processing,
Code available: http://idm.pku.edu.cn/staff/zhangjian/ALSB
Group-based Sparse Representation for Image Restoration
Traditional patch-based sparse representation modeling of natural images
usually suffer from two problems. First, it has to solve a large-scale
optimization problem with high computational complexity in dictionary learning.
Second, each patch is considered independently in dictionary learning and
sparse coding, which ignores the relationship among patches, resulting in
inaccurate sparse coding coefficients. In this paper, instead of using patch as
the basic unit of sparse representation, we exploit the concept of group as the
basic unit of sparse representation, which is composed of nonlocal patches with
similar structures, and establish a novel sparse representation modeling of
natural images, called group-based sparse representation (GSR). The proposed
GSR is able to sparsely represent natural images in the domain of group, which
enforces the intrinsic local sparsity and nonlocal self-similarity of images
simultaneously in a unified framework. Moreover, an effective self-adaptive
dictionary learning method for each group with low complexity is designed,
rather than dictionary learning from natural images. To make GSR tractable and
robust, a split Bregman based technique is developed to solve the proposed
GSR-driven minimization problem for image restoration efficiently. Extensive
experiments on image inpainting, image deblurring and image compressive sensing
recovery manifest that the proposed GSR modeling outperforms many current
state-of-the-art schemes in both PSNR and visual perception.Comment: 34 pages, 6 tables, 19 figures, to be published in IEEE Transactions
on Image Processing; Project, Code and High resolution PDF version can be
found: http://idm.pku.edu.cn/staff/zhangjian/. arXiv admin note: text overlap
with arXiv:1404.756
Compressed Sensing in Resource-Constrained Environments: From Sensing Mechanism Design to Recovery Algorithms
Compressed Sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for reconstruction. It is promising that CS can be utilized in environments where the signal acquisition process is extremely difficult or costly, e.g., a resource-constrained environment like the smartphone platform, or a band-limited environment like visual sensor network (VSNs). There are several challenges to perform sensing due to the characteristic of these platforms, including, for example, needing active user involvement, computational and storage limitations and lower transmission capabilities. This dissertation focuses on the study of CS in resource-constrained environments.
First, we try to solve the problem on how to design sensing mechanisms that could better adapt to the resource-limited smartphone platform. We propose the compressed phone sensing (CPS) framework where two challenging issues are studied, the energy drainage issue due to continuous sensing which may impede the normal functionality of the smartphones and the requirement of active user inputs for data collection that may place a high burden on the user.
Second, we propose a CS reconstruction algorithm to be used in VSNs for recovery of frames/images. An efficient algorithm, NonLocal Douglas-Rachford (NLDR), is developed. NLDR takes advantage of self-similarity in images using nonlocal means (NL) filtering. We further formulate the nonlocal estimation as the low-rank matrix approximation problem and solve the constrained optimization problem using Douglas-Rachford splitting method.
Third, we extend the NLDR algorithm to surveillance video processing in VSNs and propose recursive Low-rank and Sparse estimation through Douglas-Rachford splitting (rLSDR) method for recovery of the video frame into a low-rank background component and sparse component that corresponds to the moving object. The spatial and temporal low-rank features of the video frame, e.g., the nonlocal similar patches within the single video frame and the low-rank background component residing in multiple frames, are successfully exploited