Medical Image Analysis

Similar documents
Medical Image Analysis

Linear Diffusion. E9 242 STIP- R. Venkatesh Babu IISc

NONLINEAR DIFFUSION PDES

Nonlinear Diffusion. Journal Club Presentation. Xiaowei Zhou

ITK Filters. Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms

Nonlinear Diffusion. 1 Introduction: Motivation for non-standard diffusion

Fraunhofer Institute for Computer Graphics Research Interactive Graphics Systems Group, TU Darmstadt Fraunhoferstrasse 5, Darmstadt, Germany

Linear Diffusion and Image Processing. Outline

Edge Detection in Computer Vision Systems

Lecture 7: Edge Detection

TRACKING and DETECTION in COMPUTER VISION Filtering and edge detection

NON-LINEAR DIFFUSION FILTERING

Review Smoothing Spatial Filters Sharpening Spatial Filters. Spatial Filtering. Dr. Praveen Sankaran. Department of ECE NIT Calicut.

Review for Final. The final will be about 20% from chapter 2, 30% from chapter 3, and 50% from chapter 4. Below are the topics to study:

Image enhancement. Why image enhancement? Why image enhancement? Why image enhancement? Example of artifacts caused by image encoding

Edge Detection. CS 650: Computer Vision

Examples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.

Diffusion on the half-line. The Dirichlet problem

Reading. 3. Image processing. Pixel movement. Image processing Y R I G Q

Introduction to numerical schemes

Stability of Krylov Subspace Spectral Methods

Blobs & Scale Invariance

Spectral Processing. Misha Kazhdan

Where is the bark, the tree and the forest, mathematical foundations of multi-scale analysis

Scientific Computing: An Introductory Survey

ECE Digital Image Processing and Introduction to Computer Vision. Outline

Introduction to Linear Systems

Complex Diffusion Processes for Image Filtering

Suppose that f is continuous on [a, b] and differentiable on (a, b). Then

Lesson 04. KAZE, Non-linear diffusion filtering, ORB, MSER. Ing. Marek Hrúz, Ph.D.

Image preprocessing in spatial domain

MA1021 Calculus I B Term, Sign:

Math 180, Exam 2, Practice Fall 2009 Problem 1 Solution. f(x) = arcsin(2x + 1) = sin 1 (3x + 1), lnx

PDEs in Image Processing, Tutorials

ENERGY METHODS IN IMAGE PROCESSING WITH EDGE ENHANCEMENT

Consistent Positive Directional Splitting of Anisotropic Diffusion

Nonlinear Signal Processing ELEG 833

Optimal stopping time formulation of adaptive image filtering

Nonlinear Iterative Solution of the Neutron Transport Equation

Today s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn

Tutorial 2. Introduction to numerical schemes

CN780 Final Lecture. Low-Level Vision, Scale-Space, and Polyakov Action. Neil I. Weisenfeld

III. Time Domain Analysis of systems

tom.h.wilson Dept. Geology and Geography West Virginia University Tom Wilson, Department of Geology and Geography

PDE Based Image Diffusion and AOS

Gaussian derivatives

The Mean Value Theorem. Oct

Math 126 Final Exam Solutions

Laplacian Filters. Sobel Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters

Unit IV Derivatives 20 Hours Finish by Christmas

Unit IV Derivatives 20 Hours Finish by Christmas

Introduction to Nonlinear Image Processing

PARTIAL DIFFERENTIAL EQUATIONS MIDTERM

A BAYESIAN APPROACH TO NONLINEAR DIFFUSION BASED ON A LAPLACIAN PRIOR FOR IDEAL IMAGE GRADIENT

Iterative Methods for Ill-Posed Problems

Implicit Scheme for the Heat Equation

CS 534: Computer Vision Segmentation III Statistical Nonparametric Methods for Segmentation

CSE 554 Lecture 6: Deformation I

MAT137 Calculus! Lecture 6

Lecture No 1 Introduction to Diffusion equations The heat equat

MATH 425, HOMEWORK 3 SOLUTIONS

Math 180, Final Exam, Fall 2007 Problem 1 Solution

