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

Cascade Decoders-Based Autoencoders for Image Reconstruction

Autoencoders are composed of coding and decoding units, hence they hold the inherent potential of high-performance data compression and signal compressed sensing. The main disadvantages of current autoencoders comprise the following several aspects: the research objective is not data reconstruction but feature representation; the performance evaluation of data recovery is neglected; it is hard to achieve lossless data reconstruction by pure autoencoders, even by pure deep learning. This paper aims for image reconstruction of autoencoders, employs cascade decoders-based autoencoders, perfects the performance of image reconstruction, approaches gradually lossless image recovery, and provides solid theory and application basis for autoencoders-based image compression and compressed sensing. The proposed serial decoders-based autoencoders include the architectures of multi-level decoders and the related optimization algorithms. The cascade decoders consist of general decoders, residual decoders, adversarial decoders and their combinations. It is evaluated by the experimental results that the proposed autoencoders outperform the classical autoencoders in the performance of image reconstruction

Exploiting flow dynamics for super-resolution in contrast-enhanced ultrasound

Ultrasound localization microscopy offers new radiation-free diagnostic tools for vascular imaging deep within the tissue. Sequential localization of echoes returned from inert microbubbles with low-concentration within the bloodstream reveal the vasculature with capillary resolution. Despite its high spatial resolution, low microbubble concentrations dictate the acquisition of tens of thousands of images, over the course of several seconds to tens of seconds, to produce a single super-resolved image. %since each echo is required to be well separated from adjacent microbubbles. Such long acquisition times and stringent constraints on microbubble concentration are undesirable in many clinical scenarios. To address these restrictions, sparsity-based approaches have recently been developed. These methods reduce the total acquisition time dramatically, while maintaining good spatial resolution in settings with considerable microbubble overlap. %Yet, non of the reported methods exploit the fact that microbubbles actually flow within the bloodstream. % to improve recovery. Here, we further improve sparsity-based super-resolution ultrasound imaging by exploiting the inherent flow of microbubbles and utilize their motion kinematics. While doing so, we also provide quantitative measurements of microbubble velocities. Our method relies on simultaneous tracking and super-localization of individual microbubbles in a frame-by-frame manner, and as such, may be suitable for real-time implementation. We demonstrate the effectiveness of the proposed approach on both simulations and {\it in-vivo} contrast enhanced human prostate scans, acquired with a clinically approved scanner.Comment: 11 pages, 9 figure

Structured Sparsity: Discrete and Convex approaches

Compressive sensing (CS) exploits sparsity to recover sparse or compressible signals from dimensionality reducing, non-adaptive sensing mechanisms. Sparsity is also used to enhance interpretability in machine learning and statistics applications: While the ambient dimension is vast in modern data analysis problems, the relevant information therein typically resides in a much lower dimensional space. However, many solutions proposed nowadays do not leverage the true underlying structure. Recent results in CS extend the simple sparsity idea to more sophisticated {\em structured} sparsity models, which describe the interdependency between the nonzero components of a signal, allowing to increase the interpretability of the results and lead to better recovery performance. In order to better understand the impact of structured sparsity, in this chapter we analyze the connections between the discrete models and their convex relaxations, highlighting their relative advantages. We start with the general group sparse model and then elaborate on two important special cases: the dispersive and the hierarchical models. For each, we present the models in their discrete nature, discuss how to solve the ensuing discrete problems and then describe convex relaxations. We also consider more general structures as defined by set functions and present their convex proxies. Further, we discuss efficient optimization solutions for structured sparsity problems and illustrate structured sparsity in action via three applications.Comment: 30 pages, 18 figure

Compressive Sensing Reconstruction for Video: An Adaptive Approach Based on Motion Estimation

This paper focuses on the problem of causally reconstructing Compressive Sensing (CS) captured video. The state-of-art causal approaches usually assume the signal support is static or changing sufficiently slowly over time, where Magnetic Resonance Imaging (MRI) is widely used as a motivating example. However, such an assumption is too restrictive for many other video applications, where the signal support changes rapidly. In this paper, we propose a framework that combines Motion Estimation (ME), the Kalman Filter (KF) and CS to adapt the reconstruction process to motions in the video so that the slowly-changing assumption on the signal support is relaxed and consequently is more suitable for video reconstruction. Explicit and implicit ME are designed to provide motion aware predictions, upon which a modified KF procedure is applied. Furthermore, three CS algorithms with embedded ME and KF are developed, and theoretical analyses are conducted via reconstruction error upper bounds, to characterize the various factors that affect reconstruction accuracy. Extensive simulations utilizing actual videos are carried out and the superiority of our methods is demonstrated.This work is supported by EPSRC Research Grant EP/K033700/1; the Natural Science Foundation of China (61401018, U1334202).This is the author accepted manuscript. The final version is available from IEEE via http://dx.doi.org/10.1109/TCSVT.2016.254007