An Analysis of Edge Detectors and Improved Hybrid Technique for Edge Detection of Images

Total Page:16

File Type:pdf, Size:1020Kb

An Analysis of Edge Detectors and Improved Hybrid Technique for Edge Detection of Images International Journal of Computer Science and Electronics Engineering (IJCSEE) Volume 1, Issue 4 (2013) ISSN 2320-401X; EISSN 2320-4028 An Analysis of Edge Detectors and Improved Hybrid Technique for Edge Detection of Images Mamta. Juneja, and Parvinder S. Sandhu A. Edge Detection [2] Abstract—This paper provides an analysis of various edge detection techniques viz. sobel, prewitt, robert, laplacian of gaussian It is technique for locating areas with strong intensity and canny in which canny edge detector outperforms all existing edge contrasts. It amounts to locating each edge pixel and detectors. A new hybrid edge detection technique for extracting determining its orientation. Edge detection is one of the most edges, line, boundaries and circles from a given input image is also commonly used operations in image analysis, and there are proposed in this paper. It utilizes canny for extracting edges and probably more algorithms in the literature for enhancing and thereafter output edges are refined by application of hough transform. It has been successful to extract edges, lines, boundaries and circles detecting edges than any other single subject. The reason for of any image and is immune to various noise effects and other this is that edges form the outline of an object. An edge is the disturbances. boundary between an object and the background, and indicates the boundary between overlapping objects. This means that if Keywords—canny, circle detection, edge detection, hough the edges in an image can be identified accurately, all of the transform, laplacian of gaussian, line detection, prewitt, robert, sobel. objects can be located and basic properties such as area, perimeter, and shape can be measured. Since computer vision I. INTRODUCTION involves the identification and classification of objects in an N edge [1] is defined to be a sequence of pixels that image, edge detections is an essential tool. Edge detection is a A border two homogeneous regions of different intensities very important area in the field of Computer Vision, which help in segmentation and object recognition. It Segmentation and object recognition. It is a fundamental of indicates discontinuity in image intensity function. An Edge in low-level image processing and good edges are necessary for an image is a significant local change in the image intensity, higher level processing. usually associated with a discontinuity in either the image Edge detectors are the filters which filter out the useless intensity or the first derivative of the image intensity. information and preserve the useful information in image. Discontinuities in the image intensity can be either Step edge, Three fundamental steps involved in edge detection are: where the image intensity abruptly changes from one value on 1. Image smoothing for noise reduction: this step involve one side of the discontinuity to a different value on the filtering the image for improving the performance of edge opposite side, or Line Edges, where the image intensity detector. abruptly changes value but then returns to the starting value within some short distance. However, Step and Line edges are 2. Detection: This step involves extracting all edge points rare in real images. Because of low frequency components or that are potential candidates to become edge point. the smoothing introduced by most sensing devices, sharp 3. Edge localization: This step involves selecting from the discontinuities rarely exist in real signals. Step edges become candidate edge points only the points that are true members of Ramp Edges and Line Edges become Roof edges, where set of points comprising an edge. intensity changes are not instantaneous but occur over a finite Edge detection techniques are broadly divided in to two distance. Illustrations of these edge shapes are shown in Figure categories gradient edge detection and Laplacian edge 1. detection. Gradient based Edge Detection: This method detects the edge points in the image by using the gradient. The gradient is tool for finding the edge strength and direction at location, f, and is denoted by ∆f , and defined as the vector, Fig. 1 Types of Edges a) Step b) Ramp c) Line d) Roof (1) This vector always points in the direction of greatest rate of Mamta.Juneja is Assistant Professor in University Institute of Engineering change at location (x, y). The magnitude of the vector can be and technology, Panjab Univesity, Chandigarh. E-mail: er_mamta@yahoo. given as, com. Prof. Dr. Parvinder S. Sandhu is with Rayat and Bahra Institute of Engineering and Bio-Technology, Punjab, India. 469 International Journal of Computer Science and Electronics Engineering (IJCSEE) Volume 1, Issue 4 (2013) ISSN 2320-401X; EISSN 2320-4028 Single response to single point: The edge detector must be (2) able to give single response to single edge point. The direction of the gradient vector is given by an angle, C. Edge detectors θ(x, y). Consider the one dimensional signal with an edge The various popular edge detectors used in image shown by jump in intensity as shown in Figure 2 below: processing as described in [1] are as follows: a) Sobel Edge Detector: The Sobel edge detection method is introduced by Sobel in 1970 [1]. In Sobel edge detector, the task of edge detection is fulfilled by performing a 2D spatial gradient convolution operation on an image. This operator uses two convolution masks Gx and Gy. Fig. 2 A Signal Representation (3) If we take the gradient of this signal (which, in one dimension, is just the first derivative with respect to t) we get Here, Gx and Gy are computed as, the shape shown in Figure 3: (4) (5) Where Zi, i=1,2,.,9 are intensity levels of each pixel in the convolution are (6) Finally, the gradient magnitude is thresholded. Sobel Fig. 3 First Derivative of Signal [2] operator is very simple and effective way for finding the edges in image. The sobel operator is used mostly for detecting The first derivative of the one dimensional signal clearly horizontal and vertical edges. However the edges detected by shows maximum is located at the center of the edge in the this sobel operator are thick which may not be suitable for original signal. some applications where the detection of the outer most Laplacian based Edge Detection: This method basically contour of an object is required. searches for zero crossings in the second derivative of the b) Prewitt’s Edge Detector: The Prewitt edge detection is image. If the first derivative is maximum, then its second proposed by Prewitt in 1970) [1] to estimate the magnitude derivative will definitely be zero. This phenomenon gives rise and orientation of an edge. The Prewitt’s edge detector also to alternate method for edge detection which is known as uses the three by three convolution mask, which is little Laplacian. Hence, we can detect the edges by searching for different from that Sobel edge detector. The convolution zero crossings in the 2nd derivative, Figure 4 shows second masks smoothens the image. The convolution mask is: derivative of the signal. (7) The prewitt’s edge detector is mainly used for detecting vertical and horizontal edges in image. c) Robert’s Cross Operator: The Roberts edge detection is Fig. 4 Second Derivative of Signal [2] introduced by Lawrence Roberts in 1965.The Roberts cross operator has 2x2 convolutions mask. The Roberts Cross B. Performance Criterion for Edge Detectors operator performs a simple, quick to compute, 2-D spatial There are problems of false edge detection, missing true gradient measurement on an image. The convolution masks for edges, producing thin or thick lines and problems due to noise. Roberts operator is shown below. Hence, it was necessary to define certain performance criterion for edge detectors. Performance criterion for edge detectors (8) involve following points. The Roberts cross detector has only one disadvantage that it Good detection: good detection means the probability of fails to detect few of the edges. These masks are mainly falsely marking the non-edge points should be as low as designed to respond maximally to edges running at 45° to the possible. pixel grid, one kernel for each of the two perpendicular Good localization: The edge detected should be as close as orientations. to the real edge points. d) Laplacian of Gaussian (LoG): The Laplacian of Gaussian was proposed by Marr in 1982.The Laplacian is a 2- 470 International Journal of Computer Science and Electronics Engineering (IJCSEE) Volume 1, Issue 4 (2013) ISSN 2320-401X; EISSN 2320-4028 D isotropic measure of the 2nd spatial derivative of an image. Minimal Response: Edge in the image should only be marked The Laplacian of an image highlights regions of rapid intensity once, and where possible, image noise should not create false change and is therefore often used for edge detection. edges. Laplacian is applied to the image for smoothing purpose, in E. Comparison of Edge Detectors [5] order to reduce the sensitivity to noise. The Laplacian L(x, y) of an image with pixel intensity Gradient-based edge detection algorithms such as the values I(x, y) is given by: Prewitt filter have a major drawback of being very sensitive to noise. The size of the kernel filter and coefficients are fixed (9) and cannot be adapted to a given image. An adaptive edge- and convolution mask are: detection algorithm is necessary to provide a robust solution that is adaptable to the varying noise levels of these images to help distinguish valid image contents from visual artifacts introduced by noise. The performance of the Canny algorithm - - - - depends heavily on the adjustable parameters, σ, which is the 1 1 1 1 standard deviation for the Gaussian filter, and the threshold - 4 - - 8 - values, ‘T1’ and ‘T2’.
Recommended publications
  • Edge Detection of Noisy Images Using 2-D Discrete Wavelet Transform Venkata Ravikiran Chaganti
    Florida State University Libraries Electronic Theses, Treatises and Dissertations The Graduate School 2005 Edge Detection of Noisy Images Using 2-D Discrete Wavelet Transform Venkata Ravikiran Chaganti Follow this and additional works at the FSU Digital Library. For more information, please contact [email protected] THE FLORIDA STATE UNIVERSITY FAMU-FSU COLLEGE OF ENGINEERING EDGE DETECTION OF NOISY IMAGES USING 2-D DISCRETE WAVELET TRANSFORM BY VENKATA RAVIKIRAN CHAGANTI A thesis submitted to the Department of Electrical Engineering in partial fulfillment of the requirements for the degree of Master of Science Degree Awarded: Spring Semester, 2005 The members of the committee approve the thesis of Venkata R. Chaganti th defended on April 11 , 2005. __________________________________________ Simon Y. Foo Professor Directing Thesis __________________________________________ Anke Meyer-Baese Committee Member __________________________________________ Rodney Roberts Committee Member Approved: ________________________________________________________________________ Leonard J. Tung, Chair, Department of Electrical and Computer Engineering Ching-Jen Chen, Dean, FAMU-FSU College of Engineering The office of Graduate Studies has verified and approved the above named committee members. ii Dedicate to My Father late Dr.Rama Rao, Mother, Brother and Sister-in-law without whom this would never have been possible iii ACKNOWLEDGEMENTS I thank my thesis advisor, Dr.Simon Foo, for his help, advice and guidance during my M.S and my thesis. I also thank Dr.Anke Meyer-Baese and Dr. Rodney Roberts for serving on my thesis committee. I would like to thank my family for their constant support and encouragement during the course of my studies. I would like to acknowledge support from the Department of Electrical Engineering, FAMU-FSU College of Engineering.
    [Show full text]
  • Computer Vision: Edge Detection
    Edge Detection Edge detection Convert a 2D image into a set of curves • Extracts salient features of the scene • More compact than pixels Origin of Edges surface normal discontinuity depth discontinuity surface color discontinuity illumination discontinuity Edges are caused by a variety of factors Edge detection How can you tell that a pixel is on an edge? Profiles of image intensity edges Edge detection 1. Detection of short linear edge segments (edgels) 2. Aggregation of edgels into extended edges (maybe parametric description) Edgel detection • Difference operators • Parametric-model matchers Edge is Where Change Occurs Change is measured by derivative in 1D Biggest change, derivative has maximum magnitude Or 2nd derivative is zero. Image gradient The gradient of an image: The gradient points in the direction of most rapid change in intensity The gradient direction is given by: • how does this relate to the direction of the edge? The edge strength is given by the gradient magnitude The discrete gradient How can we differentiate a digital image f[x,y]? • Option 1: reconstruct a continuous image, then take gradient • Option 2: take discrete derivative (finite difference) How would you implement this as a cross-correlation? The Sobel operator Better approximations of the derivatives exist • The Sobel operators below are very commonly used -1 0 1 1 2 1 -2 0 2 0 0 0 -1 0 1 -1 -2 -1 • The standard defn. of the Sobel operator omits the 1/8 term – doesn’t make a difference for edge detection – the 1/8 term is needed to get the right gradient
    [Show full text]
  • Vision Review: Image Processing
    Vision Review: Image Processing Course web page: www.cis.udel.edu/~cer/arv September 17, 2002 Announcements • Homework and paper presentation guidelines are up on web page • Readings for next Tuesday: Chapters 6, 11.1, and 18 • For next Thursday: “Stochastic Road Shape Estimation” Computer Vision Review Outline • Image formation • Image processing • Motion & Estimation • Classification Outline •Images • Binary operators •Filtering – Smoothing – Edge, corner detection • Modeling, matching • Scale space Images • An image is a matrix of pixels Note: Matlab uses • Resolution – Digital cameras: 1600 X 1200 at a minimum – Video cameras: ~640 X 480 • Grayscale: generally 8 bits per pixel → Intensities in range [0…255] • RGB color: 3 8-bit color planes Image Conversion •RGB → Grayscale: Mean color value, or weight by perceptual importance (Matlab: rgb2gray) •Grayscale → Binary: Choose threshold based on histogram of image intensities (Matlab: imhist) Color Representation • RGB, HSV (hue, saturation, value), YUV, etc. • Luminance: Perceived intensity • Chrominance: Perceived color – HS(V), (Y)UV, etc. – Normalized RGB removes some illumination dependence: Binary Operations • Dilation, erosion (Matlab: imdilate, imerode) – Dilation: All 0’s next to a 1 → 1 (Enlarge foreground) – Erosion: All 1’s next to a 0 → 0 (Enlarge background) • Connected components – Uniquely label each n-connected region in binary image – 4- and 8-connectedness –Matlab: bwfill, bwselect • Moments: Region statistics – Zeroth-order: Size – First-order: Position (centroid)
    [Show full text]
  • A Survey of Feature Extraction Techniques in Content-Based Illicit Image Detection
    Journal of Theoretical and Applied Information Technology 10 th May 2016. Vol.87. No.1 © 2005 - 2016 JATIT & LLS. All rights reserved . ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195 A SURVEY OF FEATURE EXTRACTION TECHNIQUES IN CONTENT-BASED ILLICIT IMAGE DETECTION 1,2 S.HADI YAGHOUBYAN, 1MOHD AIZAINI MAAROF, 1ANAZIDA ZAINAL, 1MAHDI MAKTABDAR OGHAZ 1Faculty of Computing, Universiti Teknologi Malaysia (UTM), Malaysia 2 Department of Computer Engineering, Islamic Azad University, Yasooj Branch, Yasooj, Iran E-mail: 1,2 [email protected], [email protected], [email protected] ABSTRACT For many of today’s youngsters and children, the Internet, mobile phones and generally digital devices are integral part of their life and they can barely imagine their life without a social networking systems. Despite many advantages of the Internet, it is hard to neglect the Internet side effects in people life. Exposure to illicit images is very common among adolescent and children, with a variety of significant and often upsetting effects on their growth and thoughts. Thus, detecting and filtering illicit images is a hot and fast evolving topic in computer vision. In this research we tried to summarize the existing visual feature extraction techniques used for illicit image detection. Feature extraction can be separate into two sub- techniques feature detection and description. This research presents the-state-of-the-art techniques in each group. The evaluation measurements and metrics used in other researches are summarized at the end of the paper. We hope that this research help the readers to better find the proper feature extraction technique or develop a robust and accurate visual feature extraction technique for illicit image detection and filtering purpose.
    [Show full text]
  • Computer Vision Based Human Detection Md Ashikur
    Computer Vision Based Human Detection Md Ashikur. Rahman To cite this version: Md Ashikur. Rahman. Computer Vision Based Human Detection. International Journal of Engineer- ing and Information Systems (IJEAIS), 2017, 1 (5), pp.62 - 85. hal-01571292 HAL Id: hal-01571292 https://hal.archives-ouvertes.fr/hal-01571292 Submitted on 2 Aug 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. International Journal of Engineering and Information Systems (IJEAIS) ISSN: 2000-000X Vol. 1 Issue 5, July– 2017, Pages: 62-85 Computer Vision Based Human Detection Md. Ashikur Rahman Dept. of Computer Science and Engineering Shaikh Burhanuddin Post Graduate College Under National University, Dhaka, Bangladesh [email protected] Abstract: From still images human detection is challenging and important task for computer vision-based researchers. By detecting Human intelligence vehicles can control itself or can inform the driver using some alarming techniques. Human detection is one of the most important parts in image processing. A computer system is trained by various images and after making comparison with the input image and the database previously stored a machine can identify the human to be tested. This paper describes an approach to detect different shape of human using image processing.
    [Show full text]
  • Edge Detection Low Level
    Image Processing Image Processing - Computer Vision Edge Detection Low Level • Edge detection masks • Gradient Detectors Image Processing representation, compression,transmission • Second Derivative - Laplace detectors • Edge Linking image enhancement • Hough Transform edge/feature finding image "understanding" Computer Vision High Level UFO - Unidentified Flying Object Origin of Edges surface normal discontinuity depth discontinuity surface color discontinuity illumination discontinuity Edges are caused by a variety of factors 1 Edge detection Profiles of image intensity edges Step Edge Line Edge How can you tell that a pixel is on an edge? gray value gray gray value gray x x edge edge edge edge Edge Detection by Differentiation Edge detection 1D image f(x) gray value gray 1. Detection of short linear edge segments (edgels) x 2. Aggregation of edgels into extended edges 1st derivative f'(x) threshold |f'(x)| - threshold Pixels that passed the threshold are Edge Pixels 2 Image gradient The discrete gradient The gradient of an image: How can we differentiate a digital image f[x,y]? • Option 1: reconstruct a continuous image, then take gradient • Option 2: take discrete derivative (finite difference) The gradient points in the direction of most rapid change in intensity How would you implement this as a convolution? The gradient direction is given by: The edge strength is given by the gradient magnitude Effects of noise Solution: smooth first Consider a single row or column of the image • Plotting intensity as a function of position gives
    [Show full text]
  • A Survey of Feature Extraction Techniques in Content-Based Illicit Image Detection
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Universiti Teknologi Malaysia Institutional Repository Journal of Theoretical and Applied Information Technology 10 th May 2016. Vol.87. No.1 © 2005 - 2016 JATIT & LLS. All rights reserved . ISSN: 1992-8645 www.jatit.org E-ISSN: 1817-3195 A SURVEY OF FEATURE EXTRACTION TECHNIQUES IN CONTENT-BASED ILLICIT IMAGE DETECTION 1,2 S.HADI YAGHOUBYAN, 1MOHD AIZAINI MAAROF, 1ANAZIDA ZAINAL, 1MAHDI MAKTABDAR OGHAZ 1Faculty of Computing, Universiti Teknologi Malaysia (UTM), Malaysia 2 Department of Computer Engineering, Islamic Azad University, Yasooj Branch, Yasooj, Iran E-mail: 1,2 [email protected], [email protected], [email protected] ABSTRACT For many of today’s youngsters and children, the Internet, mobile phones and generally digital devices are integral part of their life and they can barely imagine their life without a social networking systems. Despite many advantages of the Internet, it is hard to neglect the Internet side effects in people life. Exposure to illicit images is very common among adolescent and children, with a variety of significant and often upsetting effects on their growth and thoughts. Thus, detecting and filtering illicit images is a hot and fast evolving topic in computer vision. In this research we tried to summarize the existing visual feature extraction techniques used for illicit image detection. Feature extraction can be separate into two sub- techniques feature detection and description. This research presents the-state-of-the-art techniques in each group. The evaluation measurements and metrics used in other researches are summarized at the end of the paper.
    [Show full text]
  • Edge Detection As an Effective Technique in Image Segmentation
    International Journal of Computer Science Trends and Technology (IJCST) – Volume 2 Issue 4, Nov-Dec 2014 RESEARCH ARTICLE OPEN ACCESS Edge Detection as an Effective Technique in Image Segmentation for Image Analysis Manjula KA Research Scholar Research Development Centre Bharathiar University Tamil Nadu – India ABSTRACT Digital Image processing is a technique making use of computer algorithms to perform specific operations on an image, to get an enhanced image or to extract some useful information from it. Image segmentation, which is an important phase in image processing, is the process of separation of an image into regions or categories, which correspond to different objects or parts of objects. This step is typically used to identify objects or other relevant information in digital images. There are generic methods available for image segmentation and edge based segmentation is one among them. Image segmentation needs to segment the object from the background to read the image properly and identify the content of the image carefully. In this context, edge detection is considered to be a fundamental tool for image segmentation. Keywords :- Digital image processing, image segmentation, edge detection. I. INTRODUCTION and digital image processing. Analog Image Processing refers to the processing of image The term image processing refers to through electrical means. The most common processing of images using mathematical operations example is the television image. The television in order to get an enhanced image or to extract some signal is a voltage level which varies in amplitude useful information from it. It is a type of signal to represent brightness through the image.
    [Show full text]
  • Edge Detection CS 111
    Edge Detection CS 111 Slides from Cornelia Fermüller and Marc Pollefeys Edge detection • Convert a 2D image into a set of curves – Extracts salient features of the scene – More compact than pixels Origin of Edges surface normal discontinuity depth discontinuity surface color discontinuity illumination discontinuity • Edges are caused by a variety of factors Edge detection 1.Detection of short linear edge segments (edgels) 2.Aggregation of edgels into extended edges 3.Maybe parametric description Edge is Where Change Occurs • Change is measured by derivative in 1D • Biggest change, derivative has maximum magnitude •Or 2nd derivative is zero. Image gradient • The gradient of an image: • The gradient points in the direction of most rapid change in intensity • The gradient direction is given by: – Perpendicular to the edge •The edge strength is given by the magnitude How discrete gradient? • By finite differences f(x+1,y) – f(x,y) f(x, y+1) – f(x,y) The Sobel operator • Better approximations of the derivatives exist –The Sobel operators below are very commonly used -1 0 1 121 -2 0 2 000 -1 0 1 -1 -2 -1 – The standard defn. of the Sobel operator omits the 1/8 term • doesn’t make a difference for edge detection • the 1/8 term is needed to get the right gradient value, however Gradient operators (a): Roberts’ cross operator (b): 3x3 Prewitt operator (c): Sobel operator (d) 4x4 Prewitt operator Finite differences responding to noise Increasing noise -> (this is zero mean additive gaussian noise) Solution: smooth first • Look for peaks in Derivative
    [Show full text]
  • Vision Based Real-Time Navigation with Unknown and Uncooperative Space Target Abstract
    Vision based real-time navigation with Unknown and Uncooperative Space Target Abstract Hundreds of satellites are launched every year, and the failure rate during their op- erational time frame, combined with the four to five percent failure rate of launch vehicles means that approximately one of every seven satellites will fail before reach- ing their planned working life. This generates an enormous amount of space debris, which can be a danger to working space platforms such as the International Space Station (ISS), shuttles, spacecrafts, and other vehicles. If debris collides with a ve- hicle with human passengers, it could cause significant damage and threaten the life and safety of those aboard, plus the collisions themselves add more junk, thereby creating more risk. Thus, active space debris removal operations are essential. The removal of space debris requires pose (position and orientation) information and mo- tion estimation of targets; thus, real-time detection and tracking of uncooperative targets are critical. In order to estimate a target's pose and motion, it must track over the entire frame. In addition, due to the harsh space environment, different types of sensors are required, which means practical sensor fusion algorithms are essential. However, as there is little prior information about a target's structure and motion, detection and tracking, pose and motion estimation and multi-sensor fusion tasks are very challenging. This thesis develops new approaches for target tracking, pose and motion estima- tion and multi-sensor fusion. For the target-tracking step, a new adaptation scheme iii of the Unscented Kalman Filter (UKF) is proposed to manage difficulties associated with real-time tracking of an uncooperative space target.
    [Show full text]
  • UNIVERSIDAD POLITÉCNICA DE MADRID Marta Luna Serrano
    UNIVERSIDAD POLITÉCNICA DE MADRID ESCUELA TÉCNICA SUPERIOR DE INGENIEROS DE TELECOMUNICACIÓN Automated detection and classification of brain injury lesions on structural magnetic resonance imaging TESIS DOCTORAL Marta Luna Serrano Ingeniero de Telecomunicación Madrid, 2016 Departamento de Tecnología Fotónica y Bioingeniería Grupo de Bioingeniería y Telemedicina E.T.S.I. de Telecomunicación UNIVERSIDAD POLITÉCNICA DE MADRID Automated detection and classification of brain injury lesions on structural magnetic resonance imaging TESIS DOCTORAL Autor: Marta Luna Serrano Directores: Enrique J. Gómez Aguilera José María Tormos Muñoz Madrid, Febrero 2016 Tribunal formado por el Magnífico y Excelentísimo Sr. Rector de la Universidad Politécnica de Madrid. Presidente: Dª. Mª Elena Hernando Pérez Doctora Ingeniera de Telecomunicación Profesora Titular de Universidad Universidad Politécnica de Madrid Vocales: D. César Cáceres Taladriz Doctor Ingeniero de Telecomunicación Profesor Contratado Doctor Universidad Rey Juan Carlos D. Pablo Lamata de la Orden Doctor Ingeniero de Telecomunicación Sir Henry Dale Fellow & Lecturer King’s College of London D. Alberto García Molina Doctor en Neurociencias Neuropsicólogo adjunto Hospital de Neurorehabilitación Institut Guttmann Secretaria: Dª. Patricia Sánchez González Doctora Ingeniera de Telecomunicación Profesora Ayudante Doctor Universidad Politécnica de Madrid Suplentes: Dña. Laura Roa Romero Doctora en Ciencias Físicas Catedrática de Universidad Universidad de Sevilla D. Javier Resina Tosina Doctor Ingeniero
    [Show full text]
  • CITS 4402 Computer Vision
    CITS 4402 Computer Vision Ajmal Mian Lecture 05 Edge Detection & Hough Transform 26/03/2018 Objectives of this lecture To understand what are edges To study the Sobel operator for gradient extraction To learn the Canny edge detection algorithm To study the general concept of the Hough transform To use the Hough transform for line and circle detection 26/03/2018 Computer Vision - Lecture 05 - Edge Detection & Hough Transform The University of Western Australia 2 Significance of Edges in Images There is strong evidence that some form of data compression occurs at an early stage in the human visual system Research suggests that one form of this compression involves finding edges and other information-high features in images From edges we can construct a line drawing of the scene. This results in a huge data compression, but the information content remains very high When we look at a sketch of a scene we do not feel that we are missing a great deal of information 26/03/2018 Computer Vision - Lecture 05 - Edge Detection & Hough Transform The University of Western Australia 3 What is an Edge? This is not well defined but the classical approach is to define edges as being step discontinuities in the image Edge detection then becomes a task of finding local maxima in the first derivative or zero-crossing of the 2nd derivative This idea was first suggested by David Marr at MIT in the late 70’s. 26/03/2018 Computer Vision - Lecture 05 - Edge Detection & Hough Transform The University of Western Australia 4 Edge Detection Goal: Identify
    [Show full text]