Solving Poisson Equations Using Least Square Technique in Image Editing Colin Zheng Yi Li.

Slides:



Advertisements
Similar presentations
CSE 245: Computer Aided Circuit Simulation and Verification Matrix Computations: Iterative Methods (II) Chung-Kuan Cheng.
Advertisements

1 Numerical Solvers for BVPs By Dong Xu State Key Lab of CAD&CG, ZJU.
SOLVING THE DISCRETE POISSON EQUATION USING MULTIGRID ROY SROR ELIRAN COHEN.
Least Squares example There are 3 mountains u,y,z that from one site have been measured as 2474 ft., 3882 ft., and 4834 ft.. But from u, y looks 1422 ft.
Steepest Decent and Conjugate Gradients (CG). Solving of the linear equation system.
Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.
Jonathan Richard Shewchuk Reading Group Presention By David Cline
1cs542g-term Notes  Assignment 1 due tonight ( me by tomorrow morning)
Determinants Bases, linear Indep., etc Gram-Schmidt Eigenvalue and Eigenvectors Misc
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
Influence of (pointwise) Gauss-Seidel relaxation on the error Poisson equation, uniform grid Error of initial guess Error after 5 relaxation Error after.
Matrix Operations. Matrix Notation Example Equality of Matrices.
Sparse Matrix Methods Day 1: Overview Day 2: Direct methods
The Landscape of Ax=b Solvers Direct A = LU Iterative y’ = Ay Non- symmetric Symmetric positive definite More RobustLess Storage (if sparse) More Robust.
© John M. Abowd 2005, all rights reserved Modeling Integrated Data John M. Abowd April 2005.
Implicit Approximation. Implicit approximation can be solved using: Point iteration (G/S, SOR) Direct (matrix) solution Combination of matrix soln and.
Geometric (Classical) MultiGrid. Linear scalar elliptic PDE (Brandt ~1971)  1 dimension Poisson equation  Discretize the continuum x0x0 x1x1 x2x2 xixi.
CS240A: Conjugate Gradients and the Model Problem.
Monica Garika Chandana Guduru. METHODS TO SOLVE LINEAR SYSTEMS Direct methods Gaussian elimination method LU method for factorization Simplex method of.
ECE 552 Numerical Circuit Analysis Chapter Five RELAXATION OR ITERATIVE TECHNIQUES FOR THE SOLUTION OF LINEAR EQUATIONS Copyright © I. Hajj 2012 All rights.
CSE 245: Computer Aided Circuit Simulation and Verification
PETE 603 Lecture Session #29 Thursday, 7/29/ Iterative Solution Methods Older methods, such as PSOR, and LSOR require user supplied iteration.
Introduction to Numerical Analysis I MATH/CMPSC 455 Conjugate Gradient Methods.
By Mary Hudachek-Buswell. Overview Atmospheric Turbulence Blur.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Example: Introduction to Krylov Subspace Methods DEF: Krylov sequence
Conjugate gradients, sparse matrix-vector multiplication, graphs, and meshes Thanks to Aydin Buluc, Umit Catalyurek, Alan Edelman, and Kathy Yelick for.
CS448f: Image Processing For Photography and Vision The Gradient Domain.
ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
1 Iterative Solution Methods Starts with an initial approximation for the solution vector (x 0 ) At each iteration updates the x vector by using the sytem.
CS 219: Sparse Matrix Algorithms
Linear algebra: matrix Eigen-value Problems
In-Won Lee, Professor, PE In-Won Lee, Professor, PE Structural Dynamics & Vibration Control Lab. Structural Dynamics & Vibration Control Lab. Korea Advanced.
1 Incorporating Iterative Refinement with Sparse Cholesky April 2007 Doron Pearl.
CSE 245: Computer Aided Circuit Simulation and Verification Matrix Computations: Iterative Methods I Chung-Kuan Cheng.
CS240A: Conjugate Gradients and the Model Problem.
Case Study in Computational Science & Engineering - Lecture 5 1 Iterative Solution of Linear Systems Jacobi Method while not converged do { }
Al Parker July 19, 2011 Polynomial Accelerated Iterative Sampling of Normal Distributions.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl Institut für Informatik Scientific Computing In Computer Science.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl.
Lecture 21 MA471 Fall 03. Recall Jacobi Smoothing We recall that the relaxed Jacobi scheme: Smooths out the highest frequency modes fastest.
Chapter 10 Minimization or Maximization of Functions.
1 Solving the algebraic equations A x = B =. 2 Direct solution x = A -1 B = = Applicable only to small problems For the vertical in the spectral technique.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Direct and Iterative Methods for Sparse Linear Systems
Krylov-Subspace Methods - I Lecture 6 Alessandra Nardi Thanks to Prof. Jacob White, Deepak Ramaswamy, Michal Rewienski, and Karen Veroy.
Solving Scalar Linear Systems A Little Theory For Jacobi Iteration
9 Nov B - Introduction to Scientific Computing1 Sparse Systems and Iterative Methods Paul Heckbert Computer Science Department Carnegie Mellon.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
Conjugate gradient iteration One matrix-vector multiplication per iteration Two vector dot products per iteration Four n-vectors of working storage x 0.
The Landscape of Sparse Ax=b Solvers Direct A = LU Iterative y’ = Ay Non- symmetric Symmetric positive definite More RobustLess Storage More Robust More.
Iterative Solution Methods
Krylov-Subspace Methods - I
Model Problem: Solving Poisson’s equation for temperature
Solving Systems of Linear Equations: Iterative Methods
Solving Linear Systems Ax=b
© Fluent Inc. 1/10/2018L1 Fluids Review TRN Solution Methods.
A Parallel Hierarchical Solver for the Poisson Equation
CSE 245: Computer Aided Circuit Simulation and Verification
Introduction to Multigrid Method
CSE 245: Computer Aided Circuit Simulation and Verification
CSE 245: Computer Aided Circuit Simulation and Verification
Conjugate Gradient Method
CS5321 Numerical Optimization
Alpha Matting Using Belief Propagation
6.5 Taylor Series Linearization
Numerical Linear Algebra
Lecture 8: Image alignment
Administrivia: November 9, 2009
Performance Optimization
Presentation transcript:

