Medical Image Analysis

Similar documents
Medical Image Analysis

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

NONLINEAR DIFFUSION PDES

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

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

Nonlinear Diffusion. Journal Club Presentation. Xiaowei Zhou

Lecture 7: Edge Detection

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

Introduction to Computer Vision

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

Edge Detection in Computer Vision Systems

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

ECE Digital Image Processing and Introduction to Computer Vision. Outline

Linear Diffusion and Image Processing. Outline

Introduction to Nonlinear Image Processing

PDE Based Image Diffusion and AOS

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

TRACKING and DETECTION in COMPUTER VISION Filtering and edge detection

NON-LINEAR DIFFUSION FILTERING

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

Nonlinear diffusion filtering on extended neighborhood

Graph Signal Processing for Image Compression & Restoration (Part II)

Numerical Solution Techniques in Mechanical and Aerospace Engineering

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

Efficient Beltrami Filtering of Color Images via Vector Extrapolation

EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6)

Lecture 8: Interest Point Detection. Saad J Bedros

Filtering and Edge Detection

A Four-Pixel Scheme for Singular Differential Equations

Complex Diffusion Processes for Image Filtering

Erkut Erdem. Hacettepe University February 24 th, Linear Diffusion 1. 2 Appendix - The Calculus of Variations 5.

Convolutional networks. Sebastian Seung

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

CSE 473/573 Computer Vision and Image Processing (CVIP)

Consistent Positive Directional Splitting of Anisotropic Diffusion

EEL 5544 Noise in Linear Systems Lecture 30. X (s) = E [ e sx] f X (x)e sx dx. Moments can be found from the Laplace transform as

Image preprocessing in spatial domain

I Chen Lin, Assistant Professor Dept. of CS, National Chiao Tung University. Computer Vision: 4. Filtering

Lecture No 1 Introduction to Diffusion equations The heat equat

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

PDEs in Image Processing, Tutorials

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

CS 3710: Visual Recognition Describing Images with Features. Adriana Kovashka Department of Computer Science January 8, 2015

Ergodicity for Infinite Dimensional Systems

Image Noise: Detection, Measurement and Removal Techniques. Zhifei Zhang

Image Enhancement: Methods. Digital Image Processing. No Explicit definition. Spatial Domain: Frequency Domain:

Lecture 8: Interest Point Detection. Saad J Bedros

Image Processing. Waleed A. Yousef Faculty of Computers and Information, Helwan University. April 3, 2010

Multiple Random Variables

Detectors part II Descriptors

A Localized Linearized ROF Model for Surface Denoising

Old painting digital color restoration

Gaussian derivatives

Image Gradients and Gradient Filtering Computer Vision

Joint Optimization of Segmentation and Appearance Models

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros

Solving linear systems (6 lectures)

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

Math 126 Final Exam Solutions

A Riemannian Framework for Denoising Diffusion Tensor Images

Fast Local Laplacian Filters: Theory and Applications

Non-Local Adaptive Structure Tensors. Application to Anisotropic Diffusion and Shock Filtering

Spatial Enhancement Region operations: k'(x,y) = F( k(x-m, y-n), k(x,y), k(x+m,y+n) ]

Image Segmentation: Definition Importance. Digital Image Processing, 2nd ed. Chapter 10 Image Segmentation.

Lecture 6: Edge Detection. CAP 5415: Computer Vision Fall 2008

Tensor-based Image Diffusions Derived from Generalizations of the Total Variation and Beltrami Functionals

Multivariate Random Variable

Local Enhancement. Local enhancement

Introduction to numerical schemes

Stability of Krylov Subspace Spectral Methods

Harris Corner Detector

LoG Blob Finding and Scale. Scale Selection. Blobs (and scale selection) Achieving scale covariance. Blob detection in 2D. Blob detection in 2D

Edge Detection. CS 650: Computer Vision

Math background. Physics. Simulation. Related phenomena. Frontiers in graphics. Rigid fluids

Conjugate gradient acceleration of non-linear smoothing filters

OWELL WEEKLY JOURNAL

Image Compression Based on Visual Saliency at Individual Scales

Computer Vision Lecture 3

NONLINEAR diffusion denoising is a powerful denoising

Math 180, Final Exam, Fall 2007 Problem 1 Solution

Computational Physics

Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

Lecture 1: Graphs, Adjacency Matrices, Graph Laplacian

Local enhancement. Local Enhancement. Local histogram equalized. Histogram equalized. Local Contrast Enhancement. Fig 3.23: Another example

Space-Variant Computer Vision: A Graph Theoretic Approach

ENERGY METHODS IN IMAGE PROCESSING WITH EDGE ENHANCEMENT

Basic Aspects of Discretization

Computer Intensive Methods in Mathematical Statistics

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

Blobs & Scale Invariance

Scale and Statistics in Variable Conductance Diffusion

Scale Space Analysis by Stabilized Inverse Diffusion Equations

A Partial Differential Equation Approach to Image Zoom

Edge Detection. Introduction to Computer Vision. Useful Mathematics Funcs. The bad news

Modelling Non-linear and Non-stationary Time Series

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