1) The line has a slope of ) The line passes through (2, 11) and. 6) r(x) = x + 4. From memory match each equation with its graph.

Motion Estimation (I)

2015 Math Camp Calculus Exam Solution

Green s Functions and Distributions

Signal Processing and Linear Systems1 Lecture 4: Characterizing Systems

Applied Mathematics 205. Unit III: Numerical Calculus. Lecturer: Dr. David Knezevic

Edges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise

Part 2 Introduction to Microlocal Analysis

BTCS Solution to the Heat Equation

Vlad Estivill-Castro (2016) Robots for People --- A project for intelligent integrated systems

Overview. Introduction to local features. Harris interest points + SSD, ZNCC, SIFT. Evaluation and comparison of different detectors

Additive Manufacturing Module 8

A Partial Differential Equation Approach to Image Zoom

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.

Computer Vision Lecture 3

Machine vision. Summary # 4. The mask for Laplacian is given

L(x; 0) = f(x) This family is equivalent to that obtained by the heat or diffusion equation: L t = 1 2 L

MATH 019: Final Review December 3, 2017

Week 12: Optimisation and Course Review.

a x a y = a x+y a x a = y ax y (a x ) r = a rx and log a (xy) = log a (x) + log a (y) log a ( x y ) = log a(x) log a (y) log a (x r ) = r log a (x).

Introduction to Partial Differential Equations

KAZE Features. 1 Introduction. Pablo Fernández Alcantarilla 1, Adrien Bartoli 1, and Andrew J. Davison 2

Scale-space image processing

Introduction to Machine Learning Spring 2018 Note Neural Networks

Math 1120 Calculus, section 2 Test 1

Strauss PDEs 2e: Section Exercise 2 Page 1 of 8. In order to do so, we ll solve for the Green s function G(x, t) in the corresponding PDE,

Elliptic Problems / Multigrid. PHY 604: Computational Methods for Physics and Astrophysics II

9 Forward-backward algorithm, sum-product on factor graphs

RIGOROUS MATHEMATICAL INVESTIGATION OF A NONLINEAR ANISOTROPIC DIFFUSION-BASED IMAGE RESTORATION MODEL

Numerical Solution Techniques in Mechanical and Aerospace Engineering

MATH 425, FINAL EXAM SOLUTIONS

REGULARITY FOR INFINITY HARMONIC FUNCTIONS IN TWO DIMENSIONS

3.9 Derivatives of Exponential and Logarithmic Functions

APPLICATIONS OF DIFFERENTIATION

T H E S I S. Computer Engineering May Smoothing of Matrix-Valued Data. Thomas Brox

Machine vision, spring 2018 Summary 4

Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007

Transcription:

Medical Image Analysis CS 593 / 791 Computer Science and Electrical Engineering Dept. West Virginia University 20th January 2006

Outline 1 Discretizing the heat equation 2

Outline 1 Discretizing the heat equation Mapping the image to a vector Boundary Conditions Stability 2

Recall : The heat equation In 1D I t = 2 I x 2

Recall : Numerical Derivatives First order forward difference: I (x 0 ) I(x 0 + 1) I(x 0 ) First order backward difference: I (x 0 ) I(x 0 ) I(x 0 1) Second order, second centered difference: I (x 0 ) I(x 0 + 1) 2I(x 0 ) + I(x 0 1)

Discretized 1D Heat Equation : Explicit Using the forward difference in time we get Explicit formulation I t+δ x = I t x + δ(i t x+1 2It x + I t x 1 ) Explicit : Update I t using derivatives computed at time t. Form a vector, w of image values, so that w i = I(i)

Discretized 1D Heat Equation : Explicit We can rewrite the discretized heat equation as the system of linear equations: i = [δ, 1 2δ, δ] w t+δ This is equivalent to i = [0, δ, 1 2δ, δ, 0] w t+δ w t i 1 w t i w t i+1 w t i 2 w t i 1 w t i w t i+1 w t i+2 We can continue padding the row vector of coefficients with 0 entries until...

