An Algorithm to Follow Arbitrarily Curved Paths Steven Kapturowski.

Slides:



Advertisements
Similar presentations
Vanishing points  .
Advertisements

Feature Based Image Mosaicing
Simultaneous surveillance camera calibration and foot-head homology estimation from human detection 1 Author : Micusic & Pajdla Presenter : Shiu, Jia-Hau.
Solving IPs – Cutting Plane Algorithm General Idea: Begin by solving the LP relaxation of the IP problem. If the LP relaxation results in an integer solution,
Chapter 9: Vector Differential Calculus Vector Functions of One Variable -- a vector, each component of which is a function of the same variable.
Analysis of Contour Motions Ce Liu William T. Freeman Edward H. Adelson Computer Science and Artificial Intelligence Laboratory Massachusetts Institute.
Beams and Frames.
Literature Review: Safe Landing Zone Identification Presented by Keith Sevcik.
Animation Following “Advanced Animation and Rendering Techniques” (chapter 15+16) By Agata Przybyszewska.
Chapter 6 Feature-based alignment Advanced Computer Vision.
Ladders, Couches, and Envelopes An old technique gives a new approach to an old problem Dan Kalman American University Fall 2007.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
Computer Vision Optical Flow
1Notes  Textbook: matchmove 6.7.2, B.9. 2 Match Move  For combining CG effects with real footage, need to match synthetic camera to real camera: “matchmove”
Segmentation into Planar Patches for Recovery of Unmodeled Objects Kok-Lim Low COMP Computer Vision 4/26/2000.
A New Block Based Motion Estimation with True Region Motion Field Jozef Huska & Peter Kulla EUROCON 2007 The International Conference on “Computer as a.
Probabilistic video stabilization using Kalman filtering and mosaicking.
Robust Lane Detection and Tracking
Tracking using the Kalman Filter. Point Tracking Estimate the location of a given point along a sequence of images. (x 0,y 0 ) (x n,y n )
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 24 Regression Analysis-Chapter 17.
Camera Calibration CS485/685 Computer Vision Prof. Bebis.
COMP 290 Computer Vision - Spring Motion II - Estimation of Motion field / 3-D construction from motion Yongjik Kim.
29 Palms Vehicle Detection (what we wanted to do).
3D Rigid/Nonrigid RegistrationRegistration 1)Known features, correspondences, transformation model – feature basedfeature based 2)Specific motion type,
Advanced Computer Vision Structure from Motion. Geometric structure-from-motion problem: using image matches to estimate: The 3D positions of the corresponding.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
Hand Signals Recognition from Video Using 3D Motion Capture Archive Tai-Peng Tian Stan Sclaroff Computer Science Department B OSTON U NIVERSITY I. Introduction.
Optical flow (motion vector) computation Course: Computer Graphics and Image Processing Semester:Fall 2002 Presenter:Nilesh Ghubade
Javad Lavaei Department of Electrical Engineering Columbia University Joint work with Somayeh Sojoudi Convexification of Optimal Power Flow Problem by.
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.
Evolving Curves/Surfaces for Geometric Reconstruction and Image Segmentation Huaiping Yang (Joint work with Bert Juettler) Johannes Kepler University of.
Empirical Modeling Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Regression analysis Control of built engineering objects, comparing to the plan Surveying observations – position of points Linear regression Regression.
1 Computational Vision CSCI 363, Fall 2012 Lecture 31 Heading Models.
Evolution-based least-squares fitting using Pythagorean hodograph spline curves Speaker: Ying.Liu November
1. Two long straight wires carry identical currents in opposite directions, as shown. At the point labeled A, is the direction of the magnetic field left,
PREPARED BY: SAMERA BINTI SAMSUDDIN SAH SEM /2012 (NOV 2011)
Lecture 9: Parametric Equations. Objectives Be able to use parametric equations to describe the motion of a point Be able to find the arclength of a curve.
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
HiQuadLoc: An RSS-Based Indoor Localization System for High-Speed Quadrotors 1 Tuo Yu*, Yang Zhang*, Siyang Liu*, Xiaohua Tian*, Xinbing Wang*, Songwu.
Bo QIN, Zongshun MA, Zhenghua FANG, Shengke WANG Computer-Aided Design and Computer Graphics, th IEEE International Conference on, p Presenter.
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
Semi-Differential Invariants for Recognition of Algebraic Curves Yan-Bin Jia and Rinat Ibrayev Department of Computer Science Iowa State University Ames,
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
A Robust Method for Lane Tracking Using RANSAC James Ian Vaughn Daniel Gicklhorn CS664 Computer Vision Cornell University Spring 2008.
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.
Efficient Roadway Modeling and Behavior Control for Real-time Simulation Hongling Wang Department Of Computer Science University of Iowa Oct. 28, 2004.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
City College of New York 1 John (Jizhong) Xiao Department of Electrical Engineering City College of New York Mobile Robot Control G3300:
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
Ship Computer Aided Design
Motion / Optical Flow II Estimation of Motion Field Avneesh Sud.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Optical flow and keypoint tracking Many slides adapted from S. Seitz, R. Szeliski, M. Pollefeys.
Model Refinement from Planar Parallax Anthony DickRoberto Cipolla Department of Engineering University of Cambridge.
CS552: Computer Graphics Lecture 18: Representing Cubic Splines.
Image Motion. The Information from Image Motion 3D motion between observer and scene + structure of the scene –Wallach O’Connell (1953): Kinetic depth.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
Robust Visual Motion Analysis: Piecewise-Smooth Optical Flow
Using Parametric Curves to Describe Motions
Analysis of Contour Motions
Optical flow and keypoint tracking
Spline representation. ❖ A spline is a flexible strip used to produce a smooth curve through a designated set of points. ❖ Mathematically describe such.
Presentation transcript:

