Feature-Based Image Comparison and Its Application in Wireless Visual Sensor Networks

Total Page:16

File Type:pdf, Size:1020Kb

Feature-Based Image Comparison and Its Application in Wireless Visual Sensor Networks University of Tennessee, Knoxville TRACE: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 5-2011 Feature-based Image Comparison and Its Application in Wireless Visual Sensor Networks Yang Bai University of Tennessee Knoxville, Department of EECS, [email protected] Follow this and additional works at: https://trace.tennessee.edu/utk_graddiss Part of the Other Computer Engineering Commons, and the Robotics Commons Recommended Citation Bai, Yang, "Feature-based Image Comparison and Its Application in Wireless Visual Sensor Networks. " PhD diss., University of Tennessee, 2011. https://trace.tennessee.edu/utk_graddiss/946 This Dissertation is brought to you for free and open access by the Graduate School at TRACE: Tennessee Research and Creative Exchange. It has been accepted for inclusion in Doctoral Dissertations by an authorized administrator of TRACE: Tennessee Research and Creative Exchange. For more information, please contact [email protected]. To the Graduate Council: I am submitting herewith a dissertation written by Yang Bai entitled "Feature-based Image Comparison and Its Application in Wireless Visual Sensor Networks." I have examined the final electronic copy of this dissertation for form and content and recommend that it be accepted in partial fulfillment of the equirr ements for the degree of Doctor of Philosophy, with a major in Computer Engineering. Hairong Qi, Major Professor We have read this dissertation and recommend its acceptance: Mongi A. Abidi, Qing Cao, Steven Wise Accepted for the Council: Carolyn R. Hodges Vice Provost and Dean of the Graduate School (Original signatures are on file with official studentecor r ds.) Feature-based Image Comparison and Its Application in Wireless Visual Sensor Networks A Dissertation Presented for the Doctor of Philosophy Degree The University of Tennessee, Knoxville Yang Bai May 2011 Copyright c 2011 by Yang Bai All rights reserved. ii Dedication I dedicate this dissertation to my parents, who gave me the opportunity to explore the world, and to my wife, who has been always supportive no matter what happens. iii Acknowledgments I would like to thank all the individuals who have inspired, encouraged, and advised me in the preparation of this dissertation. First and foremost, I would like to thank my advisor, Dr. Hairong Qi. Her willingness to support my work and her guidance throughout my studies has allowed me to develop my skills as a researcher within a supportive team environment. I thank her for that opportunity. I would further like to thank the other members of my committee: Dr. Mongi A. Abidi, Dr. Qing Cao, and Dr. Steven Wise. I greatly appreciate their time and input to this dissertation. Within the AICIP Lab, I owe many thanks to my fellow graduate students. I enjoyed the many conversations and discussions that have had a tremendous impact on my research and myself as a person. Dayu Yang, Sangwoo Moon, Mahmut Karakaya, Li He, Jiajia Luo, Shuangjiang Li, Bryan Bodkin, Wei Wang, Zhibo Wang, Austin Albright and Paul Donnelly thank you very much. Last but not the least, I express my deepest appreciation to my parents and my wife, for their unconditional love, support and encouragement. iv Abstract This dissertation studies the feature-based image comparison method and its application in Wireless Visual Sensor Networks. Wireless Visual Sensor Networks (WVSNs), formed by a large number of low-cost, small-size visual sensor nodes, represent a new trend in surveillance and monitoring prac- tices. Although each single sensor has very limited capability in sensing, processing and transmission, by working together they can achieve various high level tasks. Sensor col- laboration is essential to WVSNs and normally performed among sensors having similar measurements, which are called neighbor sensors. The directional sensing characteristics of imagers and the presence of visual occlusion present unique challenges to neighborhood formation, as geographically-close neighbors might not monitor similar scenes. Besides, theenergyresourceontheWVSNsisalsoverytight,withwirelesscommunicationand complicated computation consuming most energy in WVSNs. Therefore the feature-based image comparison method has been proposed, which directly compares the captured image from each visual sensor in an economical way in terms of both the computational cost and the transmission overhead. The feature-based image comparison method compares different images and aims to find similar image pairs using a set of local features from each image. The image feature is a numerical representation of the raw image and can be more compact in terms of the data volume than the raw image. The feature-based image comparison contains three steps: feature detection, descriptor calculation and feature comparison. For the step of feature detection, the dissertation proposes two computationally effi- cient corner detectors. The first detector is based on the Discrete Wavelet Transform that provides multi-scale corner point detection and the scale selection is achieved efficiently v through a Gaussian convolution approach. The second detector is based on a linear un- mixing model, which treats a corner point as the intersection of two or three “line” bases in a 3 × 3 region. The line bases are extracted through a constrained Nonnegative Matrix Factorization (NMF) approach and the corner detection is accomplished through counting the number of contributing bases in the linear mixture. For the step of descriptor calculation, the dissertation proposes an effective dimen- sionality reduction algorithm for the high dimensional Scale Invariant Feature Transform (SIFT) descriptors. A set of 40 SIFT descriptor bases are extracted through constrained NMF from a large training set and all SIFT descriptors are then projected onto the space spanned by these bases, achieving dimensionality reduction. The efficiency of the proposed corner detectors have been proven through theoretical analysis. In addition, the effectiveness of the proposed corner detectors and the dimen- sionality reduction approach has been validated through extensive comparison with several state-of-the-art feature detector/descriptor combinations. vi Contents 1 Introduction 1 1.1ImageComparisonfromVisualFeatures.................... 1 1.2WirelessVisualSensorNetworks........................ 3 1.3Motivations.................................... 5 1.4Contributions................................... 6 1.5DissertationOutline............................... 7 2 Literature Survey 8 2.1FeatureDetection................................. 9 2.1.1 Moravec’sCornerDetector....................... 10 2.1.2 HarrisCornerDetector......................... 12 2.1.3 VariationsoftheHarrisCornerDetector................ 14 2.1.4 HarrisDetectorforColorImages.................... 16 2.1.5 FASTCornerDetector.......................... 17 2.1.6 The Feature Detector in Scale Invariant Feature Transform (SIFT) . 18 2.1.7 The Feature Detector in Speed-Up Robust Features (SURF) . 21 2.2FeatureDescription................................ 23 2.2.1 Feature Descriptor in Scale Invariant Feature Transform (SIFT) . 23 2.2.2 FeatureDescriptorinSpeed-UpRobustFeature(SURF)....... 24 2.2.3 MomentInvariants............................ 24 2.2.4 ComparisonofFeatureDetectorsandDescriptors........... 27 2.3FeatureComparison............................... 29 vii 3 Light-weight Feature Detectors 31 3.1DWT-basedCornerDetector.......................... 31 3.1.1 Localize the Corner Points using Gaussian Interpolation from Deci- matedDWTDecomposition....................... 32 3.1.2 Estimate Corner Point Scales from Gaussian Convolution on the Cor- nerMap.................................. 33 3.2 An Efficient Corner Detector Based on Linear Unmixing . .......... 36 3.2.1 CornerDetectionusingLinearMixingModel............. 36 3.2.2 ConstrainedNMFforBasisCalculation................ 38 3.2.3 TrainingSetandtheExtractedBases................. 41 3.2.4 RobustDetectionofCorners...................... 44 3.2.5 ComputationalEfficiency........................ 46 3.3Discussion..................................... 49 4 Dimensionality Reduction for SIFT Descriptors 51 4.1ConstrainedNMFforCalculatingDescriptorBases.............. 52 4.2OfflineTrainingandDimensionSelection................... 54 5 Experimental Results 57 5.1PerformanceComparisonforFeatureDetectors................ 57 5.1.1 Repeatability............................... 58 5.1.2 DatasetandtheGroundTruth..................... 59 5.1.3 ExperimentalResultsfortheRepeatability.............. 62 5.2PerformanceComparisonforFeature-basedImageComparison....... 64 5.2.1 EvaluationMetrics............................ 65 5.2.2 DatasetsandtheGroundTruth..................... 65 5.2.3 Feature-basedImageComparisonontheOxfordDataset....... 67 5.3Conclusion.................................... 70 6 Feature-based Image Comparison on WVSN Datasets 72 6.1Feature-basedImageComparisonontheMSPImageDataset........ 72 6.2Feature-basedImageComparisonontheCOIL-100Dataset......... 76 viii 6.3Discussion..................................... 81 7 Conclusions and Future Works 83 7.1SummaryofContributions............................ 83 7.2DirectionsforFutureResearch......................... 84 7.2.1 RedundancyRemovalforWVSNs................... 85 7.2.2 Super-resolutionImageReconstructioninWVSNs.......... 87 7.3ClosingRemarks................................. 90 Publications 91 Bibliography 93 Vita 100 ix List of Tables 2.1Featuredetectors................................. 28 2.2Featuredescriptors...............................
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]
  • Study and Comparison of Different Edge Detectors for Image
    Global Journal of Computer Science and Technology Graphics & Vision Volume 12 Issue 13 Version 1.0 Year 2012 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 0975-4172 & Print ISSN: 0975-4350 Study and Comparison of Different Edge Detectors for Image Segmentation By Pinaki Pratim Acharjya, Ritaban Das & Dibyendu Ghoshal Bengal Institute of Technology and Management Santiniketan, West Bengal, India Abstract - Edge detection is very important terminology in image processing and for computer vision. Edge detection is in the forefront of image processing for object detection, so it is crucial to have a good understanding of edge detection operators. In the present study, comparative analyses of different edge detection operators in image processing are presented. It has been observed from the present study that the performance of canny edge detection operator is much better then Sobel, Roberts, Prewitt, Zero crossing and LoG (Laplacian of Gaussian) in respect to the image appearance and object boundary localization. The software tool that has been used is MATLAB. Keywords : Edge Detection, Digital Image Processing, Image segmentation. GJCST-F Classification : I.4.6 Study and Comparison of Different Edge Detectors for Image Segmentation Strictly as per the compliance and regulations of: © 2012. Pinaki Pratim Acharjya, Ritaban Das & Dibyendu Ghoshal. This is a research/review paper, distributed under the terms of the Creative Commons Attribution-Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/), permitting all non-commercial use, distribution, and reproduction inany medium, provided the original work is properly cited. Study and Comparison of Different Edge Detectors for Image Segmentation Pinaki Pratim Acharjya α, Ritaban Das σ & Dibyendu Ghoshal ρ Abstract - Edge detection is very important terminology in noise the Canny edge detection [12-14] operator has image processing and for computer vision.
    [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]
  • Features Extraction in Context Based Image Retrieval
    =================================================================== Engineering & Technology in India www.engineeringandtechnologyinindia.com Vol. 1:2 March 2016 =================================================================== FEATURES EXTRACTION IN CONTEXT BASED IMAGE RETRIEVAL A project report submitted by ARAVINDH A S J CHRISTY SAMUEL in partial fulfilment for the award of the degree of BACHELOR OF TECHNOLOGY in ELECTRONICS AND COMMUNICATION ENGINEERING under the supervision of Mrs. M. A. P. MANIMEKALAI, M.E. SCHOOL OF ELECTRICAL SCIENCES KARUNYA UNIVERSITY (Karunya Institute of Technology and Sciences) (Declared as Deemed to be University under Sec-3 of the UGC Act, 1956) Karunya Nagar, Coimbatore - 641 114, Tamilnadu, India APRIL 2015 Engineering & Technology in India www.engineeringandtechnologyinindia.com Vol. 1:2 March 2016 Aravindh A S. and J. Christy Samuel Features Extraction in Context Based Image Retrieval 3 BONA FIDE CERTIFICATE Certified that this project report “Features Extraction in Context Based Image Retrieval” is the bona fide work of ARAVINDH A S (UR11EC014), and CHRISTY SAMUEL J. (UR11EC026) who carried out the project work under my supervision during the academic year 2014-2015. Mrs. M. A. P. MANIMEKALAI, M.E SUPERVISOR Assistant Professor Department of ECE School of Electrical Sciences Dr. SHOBHA REKH, M.E., Ph.D., HEAD OF THE DEPARTMENT Professor Department of ECE School of Electrical Sciences Engineering & Technology in India www.engineeringandtechnologyinindia.com Vol. 1:2 March 2016 Aravindh A S. and J. Christy Samuel Features Extraction in Context Based Image Retrieval 4 ACKNOWLEDGEMENT First and foremost, we praise and thank ALMIGHTY GOD whose blessings have bestowed in us the will power and confidence to carry out our project. We are grateful to our most respected Founder (late) Dr.
    [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]
  • Ffmpeg Filters Documentation Table of Contents
    FFmpeg Filters Documentation Table of Contents 1 Description 2 Filtering Introduction 3 graph2dot 4 Filtergraph description 4.1 Filtergraph syntax 4.2 Notes on filtergraph escaping 5 Timeline editing 6 Options for filters with several inputs (framesync) 7 Audio Filters 7.1 acompressor 7.2 acopy 7.3 acrossfade 7.3.1 Examples 7.4 acrusher 7.5 adelay 7.5.1 Examples 7.6 aecho 7.6.1 Examples 7.7 aemphasis 7.8 aeval 7.8.1 Examples 7.9 afade 7.9.1 Examples 7.10 afftfilt 7.10.1 Examples 7.11 afir 7.11.1 Examples 7.12 aformat 7.13 agate 7.14 alimiter 7.15 allpass 7.16 aloop 7.17 amerge 7.17.1 Examples 7.18 amix 7.19 anequalizer 7.19.1 Examples 7.19.2 Commands 7.20 anull 7.21 apad 7.21.1 Examples 7.22 aphaser 7.23 apulsator 7.24 aresample 7.24.1 Examples 7.25 areverse 7.25.1 Examples 7.26 asetnsamples 7.27 asetrate 7.28 ashowinfo 7.29 astats 7.30 atempo 7.30.1 Examples 7.31 atrim 7.32 bandpass 7.33 bandreject 7.34 bass 7.35 biquad 7.36 bs2b 7.37 channelmap 7.38 channelsplit 7.39 chorus 7.39.1 Examples 7.40 compand 7.40.1 Examples 7.41 compensationdelay 7.42 crossfeed 7.43 crystalizer 7.44 dcshift 7.45 dynaudnorm 7.46 earwax 7.47 equalizer 7.47.1 Examples 7.48 extrastereo 7.49 firequalizer 7.49.1 Examples 7.50 flanger 7.51 haas 7.52 hdcd 7.53 headphone 7.53.1 Examples 7.54 highpass 7.55 join 7.56 ladspa 7.56.1 Examples 7.56.2 Commands 7.57 loudnorm 7.58 lowpass 7.58.1 Examples 7.59 pan 7.59.1 Mixing examples 7.59.2 Remapping examples 7.60 replaygain 7.61 resample 7.62 rubberband 7.63 sidechaincompress 7.63.1 Examples 7.64 sidechaingate 7.65 silencedetect
    [Show full text]
  • Edge Detection 1-D &
    Edge Detection CS485/685 Computer Vision Dr. George Bebis Modified by Guido Gerig for CS/BIOEN 6640 U of Utah www.cse.unr.edu/~bebis/CS485/Lectures/ EdgeDetection.ppt Edge detection is part of segmentation image human segmentation gradient magnitude • Berkeley segmentation database: http://www.eecs.berkeley.edu/Research/Projects/CS/vision/grouping/segbench/ Goal of Edge Detection • Produce a line “drawing” of a scene from an image of that scene. Why is Edge Detection Useful? • Important features can be extracted from the edges of an image (e.g., corners, lines, curves). • These features are used by higher-level computer vision algorithms (e.g., recognition). Modeling Intensity Changes • Step edge: the image intensity abruptly changes from one value on one side of the discontinuity to a different value on the opposite side. Modeling Intensity Changes (cont’d) • Ramp edge: a step edge where the intensity change is not instantaneous but occur over a finite distance. Modeling Intensity Changes (cont’d) • Ridge edge: the image intensity abruptly changes value but then returns to the starting value within some short distance (i.e., usually generated by lines). Modeling Intensity Changes (cont’d) • Roof edge: a ridge edge where the intensity change is not instantaneous but occur over a finite distance (i.e., usually generated by the intersection of two surfaces). Edge Detection Using Derivatives • Often, points that lie on an edge are detected by: (1) Detecting the local maxima or minima of the first derivative. 1st derivative (2) Detecting the zero-crossings of the second derivative. 2nd derivative Image Derivatives • How can we differentiate a digital image? – Option 1: reconstruct a continuous image, f(x,y), then compute the derivative.
    [Show full text]
  • Edge Detection (Trucco, Chapt 4 and Jain Et Al., Chapt 5)
    Edge detection (Trucco, Chapt 4 AND Jain et al., Chapt 5) • Definition of edges -Edges are significant local changes of intensity in an image. -Edges typically occur on the boundary between twodifferent regions in an image. • Goal of edge detection -Produce a line drawing of a scene from an image of that scene. -Important features can be extracted from the edges of an image (e.g., corners, lines, curves). -These features are used by higher-levelcomputer vision algorithms (e.g., recogni- tion). -2- • What causes intensity changes? -Various physical events cause intensity changes. -Geometric events *object boundary (discontinuity in depth and/or surface color and texture) *surface boundary (discontinuity in surface orientation and/or surface color and texture) -Non-geometric events *specularity (direct reflection of light, such as a mirror) *shadows (from other objects or from the same object) *inter-reflections • Edge descriptors Edge normal: unit vector in the direction of maximum intensity change. Edge direction: unit vector to perpendicular to the edge normal. Edge position or center: the image position at which the edge is located. Edge strength: related to the local image contrast along the normal. -3- • Modeling intensity changes -Edges can be modeled according to their intensity profiles. Step edge: the image intensity abruptly changes from one value to one side of the discontinuity to a different value on the opposite side. Ramp edge: astep edge where the intensity change is not instantaneous but occur overafinite distance. Ridge edge: the image intensity abruptly changes value but then returns to the starting value within some short distance (generated usually by lines).
    [Show full text]
  • Sift Based Image Stitching
    Journal of Computing Technologies (2278 – 3814) / # 14 / Volume 3 Issue 3 SIFT BASED IMAGE STITCHING Amol Tirlotkar, Swapnil S. Thakur, Gaurav Kamble, Swati Shishupal Department of Information Technology Atharva College of Engineering, University of Mumbai, India. { amoltirlotkar, thakur.swapnil09, gauravkamble293 , shishupal.swati }@gmail.com Abstract - This paper concerns the problem of image Camera. Image stitching is one of the methods that can be stitching which applies to stitch the set of images to form used to create large image by the use of overlapping FOV a large image. The process to generate one large [8]. The drawback is the memory requirement and the panoramic image from a set of small overlapping images amount of computations for image stitching is very high. In is called Image stitching. Stitching algorithm implements this project, this problem is resolved by performing the a seamless stitching or connection between two images image stitching by reducing the amount of required key having its overlapping part to get better resolution or points. First, the stitching key points are determined by viewing angle in image. Stitched images are used in transmitting two reference images which are to be merged various applications such as creating geographic maps or together. in medical fields. Most of the existing methods of image stitching either It uses a method based on invariant features to stitch produce a ‘rough’ stitch or produce a ghosting or blur effect. image which includes image matching and image For region-based image stitching algorithm detect the image merging. Image stitching represents different stages to edge, prepare for the extraction of feature points.
    [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]
  • Edge Detection
    Edge detection Digital Image Processing, K. Pratt, Chapter 15 Edge detection • Goal: identify objects in images – but also feature extraction, multiscale analysis, 3D reconstruction, motion recognition, image restoration, registration • Classical definition of the edge detection problem: localization of large local changes in the grey level image → large graylevel gradients – This definition does not apply to apparent edges, which require a more complex definition – Extension to color images • Contours are very important perceptual cues! – They provide a first saliency map for the interpretation of image semantics Contours as perceptual cues Contours as perceptual cues What do we detect? • Depending on the impulse response of the filter, we can detect different types of graylevel discontinuities – Isolate points (pixels) – Lines with a predefined slope – Generic contours • However, edge detection implies the evaluation of the local gradient and corresponds to a (directional) derivative Detection of Discontinuities • Point Detection Detected point Detection of Discontinuities • Line detection R1 R2 R3 R4 Detection of Discontinuities • Line Detection Example: Edge detection • mage locations with abrupt I changes → differentiation → high pass filtering f[,] m n Intensity profile n m ∂ f[,] m n ∂n n Types of edges Continuous domain edge models 2D discrete domain single pixel spot models Discrete domain edge models b a Profiles of image intensity edges Types of edge detectors • Unsupervised or autonomous: only rely on local image features
    [Show full text]
  • The Analysis and Implementation of Edge Detection Algorithms in Image
    International Conference on Electromechanical Control Technology and Transportation (ICECTT 2015) The Analysis and Implementation of Edge Detection Algorithms in Image Processing Based on Matlab Yang Bao-liang1,a*, Jin Feng-ming1, b, Lei Ming-dong1,c 1Chongqing University of Arts and Sciences Chongqing 402160 P. R. China a* Email: [email protected] b Email: [email protected] c Email: [email protected] Keywords: Image processing; Edge Detection; method of differential operator Abstract: Based on machine vision image feature extraction, the main content extraction edge detection chamber features, based on the analysis of the basic theory and methods of edge detection, edge detection algorithm for several commonly used Sobel, Log and Canny, on which the algorithm is simulated by use of MA TLAB, analyzes the performance characteristics on their respective, given the various applications edge algorithm, the foundation for future engineering practice under the. Realization 1. Introduction The Feature extraction of digital image is one of the main contents of the study of image processing, the factor of point, the line and surface as the main features of the image are the hot and difficult domain of research. The edge of line image appears in irregular structure and unstable phenomenon that is mutation point of the signal, which gives the position of image profile. The profile is often some important characteristics that we need in the image edge detection, which requires us to a image edge detection and extract it. The basic idea of edge detection is to detect the edge points in the image, and accordingly connect the edge points into a profile, which then divided the region [1-3].
    [Show full text]