Numerical assessment for Poisson image blending problem using MSOR iteration via five-point Laplacian operator

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The demand for image editing in the field of image processing has been increased throughout the world. One of the most famous equations for solving image editing problem is Poisson equation. Due to the advantages of the Successive Over Relaxation (SOR) iterative method with one weighted parameter, this paper examined the efficiency of the Modified Successive Over Relaxation (MSOR) iterative method for solving Poisson image blending problem. As we know, this iterative method requires two weighted parameters by considering the Red-Black ordering strategy, thus comparison of Jacobi, Gauss-Seidel and MSOR iterative methods in solving Poisson image blending problem is carried out in this study. The performance of these iterative methods to solve the problem is examined through assessing the number of iterations and computational time taken. Based on the numerical assessment over several experiments, the findings had shown that MSOR iterative method is able to solve Poisson image blending problem effectively than the other two methods which it requires fewer number of iterations and lesser computational time.

Cite

CITATION STYLE

APA

Hong, E. J., Saudi, A., & Sulaiman, J. (2017). Numerical assessment for Poisson image blending problem using MSOR iteration via five-point Laplacian operator. In Journal of Physics: Conference Series (Vol. 890). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/890/1/012010

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free