Solving Poisson Equations Using Least Square Technique in Image Editing Colin Zheng Yi Li

Roadmap Poisson Image Editing Least Square Techniques Poisson Blending Poisson Matting Least Square Techniques Conjugate Gradient With Pre-conditioning Multi-grid

Intro to Blending source target paste blend

Gradient Transfer

Gradient Transfer

Gradient Transfer

Gradient Transfer

Results

Results

∇I = (F −B)∇α+ α∇F +(1− α)∇B Into to Matting I = α F + (1 – α) B ∇I = (F −B)∇α+ α∇F +(1− α)∇B ∇I ≈ (F −B)∇α

Poisson Matting with

Poisson Matting with with

Results

Conjugate Gradient Method Problem to solve: Ax=b Sequences of iterates: x(i)=x(i-1)+(i)d(i) The search directions are the residuals. The update scalars are chosen to make the sequence conjugate (A-orthogonal) Only a small number of vectors needs to be kept in memory: good for large problems

Conjugate Gradient +

Conjugate Gradient: Starting Initialized as the source image (50 iterations) Initialized as the target image (50 iterations)

Precondition We can solve Ax=b indirectly by solving M-1Ax= M-1b If (M-1A) << (A), we can solve the latter equation more quickly than the original problem. * If max and min are the largest and smallest eigenvalues of a symmetric positive definite matrix B, then the spectral condition number of B is

Symmetric Successive Over Relaxation (SSOR) Barrett, R.; Berry, M.; Chan, T. F.; Demmel, J.; Donato, J.; Dongarra, J.; Eijkhout, V.; Pozo, R.; Romine, C.; and Van der Vorst, H. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd ed. Philadelphia, PA: SIAM, 1994.

Precondition

Precondition (Cont) Step=0 Step=5 Step=10 Step=20 Step=40 Without

Precondition Demo (20 iterations)

Multigrid Use coarse grids to computer an improved initial guess for the fine-grid.

Multigrid: Different Starting Initialized as Target (bad starting)

Multigrid (Cont) Looser threshold for the coarse grids:

Multigrid + Precondition Combine Multigrid with Precondition

Multigrid Demo

Conclusion Applications Least Square Techniques Performance Analysis Poisson Blending Poisson Matting Least Square Techniques Conjugate Gradient With Pre-conditioning Multi-grid Performance Analysis Sensitivity Convergence