Patricia van Marlen April 12, 2018

Slides:



Advertisements
Similar presentations
Extrapolation and iteration for the problem of LFOV Dr. Shuangren Zhao Research Associate Radiation Physics Department Princess Margaret Hospital.
Advertisements

Ter Haar Romeny, FEV Geometry-driven diffusion: nonlinear scale-space – adaptive scale-space.
Arc-length computation and arc-length parameterization
Optimizing and Learning for Super-resolution
Edge Preserving Image Restoration using L1 norm
3-D Computer Vision CSc83020 / Ioannis Stamos  Revisit filtering (Gaussian and Median)  Introduction to edge detection 3-D Computater Vision CSc
Level set based Image Segmentation Hang Xiao Jan12, 2013.
R. DOSIL, X. M. PARDO, A. MOSQUERA, D. CABELLO Grupo de Visión Artificial Departamento de Electrónica e Computación Universidade de Santiago de Compostela.
Solving Linear Programming Problems: The Simplex Method
Ter Haar Romeny, Computer Vision 2014 Geometry-driven diffusion: nonlinear scale-space – adaptive scale-space.
PARTICLE SWARM OPTIMISATION (PSO) Perry Brown Alexander Mathews Image:
Contour evolution scheme for variational image segmentation and smoothing S. Mahmoodi and B.S. Sharif.
ECCV 2002 Removing Shadows From Images G. D. Finlayson 1, S.D. Hordley 1 & M.S. Drew 2 1 School of Information Systems, University of East Anglia, UK 2.
Content Based Image Retrieval
Active Calibration of Cameras: Theory and Implementation Anup Basu Sung Huh CPSC 643 Individual Presentation II March 4 th,
Diffusion Filters S. Derin Babacan Department of Electrical and Computer Engineering Northwestern University March 7, 2006 ECE 463 Term Project.
Classification with reject option in gene expression data Blaise Hanczar and Edward R Dougherty BIOINFORMATICS Vol. 24 no , pages
Chapter 10 Image Segmentation.
CS443: Digital Imaging and Multimedia Filters Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University Spring 2008 Ahmed Elgammal Dept.
Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.
Algorithms for Noise Removal and the Bilateral Filter Michael Elad Scientific Computing and Computational Mathematics (SCCM) Program Stanford University.
MSc project Janneke Ansems Intensity and Feature Based 3D Rigid Registration of Pre- and Intra-Operative MR Brain Scans Committee: Prof. dr.
EE565 Advanced Image Processing Copyright Xin Li Different Frameworks for Image Processing Statistical/Stochastic Models: Wiener’s MMSE estimation.
Computational Photography: Image Processing Jinxiang Chai.
Geometry-driven Diffusion.
Despeckle Filtering in Medical Ultrasound Imaging
Rician Noise Removal in Diffusion Tensor MRI
Advanced Image Processing Image Relaxation – Restoration and Feature Extraction 02/02/10.
Motivation from Real-World Applications EE565 Advanced Image Processing Copyright Xin Li Noisy Photos Noisy ultrasound data.
Chapter 2. Image Analysis. Image Analysis Domains Frequency Domain Spatial Domain.
Chapter 10: Image Segmentation
University of Kurdistan Digital Image Processing (DIP) Lecturer: Kaveh Mollazade, Ph.D. Department of Biosystems Engineering, Faculty of Agriculture,
Edges. Edge detection schemes can be grouped in three classes: –Gradient operators: Robert, Sobel, Prewitt, and Laplacian (3x3 and 5x5 masks) –Surface.
EDGE DETECTION IN COMPUTER VISION SYSTEMS PRESENTATION BY : ATUL CHOPRA JUNE EE-6358 COMPUTER VISION UNIVERSITY OF TEXAS AT ARLINGTON.
Anisotropic Diffusion Summing of the article “scale-space and edge detection using anisotropic diffusion” By Pietro Perona And Jitendra Malik Nerya Agam.
G52IVG, School of Computer Science, University of Nottingham 1 Edge Detection and Image Segmentation.
BARCODE IDENTIFICATION BY USING WAVELET BASED ENERGY Soundararajan Ezekiel, Gary Greenwood, David Pazzaglia Computer Science Department Indiana University.
Introduction to Level Set Methods: Part II
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
1 Markov random field: A brief introduction (2) Tzu-Cheng Jen Institute of Electronics, NCTU
3.7 Adaptive filtering Joonas Vanninen Antonio Palomino Alarcos.
Filtering Objective –improve SNR and CNR Challenges – blurs object boundaries and smears out important structures.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
Scale-Space and Edge Detection Using Anisotropic Diffusion Presented By:Deepika Madupu Reference: Pietro Perona & Jitendra Malik.
Instructor: Mircea Nicolescu Lecture 7
Performance Measurement of Image Processing Algorithms By Dr. Rajeev Srivastava ITBHU, Varanasi.
Detection of nerves in Ultrasound Images using edge detection techniques NIRANJAN TALLAPALLY.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
Using Neumann Series to Solve Inverse Problems in Imaging Christopher Kumar Anand.
Level Set Segmentation ~ 9.37 Ki-Chang Kwak.
A New Approach of Anisotropic Diffusion: Medical Image Application Valencia 18th-19th 2010 Y. TOUFIQUE*, L.MASMOUDI*, R.CHERKAOUI EL MOURSLI*, M. CHERKAOUI.
Digital Image Processing (DIP)
Digital Image Processing
PDE Methods for Image Restoration
Normal Distribution.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Digital Image Processing Lecture 10: Image Restoration
Image Segmentation.
Energy Preserving Non-linear Filters
Assessing the quality of spot welding electrode’s tip using digital image processing techniques A .A. Abdulhadi Coherent and Electro-Optics Research Group.
Detecting Artifacts and Textures in Wavelet Coded Images
Historic Document Image De-Noising using Principal Component Analysis (PCA) and Local Pixel Grouping (LPG) Han-Yang Tang1, Azah Kamilah Muda1, Yun-Huoy.
Image gradients and edges April 11th, 2017
Image Segmentation Image analysis: First step:
Digital Image Processing
Non-local Means Filtering
Linear Operations Using Masks
All about convolution.
Outline Sparse Reconstruction RIP Condition
Presentation transcript:

