Edge Detection using Laplacian of Gaussian Edge detection is a fundamental tool in image processing and computer vision. It identifies points in a digital.

Slides:



Advertisements
Similar presentations
Logical Operations on Images Boolean logic is a system of logical operations defined by George Boole in the mid 19th century to apply algebraic operations.
Advertisements

3-D Computer Vision CSc83020 / Ioannis Stamos  Revisit filtering (Gaussian and Median)  Introduction to edge detection 3-D Computater Vision CSc
High Boost filtering In image processing, it is often desirable to emphasize high frequency components representing the image details without eliminating.
Digital Image Processing
Digital Image Processing In The Name Of God Digital Image Processing Lecture3: Image enhancement M. Ghelich Oghli By: M. Ghelich Oghli
Digital Image Processing
1 Image Filtering Readings: Ch 5: 5.4, 5.5, 5.6,5.7.3, 5.8 (This lecture does not follow the book.) Images by Pawan SinhaPawan Sinha formal terminology.
The Segmentation Problem
Gholamreza Anbarjafari, PhD Video Lecturers on Digital Image Processing Digital Image Processing Spatial Domain Filtering: Part II.
Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,
SDS-PAGE gel analysis SDS-PAGE analysis is done to study the expression of a protein from the control and the sample, to detect the molecular weight of.
Syndrome Decoding of Linear Block Code
Spring 2012Meetings 5 and 6, 7:20PM-10PM Image Processing with Applications-CSCI567/MATH563/MATH489 Lectures 8, 9, 10,11: Spatial Filtering 8. Linear Filters,
Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.
Document that explains the chosen concept to the animator.
Segmental Mobility – Region of Viscoelasticity  Related LOs: > Prior Viewing – Single Chain Conformation-Ideal Chain > Future Viewing – Unit cells in.
Introduction to Image Processing Grass Sky Tree ? ? Sharpening Spatial Filters.
Introduction to Image Processing
Image Processing is replacing Original Pixels by new Pixels using a Transform rst uvw xyz Origin x y Image f (x, y) e processed = v *e + r *a + s *b +
Digital Image Processing CSC331 Image Enhancement 1.
Image processing Fourth lecture Image Restoration Image Restoration: Image restoration methods are used to improve the appearance of an image.
Driving force for solidification This Learning object ‏ will introduce the concept of undercooling and driving force for phase transformations Subject:
Digtial Image Processing, Spring ECES 682 Digital Image Processing Oleh Tretiak ECE Department Drexel University.
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Logic Gates Part – III : Combinational Logic Gates Combinational Logic Circuits are made up from basic logic NAND, NOR or NOT gates that are "combined"
Intelligent Vision Systems ENT 496 Image Filtering and Enhancement Hema C.R. Lecture 4.
CSE 6367 Computer Vision Image Operations and Filtering “You cannot teach a man anything, you can only help him find it within himself.” ― Galileo GalileiGalileo.
Line Coding Schemes ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal. Authors Phani Swathi Chitta Mentor Prof.
Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
CSMA/CA Simulation  Course Name: Networking Level(UG/PG): UG  Author(s) : Amitendu Panja, Veedhi Desai  Mentor: Aruna Adil *The contents in this ppt.
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Gaussian Smoothing Gaussian Smoothing is the result of blurring an image by a Gaussian function. It is also known as Gaussian blur.  Course Name: Digital.
Gholamreza Anbarjafari, PhD Video Lecturers on Digital Image Processing Digital Image Processing Spatial Domain Filtering: Part I.
Image Filtering with GLSL DI1.03 蔡依儒. Outline Convolution Convolution Convolution implementation using GLSL Convolution implementation using GLSL Commonly.
Digital Image Processing
Digital Image Processing Week V Thurdsak LEAUHATONG.
Dr. J. Shanbehzadeh M.HosseinKord Science and Research Branch of Islamic Azad University Machine Vision 1/49 slides.
Lecture Seven Figures from Gonzales and Woods, Digital Image Processing, Copyright 2002.
CSMA/CD Simulation Carrier Sense Multiple Access (CSMA), although more efficient than ALOHA or slotted ALOHA, still has one glaring inefficiency: When.
Linear Search Linear Search is a fundamental search algorithm. Linear search, also known as sequential search, is a process that checks every element in.
Median Filtering In signal processing, it is often desirable to be able to perform some kind of noise reduction on an image or signal. The median filter.
Go-Back-N ARQ (Sliding Window Protocol) Go-Back-N is an instance of the Automatic Repeat-request (ARQ) Protocol, in which the sending process continues.
Document that explains the chosen concept to the animator 1.
Process Scheduling In multiprogramming systems, when there is more than one ready process, the operating system must decide which one to activate. The.
Image Enhancement in the Spatial Domain.
Document that explains the chosen concept to the animator
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering Northern Arizona University.
Digital Image Processing CSC331
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
ECE 692 – Advanced Topics in Computer Vision
Spatial Filtering - Enhancement
Digital Image Processing
9th Lecture - Image Filters
Digital Image Processing
Prof. Saravanan Vijayakumaran
Dilation The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.
Closing One of the important morphological operations applied to either grayscale or binary images is Closing. It is derived from the fundamental operations.
Erosion The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.
Virtual Memory Virtual memory is a technique which gives an application program the impression that it has contiguous working memory, while in fact it.
Binary Search A binary search algorithm finds the position of a specified value within a sorted array. Binary search is a technique for searching an ordered.
Sorted Linked List A linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains.
Prof. Saravanan Vijayakumaran
Discrete Convolution of Two Signals
Continuous Time Convolution
Party Problem The simplest example of Ramsey theory. It is also known as the ‘Maximum Clique Problem’. A clique of a graph is a complete sub graph of the.
Opening One of the important morphological operations applied to either grayscale or binary images is Opening. It is derived from the fundamental operations.
Image Sharpening using Laplacian
Presentation transcript:

