Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering

Slides:



Advertisements
Similar presentations
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Advertisements

Spatial Filtering (Chapter 3)
Topic 6 - Image Filtering - I DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Regional Processing Convolutional filters. Smoothing  Convolution can be used to achieve a variety of effects depending on the kernel.  Smoothing, or.
EDGE DETECTION ARCHANA IYER AADHAR AUTHENTICATION.
Instructor: Mircea Nicolescu Lecture 6 CS 485 / 685 Computer Vision.
October 2, 2014Computer Vision Lecture 8: Edge Detection I 1 Edge Detection.
Sliding Window Filters and Edge Detection Longin Jan Latecki Computer Graphics and Image Processing CIS 601 – Fall 2004.
EDGE DETECTION.
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
EE663 Image Processing Edge Detection 1
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Lecture 4 Edge Detection
Edge detection. Edge Detection in Images Finding the contour of objects in a scene.
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
CSCE 641 Computer Graphics: Image Filtering & Feature Detection Jinxiang Chai.
MSU CSE 803 Stockman Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute.
Canny Edge Detector1 1)Smooth image with a Gaussian optimizes the trade-off between noise filtering and edge localization 2)Compute the Gradient magnitude.
Segmentation (Section 10.2)
Introduction to Computer Vision CS / ECE 181B Thursday, April 22, 2004  Edge detection (HO #5)  HW#3 due, next week  No office hours today.
EE663 Image Processing Edge Detection 3 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Lecture 2: Image filtering
Lecture 4: Edge Based Vision Dr Carole Twining Thursday 18th March 2:00pm – 2:50pm.
Edge Detection Today’s readings Cipolla and Gee –supplemental: Forsyth, chapter 9Forsyth Watt, From Sandlot ScienceSandlot Science.
MSU CSE 803 Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute some result.
Computational Photography: Image Processing Jinxiang Chai.
Edge Detection Hao Huy Tran Computer Graphics and Image Processing CIS 581 – Fall 2002 Professor: Dr. Longin Jan Latecki.
Chapter 2. Image Analysis. Image Analysis Domains Frequency Domain Spatial Domain.
Spatial-based Enhancements Lecture 3 prepared by R. Lathrop 10/99 updated 10/03 ERDAS Field Guide 6th Ed. Ch 5: ;
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
Introduction to Image Processing Grass Sky Tree ? ? Sharpening Spatial Filters.
Edge Detection Today’s reading Cipolla & Gee on edge detection (available online)Cipolla & Gee on edge detection Szeliski, Ch 4.1.2, From Sandlot.
Chapter 10, Part I.  Segmentation subdivides an image into its constituent regions or objects.  Image segmentation methods are generally based on two.
CS654: Digital Image Analysis Lecture 24: Introduction to Image Segmentation: Edge Detection Slide credits: Derek Hoiem, Lana Lazebnik, Steve Seitz, David.
CSE 185 Introduction to Computer Vision Edges. Scale space Reading: Chapter 3 of S.
EE 4780 Edge Detection.
Many slides from Steve Seitz and Larry Zitnick
October 7, 2014Computer Vision Lecture 9: Edge Detection II 1 Laplacian Filters Idea: Smooth the image, Smooth the image, compute the second derivative.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Edge Detection and Geometric Primitive Extraction Jinxiang Chai.
Brent M. Dingle, Ph.D Game Design and Development Program Mathematics, Statistics and Computer Science University of Wisconsin - Stout Edge Detection.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP7 Spatial Filters Miguel Tavares Coimbra.
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.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
EDGE DETECTION Instructor: Dr. Engr. Junaid Zafar.
Course 5 Edge Detection. Image Features: local, meaningful, detectable parts of an image. edge corner texture … Edges: Edges points, or simply edges,
Lecture 04 Edge Detection Lecture 04 Edge Detection Mata kuliah: T Computer Vision Tahun: 2010.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Computer Vision Image Features Instructor: Dr. Sherif Sami Lecture 4.
Instructor: Mircea Nicolescu Lecture 7
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Digital Image Processing CSC331
Image Features (I) Dr. Chang Shu COMP 4900C Winter 2008.
September 26, 2013Computer Vision Lecture 8: Edge Detection II 1Gradient In the one-dimensional case, a step edge corresponds to a local peak in the first.
Sliding Window Filters Longin Jan Latecki October 9, 2002.
1 Edge Operators a kind of filtering that leads to useful features.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Miguel Tavares Coimbra
Edge Detection slides taken and adapted from public websites:
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering Northern Arizona University.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Image Pre-Processing in the Spatial and Frequent Domain
Jeremy Bolton, PhD Assistant Teaching Professor
Computer Vision Lecture 9: Edge Detection II
Dr. Chang Shu COMP 4900C Winter 2008
a kind of filtering that leads to useful features
a kind of filtering that leads to useful features
Linear Operations Using Masks
CS 565 Computer Vision Nazar Khan Lecture 9.
Presentation transcript:

Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering Northern Arizona University

Some Important Topics in Image Processing Contrast enhancement Filtering (both spatial and frequency domains) Restoration Segmentation Image Compression etc. EE 460/560 course, Fall 2003 (formerly CSE 432/532) Edge Detection uses spatial filtering to extract important information from a scene.

Types of Edges Physical Edges Image Edges Different objects in physical contact Spatial change in material properties Abrupt change in surface orientation Image Edges In general: Boundary between contrasting regions in image Specifically: Abrupt local change in brightness Image edges are important clues for identifying and interpreting physical edges in the scene.

Goal: Produce an Edge Map Original Image Edge Map

Edge Detection Concepts in 1-D Edges can be characterized as either: local extrema of zero-crossings of

Continuous Gradient But is a vector. We really need a scalar that gives a measure of edge “strength.” This is the gradient magnitude. It’s isotropic.

Classification of Points Let points that satisfy be edge points. PROBLEM: T Non-zero edge width Stronger gradient magnitudes produce thicker edges. To precisely locate the edge, we need to thin. Ideally, edges should be only one point thick.

Practical Gradient Algorithm Compute for all points. Threshold to produce candidate edge points. Thin by testing whether each candidate edge point is a local maximum of along the direction of . Local maxima are classified as edge points.

Cameraman image Thresholded Gradient Thresholded and Thinned

Directional Edge Detection Horizontal operator (finds vertical edges) Vertical operator (finds horizontal edges) finds edges perpendicular to the direction

Horizontal Difference Directional Examples Horizontal Difference Operator Vertical Difference Operator

Discrete Gradient Operators Pixels are samples on a discrete grid. Must estimate the gradient solely from these samples. STRATEGY: Build gradient estimation filter kernels and convolve them with the image. Two basic filter concepts First difference: Central difference:

Simple Filtering Example in 1-D Convolving with [ 5 5 5 8 20 25 25 22 12 4 3 3 ]   [ 0]

Simple Filtering Example in 1-D Convolving with [ 5 5 5 8 20 25 25 22 12 4 3 3 ]   [ 0 0]

Simple Filtering Example in 1-D Convolving with [ 5 5 5 8 20 25 25 22 12 4 3 3 ]   [ 0 0 3]

Simple Filtering Example in 1-D Convolving with [ 5 5 5 8 20 25 25 22 12 4 3 3 ]   produces: [ 0 0 3 12 5 0 -3 -13 -8 -1 0 ]

Gradient Estimation 1. Create orthogonal pair of filters, 2. Convolve image with each filter: 3. Estimate the gradient magnitude:

Roberts Operator Small kernel, relatively little computation First difference (diagonally) Very sensitive to noise Origin not at kernel center Somewhat anisotropic

Noise Noise is always a factor in images. Derivative operators are high-pass filters. High-pass filters boost noise! Effects of noise on edge detection: False edges Errors in edge position Key concept: Build filters to respond to edges and suppress noise.

Prewitt Operator Larger kernel, somewhat more computation Central difference, origin at center Smooths (averages) along edge, less sensitive to noise Somewhat anisotropic

Sobel Operator 3 x 3 kernel, same computation as Prewitt Central difference, origin at center Better smoothing along edge, even less sensitive to noise Still somewhat anisotropic

Discrete Operators Compared Original Roberts

Roberts Prewitt

Prewitt Sobel

T = 5 T = 10 Roberts T = 40 T = 40 T = 20

Continuous Laplacian This is a scalar. It’s also isotropic. Edge detection: Find all points for which No thinning is necessary. Tends to produce closed edge contours.

Discrete Laplacian Operators Origin at center Only one convolution needed, not two Can build larger kernels by sampling Laplacian of Gaussian

Laplacian of Gaussian (Marr-Hildreth Operator) Let: Then:

LoG Filter Impulse Response

LoG Filter Frequency Response

Laplacian of Gaussian Examples

LoG Properties One filter, one convolution needed Zero-crossings are very sensitive to noise (2nd deriv.) Bandpass filtering reduces noise effects Edge map can be produced for a given scale Scale-space or pyramid decomposition possible Found in biological vision!! Practical LoG Filters: Kernel at least 3 times width of main lobe, truncate Larger kernel  more computation

Summary Edges can be detected from the derivative: Extrema of gradient magnitude Zero-crossings of Laplacian Practical filter kernels; convolve with image Noise effects False edges Imprecise edge locations Correct filtering attempts to control noise Edge map is the goal

Questions?