Digital Image Processing: Sharpening Filtering in Spatial Domain CSC Biomedical Imaging and Analysis Dr. Kazunori Okada

Similar documents
Image Enhancement (Spatial Filtering 2)

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

Image preprocessing in spatial domain

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

Intensity Transformations and Spatial Filtering: WHICH ONE LOOKS BETTER? Intensity Transformations and Spatial Filtering: WHICH ONE LOOKS BETTER?

Lecture 7: Edge Detection

Templates, Image Pyramids, and Filter Banks

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

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

Basics on 2-D 2 D Random Signal

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

Digital Image Processing COSC 6380/4393

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

EDGES AND CONTOURS(1)

Lecture 8: Interest Point Detection. Saad J Bedros

Introduction to Computer Vision

Introduction to Computer Vision. 2D Linear Systems

ECE Digital Image Processing and Introduction to Computer Vision. Outline

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

Edge Detection in Computer Vision Systems

Gradient-domain image processing

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

Linear Operators and Fourier Transform

Subsampling and image pyramids

Roadmap. Introduction to image analysis (computer vision) Theory of edge detection. Applications

Fourier Transforms 1D

Computational Photography

Digital Image Processing COSC 6380/4393

Filtering and Edge Detection

Lecture 11: Vector Calculus I

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

CSC321 Lecture 20: Autoencoders

Pressure-velocity correction method Finite Volume solution of Navier-Stokes equations Exercise: Finish solving the Navier Stokes equations

Lecture 04 Image Filtering

Lecture Outline. Basics of Spatial Filtering Smoothing Spatial Filters. Sharpening Spatial Filters

The Laplacian ( ) Matthias Vestner Dr. Emanuele Rodolà Room , Informatik IX

Overview. Harris interest points. Comparing interest points (SSD, ZNCC, SIFT) Scale & affine invariant interest points

Edge Detection. Image Processing - Computer Vision

Image Filtering. Slides, adapted from. Steve Seitz and Rick Szeliski, U.Washington

A Riemannian Framework for Denoising Diffusion Tensor Images

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

ENERGY METHODS IN IMAGE PROCESSING WITH EDGE ENHANCEMENT

Colorado School of Mines Image and Multidimensional Signal Processing

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

Computer Vision Lecture 3

CSC321 Lecture 5: Multilayer Perceptrons

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

Local Enhancement. Local enhancement

CS 179: LECTURE 16 MODEL COMPLEXITY, REGULARIZATION, AND CONVOLUTIONAL NETS

Medical Image Analysis

Review of Power Series

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

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

Digital Image Processing ERRATA. Wilhelm Burger Mark J. Burge. An algorithmic introduction using Java. Second Edition. Springer

CS5540: Computational Techniques for Analyzing Clinical Data. Prof. Ramin Zabih (CS) Prof. Ashish Raj (Radiology)

Physics 351 Wednesday, January 10, 2018

SIFT: SCALE INVARIANT FEATURE TRANSFORM BY DAVID LOWE

Edge Detection. CS 650: Computer Vision

Math Lecture 4 Limit Laws

(Refer Slide Time: 0:35)

II. Unit Speed Curves

Math (P)Review Part II:

Lecture 3 Math & Probability Background

CS5670: Computer Vision

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

Face Recognition Using Laplacianfaces He et al. (IEEE Trans PAMI, 2005) presented by Hassan A. Kingravi

Today s lecture. Local neighbourhood processing. The convolution. Removing uncorrelated noise from an image The Fourier transform

Chapter 4: Filtering in the Frequency Domain. Fourier Analysis R. C. Gonzalez & R. E. Woods

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

CSC321 Lecture 15: Exploding and Vanishing Gradients

CS 188: Artificial Intelligence Spring Announcements

Computer Vision & Digital Image Processing. Periodicity of the Fourier transform

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi

Differentiation and Integration of Fourier Series

1.1. Fields Partial derivatives

Neural Networks 2. 2 Receptive fields and dealing with image inputs

CSC 411 Lecture 10: Neural Networks

### dv where ρ is density, R is distance from rotation axis, and dv is

Multimedia Databases. Previous Lecture. 4.1 Multiresolution Analysis. 4 Shape-based Features. 4.1 Multiresolution Analysis

Multimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig

Blob Detection CSC 767

MATH 333: Partial Differential Equations

1.4 Rewriting Equations

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

3.8 Combining Spatial Enhancement Methods 137

Image Filtering, Edges and Image Representation

Multimedia Databases. 4 Shape-based Features. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis

Computer Vision & Digital Image Processing

CS 188: Artificial Intelligence Spring Announcements

Edge Detection. Computer Vision P. Schrater Spring 2003