Discretized 1D Heat Equation : Explicit w t+δ i = [0,..., 0, δ, 1 2δ, δ, 0,..., 0]w t = a i w t Where (1 2δ) is in the i-th column, since it multiplies w t i. We can write the whole system of equations by forming a matrix A whose i-th row is a i w t+1 = Aw t A is a tridiagonal matrix.

Discretized 1D Heat Equation : Explicit w t+δ i = [0,..., 0, δ, 1 2δ, δ, 0,..., 0]w t = a i w t Where (1 2δ) is in the i-th column, since it multiplies w t i. We can write the whole system of equations by forming a matrix A whose i-th row is a i w t+1 = Aw t A is a tridiagonal matrix.

Discretized 2D Heat Equation : Explicit Recall the 2D heat equation I t = 2 I x 2 + 2 I y 2 Using the forward difference in time we get Explicit formulation I t+δ x,y = I t x,y + δ(i t x+1,y 4It x,y + I t x 1,y + It x,y+1 + It x,y 1 ) Update I t using derivatives computed at time t.

Discretized 2D Heat Equation : Implicit Recall the heat equation I t = 2 I x 2 + 2 I y 2 Using the backward difference in time we get Explicit formulation I t+δ x,y = Ix,y t + δ(i t+δ x+1,y 4It+δ x,y + I t+δ x 1,y + It+δ x,y+1 + It+δ x,y 1 ) Implicit : Update I t using derivatives computed at time t + δ.

Mapping the image to a vector 2D image indices to 1D image index Map 2d coordinates of I(x, y) (0, 0) (1, 0) (2, 0) (0, 1) (1, 1) (2, 1) (0, 2) (1, 2) (2, 2) to 1d coordinates of w(i) 0 3 6 1 4 7 2 5 8 The coordinate transformation is given by i(x, y) = nx + y for an n n image.

Mapping the image to a vector Writing central differences in 1D vector form For the coordinate transformation function i(x, y) = nx + y If I(x, y) w(i), then I(x, y + 1) w(i + 1), since i(x, y + 1) = nx + y + 1 = i(x, y) + 1. If I(x, y) w(i), then I(x + 1, y) w(i + n), since i(x + 1, y) = n(x + 1) + y = i(x, y) + n.

Mapping the image to a vector Writing central differences in 1D vector form For the coordinate transformation function i(x, y) = nx + y If I(x, y) w(i), then I(x, y + 1) w(i + 1), since i(x, y + 1) = nx + y + 1 = i(x, y) + 1. If I(x, y) w(i), then I(x + 1, y) w(i + n), since i(x + 1, y) = n(x + 1) + y = i(x, y) + n.

Mapping the image to a vector Writing central differences in 1D vector form For the coordinate transformation function i(x, y) = nx + y If I(x, y) w(i), then I(x, y + 1) w(i + 1), since i(x, y + 1) = nx + y + 1 = i(x, y) + 1. If I(x, y) w(i), then I(x + 1, y) w(i + n), since i(x + 1, y) = n(x + 1) + y = i(x, y) + n.

Mapping the image to a vector Writing central differences in 1D vector form For the coordinate transformation function i(x, y) = nx + y If I(x, y) w(i), then I(x, y + 1) w(i + 1), since i(x, y + 1) = nx + y + 1 = i(x, y) + 1. If I(x, y) w(i), then I(x + 1, y) w(i + n), since i(x + 1, y) = n(x + 1) + y = i(x, y) + n.

Mapping the image to a vector Writing central differences in 1D vector form For the coordinate transformation function i(x, y) = nx + y If I(x, y) w(i), then I(x, y + 1) w(i + 1), since i(x, y + 1) = nx + y + 1 = i(x, y) + 1. If I(x, y) w(i), then I(x + 1, y) w(i + n), since i(x + 1, y) = n(x + 1) + y = i(x, y) + n.

Mapping the image to a vector Writing central differences in 1D vector form For the coordinate transformation function i(x, y) = nx + y So, I 2 (x, y) y 2 I(x, y + 1) 2I(x, y) + I(x, y 1) w(i + 1) 2w(i) + w(i 1) and I 2 (x, y) x 2 I(x + 1, y) 2I(x, y) + I(x 1, y) w(i + n) 2w(i) + w(i n)

