Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Fitting Choose a parametric object/some objects to represent a set of tokens Most.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Computer Vision - A Modern Approach Set: Probability in segmentation Slides by D.A. Forsyth Missing variable problems In many vision problems, if some.
Computer Vision - A Modern Approach Set: Model-based Vision Slides by D.A. Forsyth Recognition by Hypothesize and Test General idea –Hypothesize object.
Fitting: The Hough transform
Lecture 5 Hough transform and RANSAC
Announcements Quiz solutions on the web page. Problem Set 5 on the web page. Due Thursday, April 1. Results from Problem Set 4.
Announcements Quiz on Tuesday, March 10. Material covered (Union not Intersection) – All lectures before today (March 3). –Forsyth and Ponce Readings:
Fitting lines. Fitting Choose a parametric object/some objects to represent a set of tokens Most interesting case is when criterion is not local –can’t.
Computer Vision Fitting Marc Pollefeys COMP 256 Some slides and illustrations from D. Forsyth, T. Darrel, A. Zisserman,...
Computer Vision Fitting Marc Pollefeys COMP 256 Some slides and illustrations from D. Forsyth, T. Darrel, A. Zisserman,...
Fitting. We’ve learned how to detect edges, corners, blobs. Now what? We would like to form a higher-level, more compact representation of the features.
Segmentation Kyongil Yoon. Segmentation Obtain a compact representation of what is helpful (in the image) No comprehensive theory of segmentation Human.
Fitting: Concepts and recipes. Review: The Hough transform What are the steps of a Hough transform? What line parametrization is best for the Hough transform?
Feature Detection: Corners and Lines. Edges vs. Corners Edges = maxima in intensity gradientEdges = maxima in intensity gradient.
Fitting a Model to Data Reading: 15.1,
Fitting. Choose a parametric object/some objects to represent a set of tokens Most interesting case is when criterion is not local –can’t tell whether.
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 - A Modern Approach Set: Segmentation Slides by D.A. Forsyth Segmentation and Grouping Motivation: not information is evidence Obtain a.
Fitting.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Robust fitting Prof. Noah Snavely CS1114
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
CSE 185 Introduction to Computer Vision
Concept of Power ture=player_detailpage&v=7yeA7a0u S3A.
HOUGH TRANSFORM Presentation by Sumit Tandon
HOUGH TRANSFORM & Line Fitting Introduction  HT performed after Edge Detection  It is a technique to isolate the curves of a given shape / shapes.
Fitting : Voting and the Hough Transform Monday, Feb 14 Prof. Kristen Grauman UT-Austin.
EM and model selection CS8690 Computer Vision University of Missouri at Columbia Missing variable problems In many vision problems, if some variables.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 14/15 – TP8 Segmentation Miguel Tavares Coimbra.
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
Fitting: The Hough transform
CS654: Digital Image Analysis
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.
Course 8 Contours. Def: edge list ---- ordered set of edge point or fragments. Def: contour ---- an edge list or expression that is used to represent.
Fitting image transformations Prof. Noah Snavely CS1114
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
Model fitting ECE 847: Digital Image Processing Stan Birchfield Clemson University.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP10 Advanced Segmentation Miguel Tavares.
Fitting.
Detecting Image Features: Corner. Corners Given an image, denote the image gradient. C is symmetric with two positive eigenvalues. The eigenvalues give.
Hough Transform CS 691 E Spring Outline Hough transform Homography Reading: FP Chapter 15.1 (text) Some slides from Lazebnik.
Object Recognition. Segmentation –Roughly speaking, segmentation is to partition the images into meaningful parts that are relatively homogenous in certain.
Grouping and Segmentation. Sometimes edge detectors find the boundary pretty well.
A PRESENTATION ON JOINTS & FITTINGS PREPARED BY GOLAKIYA JATIN GUIDED BY PROFF. AESHA J. MEHTA DEPARTMENT OF CHAMICAL ENGINEERING SHREE S’AD.
Segmentation by fitting a model: Hough transform and least squares
Fitting: Voting and the Hough Transform
Miguel Tavares Coimbra
Model fitting ECE 847: Digital Image Processing Stan Birchfield
Fitting.
Line Fitting James Hayes.
Fitting: The Hough transform
Exercise Class 11: Robust Tecuniques RANSAC, Hough Transform
A special case of calibration
Fitting Curve Models to Edges
Segmentation and Grouping
Fitting.
Computer Vision - A Modern Approach
Photo by Carl Warner.
Missing variable problems
Segmentation by fitting a model: robust estimators and RANSAC
Fitting CS 678 Spring 2018.
Introduction to Sensor Interpretation
CSE 185 Introduction to Computer Vision
Introduction to Sensor Interpretation
Calibration and homographies
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
Presentation transcript:

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Fitting Choose a parametric object/some objects to represent a set of tokens Most interesting case is when criterion is not local –can’t tell whether a set of points lies on a line by looking only at each point and the next. Three main questions: –what object represents this set of tokens best? –which of several objects gets which token? –how many objects are there? (you could read line for object here, or circle, or ellipse or...)

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Fitting and the Hough Transform Purports to answer all three questions –in practice, answer isn’t usually all that much help We do for lines only A line is the set of points (x, y) such that Different choices of , d>0 give different lines For any (x, y) there is a one parameter family of lines through this point, given by Each point gets to vote for each line in the family; if there is a line that has lots of votes, that should be the line passing through the points

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth tokens votes

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Mechanics of the Hough transform Construct an array representing , d For each point, render the curve ( , d) into this array, adding one at each cell Difficulties –how big should the cells be? (too big, and we cannot distinguish between quite different lines; too small, and noise causes lines to be missed) How many lines? –count the peaks in the Hough array Who belongs to which line? –tag the votes Hardly ever satisfactory in practice, because problems with noise and cell size defeat it

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth tokens votes

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Line fitting can be max. likelihood - but choice of model is important

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Who came from which line? Assume we know how many lines there are - but which lines are they? –easy, if we know who came from which line Three strategies –Incremental line fitting –K-means –Probabilistic (later!)

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Robustness As we have seen, squared error can be a source of bias in the presence of noise points –One fix is EM - we’ll do this shortly –Another is an M-estimator Square nearby, threshold far away –A third is RANSAC Search for good points

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Too small

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Too large

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth RANSAC Choose a small subset uniformly at random Fit to that Anything that is close to result is signal; all others are noise Refit Do this many times and choose the best Issues –How many times? Often enough that we are likely to have a good line –How big a subset? Smallest possible –What does close mean? Depends on the problem –What is a good line? One where the number of nearby points is so big it is unlikely to be all outliers

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Fitting Slides by D.A. Forsyth Fitting curves other than lines In principle, an easy generalisation –The probability of obtaining a point, given a curve, is given by a negative exponential of distance squared In practice, rather hard –It is generally difficult to compute the distance between a point and a curve