Course 5 Edge Detection. Image Features: local, meaningful, detectable parts of an image. edge corner texture … Edges: Edges points, or simply edges,

Slides:



Advertisements
Similar presentations
Spatial Filtering (Chapter 3)
Advertisements

Instructor: Mircea Nicolescu Lecture 6 CS 485 / 685 Computer Vision.
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
EDGE DETECTION.
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
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
Filtering and Edge Detection
Computer Vision Group Edge Detection Giacomo Boracchi 5/12/2007
Canny Edge Detector.
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Canny Edge Detector1 1)Smooth image with a Gaussian optimizes the trade-off between noise filtering and edge localization 2)Compute the Gradient magnitude.
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering
Edge Detection Today’s reading Forsyth, chapters 8, 15.1
CS485/685 Computer Vision Dr. George Bebis
Segmentation (Section 10.2)
Extension of M-VOTE: Improving Feature Detection
EE663 Image Processing Edge Detection 3 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Edge Detection Today’s readings Cipolla and Gee –supplemental: Forsyth, chapter 9Forsyth Watt, From Sandlot ScienceSandlot Science.
Computer Vision P. Schrater Spring 2003
Computational Photography: Image Processing Jinxiang Chai.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Computer Vision Spring ,-685 Instructor: S. Narasimhan WH 5409 T-R 10:30 – 11:50am.
Copyright © 2012 Elsevier Inc. All rights reserved.. Chapter 5 Edge Detection.
G52IIP, School of Computer Science, University of Nottingham 1 Edge Detection and Image Segmentation.
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
Edges. Edge detection schemes can be grouped in three classes: –Gradient operators: Robert, Sobel, Prewitt, and Laplacian (3x3 and 5x5 masks) –Surface.
Edge Detection Today’s reading Cipolla & Gee on edge detection (available online)Cipolla & Gee on edge detection From Sandlot ScienceSandlot Science.
Edge Detection Today’s reading Cipolla & Gee on edge detection (available online)Cipolla & Gee on edge detection Szeliski, Ch 4.1.2, From Sandlot.
G52IVG, School of Computer Science, University of Nottingham 1 Edge Detection and Image Segmentation.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
EE 4780 Edge Detection.
COMP322/S2000/L171 Robot Vision System Major Phases in Robot Vision Systems: A. Data (image) acquisition –Illumination, i.e. lighting consideration –Lenses,
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.
Edges.
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.
Chapter 9: Image Segmentation
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
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.
Lecture 04 Edge Detection Lecture 04 Edge Detection Mata kuliah: T Computer Vision Tahun: 2010.
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Edge Segmentation in Computer Images CSE350/ Sep 03.
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
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.
Detecting Image Features: Corner. Corners Given an image, denote the image gradient. C is symmetric with two positive eigenvalues. The eigenvalues give.
1 Edge Operators a kind of filtering that leads to useful features.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
Winter in Kraków photographed by Marcin Ryczek
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.
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
Canny Edge Detector.
Feature Detection .
Edge Detection Today’s readings Cipolla and Gee Watt,
Canny Edge Detector Smooth image with a Gaussian
Winter in Kraków photographed by Marcin Ryczek
IT472 Digital Image Processing
Presentation transcript:

Course 5 Edge Detection

Image Features: local, meaningful, detectable parts of an image. edge corner texture … Edges: Edges points, or simply edges, are pixels at or around which the image values undergo a sharp variation.

Usually, edges are classified as : step edge, ridge edge roof edge. We will emphasize on step edge detection in our discussions.

1.Edge detection: 1)Goal: Given an image corrupted by acquisition noise, locate the edges most likely to be generated by scene elements not by noise. 2) Operations required in edge detection i)Noise smoothing: suppress as much of the image noise as possible, without destroying the edges. In the absence of specific information of image, assume the noise white and Gaussian.

ii) Edge Enhancement: Design a filter corresponding to edges; that is, the filter’s output is large at edge pixel and low elsewhere, so edge an be located as the maximum in filter’s output. iii) Edge Location: Decide which local maximum in the filter’s output are edges and which are just caused by noise.

3) Edge descriptions: edge normal: the direction (unit vector) of the maximum intensity variation at edge pixels. Edge normal is perpendicular to the edge. edge direction: perpendicular to edge normal, and therefore tangent to the contour. edge position: the pixel position where the edge is located. edge strength: the measurement of local image contrast, e.g., intensity variation along an edge normal.

2. Gradient Based Edge Detection: 1)Gradient: Magnitude Direction

Note: The direction of edge normal is perpendicular to the edge. In computation, gradient is approximated by: G X = G Y = for symmetry, G X = G Y =

