Introduction to Sensor Interpretation

Slides:



Advertisements
Similar presentations
Kin 304 Regression Linear Regression Least Sum of Squares
Advertisements

Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Feature Matching and Robust Fitting Computer Vision CS 143, Brown James Hays Acknowledgment: Many slides from Derek Hoiem and Grauman&Leibe 2008 AAAI Tutorial.
Uncertainty Representation. Gaussian Distribution variance Standard deviation.
Multiple View Geometry
Computer Vision Fitting Marc Pollefeys COMP 256 Some slides and illustrations from D. Forsyth, T. Darrel, A. Zisserman,...
Robust Estimator 學生 : 范育瑋 老師 : 王聖智. Outline Introduction LS-Least Squares LMS-Least Median Squares RANSAC- Random Sample Consequence MLESAC-Maximum likelihood.
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.
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.
Lecture 8: Image Alignment and RANSAC
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.
1Jana Kosecka, CS 223b EM and RANSAC EM and RANSAC.
Simple Linear Regression. Introduction In Chapters 17 to 19, we examine the relationship between interval variables via a mathematical equation. The motivation.
Fitting.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
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
Chapter 6 Feature-based alignment Advanced Computer Vision.
Computer Vision - Fitting and Alignment
Stats for Engineers Lecture 9. Summary From Last Time Confidence Intervals for the mean t-tables Q Student t-distribution.
Model Building III – Remedial Measures KNNL – Chapter 11.
1 Robust estimation techniques in real-time robot vision Ezio Malis, Eric Marchand INRIA Sophia, projet ICARE INRIA Rennes, projet Lagadic.
Fitting and Registration Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/14/12.
1 Multiple Regression A single numerical response variable, Y. Multiple numerical explanatory variables, X 1, X 2,…, X k.
EECS 274 Computer Vision Model Fitting. Fitting Choose a parametric object/some objects to represent a set of points Three main questions: –what object.
Computer Vision - Fitting and Alignment (Slides borrowed from various presentations)
Radial Basis Function ANN, an alternative to back propagation, uses clustering of examples in the training set.
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.
CSE 185 Introduction to Computer Vision Feature Matching.
1/17/2016CS225B Kurt Konolige Probabilistic Models of Sensing and Movement Move to probability models of sensing and movement Project 2 is about complex.
CS 2750: Machine Learning Linear Regression Prof. Adriana Kovashka University of Pittsburgh February 10, 2016.
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Robust Estimation Course web page: vision.cis.udel.edu/~cv April 23, 2003  Lecture 25.
Fitting.
Line fitting.
Grouping and Segmentation. Sometimes edge detectors find the boundary pretty well.
ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.
Simple Linear Regression
Regression Analysis AGEC 784.
AP Statistics Chapter 14 Section 1.
LECTURE 11: Advanced Discriminant Analysis
Robot & Vision Lab. Wanjoo Park (revised by Dong-eun Seo)
Fitting.
Line Fitting James Hayes.
Detection of discontinuity using
Kin 304 Regression Linear Regression Least Sum of Squares
Exercise Class 11: Robust Tecuniques RANSAC, Hough Transform
A Brief Introduction of RANSAC
Lecture 7: Image alignment
BPK 304W Regression Linear Regression Least Sum of Squares
CS 2750: Machine Learning Linear Regression
A special case of calibration
Fitting Curve Models to Edges
Features Readings All is Vanity, by C. Allan Gilbert,
Fitting.
Photo by Carl Warner.
Photo by Carl Warner.
Segmentation by fitting a model: robust estimators and RANSAC
Fitting CS 678 Spring 2018.
5.4 General Linear Least-Squares
Hough Transform.
Introduction to Sensor Interpretation
CSE 185 Introduction to Computer Vision
Calibration and homographies
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
Parameter estimation class 6
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
Presentation transcript:

