1,071 research outputs found
Convolutional Dictionary Regularizers for Tomographic Inversion
There has been a growing interest in the use of data-driven regularizers to
solve inverse problems associated with computational imaging systems. The
convolutional sparse representation model has recently gained attention, driven
by the development of fast algorithms for solving the dictionary learning and
sparse coding problems for sufficiently large images and data sets.
Nevertheless, this model has seen very limited application to tomographic
reconstruction problems. In this paper, we present a model-based tomographic
reconstruction algorithm using a learnt convolutional dictionary as a
regularizer. The key contribution is the use of a data-dependent weighting
scheme for the l1 regularization to construct an effective denoising method
that is integrated into the inversion using the Plug-and-Play reconstruction
framework. Using simulated data sets we demonstrate that our approach can
improve performance over traditional regularizers based on a Markov random
field model and a patch-based sparse representation model for sparse and
limited-view tomographic data sets
Enhanced CNN for image denoising
Owing to flexible architectures of deep convolutional neural networks (CNNs),
CNNs are successfully used for image denoising. However, they suffer from the
following drawbacks: (i) deep network architecture is very difficult to train.
(ii) Deeper networks face the challenge of performance saturation. In this
study, the authors propose a novel method called enhanced convolutional neural
denoising network (ECNDNet). Specifically, they use residual learning and batch
normalisation techniques to address the problem of training difficulties and
accelerate the convergence of the network. In addition, dilated convolutions
are used in the proposed network to enlarge the context information and reduce
the computational cost. Extensive experiments demonstrate that the ECNDNet
outperforms the state-of-the-art methods for image denoising.Comment: CAAI Transactions on Intelligence Technology[J], 201
Image Fusion via Sparse Regularization with Non-Convex Penalties
The L1 norm regularized least squares method is often used for finding sparse
approximate solutions and is widely used in 1-D signal restoration. Basis
pursuit denoising (BPD) performs noise reduction in this way. However, the
shortcoming of using L1 norm regularization is the underestimation of the true
solution. Recently, a class of non-convex penalties have been proposed to
improve this situation. This kind of penalty function is non-convex itself, but
preserves the convexity property of the whole cost function. This approach has
been confirmed to offer good performance in 1-D signal denoising. This paper
demonstrates the aforementioned method to 2-D signals (images) and applies it
to multisensor image fusion. The problem is posed as an inverse one and a
corresponding cost function is judiciously designed to include two data
attachment terms. The whole cost function is proved to be convex upon suitably
choosing the non-convex penalty, so that the cost function minimization can be
tackled by convex optimization approaches, which comprise simple computations.
The performance of the proposed method is benchmarked against a number of
state-of-the-art image fusion techniques and superior performance is
demonstrated both visually and in terms of various assessment measures
- …