Patricia van Marlen April 12, 2018 Linear and anisotropic diffusion in image processing: A study on implementation, parameters and segmentation Patricia van Marlen April 12, 2018

Outline Introduction Part 1: diffusion filtering methods numerical schemes results: methods and schemes Part 2: time step Δt: theory and results stopping time S: theory and results Part 3: results: segmentation Conclusion and further research

Introduction LUMC/TUD MRI project: MRI scanner for developing countries

Introduction LUMC/TUD MRI project: MRI scanner for developing countries Advantages: affordable

Introduction LUMC/TUD MRI project: MRI scanner for developing countries Advantages: affordable transportable

Introduction LUMC/TUD MRI project: MRI scanner for developing countries Advantages: affordable transportable always ready for use no cooling necessary

Introduction LUMC/TUD MRI project: MRI scanner for developing countries Advantages: affordable transportable always ready for use no cooling necessary Disadvantage: low SNR: noise in the images

Introduction LUMC/TUD MRI project: MRI scanner for developing countries Advantages: affordable transportable always ready for use no cooling necessary Disadvantage: low SNR: noise in the images Noise removal: diffusion filtering methods

Diffusion filtering methods: linear diffusion Diffusion equation D is the diffusion coefficient u is gray value Neumann boundary conditions:

Diffusion filtering methods: linear diffusion Diffusion equation D is the diffusion coefficient u is gray value Neumann boundary conditions: D=1, leads to the heat equation Disadvantage: space-invariant blurring

Diffusion filtering methods: anisotropic diffusion Diffusion equation D is the diffusion coefficient u is gray value Neumann boundary conditions:

Diffusion filtering methods: anisotropic diffusion Diffusion equation D is the diffusion coefficient u is gray value Neumann boundary conditions: D=c(| u|), leads to

Diffusion filtering methods: Anisotropic diffusion Intraregional blurring: Within a region, u is small So: if u is small, we need c(| u|) to be high Edge preservation: Close to a boundary, u is large So: if u is large, we need c (| u|) to be close to zero

Diffusion filtering methods: Anisotropic diffusion Well-posed method:

Diffusion filtering methods: Anisotropic diffusion Well-posed method: Ill-posed method:

Diffusion filtering methods: Anisotropic diffusion Well-posed method: Ill-posed method: Fulfill the threshold property: Perona-Malik 1: Perona-Malik e:

Numerical schemes: Forward Time, Central Space (FTCS) Time-derivative: Euler forward Space-derivatives: central difference Accuracy: O(Δt)+O(Δx2) Set Δx=Δy=1

Numerical schemes: Forward Time, Central Space (FTCS) Linear diffusion filtering

Numerical schemes: Forward Time, Central Space (FTCS) Linear diffusion filtering Anisotropic diffusion filtering

Numerical schemes: Forward Time, Central Space (FTCS) Linear diffusion filtering Anisotropic diffusion filtering Addition of Gaussian kernel:

Numerical schemes: Forward Time, Central Space (FTCS) Linear diffusion filtering Anisotropic diffusion filtering with Gaussian kernel Addition of Gaussian kernel:

Numerical schemes: Additive Operator Splitting (AOS) The AOS scheme in 2D

Numerical schemes: Additive Operator Splitting (AOS) The AOS scheme in 2D We have two dimensions, so Ax and Ay

Numerical schemes: Additive Operator Splitting (AOS) The AOS scheme in 2D We have two dimensions, so Ax and Ay Figure 2: a) original numbering b) transposed numbering

Results: methods and schemes Test problem: Gaussian noise with mean 0 and SD 0.06 Figure 3: test problem with and without noise

Results: methods and schemes Test problem: Gaussian noise with mean 0 and SD 0.06 Difference measure is the SD of the noise in the image: Figure 3: test problem with and without noise

Results: methods and schemes FTCS scheme standard deviation δ Perona-Malik 1 0.0592 Perona-Malik e Perona-Malik 1 with GK 0.0594 Perona-Malik e with GK Well-posed method 0.0595 Ill-posed method Heat equation 0.0597 Table 1: results of the diffusion filtering methods for FTCS scheme

Results: methods and schemes FTCS scheme standard deviation δ Perona-Malik 1 0.0592 Perona-Malik e Perona-Malik 1 with GK 0.0594 Perona-Malik e with GK Well-posed method 0.0595 Ill-posed method Heat equation 0.0597 Table 1: results of the diffusion filtering methods for FTCS scheme Figure 4: best result of Perona-Malik 1

Results: methods and schemes FTCS scheme standard deviation δ Perona-Malik 1 0.0592 Perona-Malik e Perona-Malik 1 with GK 0.0594 Perona-Malik e with GK Well-posed method 0.0595 Ill-posed method Heat equation 0.0597 Table 1: results of the diffusion filtering methods for FTCS scheme Figure 5: unstable result of well-posed method

Results: methods and schemes AOS scheme standard deviation δ Perona-Malik 1 with GK 0.0590 Perona-Malik e Perona-Malik 1 0.0592 Well-posed method 0.0593 Perona-Malik e with GK 0.0596 Ill-posed method Table 2: results of the diffusion filtering methods for AOS scheme

Results: methods and schemes AOS scheme standard deviation δ Perona-Malik 1 with GK 0.0590 Perona-Malik e Perona-Malik 1 0.0592 Well-posed method 0.0593 Perona-Malik e with GK 0.0596 Ill-posed method Table 2: results of the diffusion filtering methods for AOS scheme Figure 6: best result of Perona-Malik 1 with GK

Results: methods and schemes conclusions the AOS scheme gave slightly better results, but due to calculation time FTCS is used for the following parts

Results: methods and schemes conclusions the AOS scheme gave slightly better results, but due to calculation time FTCS is used for the following parts Perona-Malik 1 seems the best method and is also chosen for following parts, it is given by:

Results: methods and schemes conclusions the AOS scheme gave slightly better results, but due to calculation time FTCS is used for the following parts Perona-Malik 1 seems the best method and is also chosen for following parts, it is given by: the well-posed and ill-posed method showed instability for FTCS scheme, but were stable for AOS scheme

Results: methods and schemes conclusions the AOS scheme gave slightly better results, but due to calculation time FTCS is used for the following parts Perona-Malik 1 seems the best method and is also chosen for following parts, it is given by: the well-posed and ill-posed method showed instability for FTCS scheme, but were stable for AOS scheme parameter choice has a big influence on the outcomes

Parameter study Investigation of parameter K, used in the Perona-Malik functions time step size Δt number of time steps T

Parameter study Investigation of parameter K, used in the Perona-Malik functions time step size Δt number of time steps T

Parameter study time step size Δt So far Δt was constant Adaptive time step for Perona-Malik methods with α=4, a=0.25 and b=0.75

Parameter study time step size Δt So far Δt was constant Adaptive time step for Perona-Malik methods with α=4, a=0.25 and b=0.75 Initial iterations (large uchange ): Δt ~ 0.0625 Later iterations (small uchange ): Δt ~ 0.25 So: an increasing function

Parameter study time step size Δt Initial iterations: Δt ~ 0.25 Later iterations: Δt ~ 0 So: a decreasing function Figure 7: Optimal time step for Perona-Malik 1

Parameter study time step size Δt Adaptive time step for Perona-Malik methods with α=4, a=0.25 and b=0.75 Initial iterations: Δt ~ 0.0625 Later iterations: Δt ~ 0.25 So: an increasing function

Parameter study time step size Δt Adaptive time step for Perona-Malik methods with α=4, a=1 and b=1 Initial iterations: Δt ~ 0.25 Later iterations: Δt ~ 0 So: a decreasing function