Mapping the image to a vector Writing central differences in 1D vector form For the coordinate transformation function i(x, y) = nx + y So, I 2 (x, y) y 2 I(x, y + 1) 2I(x, y) + I(x, y 1) w(i + 1) 2w(i) + w(i 1) and I 2 (x, y) x 2 I(x + 1, y) 2I(x, y) + I(x 1, y) w(i + n) 2w(i) + w(i n)

Mapping the image to a vector Writing difference equations in matrix form The implicit formulation of the heat equation involves solving n 2 simultaneous equations:.. w t i.. wi t = w t+δ i + δ(w t+δ t+δ i+1 4wi + w t+δ i 1 + w t+δ i+n + w t+δ i n )........................... =... δ... δ 1 4δ δ... δ.............................. What to do when w(i ± 1) or w(i ± n) falls outside the image. w t+δ i n. w t+δ i 1 w t+δ i w t+δ i+1. w t+δ i+n.

Boundary Conditions Constant Boundary Value (x < 0) or (x > n) I(x) = c For c = 0: I xx (0) 2I(0) + I(1)

Boundary Conditions Constant Boundary Slope Fixing the slope at zero (adiabatic) gives (x < 0) I(x) = I(0) (x > n) I(x) = I(n) I xx (0) I(0) + I(1)

Boundary Conditions Periodic Boundary Conditions (x < 0) I(x) = I(x + n) (x > n) I(x) = I(x n) I xx (0) I(n 1) 2I(0) + I(1)

Boundary Conditions Reflective Boundary Conditions (x < 0) I(x) = I( x) (x > n) I(x) = I(2n x) I xx (0) 2I(0) + 2I(1)

Stability Stability of the explicit 1D heat equation The 1D heat equation, I t = I xx, has solution I(x, t) = e t cos(x). This corresponds to the problem with initial condition I(x, 0) = cos(x). Discretize only in time (forward) Observe that I xx (x, t) = e t cos(x) = I(x, t) I t+δ I t δ = I t I t+δ = I t δi t

Stability Convergence criterion : ratio test The sequence I t is convergent if lim I t+δ t I t < 1 The explicit equation we formed earlier I t+δ = I t δi t has convergence criterion I t+δ I t = 1 δ < 1 This is satisfied for 0 < δ < 2. (Only conditionally convergent.)

Stability Stability of the implicit 1D heat equation Discretize only in time (backward) I t+δ I t = I t+δ δ I t+δ = I t δi t+δ The implicit equation has convergence criterion I t+δ I t = 1 1 + δ < 1 This is satisfied for δ > 0.

Stability Stability In general, it can be shown that Explicit methods are conditionally stable. Implicit methods are unconditionally stable.

Outline 1 Discretizing the heat equation 2 Introduction Weaknesses of the standard scale-space paradigm Inhomogeneous diffusion Properties of inhomogeneous diffusion Next Class

Introduction Scale-space The need for multiscale image representations: Details in images should only exist over certain ranges of scale.

Introduction Scale-space Definition: a family of images, I(x, y, t), where The scale-space parameter is t. I(x, y, 0) is the original image. Increasing t corresponds to coarser resolutions. I(x, y, t) can be generated by convolving with wider Gaussian kernels as t increases, or equivalently, by solving the heat equation.

Introduction Earlier Scale-space properties Causality: coarse details are caused by fine details. New details should not arise in coarse scale images. Smoothing should be homogeneous and isotropic. This paper will challenge the last property, and propose a more useful scale-space definition. The new scale-space will be shown to obey the causality property.

Weaknesses of the standard scale-space paradigm Lost Edge Information Edge location is not preserved across the scale space. Edge crossings may disappear. Region boundaries are blurred. Gaussian blurring is a local averaging operation. It does not respect natural boundaries.

Weaknesses of the standard scale-space paradigm Linear Scale Space Def: Scale spaces generated by a linear filtering operation. Nonlinear filters, such as the median filter, can be used to generate scale-space images. Many nonlinear filters violate one of the scale-space conditions.

Weaknesses of the standard scale-space paradigm New Criteria Causality. Immediate localization : edge locations remain fixed. Piecewise Smoothing : permit discontinuities at boundaries. At all scales the image will consist of smooth regions separated by boundaries (edges).

