Search

The main aim of this paper is to develop an algorithm for blending of multiple images in the image-stitching process. Our idea is to propose a variational method containing an energy functional to determine both a stitched image and weighting mask functions of multiple input images for image blending. The existence of the solution of the proposed energy functional is shown. We also present an alternative minimizing algorithm to solve the proposed model numerically and show the convergence of this algorithm. Experimental results show that the proposed model works effectively and efficiently and that the proposed method is competitive with the tested existing methods under noisy conditions. [ABSTRACT FROM AUTHOR]

In the image processing community, there have recently been many restoration and reconstruction problems that can be reformulated into linearly constrained convex programming models whose objective functions have separable structures. These favorable reformulations have promoted impressive applications of the alternating direction method (ADM) in the field of image processing. At each iteration, the computation of ADM is dominated by solving two subproblems exactly. However, in many restoration and reconstruction applications, it is cither impossible or extremely expensive to obtain exact solutions of these ADM subproblems. This fact urges the development on inexact versions of ADM, which allow the generated ADM subproblems to be solved approximately subject to certain inexactness criteria. In this paper, we develop some truly implementable inexact ADMs whose inexactness criteria controlling the accuracy of the ADM subproblems are easily implementable. The convergence of the new inexact ADMs will be proved. Numerical results on several image processing problems will be given to illustrate the effectiveness of the proposed inexact ADMs. [ABSTRACT FROM AUTHOR]

Image restoration problems are often solved by finding the minimizer of a suitable objective function consisting of a data-fitting term and a regularization term. In this paper, we consider the data-fitting term measured in the ℓ1 norm to handle non-Gaussian additive noise and the regularization term given by the total variation (TV) to restore image edges. We propose a new algorithm for this image restoration problem by making use of new variables to modify the data-fitting term and the TV regularization term. An alternating minimization method based on the new formulation is employed to restore blurred and noisy images. Our experimental results show that the quality of restored images by the proposed method is competitive with those restored by the other tested methods. We also show the convergence of the alternating minimization algorithm and demonstrate that the proposed algorithm is very efficient. [ABSTRACT FROM AUTHOR]

This paper studies the application of preconditioned conjugate gradient methods in high-resolution color image reconstruction problems. The high-resolution color images are reconstructed from multiple undersampled, shifted, degraded color frames with subpixel displacements. The resulting degradation matrices are spatially variant. To capture the changes of reflectivity across color channels, the weighted H1 regularization functional is used in the Tikhonov regularization. The Neumann boundary condition is also employed to reduce the boundary artifacts. The preconditioners are derived by taking the cosine transform approximation of the degradation matrices. Numerical examples are given to illustrate the fast convergence of the preconditioned conjugate gradient method. [ABSTRACT FROM AUTHOR]