2) Roberts Operator 3) Sobel Operator: — avoid having the gradient calculated about an interpolated point between pixels.

where c is constant, e.g., c = 2 S x = S y = And, a0a0 a1a1 a2a2 a7a7 [i,j]a3a3 a6a6 a5a5 a4a

3. LapLacian Operator ----Second derivative of a smoothed step edge gives a function that crosses zero at the location of the edge. The second derivative of a 2D function is Laplacian.

In discrete computation: Or, by template,

4. LapLacian of Gaussian (LOG) LOG combines Guassian filter with the LapLasian for edge detection: — smoothing filter using a Gaussian — edge enhancement using Laplassian — edge localization by detecting zero-crossing Let g(x,y) be Gaussian filter. f(x,y) be noise corrupted image; h(x,y) be LOG, then:

Then Log is :

5. Canny Edge Detector: So far, canny operator has been considered as the best of edge detector. Canny operator consists of four basic processes: — smooth image with a Gaussian filter — compute gradient magnitude and orientation using finite difference approximation

— Applying nonmaxima suppression to gradient magnitude to identify edge locations. — We double thresholding to detect and link edges. 1)Canny-Enhancer (smoothing and enhancement) a) Apply Gaussian smoothing to input image I, obtaining where G is Gaussian filter.

b) For each pixel [ i, j ], compute gradient component J x and J y by finite-difference estimate: Edge strength Edge normal c) Form output: Strength image: E s, formed by e s [i,j], Orientation image: E 0, formed by e 0 [i,j].

2) Nonmaxima-supperation The input images are E s and E 0, the edge strength image and edge orientation image. Consider four directions d 1, d 2, d 3, d 4 identified by 0 0, 45 0, 90 0, orientations. For each pixel [i,j]: a) find direction d k which best approximates the direction of E 0 [i,j]. b) Along the direction d k, check the two neighbors of pixel [i,j]. If E s [i,j] is greater than both of its neighbors, set I N [i,j] = E s [i,j]; otherwise, E N [i,j] = 0. The output image I N consists of thinned edge points.

3) Double threshold and edge link Input image I N and E 0, choose two thresholds T h and T L such that T h >T L a) Locate an unvisited edge point I N [i,j] which satisfies I N [i,j]> T h. b) Follow I N in the directions perpendicular to edge normal as long as I N >T h. Save the satisfied edge points. c) When the tracing process ended there I N T L..

d) When edge gap can be bridged up (where I N > T h. ), go to step b). If it cannot find further connectivity of I N > T L, go to step a). 6. Corner Detection: Corner features have advantages: — more meaningfully defined in scene. — less likely to generate false features. — corners are easier to match than edge points.

For an image I, consider a point p with intensity gradient I x and I y. In a neighborhood N of p form the structure matrix C: The key is to find the eigenvalues and corresponding eigenvector of matrix C. — if image is uniform, C = 0. And — if image consists of only an ideal step edge, rank of c is 1, and λ 1 > 0, λ 2 = 0,

the direction of eigenvector of corresponds to the edge normal. — if image contains an ideal corner, then The eigenvector of corresponds to the stronger edge of the corner; the eigenvector of to the weaker edge.

Algorithm (Tomasi and Kanade, 1991) Input image is I, two preset parameters: T——threshold on smaller eignvalue N——window size of neighborhood. a) Compute image gradient over I. b) For each image point, from structure matrix C in its neighborhood of window. c) Compute the eigenvalues.

d) If, save point P in list L e) Sort L in decreasing order. f) Scan L from top to bottom. For each point P, delete all its neighborhood that appears in the list L, so that output points do not have overlapped neighborhood.

7. Line Detection (Liu and Huang, 1991) Line features have advantages: — more meaningfully defined in scene — less affected by noise — subpixel accuracy — easier to match(less false matches) Input image: I, preset parameter: T — gradient threshold — parameter of Gaussian filter

Algorithm: a) Use Gaussian filter to smooth image I, output is G. b) Calculate gradient of image G and its magnitude and orientation for each point. c) Thresholding gradient magnitude M by value T to get a binary image S, line support region image. when M[i,j] >T, S[i,j]=1, otherwise S[i,j]=0.

d) Based on the direction of edge normal, segment each connected regions S i into subregion; in each subregion, the orientations do not differ much. e) Suppose the equation of image line is ax + by + c = 0 The distance from a point in the support region to the line is

f) For each subregion obtained in step d), minimize the sum of distance from point to the line. g) Use least-square to solve for parameters a, b and c. Thus, line is found. Note: the choice of threshold value of T is not critical in the algorithm.