The Frequency Domain, without tears. Many slides borrowed from Steve Seitz

Physics 1A. Lecture 3B

Lecture 3: Linear Filters

Lecture 1. Scott Pauls 1 3/28/07. Dartmouth College. Math 23, Spring Scott Pauls. Administrivia. Today s material.

Affine and Perspective Warping (Geometric Transforms)

Numerical methods for the Navier- Stokes equations

CITS 4402 Computer Vision

Mathematical Problems in Image Processing

Morphological image processing

Lecture 7: Finding Features (part 2/2)

Transcription:

Homework Exercise Start project coding work according to the project plan Adjust project plans according to my comments (reply ilearn threads) New Exercise: Install VTK & FLTK. Find a simple hello world apps in VTK & FLTK. Then build/execute them. Send me snap shot of results by ilearnwithin one week for extra credits. Once you finish this. Work on connecting your ITK apps and VTK/FLTK. And incorporate it into your project work. SFSU: CSC61-81 Kazunori Okada 1 Digital Image Processing: Sharpening Filtering in Spatial Domain CSC61-81 Biomedical Imaging and Analysis Dr. Kazunori Okada Adopted from slides for DT8/4 Digital Image Processing by Dr. Brian Mac Nameeat Dublin Institute of Technology http://www.comp.dit.ie/bmacnamee/gaip.htm SFSU: CSC61-81 Kazunori Okada 1

Overview Last lecture Practical Foundation of Digital Image Processing I Spatial Domain Analysis Image Enhancement Point Processing: Intensity Transformations Neighbor Processing: Spatial Smoothing Filtering Today s lecture Practical Foundation of Digital Image Processing II Sharpening Filtering in Spatial Domain SFSU: CSC61-81 Kazunori Okada 3 Review: Purpose of Image Filtering The basic procedure for image processing for Improving image quality for human perception Extracting information for autonomous machine perception Manipulate images for Smoothing, Sharpening, Denoising, Restoration, Compression, Edge detection, Shape morphology Transform an image to another image SFSU: CSC61-81 Kazunori Okada 4