Edge Detection using Laplacian of Gaussian Edge detection is a fundamental tool in image processing and computer vision. It identifies points in a digital image at which the image brightness changes sharply or has discontinuities. Laplacian of Gaussian is used to filter noise before edge detection. This method combines Gaussian filtering with the Laplacian for edge detection.  Course Name: Digital Image Processing Level(UG/PG): UG  Author(s) : Phani Swathi Chitta  Mentor: Prof. Saravanan Vijayakumaran *The contents in this ppt are licensed under Creative Commons Attribution-NonCommercial-ShareAlike 2.5 India license

Learning Objectives After interacting with this Learning Object, the learner will be able to: Explain the method of edge detection using Laplacian of Gaussian (LoG) filter

Definitions of the components/Keywords: In Laplacian of Gaussian edge detection there are mainly three steps: - Filtering - Enhancement - Detection Laplacian is a measure of the second spatial derivative of an image Very useful in detecting abrupt changes In edge detection, Gaussian smoothing is done prior to Laplacian to remove the effect of noise. The operations are linear and can be interchanged Gaussian smoothing is a special case of weighted smoothing, where the coefficients of the smoothing kernel are derived from a Gaussian distribution.

Definitions of the components/Keywords: The 2-D Laplacian of Gaussian (LoG) function centered on zero and with Gaussian standard deviation has the form: where σ is the standard deviation The amount of smoothing can be controlled by varying the value of the standard deviation.

Master Layout Give a slider to select any one value of sigma. Image after edge detection Original Image

Step 1: Thresh =0.1,Sigma =1.0 I nstruction for the animator T ext to be displayed in the working area (DT) The first fig. should appear and then when the slider points at 0.5, the second fig. should be shown The text in DT should appear in parallel to the figures The original image The resulting image after Gaussian smoothing is done The filter mask used for smoothing is of size 3x3

Step 2: Thresh = 0.1, Sigma 0.05 I nstruction for the animator T ext to be displayed in the working area (DT) The first fig. should appear and then when the slider points at 0.8, the second fig. should be shown The text in DT should appear in parallel to the figures The original image The resulting image after Gaussian smoothing is done The filter mask used for smoothing is of size 3x3

Step 3: Thresh = 0.1, Sigma 0.5 I nstruction for the animator T ext to be displayed in the working area (DT) The first fig. should appear and then when the slider points at 1, the second fig. should be shown The text in DT should appear in parallel to the figures The original image The resulting image after Gaussian smoothing is done The filter mask used for smoothing is of size 3x3

Step 4: Thresh = 0.1, Sigma 0.8 I nstruction for the animator T ext to be displayed in the working area (DT) The first fig. should appear and then when the slider points at 3, the second fig. should be shown The text in DT should appear in parallel to the figures The original image The resulting image after Gaussian smoothing is done The filter mask used for smoothing is of size 3x3

Step 5: Thresh = 0.5, Sigma 0.5 I nstruction for the animator T ext to be displayed in the working area (DT) The first fig. should appear and then when the slider points at 5, the second fig. should be shown The text in DT should appear in parallel to the figures The original image The resulting image after Gaussian smoothing is done The filter mask used for smoothing is of size 3x3

Step 6: Thresh = 0.5, Sigma 0.8 I nstruction for the animator T ext to be displayed in the working area (DT) The first fig. should appear and then when the slider points at 8, the second fig. should be shown The text in DT should appear in parallel to the figures The original image The resulting image after Gaussian smoothing is done The filter mask used for smoothing is of size 3x3

Step 7: Thresh = 0.01, Sigma 0.5 I nstruction for the animator T ext to be displayed in the working area (DT) The first fig. should appear and then when the slider points at 10, the second fig. should be shown The text in DT should appear in parallel to the figures The original image The resulting image after Gaussian smoothing is done The filter mask used for smoothing is of size 3x3

Step 8: Thresh = 0.01, Sigma 0.8 I nstruction for the animator T ext to be displayed in the working area (DT) The first fig. should appear and then when the slider points at 10, the second fig. should be shown The text in DT should appear in parallel to the figures The original image The resulting image after Gaussian smoothing is done The filter mask used for smoothing is of size 3x3

Introduction Credits 14 Definitions Test your understanding (questionnaire) ‏ Lets Sum up (summary) ‏ Want to know more… (Further Reading) ‏ Try it yourself Interactivity: Analogy Slide 1 Slide 3 Slide 23, 24,25 Slide 26 Electrical Engineering  Select any one of the figures a b c d  Select the value of sigma

Questionnaire 1.If and are the two threshold values and then which threshold value gives more edges? Answers: a) b)

Questionnaire 2. What is the resulting image if proper threshold is applied to the given image ? Answers: a) b)

Questionnaire 2. What is the resulting image if proper threshold is applied to the given image ? Answers: c) d)None

Links for further reading Reference websites: password /nadernejadAMS pdf Books: Digital Image Processing – Rafael C. Gonzalez, Richard E. Woods, Third edition, Prentice Hall