January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.1 Image Measurements and Detection Davi Geiger

Slides:



Advertisements
Similar presentations
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Advertisements

Computer Vision Lecture 18: Object Recognition II
Computer Vision Lecture 16: Texture
Computer Vision Lecture 16: Region Representation
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
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
© 2004 by Davi GeigerComputer Vision January 2004 L1.1 Image Measurements and Detection.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
Edge detection. Edge Detection in Images Finding the contour of objects in a scene.
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
© 2002 by Davi GeigerComputer Vision September 2002 L1.1 Feature Detection.
Edge Detection Today’s reading Forsyth, chapters 8, 15.1
Segmentation (Section 10.2)
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Neighborhood Operations
National Center for Supercomputing Applications University of Illinois at Urbana-Champaign Image Features Kenton McHenry, Ph.D. Research Scientist.
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
Lecture 2: Edge detection CS4670: Computer Vision Noah Snavely 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.
Phase Congruency Detects Corners and Edges Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
AdeptSight Image Processing Tools Lee Haney January 21, 2010.
M. Elena Martinez-Perez, Alun D. Hughes, Simon A. Thom, Anil A. Bharath, Kim H. Parker Medical Image Analysis 11 (2007) 47–61 黃銘哲 2010/11/9 1.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
Image Segmentation and Edge Detection Digital Image Processing Instructor: Dr. Cheng-Chien LiuCheng-Chien Liu Department of Earth Sciences National Cheng.
A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.
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,
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Image Segmentation by Histogram Thresholding Venugopal Rajagopal CIS 581 Instructor: Longin Jan Latecki.
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
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.
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
Image Features (I) Dr. Chang Shu COMP 4900C Winter 2008.
Instructor: Mircea Nicolescu Lecture 10 CS 485 / 685 Computer Vision.
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.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
Edge Detection slides taken and adapted from public websites:
CS262: Computer Vision Lect 09: SIFT Descriptors
Mean Shift Segmentation
Computer Vision Lecture 12: Image Segmentation II
Edge Detection CS 678 Spring 2018.
Fitting Curve Models to Edges
Jeremy Bolton, PhD Assistant Teaching Professor
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
Dr. Chang Shu COMP 4900C Winter 2008
Computer Vision Lecture 16: Texture II
From a presentation by Jimmy Huff Modified by Josiah Yoder
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
T. J. Okamoto (NAOJ/Kyoto Univ.)
Lecture 2: Edge detection
Edge Detection Today’s reading
Fourier Transform of Boundaries
Lecture 2: Edge detection
Presented by Xu Miao April 20, 2005
IT472 Digital Image Processing
IT472 Digital Image Processing
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Presentation transcript:

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.1 Image Measurements and Detection Davi Geiger

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.2 Images are Intensity Surfaces and Edges are Intensity Discontinuities I 1 (x, y) I 2 (x, y)

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.3 //  /4  /3  /6  /3 // //  s=3 pixels s=7 pixels Discrete approximation

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.4 //  /4  /3  /6  /3 // // , where Removing the center pixel:

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.5  /4 s=3 s=5  /3  /6 s=5 s=3 s=5 s=3 s=5 s=7 s=3 for  for  for  In order to obtain more robust measures, for an angle , we can average the value of along  to obtain

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.6 Taking the derivative along the angle  i.e., in a direction Analogously, we obtain. We now have a bank of sixteen (16) distinct oriented filters at different scales, namely { ;  and s . will have maximum response (highest value) among the possible orientations, while will have the minimum response.  / 3  

January 19, 2006Computer Vision © 2006 Davi GeigerLecture

January 19, 2006Computer Vision © 2006 Davi GeigerLecture

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.9  /3  /6 Corners and Junctions will respond to high values of at distant locations from the center. The maximum responses here among the different  are and  

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.10 The Hessian allows for computing the second derivative. In order to compute the (second) derivative along the direction  of a (first) derivative along a direction  we compute the projections For example, for we obtain and for we obtain Measurements: 2 nd Derivatives

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.11 In order to compute the (second) derivative along a direction  of a (first) derivative along a direction  we obtain a continuous and a lattice approximation as   x y Measurements: 2 nd Derivatives (cont.)

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.12 Features such as edges, corners, junction, and eyes are obtained by making some decision from the image measurements. Decisions are the result of some comparison followed by a choice. Examples: (i) if a measurement is above a threshold, we accept; otherwise, we reject; (ii) if a measurement is the largest compared to others, we select it. Image Features – Decisions!

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.13 Edge threshold: Decision! Edge orientation: Decision! A step edge at  The value is (equally) large for both  and  as shown (in red) for the scale s = 3 pixels. It is also large for values  not shown  However, the quantity is significantly larger for  Decisions: Edgels (Edge-pixels and Orientation)

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.14 The gray level indicates the angle: the darkest one is 0 degrees. The larger the angle, the lighter its color, up to  Strength of the Edgel Edgel(x, y) if else Nil Decisions: Edgels (cont.)

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.15 Decisions: Connecting Edgels (Pseudocode)  max ( x c, y c )

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.16 Decisions: Connecting Edgels (Pseudocode)

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.17 We have considered at least four parameters: How to estimate them? One technique is Histogram partitioning: plot the histogram and find the parameter that “best partitions it”. Threshold Parameters: Estimation

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.18 Angle change y x A contour segment is the contour curvature multiplied by the arc length, where Decisions: Local Angle Change

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.19 Curvature of Isocontour

January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.20 Curvature of Isocontour (cont.)