Review: Spatial Image Filtering: Process Origin Simple 3*3 Neighbourhood y Image f ( x e 3*3 Filter a b c d e f g h i Original Image Pixels * r s t u v w x y z Filter e processed = v*e + r*a + s*b + t*c + u*d + w*f + x*g + y*h + z*i The above is repeated for every pixel in the original image to generate the filtered image SFSU: CSC61-81 Kazunori Okada 5 Review: Spatial Image Filtering: Formula a b g ( = w( s, t) f( x+ s, y+ t) s= at= b Filtering can be given in equation form as shown above Notations are based on the image shown to the left SFSU: CSC61-81 Kazunori Okada 6 3

Image Enhancement by Sharpening Smoothing filters are used to remove fine details from the original images Sharpening spatial filters seek to highlight fine detail Remove blurring from images Highlight edges Sharpening filters are based on spatial differentiation SFSU: CSC61-81 Kazunori Okada 7 Spatial Differentiation Finding the derivativeof a function with respect to the spatial variable How function s output change as location changes Rate of change of a function Slope of a function SFSU: CSC61-81 Kazunori Okada 8 4

Order of Derivatives First derivative Speed: change of location Slope Gradient Divergence Second derivative Acceleration: change of speed Curvature Hessian Laplacian SFSU: CSC61-81 Kazunori Okada 9 Sharpening Filtering: Examples Images taken from Gonzalez & Woods, Digital Image Processing (00) Let s consider a simple 1 dimensional example A B SFSU: CSC61-81 Kazunori Okada 10 5

Spatial Differentiation: 1 st Derivative The discrete approximated formula for the 1 st derivative of a function f is as follows: f x = f( x+ 1) f( x) It s just the difference between subsequent values and measures the rate of change of the function High value at the location of changes SFSU: CSC61-81 Kazunori Okada 11 Example: 1 st Derivative Image Strip 8 7 6 5 4 3 1 0 5 5 4 3 1 0 0 0 6 0 0 0 0 1 3 1 0 0 0 0 7 7 7 7 1st Derivative 0-1-1-1-1-1 0 0 6-6 0 0 0 1 --1 0 0 0 7 0 0 0 8 6 4 0 - -4-6 -8 SFSU: CSC61-81 Kazunori Okada 1 6

Spatial Differentiation: nd Derivative The discrete approximated formula for the nd derivative of a function is as follows: f x = f( x+ 1) + f( x 1) f ( x) Takes into account the values both before and after the current value High value at the location of high curvature SFSU: CSC61-81 Kazunori Okada 13 Example: nd Derivative Image Strip 8 7 6 5 4 3 1 0 5 5 4 3 1 0 0 0 6 0 0 0 0 1 3 1 0 0 0 0 7 7 7 7-1 0 0 0 0 1 0 6-1 6nd 0Derivative 0 1 1-4 1 1 0 0 7-7 0 0 10 5 0-5 -10-15 SFSU: CSC61-81 Kazunori Okada 14 7

Derivative Image Filtering Given a N-D image (N =, 3 ) Construct a kby k filter derived from the spatial derivatives kvalue? Dimension (N): k by k by k by. Derivative order? Continuous to discrete? Perform filtering of the input image Convolution How to solve border problem? SFSU: CSC61-81 Kazunori Okada 15 1 st vs nd Derivatives for Enhancement The nd derivative is more useful for image enhancement than the 1 st derivative Stronger response to fine detail Simpler implementation We will come back to the 1 st order derivative later on The first sharpening filter we will look at is the Laplace filter Based on nd spatial derivative Look at a discrete implementation SFSU: CSC61-81 Kazunori Okada 16 8

Laplace Filter Concept One of the simplest sharpening filters Based on nd spatial derivative Isotropic Radially symmetric Concentric Circle Respond equality to any direction Sum to zero Useful for sharpening and edge detection Laplace sharpening Zero crossing edge detection (later) We will look at a discrete implementation SFSU: CSC61-81 Kazunori Okada 17 Laplace Filter Derivation The D Laplacian function is defined by: f = where the partial nd order derivative in the x direction is defined as follows: f x = and in the ydirection as follows: f y = f f( x+ 1, + f( y+ 1) + f = x f + y f( x 1, f( f( y 1) f( SFSU: CSC61-81 Kazunori Okada 18 9

Laplace Filter Cond. So, the D Laplacian can be given as follows: f = [ f( x+ 1, + f( x 1, + f( y+ 1) + f( y 1)] 4f( We can easily build a filter based on this 0 1 0 1-4 1 0 1 0 SFSU: CSC61-81 Kazunori Okada 19 Digital Laplace Filtering Using the Laplace filter 0 1 0 1-4 1 0 1 0 Perform the neighborhood transformation via image filtering SFSU: CSC61-81 Kazunori Okada 0 10

Laplace Filter Examples Applying the Laplacian to an image we get a new image that highlights edges and other discontinuities Original Image Laplacian Filtered Image Laplacian Filtered Image Scaled for Display SFSU: CSC61-81 Kazunori Okada 1 Examples of Laplace Filtering Retina SFSU: CSC61-81 Kazunori Okada 11

Issues for Laplace Filtering The result of a Laplace filtering is not an enhanced image (It indicates Curvature) We have to do more work in order to sharpen an image Subtract the Laplacian result from the original image to generate our final sharpened enhanced image g( = f( f Laplacian Filtered Image Scaled for Display SFSU: CSC61-81 Kazunori Okada 3 Image Enhancement by Laplace Filtering - = Original Image Laplacian Filtered Image Sharpened Image In the final sharpened image edges and fine detail are much more obvious SFSU: CSC61-81 Kazunori Okada 4 1

Laplace Enhancement SFSU: CSC61-81 Kazunori Okada 5 Integrating Steps into Single Filter The entire enhancement can be combined into a single filtering operation g( = f( f = f( [ f( x+ 1, + f( x 1, + f( y+ 1) + f( y 1) 4f( ] = 5f( f( x+ 1, f( x 1, f( y+ 1) f( y 1) SFSU: CSC61-81 Kazunori Okada 6 13

Digital Laplace Sharpening This gives us a new filter which does the whole job for us in one step 0-1 0-1 5-1 0-1 0 SFSU: CSC61-81 Kazunori Okada 7 Example of Laplace Sharpening 1 SFSU: CSC61-81 Kazunori Okada 8 14

Example of Laplace Sharpening SFSU: CSC61-81 Kazunori Okada 9 Variants (Due to Discretization) There are lots of slightly different versions of the Laplacian that can be used: 0 1 0 1-4 1 0 1 0 Simple Laplacian 1 1 1 1-8 1 1 1 1 Variant of Laplacian -1-1 -1-1 9-1 -1-1 -1 SFSU: CSC61-81 Kazunori Okada 30 15

Summary Practical Foundation of Digital Image Processing II Sharpening Filtering in Spatial Domain Next Week: Practical Foundation of Digital Image Processing III Sharpening Filtering in Spatial Domain cond Edge Detection in Spatial Domain Filter Combination Multiple-Image Operation Frequency Domain Techniques Homework Exercise/Project: VTK, FLTK Extra credit by submitting hello world! Start project coding work according to the project plan Adjust project plans according to my comments (reply ilearn threads) SFSU: CSC61-81 Kazunori Okada 31 16