Lecture 3: Compressive Classification

Energy-Based Image Simplification with Nonlocal Data and Smoothness Terms

Digital Image Processing. Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 2009

Transcription:

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

Outline 1 Recap 2 Edge Enhancement 3 Experimental Results 4 The rest of the paper... 5 Anisotropic Diffusion

Outline 1 Recap 2 Edge Enhancement 3 Experimental Results 4 The rest of the paper... 5 Anisotropic Diffusion

Edge Enhancement Inhomogeneous diffusion may actually enhance edges, for a certain choice of g(). 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) = φ (s)i xx t (I x) is the rate of change of edge slope with respect to time. t (I x) = x (I t) = φ (s)i 2 xx + φ (s)i xxx

Edge Enhancement 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. I, I x, I xx, I xxx t (I x)(p) = φ (s)i xxx (p) The sign of this quantity depends only on φ (s).

Edge Enhancement 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. I, I x, I xx, I xxx t (I x)(p) = φ (s)i xxx (p) The sign of this quantity depends only on φ (s).

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 are smoothed and which are sharpened.

Outline 1 Recap 2 Edge Enhancement 3 Experimental Results 4 The rest of the paper... 5 Anisotropic Diffusion

The function φ(s) = g(s)s φ(0) = 0 φ (s) > 0 for s < K φ (s) < 0 for s > K lim s φ(s) 0

The function g(s) Perona and Malik suggest two possible functions (s = I ): I ( ) g( I ) = e K 2 g( I ) = 1 1 + ( I (α > 0) K )1+α

Effect of varying K on g() 1 g( I ) = 1 + ( I (α > 0) K )1+α Figure: K = 2, 4, 6

Effect of varying α on g() 1 g( I ) = 1 + ( I (α > 0) K )1+α Figure: α = 1, 3, 5, 7, 9

Effect of varying K and α on c() Figure: I and I.

Effect of varying K on c() Figure: K = 3, 5, 10, 100.

Effect of varying α on c() Figure: α = 1, 2, 3, 5.

Outline 1 Recap 2 Edge Enhancement 3 Experimental Results Discretized Inhomogeneous Heat Equation Perona-Malik Implementation Discrete Maximum Principle Adaptive Parameter Setting 4 The rest of the paper... 5 Anisotropic Diffusion

Discretized Inhomogeneous Heat Equation Explicit Formulation I t = c(x, y, t) 2 I + c I Using centered differences for the Laplacian and gradients: I t+1 x,y I t x,y λ = c x,y (I t x 1,y + It x+1,y + It x,y 1 + It x,y+1 4It x,y) + ( c x+1,y c x 1,y 2 + ( c x,y+1 c x,y 1 2 )( I x+1,y I x 1,y ) 2 )( I x,y+1 I x,y 1 ) 2

Discretized Inhomogeneous Heat Equation Implicit Formulation Same diagonal structure as homogeneous heat equation? Yes. Symmetric? No. Diagonal dominance? Data dependent.

Discretized Inhomogeneous Heat Equation Implicit Formulation Same diagonal structure as homogeneous heat equation? Yes. Symmetric? No. Diagonal dominance? Data dependent.

Discretized Inhomogeneous Heat Equation Implicit Formulation Same diagonal structure as homogeneous heat equation? Yes. Symmetric? No. Diagonal dominance? Data dependent.

Discretized Inhomogeneous Heat Equation Implicit Formulation Same diagonal structure as homogeneous heat equation? Yes. Symmetric? No. Diagonal dominance? Data dependent.

Perona-Malik Implementation Explicit Formulation I t = c(x, y, t) 2 I + c I By splitting the Laplacian and averaging the forward and backward differences in the gradient: I t+1 x,y I t x,y λ = c x,y [(I t x 1,y It x,y) + (I t x+1,y It x,y) + (I t x,y 1 It x,y) + (I t x,y+1 It x,y)] + c x (I x+1,y I x,y 2 + c y (I x,y+1 I x,y 2 + I x,y I x 1,y ) 2 + I x,y I x,y 1 ) 2

Perona-Malik Implementation Explicit Formulation I t = c(x, y, t) 2 I + c I I t+1 x,y I t x,y λ = (c x,y 1 c 2 x )(It x 1,y It x,y) + (c x,y + 1 c 2 x )(It x+1,y It x,y) + (c x,y 1 c 2 x )(It x,y 1 It x,y) + (c x,y + 1 c 2 x )(It x,y+1 It x,y)

Perona-Malik Implementation Explicit Formulation c x,y + 1 c 2 x c x,y 1 c 2 x c x+ 1 2,y c x 1 2,y c x+ 1 c x 1 Where s x,y = I(x, y). 2,y g( s x,y + s x+1,y ) 2 2,y g( s x,y + s x 1,y ) 2

Perona-Malik Implementation Explicit Formulation I t+1 x,y I t x,y λ = g( s x,y + s x 1,y )(Ix 1,y t 2 It x,y) + g( s x,y + s x+1,y )(Ix+1,y t 2 It x,y) + g( s x,y + s x,y 1 )(Ix,y 1 t 2 It x,y) + g( s x,y + s x,y+1 )(Ix,y+1 t 2 It x,y)

