Abstract: The paper is a comparative study of two classical vari-ants of parallel projection methods for solving the convex feasibility problem with their equivalents that involve variable weights in the construction of the solutions. We used a graphical representation of these methods for inpainting a convex area of an image in order to investigate their effectiveness in image reconstruction applications. We also presented a numerical analysis of the convergence of these four algorithms in terms of the average number of steps and execution time, in classical CPU and, alternativaly, in parallel GPU implementation.
Abstract: In this paper, we apply a semismooth active set method to image inpainting. The method exploits primal and dual features of a proposed regularized total variation model, following after the technique presented in [4]. Numerical results show that the method is fast and efficient in inpainting sufficiently thin domains.
Abstract: The automatic construction of large, high-resolution
image vistas (mosaics) is an active area of research in the fields of
photogrammetry [1,2], computer vision [1,4], medical image
processing [4], computer graphics [3] and biometrics [8]. Image
stitching is one of the possible options to get image mosaics. Vista
Creation in image processing is used to construct an image with a
large field of view than that could be obtained with a single
photograph. It refers to transforming and stitching multiple images
into a new aggregate image without any visible seam or distortion in
the overlapping areas. Vista creation process aligns two partial
images over each other and blends them together. Image mosaics
allow one to compensate for differences in viewing geometry. Thus
they can be used to simplify tasks by simulating the condition in
which the scene is viewed from a fixed position with single camera.
While obtaining partial images the geometric anomalies like rotation,
scaling are bound to happen. To nullify effect of rotation of partial
images on process of vista creation, we are proposing rotation
invariant vista creation algorithm in this paper. Rotation of partial
image parts in the proposed method of vista creation may introduce
some missing region in the vista. To correct this error, that is to fill
the missing region further we have used image inpainting method on
the created vista. This missing view regeneration method also
overcomes the problem of missing view [31] in vista due to cropping,
irregular boundaries of partial image parts and errors in digitization
[35]. The method of missing view regeneration generates the missing
view of vista using the information present in vista itself.
Abstract: An effective visual error concealment method has been presented by employing a robust rotation, scale, and translation (RST) invariant partial patch matching model (RSTI-PPMM) and
exemplar-based inpainting. While the proposed robust and inherently
feature-enhanced texture synthesis approach ensures the generation
of excellent and perceptually plausible visual error concealment results, the outlier pruning property guarantees the significant quality improvements, both quantitatively and qualitatively. No intermediate
user-interaction is required for the pre-segmented media and the
presented method follows a bootstrapping approach for an automatic
visual loss recovery and the image and video error concealment.
Abstract: This paper is concerned with the numerical minimization
of energy functionals in BV (
) (the space of bounded variation
functions) involving total variation for gray-scale 1-dimensional inpainting
problem. Applications are shown by finite element method
and discontinuous Galerkin method for total variation minimization.
We include the numerical examples which show the different recovery
image by these two methods.