An Algorithm to Follow Arbitrarily Curved Paths Steven Kapturowski

The Problem Given a curved path, find the appropriate movement so as to advance along the path’s center Must be able to moderate one’s speed along path so as to minimize acceleration endured by the body Should be robust to noise and missing data

Solution Concept We assume image has been preprocessed to find image points of road edges Find a best fit curve for each road side Use slope of curves to estimate vanishing point Correlate radius of curvature to maximum safe velocity

Curve Fitting Use cubic spline curve to model road edge data Reduces noise compared to working with raw data Allows data interpolation when edge regions are missing

…Curve Fitting c( )= v 1 (1 – ) 3 + v 2 (1 – ) 2 + v 3 2 (1 – ) + v 4 3 Minimize objective function: E(v 1, v 2, v 3, v 4 ) =  i |c( min,I ) - p i | 2 Currently using mean squared error (may change to weighted mean squared error as appropriate) For fixed v, |c( ) - p i | one can find min,I by numerically solving D |c( min,I ) - p i | = 0 (Quintic Polynomial) Nonlinear optimization problem

Why look at curvature?  = |  ’| 3 / { |  ’| 2 |  ’’| 2 - (  ’ ∘  ’’) 2 } 1/2   a Transverse = v 2 /  Need a Transverse < a max a = a Transverse 2 + a parallel 2

…Curvature Continued Should be able to assume ground is level with optical axis for small z This allows us to find world curvature near the camera Not completely clear what to make of image curvature when z is not small Image Plane h focus d f z

Literature Survey Significant work done on edge detection: Ref. [R] focuses on straight roads but detects boundaries in highly non-ideal conditions Several papers explore curve fitting to determine vanishing points: Ref. [MDMT] explores a road model consisting of concentric circular arcs Ref. [WTS] Considers formation of cubic and quartic spline models Little work found on velocity control and curvature measurements

Approach Paradigm Task-oriented 3D and motion based vision Recovery only of select details

Completed Work Developed road simulation model Data structures to facilitate algorithms ~75% finished with curve fitting routine

Goals (certain to complete) Program vanishing point detection Continue investigating relationship between image curvature and world curvature Test algorithms with incomplete and noisy data

Goals (if time permits) Relax idealized parameters Test on real world data Add lane constraints Compare results with different road models Explore hybrid road models

References [WTS] Wang, Y., Teoh, E.K., & Shen, D.“Lane detection and tracking using B-Snake” Image and Vision Computing 22 (2004) [MDMT] Morgan, A.D., Dagless, E.L., Milford, D.J., Thomas, B.T. “Road Edge Tracking for Robot Road Following” Image and Vision Computing 8(3) (1990) [PS] Plass, M., Stone, M. “Curve-fitting with Piecewise Parametric Cubics” Computer Graphics 17(3) (1983) [R] Rasmussen, C. “Grouping Dominant Orientations for Ill- Structured Road Following” Computer Vision and Pattern Recognition, Proceedings of the 2004 IEEE Computer Society Conference on

…Curvature Continued Possible Approach: Knowing curvature near camera gives maximum speed Can’t change speed instantaneously: a Total = {(v 2 /  ) 2 + (∆v/∆t) 2 } 1/2, where v = (v 1 +v 2 )/2, ∆v = v 2 - v 1 Quartic equation for v 2 (has exact solution, though even this could be much simplified under certain assumptions) Correspond high curvature points between images Find time to collision with image plane