1 Model Fitting Hao Jiang Computer Science Department Oct 8, 2009.

Slides:



Advertisements
Similar presentations
Object Recognition from Local Scale-Invariant Features David G. Lowe Presented by Ashley L. Kapron.
Advertisements

Fitting: The Hough transform. Voting schemes Let each feature vote for all the models that are compatible with it Hopefully the noise features will not.
Tuesday, Oct 7 Kristen Grauman UT-Austin
Pedestrian Detection in Crowded Scenes Dhruv Batra ECE CMU.
Beyond bags of features: Part-based models Many slides adapted from Fei-Fei Li, Rob Fergus, and Antonio Torralba.
Fitting: The Hough transform
Lecture 5 Hough transform and RANSAC
CS 558 C OMPUTER V ISION Lecture VIII: Fitting, RANSAC, and Hough Transform Adapted from S. Lazebnik.
Beyond bags of features: Adding spatial information Many slides adapted from Fei-Fei Li, Rob Fergus, and Antonio Torralba.
1 Model Fitting Hao Jiang Computer Science Department Oct 6, 2009.
1 Image Recognition - I. Global appearance patterns Slides by K. Grauman, B. Leibe.
Image alignment.
Beyond bags of features: Adding spatial information Many slides adapted from Fei-Fei Li, Rob Fergus, and Antonio Torralba.
Lecture 10: Cameras CS4670: Computer Vision Noah Snavely Source: S. Lazebnik.
Fitting a Model to Data Reading: 15.1,
Lecture 8: Image Alignment and RANSAC
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Fitting: The Hough transform
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
Lecture 10: Robust fitting CS4670: Computer Vision Noah Snavely.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Fitting & Matching Lectures 7 & 8 – Prof. Fergus Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
Image alignment.
Fitting: The Hough transform. Voting schemes Let each feature vote for all the models that are compatible with it Hopefully the noise features will not.
Fitting & Matching Lecture 4 – Prof. Bregler Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
HOUGH TRANSFORM & Line Fitting Introduction  HT performed after Edge Detection  It is a technique to isolate the curves of a given shape / shapes.
Bag-of-features models. Origin 1: Texture recognition Texture is characterized by the repetition of basic elements or textons For stochastic textures,
Perceptual and Sensory Augmented Computing Visual Object Recognition Tutorial Visual Object Recognition Bastian Leibe & Computer Vision Laboratory ETH.
Fitting : Voting and the Hough Transform Monday, Feb 14 Prof. Kristen Grauman UT-Austin.
Object Detection 01 – Advance Hough Transformation JJCAO.
CS 1699: Intro to Computer Vision Matching and Fitting Prof. Adriana Kovashka University of Pittsburgh September 29, 2015.
Generalized Hough Transform
Fitting: Deformable contours Tuesday, September 22 th 2015 Devi Parikh Virginia Tech 1 Slide credit: Kristen Grauman Disclaimer: Many slides have been.
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
Fitting: The Hough transform
Model Fitting Computer Vision CS 143, Brown James Hays 10/03/11 Slides from Silvio Savarese, Svetlana Lazebnik, and Derek Hoiem.
EECS 274 Computer Vision Model Fitting. Fitting Choose a parametric object/some objects to represent a set of points Three main questions: –what object.
Fitting Thursday, Sept 24 Kristen Grauman UT-Austin.
1 Model Fitting Hao Jiang Computer Science Department Sept 30, 2014.
CS 1699: Intro to Computer Vision Detection II: Deformable Part Models Prof. Adriana Kovashka University of Pittsburgh November 12, 2015.
Lecture 08 27/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
A New Method for Crater Detection Heather Dunlop November 2, 2006.
Fitting : Voting and the Hough Transform Thursday, September 17 th 2015 Devi Parikh Virginia Tech 1 Slide credit: Kristen Grauman Disclaimer: Many slides.
CS 2750: Machine Learning Linear Regression Prof. Adriana Kovashka University of Pittsburgh February 10, 2016.
Hough Transform. Introduction The Hough Transform is a general technique for extracting geometrical primitives from e.g. edge data Performed after Edge.
Hough Transform CS 691 E Spring Outline Hough transform Homography Reading: FP Chapter 15.1 (text) Some slides from Lazebnik.
: Chapter 13: Finding Basic Shapes 1 Montri Karnjanadecha ac.th/~montri Image Processing.
CS 558 C OMPUTER V ISION Fitting, RANSAC, and Hough Transfrom Adapted from S. Lazebnik.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
SIFT.
Grouping and Segmentation. Sometimes edge detectors find the boundary pretty well.
CS 2770: Computer Vision Fitting Models: Hough Transform & RANSAC
SIFT Scale-Invariant Feature Transform David Lowe
Lecture 07 13/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Fitting: Voting and the Hough Transform
Fitting: The Hough transform
Exercise Class 11: Robust Tecuniques RANSAC, Hough Transform
Fitting: Voting and the Hough Transform (part 2)
Fitting: Voting and the Hough Transform April 24th, 2018
Fitting Curve Models to Edges
Image Processing, Leture #12
Prof. Adriana Kovashka University of Pittsburgh October 19, 2016
SIFT.
Finding Basic Shapes Hough Transforms
ECE734 Project-Scale Invariant Feature Transform Algorithm
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
Presentation transcript:

1 Model Fitting Hao Jiang Computer Science Department Oct 8, 2009

Hough transform for circles  For a fixed radius r, unknown gradient direction Circle: center (a,b) and radius r Image space Hough space Source: K. Grauman

Hough transform for circles  For a fixed radius r, unknown gradient direction Circle: center (a,b) and radius r Image space Hough space Intersecti on: most votes for center occur here. Source: K. Grauman

Hough transform for circles  For an unknown radius r, unknown gradient direction Circle: center (a,b) and radius r Hough space Image space b a r Source: K. Grauman

Hough transform for circles  For an unknown radius r, unknown gradient direction Circle: center (a,b) and radius r Hough space Image space b a r Source: K. Grauman

Hough transform for circles  For an unknown radius r, known gradient direction Circle: center (a,b) and radius r Hough spaceImage space θ x Source: K. Grauman

Hough transform for circles For every edge pixel (x,y) : For each possible radius value r: For each possible gradient direction θ: // or use estimated gradient a = x – r cos(θ) b = y + r sin(θ) H[a,b,r] += 1 end Source: K. Grauman

Example: detecting circles with Hough Crosshair indicates results of Hough transform, bounding box found via motion differencing. Source: K. Grauman

Original Edges Example: detecting circles with Hough Votes: Penny Note: a different Hough transform (with separate accumulators) was used for each circle radius (quarters vs. penny). Source: K. Grauman

Original Edges Example: detecting circles with Hough Votes: Quarter Coin finding sample images from: Vivek Kwatra Source: K. Grauman

General Hough Transform  Hough transform can also be used to detection arbitrary shaped object. 11 TemplateTarget

General Hough Transform  Hough transform can also be used to detection arbitrary shaped object. 12 TemplateTarget

General Hough Transform  Hough transform can also be used to detection arbitrary shaped object. 13 TemplateTarget

General Hough Transform  Hough transform can also be used to detection arbitrary shaped object. 14 TemplateTarget

General Hough Transform  Rotation Invariance 15

Example model shape Source: L. Lazebnik Say we’ve already stored a table of displacement vectors as a function of edge orientation for this model shape.

Example displacement vectors for model points Now we want to look at some edge points detected in a new image, and vote on the position of that shape.

Example range of voting locations for test point

Example range of voting locations for test point

Example votes for points with θ =

Example displacement vectors for model points

Example range of voting locations for test point

votes for points with θ = Example

Application in recognition Instead of indexing displacements by gradient orientation, index by “visual codeword” B. Leibe, A. Leonardis, and B. Schiele, Combined Object Categorization and Segmentation with an Implicit Shape ModelCombined Object Categorization and Segmentation with an Implicit Shape Model, ECCV Workshop on Statistical Learning in Computer Vision 2004 training image visual codeword with displacement vectors Source: L. Lazebnik

Application in recognition Instead of indexing displacements by gradient orientation, index by “visual codeword” test image Source: L. Lazebnik

RANSAC  RANSAC – Random Sampling Consensus  Procedure:  Randomly generate a hypothesis  Test the hypothesis  Repeat for large enough times and choose the best one 26

Line Detection 27

Line Detection 28

Line Detection 29

Line Detection 30 Count “inliers”: 7

Line Detection 31 Inlier number: 3

Line Detection 32 After many trails, we decide this is the best line.

Probability of Success  What’s the success rate of RANSAC given a fixed number of validations?  Given a success rate, how to choose the minimum number of validations? 33

Object Detection Using RANSAC 34 Template Target

Scale and Rotation Invariant Feature  SIFT (D. Lowe, UBC) 35

Stable Feature 36

Stable Feature 37 Local max/min point’s values are stable when the scale changes

SIFT 38 Filtering the image using filters at different scales. (for example using Gaussian filter)

Difference of Gaussian 39

SIFT Feature Points 40 (b) Shows the points at the local max/min of DOG scale space for the image in (a).