Introduction to Sensor Interpretation What is “sensor interpretation”? - abstraction of high-dimensional input spaces to low-dimensional output spaces - interpreting reduced data according to the task at hand Why interpret sensors? - working with large datasets is expensive - smoothing and filtering based on models can yield better results in applications From Ziegler et al., 3D Reconstruction Using Labeled Image Regions 6/2/2019 CS225B Kurt Konolige

A General View of Sensor Interpretation Measurements Features [filtering, data reduction] Model Fit [robust techniques, outlier rejection] Interpretation Features Dimensionality reduction of the data Models A model is a mathematical description of the abstract feature, controlled by a few parameters Interpretation How can the modeled data be interpreted to perform a task? 6/2/2019 CS225B Kurt Konolige

Some Issues Models Sensor Noise A model is a mathematical description of the abstract feature, controlled by a few parameters Sensor Noise Noise is the deviation of a sensor reading from its ideal value Noise complicates the process of feature extraction, and makes probabilistic techniques useful Graphs from Guo, A Multiple-Line Fitting Algorithm without Initialization 6/2/2019 CS225B Kurt Konolige

Some Issues Segmentation Outliers / Data association What is the important part or parts of a set of sensor readings? Figure/ground distinction [Edgar Rubin] Outliers / Data association Some readings are not associated with the feature at all, and do not correspond to normal noise values [Roger Shepard] Graph from Guo, A Multiple-Line Fitting Algorithm without Initialization 6/2/2019 CS225B Kurt Konolige

Techniques: Maximum Likelihood Maximum Likelihood Method [Linear Regression] Measurement function Independent measurements zi with value Gaussian distribution of error, with the same variance for each zi THEN – maxx p(x|z) is given by Line parameters: slope, intercept Measurement equation: s,i x 6/2/2019 CS225B Kurt Konolige

Techniques: Maximum Likelihood Maximum Likelihood Issues Which model? - some are better than others What is a good measure of fit? How many line segments? Outliers – Gaussian assumption means outliers pull a lot of weight Solutions are in robust statistics Ignore high residuals Least Median of Squares [Rousseeuw] Consensus estimators Unequal Variance Some measurements should count more more than others Mahalanobis distance: s,i x 6/2/2019 CS225B Kurt Konolige

Techniques: Hough Transform Slope/intercept parameterization of a line A point in (a,d) represents a line in (x,y) For a give point (x,y), there is a family of lines going through the point – a curve in (a,d) From T. Darrell course notes 6/2/2019 CS225B Kurt Konolige

Techniques: Hough Transform Issues Representing curves in (a,d) – typically use a grid of cells For each point in (x,y), increment the count in corresponding cells Find loci Noise, resolution, and computation are problems From T. Darrell course notes 6/2/2019 CS225B Kurt Konolige

Techniques: RANSAC [Fischler and Bolles] RANdom SAmple Consensus Uses consensus to determine data association Uses random sampling to find “seeds” for consensus Robust to outliers Can find multiple features How many pairs must we pick before we find a good line? 6/2/2019 CS225B Kurt Konolige

Techniques: RANSAC [Fischler and Bolles] Algorithm Function f(x) = y for finding a model y from a set of data points x of size n (e.g., in the case of lines, two or more points) Choose a random set x Find all inliers to model y Accept if inliers > threshold (maybe replace previous model, or add to models if using multiple models) Iterate for some number k How many pairs must we pick before we find a good line? z is the probability of only bad picks k is chosen based on z 6/2/2019 CS225B Kurt Konolige

Techniques: Incremental/Recursive Line Fitting Order points along the curve Start with a straight line connecting the first and last points Find point with max distance Split and apply algorithm to each segment Incremental Line Fitting Order points along the curve Add next few points to a new line Fit line and check residual If residual is good, add next point and re-fit If residual is bad, declare line done and start a new line 6/2/2019 CS225B Kurt Konolige

Techniques: Incremental Line Fitting From T. Darrell course notes 6/2/2019 CS225B Kurt Konolige