Image Processing, Lecture #10

Slides:



Advertisements
Similar presentations
Computational Biology, Part 23 Biological Imaging II Robert F. Murphy Copyright  1996, 1999, All rights reserved.
Advertisements

Spatial Filtering (Chapter 3)
EDGE DETECTION.
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Segmentation (2): edge detection
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
Lecture 4 Edge Detection
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.
CS 376b Introduction to Computer Vision 02 / 27 / 2008 Instructor: Michael Eckmann.
Canny Edge Detector1 1)Smooth image with a Gaussian optimizes the trade-off between noise filtering and edge localization 2)Compute the Gradient magnitude.
1 Lecture 12 Neighbourhood Operations (2) TK3813 DR MASRI AYOB.
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.
Chapter 10: Image Segmentation
Neighborhood Operations
National Center for Supercomputing Applications University of Illinois at Urbana-Champaign Image Features Kenton McHenry, Ph.D. Research Scientist.
06 - Boundary Models Overview Edge Tracking Active Contours Conclusion.
Spatial Filtering: Basics
Edge Detection (with implementation on a GPU) And Text Recognition (if time permits) Jared Barnes Chris Jackson.
University of Kurdistan Digital Image Processing (DIP) Lecturer: Kaveh Mollazade, Ph.D. Department of Biosystems Engineering, Faculty of Agriculture,
0 - 1 © 2007 Texas Instruments Inc, Content developed in partnership with Tel-Aviv University From MATLAB ® and Simulink ® to Real Time with TI DSPs Edge.
: Chapter 8: Edge Detection 1 Montri Karnjanadecha ac.th/~montri Image Processing.
CS654: Digital Image Analysis Lecture 24: Introduction to Image Segmentation: Edge Detection Slide credits: Derek Hoiem, Lana Lazebnik, Steve Seitz, David.
EE 4780 Edge Detection.
CSC508 Convolution Operators. CSC508 Convolution Arguably the most fundamental operation of computer vision It’s a neighborhood operator –Similar to the.
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.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
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.
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.
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.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Concept 1: Computing Weighted Sum. Is an operation between two tables of numbers, usually between an image and weights. Typically, if one table is smaller,
Miguel Tavares Coimbra
Cascade for Fast Detection
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering Northern Arizona University.
Chapter 10 Image Segmentation
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Detection of discontinuity using
Lit part of blue dress and shadowed part of white dress are the same color
Mean Shift Segmentation
Fourier Transform: Real-World Images
Fitting Curve Models to Edges
Image Processing, Leture #12
Computer Vision Lecture 9: Edge Detection II
Levi Smith REU Week 1.
Dr. Chang Shu COMP 4900C Winter 2008
Computer Vision Lecture 16: Texture II
Lecture 10 Image sharpening.
9th Lecture - Image Filters
From a presentation by Jimmy Huff Modified by Josiah Yoder
پردازش تصاویر دیجیتال- احمدی فرد
Spatial operations and transformations
Canny Edge Detector.
: Chapter 8: Edge Detection
Linear Operations Using Masks
Finding Basic Shapes Hough Transforms
Canny Edge Detector Smooth image with a Gaussian
Image Filtering with GLSL
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Spatial operations and transformations
FREQUENTLY USED 3x3 CONVOLUTION KERNELS
Presentation transcript:

240-373 Image Processing, Lecture #10 Basic Edge Detection Edge detection, ideally, identifies all the lines that outline the objects in an image. Template for edge detection: Y_difference(x,y) = value(x,y) - value(x,y+1) This is equivalent to convolving with image with a 2x1 template 1 -1 X_difference(x,y) = value(x,y) - value(x-1,y) use the template -1 1 Once X_difference and Y_difference are computed to create the single measurement of “gradient magnitude” (strength of the edge) It is also useful to divide Y_difference by X_difference and identify a gradient direction (the angle of the edge between the regions) 02/01/62 240-373 Image Processing, Lecture #10

240-373 Image Processing, Lecture #10 Example Image X_difference Y_difference Gradient Direction 1 1 1 1 1 0 0 0 0 * 0 0 0 0 0 * * * * * 1 1 1 1 1 0 0 0 0 * 0 0 0 1 1 * * * 1 1 1 0 0 0 0 -1 0 * 0 0 1 0 0 * * * * 1 1 0 0 0 0 -1 0 0 * 0 0 0 0 0 * * * * 1 1 0 0 0 0 -1 0 0 * * * * * * * * * * Technique 4: Sobel edge detection The Sobel 3 x 3 templates are normally given as X-direction Y-direction -1 0 1 1 2 1 -2 0 2 0 0 0 -1 0 1 -1 -2 -1 Example Image abs A + abs B Threshold at 12 02/01/62 240-373 Image Processing, Lecture #10

240-373 Image Processing, Lecture #10 02/01/62 240-373 Image Processing, Lecture #10

240-373 Image Processing, Lecture #10 02/01/62 240-373 Image Processing, Lecture #10

240-373 Image Processing, Lecture #10 02/01/62 240-373 Image Processing, Lecture #10

Second-order edge detection An image such as The basic Sobel vertical edge operator yields Applying the edge operator again yields This is similar to the differentiation operator applied to a straight line, e.g. if y = 3x - 2, then Laplacian template 02/01/62 240-373 Image Processing, Lecture #10

Pyramid Edge Detection Technique 5: Pyramid edge detection USE: To enhance substantial (strong and long) edges but to ignore the weak or short edges THEORY: The image is cut down to quarter Each pixel in the quarter-size image is an average of the four corresponding pixels in the full-size image This repeats until unwanted edges are invisible An edge detector is applied to the smallest image and where edge pixels have been found, an edge detector is applied to the corresponding four pixels in the next largest image OPERATION: Create a second image of size m/2 x n/2 by evaluating for each 0 < i < m and 0< j < n This is repeat and each generated image is kept With the smallest image, perform some edge detection--such as Sobel In pixels where edges are discovered, perform as edge detection operation on the group of four corresponding pixels in the next largest image Continue to find the best edges down through the pyramid of images until the main edges in the original image have been discovered 02/01/62 240-373 Image Processing, Lecture #10

240-373 Image Processing, Lecture #10 Edge Following Technique 7: Simple edge following USE: Knowing that a pixel is on an edge, the edge will be followed so that an objected is outlined OPERATION: Suppose that t position on the edge has been identified, call it (x,y) and flag this position as used Evaluate all the 3x3 Sobel gradient values centered on each of the eight pixels surrounding (x,y) Choose the three pixels with the greatest absolute gradient magnitude Put these three pixel in a three-column array Order them in row according to the gradient magnitude Choose the one with greatest gradient magnitude Now this pixel will be one of the direction 0-7 with respect to the pixel (x,y) given by the following map, where * is the position of pixel (x,y) 0 1 2 7 * 3 6 5 4 Call the direction of travel d Repeat the algorithm but look at only pixels in d, (d+1) mod 8, and (d-1) mod 8 directions If no suitable high value of gradient magnitude is found, remove the pixel from the list and choose the next one of the three stored. Move up one row if all three are removed Stop when the original pixel is reached, or execution has gone too long, or the number of rows in the list is very large 02/01/62 240-373 Image Processing, Lecture #10