17 research outputs found
A Fast Alternating Minimization Algorithm for Total Variation Deblurring Without Boundary Artifacts
Recently, a fast alternating minimization algorithm for total variation image
deblurring (FTVd) has been presented by Wang, Yang, Yin, and Zhang [{\em SIAM
J. Imaging Sci.}, 1 (2008), pp. 248--272]. The method in a nutshell consists of
a discrete Fourier transform-based alternating minimization algorithm with
periodic boundary conditions and in which two fast Fourier transforms (FFTs)
are required per iteration. In this paper, we propose an alternating
minimization algorithm for the continuous version of the total variation image
deblurring problem. We establish convergence of the proposed continuous
alternating minimization algorithm. The continuous setting is very useful to
have a unifying representation of the algorithm, independently of the discrete
approximation of the deconvolution problem, in particular concerning the
strategies for dealing with boundary artifacts. Indeed, an accurate restoration
of blurred and noisy images requires a proper treatment of the boundary. A
discrete version of our continuous alternating minimization algorithm is
obtained following two different strategies: the imposition of appropriate
boundary conditions and the enlargement of the domain. The first one is
computationally useful in the case of a symmetric blur, while the second one
can be efficiently applied for a nonsymmetric blur. Numerical tests show that
our algorithm generates higher quality images in comparable running times with
respect to the Fast Total Variation deconvolution algorithm
Maximum likelihood extension for non-circulant deconvolution
The International Conference on Image Processing, Paris, France, October 27-30 2014Directly applying circular de-convolution to real-world blurred images usually results in boundary artifacts. Classic boundary extension techniques fail to provide likely results, in terms of a circular boundary-condition observation model. Boundary reflection gives raise to non-smooth features, especially when oblique oriented features encounter the image boundaries. Tapering the boundaries of the image support, or similar strategies (like constrained diffusion), provides smoothness on the toroidal support; however this does not guarantee consistency with the spectral properties of the blur (in particular, to its zeros). Here we propose a simple, yet effective, model-derived method for extending real-world blurred images, so that they become likely in terms of a Gaussian circular boundary-condition observation model. We achieve artifact-free results, even under highly unfavorable conditions, when other methods fail.Peer Reviewe
A Framework for Fast Image Deconvolution with Incomplete Observations
In image deconvolution problems, the diagonalization of the underlying
operators by means of the FFT usually yields very large speedups. When there
are incomplete observations (e.g., in the case of unknown boundaries), standard
deconvolution techniques normally involve non-diagonalizable operators,
resulting in rather slow methods, or, otherwise, use inexact convolution
models, resulting in the occurrence of artifacts in the enhanced images. In
this paper, we propose a new deconvolution framework for images with incomplete
observations that allows us to work with diagonalized convolution operators,
and therefore is very fast. We iteratively alternate the estimation of the
unknown pixels and of the deconvolved image, using, e.g., an FFT-based
deconvolution method. This framework is an efficient, high-quality alternative
to existing methods of dealing with the image boundaries, such as edge
tapering. It can be used with any fast deconvolution method. We give an example
in which a state-of-the-art method that assumes periodic boundary conditions is
extended, through the use of this framework, to unknown boundary conditions.
Furthermore, we propose a specific implementation of this framework, based on
the alternating direction method of multipliers (ADMM). We provide a proof of
convergence for the resulting algorithm, which can be seen as a "partial" ADMM,
in which not all variables are dualized. We report experimental comparisons
with other primal-dual methods, where the proposed one performed at the level
of the state of the art. Four different kinds of applications were tested in
the experiments: deconvolution, deconvolution with inpainting, superresolution,
and demosaicing, all with unknown boundaries.Comment: IEEE Trans. Image Process., to be published. 15 pages, 11 figures.
MATLAB code available at
https://github.com/alfaiate/DeconvolutionIncompleteOb
Structure tensor total variation
This is the final version of the article. Available from Society for Industrial and Applied Mathematics via the DOI in this record.We introduce a novel generic energy functional that we employ to solve inverse imaging problems
within a variational framework. The proposed regularization family, termed as structure tensor
total variation (STV), penalizes the eigenvalues of the structure tensor and is suitable for both
grayscale and vector-valued images. It generalizes several existing variational penalties, including
the total variation seminorm and vectorial extensions of it. Meanwhile, thanks to the structure
tensor’s ability to capture first-order information around a local neighborhood, the STV functionals
can provide more robust measures of image variation. Further, we prove that the STV regularizers
are convex while they also satisfy several invariance properties w.r.t. image transformations. These
properties qualify them as ideal candidates for imaging applications. In addition, for the discrete
version of the STV functionals we derive an equivalent definition that is based on the patch-based
Jacobian operator, a novel linear operator which extends the Jacobian matrix. This alternative
definition allow us to derive a dual problem formulation. The duality of the problem paves the
way for employing robust tools from convex optimization and enables us to design an efficient
and parallelizable optimization algorithm. Finally, we present extensive experiments on various
inverse imaging problems, where we compare our regularizers with other competing regularization
approaches. Our results are shown to be systematically superior, both quantitatively and visually
Correction of spherical single lens aberration using digital image processing for cellular phone camera
制度:新 ; 報告番号:甲3276号 ; 学位の種類:博士(工学) ; 授与年月日:2011/2/21 ; 早大学位記番号:新558