Results: parameters time step size Δt Behaviour of Blue: optimal Δt Red: original method Green: modified method Figure 8: behaviour of various time steps

Results: parameters time step size Δt Figure 9: results for K=0.05 Figure 8: behaviour of various time steps

Results: parameters time step size Δt Figure 9: results for K=0.05 Figure 8: behaviour of various time steps Figure 10: results for K=0.5

Parameter study time step size Δt Adaptive time step for well-posed and ill-posed method if with 0<q<1

Parameter study time step size Δt Adaptive time step for well-posed and ill-posed method if with 0<q<1 Method is based on constant total pixel value (TPV), if TPV starts to increase the time step is reduced

Results: parameters time step size Δt Adaptive time step for well-posed and ill-posed method if with 0<q<1 Figure 11: results for adaptive time step for various q

Parameter study stopping time S Optimal stopping time: number of time steps at which the image is at its best and the diffusion should stop

Parameter study stopping time S Optimal stopping time: number of time steps at which the image is at its best and the diffusion should stop Correlation stopping time

Parameter study stopping time S Optimal stopping time: number of time steps at which the image is at its best and the diffusion should stop Correlation stopping time λ-stopping time

Parameter study stopping time S Optimal stopping time: number of time steps at which the image is at its best and the diffusion should stop Correlation stopping time λ-stopping time

Results: parameters stopping time S Scorr Svisual 0.01 841 631 850 0.05 168 126 180 0.1 84 63 90 0.2 41 31 45 Table 3: results for Shepp-Logan, K=0.05 Δt Sλ Scorr Svisual 0.01 31 41 70 0.05 6 8 15 0.1 3 4 7 0.2 2 5 Table 4: results for Ella, K=0.05

Results: parameters stopping time S Correlation stopping time λ-stopping time New stopping time Snew

Results: parameters stopping time S Scorr Svisual Snew 0.01 841 631 850 0.05 168 126 180 0.1 84 63 90 80 0.2 41 31 45 Table 5: results for Shepp-Logan, K=0.05 Δt Sλ Scorr Svisual Snew 0.01 31 41 70 0.05 6 8 15 0.1 3 4 7 0.2 2 5 Table 6: results for Ella, K=0.05

Results: parameters stopping time S Scorr Svisual Snew 0.01 841 631 850 0.05 168 126 180 0.1 84 63 90 80 0.2 41 31 45 Table 5: results for Shepp-Logan, K=0.05 Δt Sλ Scorr Svisual Snew 0.01 31 41 70 0.05 6 8 15 0.1 3 4 7 0.2 2 5 Table 6: results for Ella, K=0.05

Results: parameters stopping time S Figure 12: results when using stopping time Snew

Segmentation Segmentation partitions an image into several regions, useful to identify structures Segmentation method: region growing algorithm Segmentation is not possible on noisy images, the irregularities would lead to incorrect regions

Results: segmentation Figure 13: segmentation of a) noiseless Shepp-Logan b) filtered Shepp-Logan

Results: segmentation Figure 14: segmentation of a) noiseless Ella b) filtered Ella

Conclusions Methods and numerical schemes Perona-Malik 1 seems to give the best results AOS had slightly better results, but its calculation time was also a little higher Parameter study introduced time step and stopping time lead to good results well-posed and ill-posed method were unstable for FTCS scheme, this can be overcome with an adaptive time step Segmentation segmentation showed that images obtained with anisotropic diffusion filtering are of good quality

Conclusions Methods and numerical schemes Perona-Malik 1 seems to give the best results AOS had slightly better results, but its calculation time was also a little higher Parameter study introduced time step and stopping time lead to good results well-posed and ill-posed method were unstable for FTCS scheme, this can be overcome with an adaptive time step Segmentation segmentation showed that images obtained with anisotropic diffusion filtering are of good quality

Conclusions Methods and numerical schemes Perona-Malik 1 seems to give the best results AOS had slightly better results, but its calculation time was also a little higher Parameter study introduced time step and stopping time lead to good results well-posed and ill-posed method were unstable for FTCS scheme, this can be overcome with an adaptive time step Segmentation segmentation showed that images obtained with anisotropic diffusion filtering are of good quality

Further research further investigation of parameters

Further research further investigation of parameters improve the calculation time of the AOS method

Further research further investigation of parameters improve the calculation time of the AOS method test methods on real data

Questions?

Figure 15: best result for Perona-Malik 1 with GK, FTCS scheme Figure 16: best result for Perona-Malik 1, AOS scheme

Figure 17: segmentation of normal brain image

Figure 18: segmentation of hydrocephalus image