Multigrid Computation for Variational Image Segmentation Problems: Multigrid approach  Rosa Maria Spitaleri Istituto per le Applicazioni del Calcolo-CNR.

Slides:



Advertisements
Similar presentations
School of something FACULTY OF OTHER School of Computing An Adaptive Numerical Method for Multi- Scale Problems Arising in Phase-field Modelling Peter.
Advertisements

Istituto per le Applicazioni del Calcolo "M. Picone" Multigrid Computation for Variational Image Segmentation Problems: Euler equations and approximation.
Mutigrid Methods for Solving Differential Equations Ferien Akademie 05 – Veselin Dikov.
CISC 489/689 Spring 2009 University of Delaware
Partial Differential Equations
Improvement of a multigrid solver for 3D EM diffusion Research proposal final thesis Applied Mathematics, specialism CSE (Computational Science and Engineering)
1 Iterative Solvers for Linear Systems of Equations Presented by: Kaveh Rahnema Supervisor: Dr. Stefan Zimmer
1 Numerical Solvers for BVPs By Dong Xu State Key Lab of CAD&CG, ZJU.
CS 290H 7 November Introduction to multigrid methods
SOLVING THE DISCRETE POISSON EQUATION USING MULTIGRID ROY SROR ELIRAN COHEN.
CSCI-455/552 Introduction to High Performance Computing Lecture 26.
MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA
Geometric (Classical) MultiGrid. Hierarchy of graphs Apply grids in all scales: 2x2, 4x4, …, n 1/2 xn 1/2 Coarsening Interpolate and relax Solve the large.
Error Measurement and Iterative Methods
Image Reconstruction Group 6 Zoran Golic. Overview Problem Multigrid-Algorithm Results Aspects worth mentioning.
Algebraic MultiGrid. Algebraic MultiGrid – AMG (Brandt 1982)  General structure  Choose a subset of variables: the C-points such that every variable.
CSCI 317 Mike Heroux1 Sparse Matrix Computations CSCI 317 Mike Heroux.
Geometric MultiGrid Mehod
COMP1261 Advanced Algorithms n 15 credits, Term 1 (Wednesday 9-12) n Pre-requisites: Calculus and Mathematical Methods, Numerical Mathematics and Computer.
Influence of (pointwise) Gauss-Seidel relaxation on the error Poisson equation, uniform grid Error of initial guess Error after 5 relaxation Error after.
Lecture 34 - Ordinary Differential Equations - BVP CVEN 302 November 28, 2001.
Geometric (Classical) MultiGrid. Linear scalar elliptic PDE (Brandt ~1971)  1 dimension Poisson equation  Discretize the continuum x0x0 x1x1 x2x2 xixi.
Easy Optimization Problems, Relaxation, Local Processing for a single variable.
Multiscale Methods of Data Assimilation Achi Brandt The Weizmann Institute of Science UCLA INRODUCTION EXAMPLE FOR INVERSE PROBLEMS.
MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA
1 M. Bronstein Multigrid multidimensional scaling Multigrid Multidimensional Scaling Michael M. Bronstein Department of Computer Science Technion – Israel.
Exercise where Discretize the problem as usual on square grid of points (including boundaries). Define g and f such that the solution to the differential.
Numerical methods for PDEs PDEs are mathematical models for –Physical Phenomena Heat transfer Wave motion.
ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
1 Numerical Integration of Partial Differential Equations (PDEs)
© Fluent Inc. 9/5/2015L1 Fluids Review TRN Solution Methods.
Multigrid for Nonlinear Problems Ferien-Akademie 2005, Sarntal, Christoph Scheit FAS, Newton-MG, Multilevel Nonlinear Method.
Malena Español, Tufts University Misha Kilmer, Tufts University
MA5251: Spectral Methods & Applications
Introduction to Scientific Computing II From Gaussian Elimination to Multigrid – A Recapitulation Dr. Miriam Mehl.
1 Computational Methods II (Elliptic) Dr. Farzad Ismail School of Aerospace and Mechanical Engineering Universiti Sains Malaysia Nibong Tebal Pulau.
Administrivia: May 20, 2013 Course project progress reports due Wednesday. Reading in Multigrid Tutorial: Chapters 3-4: Multigrid cycles and implementation.
11/17/ Shooting Method Major: All Engineering Majors Authors: Autar Kaw, Charlie Barker
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Introduction Course Outline.
Numerical Methods.
Implementing Hypre- AMG in NIMROD via PETSc S. Vadlamani- Tech X S. Kruger- Tech X T. Manteuffel- CU APPM S. McCormick- CU APPM Funding: DE-FG02-07ER84730.
Introduction to Scientific Computing II Overview Michael Bader.
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.
Introduction to Scientific Computing II
Discretization for PDEs Chunfang Chen,Danny Thorne Adam Zornes, Deng Li CS 521 Feb., 9,2006.
MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA
Partial Derivatives Example: Find If solution: Partial Derivatives Example: Find If solution: gradient grad(u) = gradient.
Marching Solver for Poisson Equation 大氣四 簡睦樺. Outline A brief review for Poisson equation and marching method Parallel algorithm and consideration for.
The Application of the Multigrid Method in a Nonhydrostatic Atmospheric Model Shu-hua Chen MMM/NCAR.
University of Colorado
X1X1 X2X2  Basic Kinematics Real Applications Simple Shear Trivial geometry Proscribed homogenous deformations Linear constitutive.
Optimizing 3D Multigrid to Be Comparable to the FFT Michael Maire and Kaushik Datta Note: Several diagrams were taken from Kathy Yelick’s CS267 lectures.
EEE 431 Computational Methods in Electrodynamics
MultiGrid.
© Fluent Inc. 1/10/2018L1 Fluids Review TRN Solution Methods.
Introduction to Multigrid Method
Introduction to Scientific Computing II
Civil Engineering Majors Authors: Autar Kaw, Charlie Barker
3D Image Segmentation and Multigrid Method
Introduction to Scientific Computing II
Problems with Gauss-Seidel
Anisotropic Diffusion for Speckle Reduction of SAR Image
Stencil Pattern ITCS 4/5145 Parallel computing, UNC-Charlotte, B. Wilkinson Oct 14, 2014 slides6b.ppt 1.
Electrical Engineering Majors Authors: Autar Kaw, Charlie Barker
Stencil Pattern ITCS 4/5145 Parallel computing, UNC-Charlotte, B. Wilkinson StencilPattern.ppt Oct 14,
Numerical Computation and Optimization
Chemical Engineering Majors Authors: Autar Kaw, Charlie Barker
Presentation transcript:

Multigrid Computation for Variational Image Segmentation Problems: Multigrid approach  Rosa Maria Spitaleri Istituto per le Applicazioni del Calcolo-CNR Viale del Policlinico 137, Rome, Italy iac.rm.cnr.it Advances in Numerical Algorithms, GRAZ, September , 2003

A few research topics  numerical simulation (PDE approximation)  linear and non-linear multigrid computation  applications: –grid generation –shallow water equations –image segmentation  numerical results  visualization  interactivity

Multigrid Computation  In the multigrid computation a system of finite-difference or finite-element equations is solved on a given grid by continuous interactions with a hierarchy of coarser grids  Main components of the multigrid computation: relaxation for error smoothing restriction (fine-to-coarser transfer operator) prolongation (coarse-to fine transfer operator) MG cycling ( cycling by grid change)

 Let G 0, G 1,..., G M be a sequence of grids, all approximating the domain , with mesh sizes h 0, h 1,..., h M such that h 0 > h 1 >... > h M.  Let us assume the system Lw = F in ,  w =  on  and the difference equations along with the associated boundary conditions L M w M = F M on G M,  M w M =  M on  M

 Full Approximation Storage ( FAS ) algorithm for non linear problems  The general form of the correction equation is L l w l = F l,  l w l =  l where F l = L l (I l l+1 w a l+1 )+I l l+1 (F l+1 -L l+1 w a l+1 )  l =  l (I l l+1 w a l+1 )+I l l+1 (  l+1 -  l+1 w a l+1 ), w a l+1 is the computed approximation on the finer grid and I l l+1 an appropriate fine-to-coarse transfer operator (restriction)

 In the fine grid correction step ( w a l+1 ) new = ( w a l+1 ) old + I l l+1 (w a l - I l l+1 w a l+1 ) where I l l+1 is an appropriate coarse-to-fine transfer operator (prolongation)  In the FAS algorithm the idea is to store the full current approximation w a l instead of storing just the correction

Pre-smoothing  compute by applying 1 (≥0) sweeps of a given (non-linear) relaxation method with starting guess One iteration step of the (l+1,l) two-grid method, which computes from, is composed of the following steps: FAS two-grid method

Post-smoothing  compute by applying 2 (≥0) sweeps of a given (non-linear) relaxation method with starting guess The non-linear relaxation procedure, suitable for error smoothing, is applied 1 times before and 2 times after the coarse grid correction step

Coarse-grid correction u computation of the residual u restriction of the residual u restriction of the current approximation u computation of the exact solution of u computation of the correction u interpolation of the correction u computation of the correct approximation

Multigrid Components  coarse grid construction (hierarchy of grids): meshsize doubling  relaxation for error smoothing (, ): Gauss-Seidel relaxation-non collective  relaxation ordering : rotated lexicographical  multigrid cycling : V, W cycles

 restriction ( fine-to-coarse-grid transfer operator )(, ) : straight injection, weighted --> nine-point  prolongation (coarse-to-fine-grid transfer operator ) ( ) : piecewise linear interpolation, weighted-->nine-point

References á R. M. Spitaleri, A Scientific Computing Environment for Differential Modeling, Mathematics and Computer in Simulation, 62, 4: (2003) á R.M. Spitaleri, R. March, D. Arena, A Multigrid Finite Difference Method for the Solution of Euler Equations of the Variational Image Segmentation Applied Numerical Mathematics, 39: (2001) á R. M. Spitaleri, Numerical Insights in the Solution of Euler Equations of the Variational Image Segmentation, Non Linear Analysis, 47: (2001) á Spitaleri R.M., Full-FAS Multigrid Grid Generation Algorithms, Applied Numerical Mathematics 32, 4: (2000) á R.M Spitaleri, R. March and D. Arena, Finite Difference Solution of Euler Equations Arising in Variational Image Segmentation, Numerical Algorithms, 21: (1999) á R.M. Spitaleri (Ed.) Special issue on Applied Scientifc Computing-Grid Generation, Approximated Solutions and Visualization, Applied Numerical Mathematics, (2003- to appear) á R.M. Spitaleri (Ed.) Special Issue on Applied Numerical Computing: Grid Generation and Solution Methods for Advanced Simulations, Applied Numerical Mathematics 46, 3-4, ( 2003)

Organization 2003 u MASCOT 03 IMACS/ISGG Worshop 3 rd Meeting on Applied Scientific Computing and Tools, Grid generation, Approximation, Simulation and Visualization FORTE VILLAGE RESORT, Sardinia, October 3-4, 2003 in TCN-CAE International Conference on CAE and Computational Technologies for Industry, October 2-5, 2003 u EWM2003-Annual Conference of EWM-European Women in Mathematics, Luminy, France, November 3-7, 2003 Session ‘Numerical Methods’