Perona-Malik Implementation Anisotropic Implementation Compute g() using the projection of the gradient along one direction. For example, in g( sx,y +s x+1,y 2 ), let s x,y = I (x, y) x s x+1,y = I (x + 1, y) x Computing s x,y using forward differences, and s x+1,y using backward differences s x,y = I x+1,y I x,y s x+1,y = I x+1,y I x,y, so g( sx,y +s x+1,y 2 ) = g( I(x + 1, y) I(x, y) ).

Perona-Malik Implementation Explicit Formulation I t+1 x,y I t x,y λ = g( I x 1,y I x,y )(I t x 1,y It x,y) + g( I x+1,y I x,y )(I t x+1,y It x,y) + g( I x,y 1 I x,y )(I t x,y 1 It x,y) + g( I x,y+1 I x,y )(I t x,y+1 It x,y) Notation: The authors use to denote finite differences. This is not the gradient operator ( ).

Perona-Malik Implementation N I i,j I i 1,j I i,j S I i,j I i+1,j I i,j E I i,j I i,j+1 I i,j W I i,j I i,j 1 I i,j Image neighborhood system c Ni,j = g( N I i,j ) c Si,j = g( S I i,j ) c Ei,j = g( E I i,j ) c Wi,j = g( W I i,j )

Perona-Malik Implementation Explicit Formulation The previous explicit formulation I t+1 x,y I t x,y λ = g( I x 1,y I x,y )(I t x 1,y It x,y) + g( I x+1,y I x,y )(I t x+1,y It x,y) + g( I x,y 1 I x,y )(I t x,y 1 It x,y) + g( I x,y+1 I x,y )(I t x,y+1 It x,y) can be rewritten as I t+1 x,y = I t x,y + λ(c Ni,j N I i,j + c Si,j S I i,j + c Ei,j E I i,j + c Wi,j W I i,j ) t

Discrete Maximum Principle Let I Mij = max(i, I N, I S, I E, I W ) Ix,y t+1 = Ix,y t + λ(c Ni,j N I i,j + c Si,j S I i,j + c Ei,j E I i,j + c Wi,j W I i,j ) Ix,y t+1 = Ix,y(1 t λ(c Ni,j + c Si,j + c Ei,j + c Wi,j )) + λ(c Ni,j I Ni,j + c Si,j I Si,j + c Ei,j I Ei,j + c Wi,j I Wi,j ) Since all c s and λ are positive and between 0,1: I t+1 x,y I t M ij (1 λ(c Ni,j + c Si,j + c Ei,j + c Wi,j )) + I t M ij (λ(c Ni,j + c Si,j + c Ei,j + c Wi,j )) = I t M ij

Discrete Maximum Principle Let I Mij = max(i, I N, I S, I E, I W ) Ix,y t+1 = Ix,y t + λ(c Ni,j N I i,j + c Si,j S I i,j + c Ei,j E I i,j + c Wi,j W I i,j ) Ix,y t+1 = Ix,y(1 t λ(c Ni,j + c Si,j + c Ei,j + c Wi,j )) + λ(c Ni,j I Ni,j + c Si,j I Si,j + c Ei,j I Ei,j + c Wi,j I Wi,j ) Since all c s and λ are positive and between 0,1: I t+1 x,y I t M ij (1 λ(c Ni,j + c Si,j + c Ei,j + c Wi,j )) + I t M ij (λ(c Ni,j + c Si,j + c Ei,j + c Wi,j )) = I t M ij

Adaptive Parameter Setting Set K every iteration Compute a histogram, f i, of I Find K such that 90% of the pixels have gradient magnitude < K. (If b i=1 f i 0.9n 2 then bin b corresponds to gradient magnitude K ).

Outline 1 Recap 2 Edge Enhancement 3 Experimental Results 4 The rest of the paper... 5 Anisotropic Diffusion

Edge Detection Due to Edge enhancement Edge localization edge detection algorithms will benefit from using this nonlinear diffusion process rather than using linear diffusion (Gaussian convolution).

Energy Minimization and Markov Random Field Models The anisotropic diffusion algorithm minimizes some energy function. Smoothness conditional dependence on nearest neighbors (Markovian property)

Outline 1 Recap 2 Edge Enhancement 3 Experimental Results 4 The rest of the paper... 5 Anisotropic Diffusion Introduction

Introduction The problem with inhomogeneous diffusion Noise on edges will not be reduced. Even with the anisotropic implementation of Perona-Malik, noise on diagonal edges will not be handled properly.

Introduction The problem with inhomogeneous diffusion The inhomogeneous heat equation I t = div(c(x, y, t) I) only controls the magnitude of intensity (or heat) flow. The anisotropic heat equation I t = div(d(x, y, t) I), where D(x, y, t) is a matrix-valued function, can also control the direction of intensity (or heat) flow.

Introduction Next: Wednesday: Susan Lemieux will continue the MRI acquisition lecture. Friday: Weickert A review of nonlinear diffusion filtering. The physical laws of heat flow and diffusion. Anisotropic diffusion filtering.