Inhomogeneous diffusion Diffusion equation I = div(c(x, y, t) I) t The diffusion coefficient, c(x, y, t) controls the degree of smoothing at each point in I. The basic idea: Setting c(x, y, t) = 0 at region boundaries, and c(x, y, t) = 1 at region interior will encourage intraregion smoothing, and discourage interregion smoothing.

Inhomogeneous diffusion Diffusion equation By the chain rule: ( I = div t = c x c(x, y, t) I x c(x, y, t) I y ) I x + c(x, y, t) 2 I x 2 + c y = c(x, y, t) 2 I + c I I y + c(x, y, t) 2 I y 2 Notation The paper uses the symbol to represent the Laplacian. I = 2 I = div( I)

Inhomogeneous diffusion Conduction coefficient What properties would he like c(x, y, t) to have? c = 1 at interior of a region. c = 0 at boundary of a region. c should be nonnegative everywhere. Since c(x, y, t) depends on edge information, we need an edge descriptor, E(x, y, t), to compute c. Notation When written as a function of the edge descriptor, the authors use the symbol g() for conduction coefficient.

Inhomogeneous diffusion Edge Estimate (or Edge Descriptor) E(x, y, t) should convey the following information: Location. Magnitude (contrast across edge). Direction. and obey the following properties: E(x, y, t) = 0 at region interior. E(x, y, t) = K e(x, y, t) at region boundaries. K is the contrast, e(x, y, t) is perpendicular to the edge. I(x, y, t) has these properties, and is a useful edge estimator.

Properties of inhomogeneous diffusion Maximum Principle The maximum and minimum intensities in the scale-space image I(x, y, t) occur at t = 0 (the finest scale image). Since new maxima and minima correspond to new image features, the causality requirement of scale-space can satisfied if the evolution equation obeys the maximum principle. We will make some less rigorous observations concerning causality...

Properties of inhomogeneous diffusion Maximum Principle For the 1D heat equation : I t = I xx. Solving the heat equation is equivalent to convolution. Convolution is a local averaging operation. Averaging is bounded by the values being averaged.

Properties of inhomogeneous diffusion Maximum Principle For the equation I t = c(x, y, t) 2 I + c I Note that at local minima I = 0 and we are evolving by the original heat equation. It can be shown that this general class of PDEs obeys the maximum principle. We will also inspect a maximum principle for the discretized equations.

Properties of inhomogeneous diffusion Edge Enhancement Inhomogeneous diffusion may actually enhance edges, for a certain choice of c(x, y, t). 1D example: Let s(x) = I x, and φ(s) = g(s)s = g(i x)i x. The 1D heat equation becomes I t = x (g(i x)i x ) = x φ(s) by chain rule = φ s s x = φ (s)i xx

Properties of inhomogeneous diffusion Edge Enhancement We are interested in the rate of change of edge slope with respect to time. t (I x) = x (I t) if I is smooth = x (φ (s)i xx ) = φ (s)i 2 xx + φ (s)i xxx

Properties of inhomogeneous diffusion Edge Enhancement I, I x, I xx, I xxx t (I x) = φ (s)i 2 xx + φ (s)i xxx For a step edge with I x > 0 look at the inflection point, p. Observe that I xx (p) = 0, and I xxx (p) < 0. t (I x)(p) = φ (s)i xxx (p) The sign of this quantity depends only on φ (s).

Properties of inhomogeneous diffusion Edge Enhancement At the inflection point: t (I x)(p) = φ (s)i xxx (p) If φ (s) > 0, then t (I x)(p) < 0 (slope is decreasing). If φ (s) < 0, then t (I x)(p) > 0 (slope is increasing). Since φ(s) = g(s)s, selecting the function g(s) determines which edges of smoothed and which are sharpened.

Properties of inhomogeneous diffusion The function g() Perona and Malik suggest two possible functions I ( ) g( I ) = e K 2 g( I ) = 1 1 + ( I (α > 0) K )1+α

Next Class We will continue to discuss the paper, looking at parameter setting and implementation details.