September 13, 2005.ppt

September 13, 2005 EE - 6358 Computer Vision EDGE DETECTION Presentation by Sumit Tandon Department of Electrical Engineering University of Texas at Arlington Course # EE6358 Computer Vision CONTENTS Introduction Types of Edges Steps in Edge Detection Methods of Edge Detection First Order Derivative Methods First Order Derivative Methods - Summary Second Order Derivative Methods Second Order Derivative Methods - Summary Optimal Edge Detectors Canny Edge Detection Edge Detector Performance Line Detection Convolution based technique Hough transform Application areas INTRODUCTION Edge - Area of significant change in the image intensity / contrast Edge Detection – Locating areas with strong intensity contrasts Use of Edge Detection – Extracting information about the image. E.g. location of objects present in the image, their shape, size, image sharpening and enhancement TYPES OF EDGES Variation of Intensity / Gray Level Step Edge Ramp Edge Line Edge Roof Edge Steps in Edge Detection Filtering – Filter image to improve performance of the Edge Detector wrt noise Enhancement – Emphasize pixels having significant change in local intensity Detection – Identify edges - thresholding Localization – Locate the edge accurately, estimate edge orientation Noisy Image Example of Noisy Image METHODS OF EDGE DETECTION First Order Derivative / Gradient Methods Roberts Operator Sobel Operator Prewitt Operator Second Order Derivative Laplacian Laplacian of Gaussian Difference of Gaussian Optimal Edge Detection Canny Edge Detection First Derivative At the point of greatest slope, the first derivative has maximum value E.g. For a Continuous 1-dimensional function f(t) Gradient For a continuous two dimensional function Gradient is defined as Gradient Approximation of Gradient for a discrete two dimensional function Convolution Mask Gx= Gy = Differences are computed at the interpolated points [i, j+1/2] and [i+1/2, j] Demo Gradient Methods – Roberts Operator Provides an