324 research outputs found
Recovery of Missing Samples Using Sparse Approximation via a Convex Similarity Measure
In this paper, we study the missing sample recovery problem using methods
based on sparse approximation. In this regard, we investigate the algorithms
used for solving the inverse problem associated with the restoration of missed
samples of image signal. This problem is also known as inpainting in the
context of image processing and for this purpose, we suggest an iterative
sparse recovery algorithm based on constrained -norm minimization with a
new fidelity metric. The proposed metric called Convex SIMilarity (CSIM) index,
is a simplified version of the Structural SIMilarity (SSIM) index, which is
convex and error-sensitive. The optimization problem incorporating this
criterion, is then solved via Alternating Direction Method of Multipliers
(ADMM). Simulation results show the efficiency of the proposed method for
missing sample recovery of 1D patch vectors and inpainting of 2D image signals
Asymptotic Analysis of Inpainting via Universal Shearlet Systems
Recently introduced inpainting algorithms using a combination of applied
harmonic analysis and compressed sensing have turned out to be very successful.
One key ingredient is a carefully chosen representation system which provides
(optimally) sparse approximations of the original image. Due to the common
assumption that images are typically governed by anisotropic features,
directional representation systems have often been utilized. One prominent
example of this class are shearlets, which have the additional benefitallowing
faithful implementations. Numerical results show that shearlets significantly
outperform wavelets in inpainting tasks. One of those software packages,
www.shearlab.org, even offers the flexibility of usingdifferent parameter for
each scale, which is not yet covered by shearlet theory.
In this paper, we first introduce universal shearlet systems which are
associated with an arbitrary scaling sequence, thereby modeling the previously
mentioned flexibility. In addition, this novel construction allows for a smooth
transition between wavelets and shearlets and therefore enables us to analyze
them in a uniform fashion. For a large class of such scaling sequences, we
first prove that the associated universal shearlet systems form band-limited
Parseval frames for consisting of Schwartz functions.
Secondly, we analyze the performance for inpainting of this class of universal
shearlet systems within a distributional model situation using an
-analysis minimization algorithm for reconstruction. Our main result in
this part states that, provided the scaling sequence is comparable to the size
of the (scale-dependent) gap, nearly-perfect inpainting is achieved at
sufficiently fine scales
A Second Order TV-type Approach for Inpainting and Denoising Higher Dimensional Combined Cyclic and Vector Space Data
In this paper we consider denoising and inpainting problems for higher
dimensional combined cyclic and linear space valued data. These kind of data
appear when dealing with nonlinear color spaces such as HSV, and they can be
obtained by changing the space domain of, e.g., an optical flow field to polar
coordinates. For such nonlinear data spaces, we develop algorithms for the
solution of the corresponding second order total variation (TV) type problems
for denoising, inpainting as well as the combination of both. We provide a
convergence analysis and we apply the algorithms to concrete problems.Comment: revised submitted versio
A Unified Surface Geometric Framework for Feature-Aware Denoising, Hole Filling and Context-Aware Completion
Technologies for 3D data acquisition and 3D printing have enormously developed in the past few years, and, consequently, the demand for 3D virtual twins of the original scanned objects has increased. In this context, feature-aware denoising, hole filling and context-aware completion are three essential (but far from trivial) tasks. In this work, they are integrated within a geometric framework and realized through a unified variational model aiming at recovering triangulated surfaces from scanned, damaged and possibly incomplete noisy observations. The underlying non-convex optimization problem incorporates two regularisation terms: a discrete approximation of the Willmore energy forcing local sphericity and suited for the recovery of rounded features, and an approximation of the l(0) pseudo-norm penalty favouring sparsity in the normal variation. The proposed numerical method solving the model is parameterization-free, avoids expensive implicit volumebased computations and based on the efficient use of the Alternating Direction Method of Multipliers. Experiments show how the proposed framework can provide a robust and elegant solution suited for accurate restorations even in the presence of severe random noise and large damaged areas
Sparse representations and bayesian image inpainting
International audienceRepresenting the image to be inpainted in an appropriate sparse dictionary, and combining elements from bayesian statistics, we introduce an expectation-maximization (EM) algorithm for image inpainting. From a statistical point of view, the inpainting can be viewed as an estimation problem with missing data. Towards this goal, we propose the idea of using the EM mechanism in a bayesian framework, where a sparsity promoting prior penalty is imposed on the reconstructed coefficients. The EM framework gives a principled way to establish formally the idea that missing samples can be recovered based on sparse representations. We first introduce an easy and efficient sparse-representation-based iterative algorithm for image inpainting. Additionally, we derive its theoretical convergence properties for a wide class of penalties. Particularly, we establish that it converges in a strong sense, and give sufficient conditions for convergence to a local or a global minimum. Compared to its competitors, this algorithms allows a high degree of flexibility to recover different structural components in the image (piece-wise smooth, curvilinear, texture, etc). We also describe some ideas to automatically find the regularization parameter
- …