Reconstruct scene geometry from two or more calibrated images. scene point. image plane. Reconstruct scene geometry from two or more calibrated images

Similar documents
Targil 8 : Image warping. Forward warping. Motion Transformations and Image Warping (cont.) Automatic Image Alignment: Lucas Kanade (cont.

IMAGE SAMPLING AND IMAGE QUANTIZATION

Motion estimation. Announcements. Outline. Motion estimation

NEWTON S SECOND LAW OF MOTION

On the Spacetime Geometry of Galilean Cameras

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS

DAGM 2011 Tutorial on Convex Optimization for Computer Vision

CENG 477 Introduction to Computer Graphics. Modeling Transformations

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

STEREO PLANE MATCHING TECHNIQUE

Motion along a Line. Describing Motion along a Line

Computational Geometry in Wireless Networks - Routing. Presented by Heather M. Michaud

4.1 3D GEOMETRIC TRANSFORMATIONS

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps

M y. Image Warping. Targil 7 : Image Warping. Image Warping. 2D Geometric Transformations. image filtering: change range of image g(x) = T(f(x))

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

EECS 487: Interactive Computer Graphics

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

A METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

A Fast Stereo-Based Multi-Person Tracking using an Approximated Likelihood Map for Overlapping Silhouette Templates

Marker-less Motion Capture

Gauss-Jordan Algorithm

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.

Image Based Computer-Aided Manufacturing Technology

Announcements. Motion. Motion. Continuous Motion. Background Subtraction

Projection & Interaction

arxiv: v1 [cs.cv] 25 Apr 2017

Image warping Li Zhang CS559

Improved TLD Algorithm for Face Tracking

Optics and Light. Presentation

Real-Time Non-Rigid Multi-Frame Depth Video Super-Resolution

A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding

Detection and segmentation of moving objects in highly dynamic scenes

Visual Perception as Bayesian Inference. David J Fleet. University of Toronto

A Matching Algorithm for Content-Based Image Retrieval

Dynamic Depth Recovery from Multiple Synchronized Video Streams 1

A Face Detection Method Based on Skin Color Model

Robust Segmentation and Tracking of Colored Objects in Video

Probabilistic Detection and Tracking of Motion Discontinuities

Real Time Integral-Based Structural Health Monitoring

A MRF formulation for coded structured light

Piecewise Linear Models

Fish-Eye Camera Video Processing and Trajectory Estimation Using 3D Human Models

In Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12].

A Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.

Track-based and object-based occlusion for people tracking refinement in indoor surveillance

An Iterative Scheme for Motion-Based Scene Segmentation

1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom.

Image warping/morphing

Wiley Plus. Assignment 1 is online:

Exercise 3: Bluetooth BR/EDR

Geometry Transformation

Traditional Rendering (Ray Tracing and Radiosity)

Point Cloud Representation of 3D Shape for Laser- Plasma Scanning 3D Display

Proceeding of the 6 th International Symposium on Artificial Intelligence and Robotics & Automation in Space: i-sairas 2001, Canadian Space Agency,

Non-uniform Subdivision for B-splines of Arbitrary Degree

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves

Ray Tracing II. Improving Raytracing Speed. Improving Computational Complexity. Raytracing Computational Complexity

Geodesic, Flow Front and Voronoi Diagram

COMP26120: Algorithms and Imperative Programming

LAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation

Motion Estimation of a Moving Range Sensor by Image Sequences and Distorted Range Data

Efficient Region Tracking With Parametric Models of Geometry and Illumination

Real-time 2D Video/3D LiDAR Registration

A new algorithm for small object tracking based on super-resolution technique

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

Net Ne w t ork y La e y r Net Ne w t ork y La e y r Initial motivation: Net Ne w t ork y La e y r Net Ne w t ork y La e y r Net Ne w t ork

Evaluation and Improvement of Region-based Motion Segmentation

SENSING using 3D technologies, structured light cameras

Upper Body Tracking for Human-Machine Interaction with a Moving Camera

Research article. 1. Introduction

FACIAL ACTION TRACKING USING PARTICLE FILTERS AND ACTIVE APPEARANCE MODELS. Soumya Hamlaoui & Franck Davoine

MOTION TRACKING is a fundamental capability that

Computer representations of piecewise

Learning in Games via Opponent Strategy Estimation and Policy Search

A High-Speed Adaptive Multi-Module Structured Light Scanner

A Framework for Applying Point Clouds Grabbed by Multi-Beam LIDAR in Perceiving the Driving Environment

High Resolution Passive Facial Performance Capture

Projective geometry- 2D

Wheelchair-user Detection Combined with Parts-based Tracking

WAVE STATISTICS AND SPECTRA VIA A VARIATIONAL WAVE ACQUISITION STEREO SYSTEM

Multiple View Discriminative Appearance Modeling with IMCMC for Distributed Tracking

Characterization of Impact Damage in Composite Plates

Moving Object Detection Using MRF Model and Entropy based Adaptive Thresholding

Definition and examples of time series

FLOW VISUALIZATION USING MOVING TEXTURES * Nelson Max Lawrence Livermore National Laboratory Livermore, California

ROAD SURVEY BY KALMAN FILTER RECTIFICATION OF IMAGE SEQUENCES ACQUIRED WITH A MONOSCOPIC LOW-COST MMS

CS 450: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 2015 DR. MICHAEL J. REALE

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)

Hierarchical Stochastic Motion Blur Rasterization

THE micro-lens array (MLA) based light field cameras,

Principles of MRI EE225E / BIO265. Lecture 10. Instructor: Miki Lustig UC Berkeley, EECS. M. Lustig, EECS UC Berkeley

Assignment 2. Due Monday Feb. 12, 10:00pm.

Transcription:

Sereo and Moion The Sereo Problem Reconsrc scene geomer from wo or more calibraed images scene poin focal poin image plane Sereo The Sereo Problem Reconsrc scene geomer from wo or more calibraed images Basic Principle: Trianglaion Gives reconsrcion as inersecion of wo ras Reqires poin correspondence This is he hard par 1

Sereo Correspondence Deermine Piel Correspondence Pairs of poins ha correspond o same scene poin epipolar line epipolar plane epipolar line Epipolar Consrain Redces correspondence problem o 1D search along conjgae epipolar lines Sereo recificaion: make epipolar lines horizonal his is wha he prewarp did in view morphing Correspondence and Opical Flow Sereo reqires js 1D moion esimaion B in general he moion field is 2D Epipolar lines no known in advance Non-rigid moion (no epipolar lines) Tre moion field: projeced poin displacemens Opical flow is apparen moion in he image Generall hese will no be he same 2

3 The Aperre Problem We can measre he re 2D moion field from local image measremens Eample: Barber Pole llsion hp://www.sandloscience.com Opical Flow Eqaion Several of he following slides adaped from P. Anandan, 1999 = (,v) v d d = = = = 0 ),, ( ),, ( v δ δ δ = Assmpions Brighness Consanc: inensi of a moving poin is consan over ime Piel inensi is linear in (for small ime seps)

Normal Flow v v T = 0 Opical flow eqaion is a line consrain Normal componen can be comped Tangen componen T is ndefined negraing Neighborhood nformaion Lcas and Kanade Mehod v We wan o minimize : This corresponds o solving : i i i ( v (i.e., if poins are on a line - -js ge normal flow) 2 2 = v Mari on he lef is singlar if all gradiens poin in same direcion i ) 2 4

Limis of he Gradien Mehod Fails When No enogh variaion in local neighborhood Moion is large (mch greaer han a piel) Linear brighness assmpion is no me For larger displacemens, mach emplaes insead Define a small area arond a piel as he emplae Search locall for emplae in ne image Use a mach measre sch as correlaion, normalized correlaion, or sm-of-sqares difference (SSD) Choose he maimm (or minimm) as he mach Window size is imporan small windows lead o false maches big windows lead o over-smoohing SSD Srface Tered area 5

SSD Srface -- Edge SSD Srface homogeneos area 6

Coarse o Fine Esimaion Firs se large windows and search over large displacemen range Refine hese esimaes sing smaller windows Can do his more efficienl b sing: A PYRAMD! Seps: Convolve image wih a small kernel Tpicall 55 Gassian or Laplacian filer Sbsample o ge lower resolion image Repea for more levels Resl: A seqence of low-pass or band-pass filered images Pramids Pramids were inrodced as a mli-resolion image compaion paradigm in he earl 80s. The mos poplar pramid is he Br pramid, which foreshadows waveles Two kinds of pramids: Low pass or Gassian pramid Band-pass or Laplacian pramid 7

8

Coarse-o-Fine Flow Esimaion (Anandan) Consrc pramids from each image (Gassian) Sar a coarses level, iniialize flow o 0 1. Do local search (33 or 55 area) sing small (55) emplaes 2. Arond he peak perform sbpiel refinemen 1. Eiher analicall, sing he Lcas-Kanade formlaion or 2. Nmericall b fiing qadraic srface o he peak and inerpolaing o find he sb-piel peak 3. Warp one image oward he oher sing he flow field 4. Repea seps 1,2, and 3 a few imes (sall 5-10) 5. Projec he flow field o ne finer level 6. Move o he ne finer level and repea 1-5. Sop when o finish he ieraions a he fines level Sereo Maching Sereo Pair Qanized Deph Map normalized cross-correlaion search 9

Sereo Maching Algorihms Pifalls speclariies (non-lamberian srfaces) ambigi (aperre problem, low-conras regions) missing daa (occlsions) inensi error (qanizaion, sensor error) posiion error (camera calibraion) Nmeros approaches corse-o-fine [Anandan 89] edge-based [Marr-Poggio] dnamic programming [Baker-Binford 81] MRF s, graph cs [Zabih] adapive windows [Kanade 91] mli-baseline [Okomi 93] man more... Normalized cross-correlaion Graph cs [Zabih 99] 10

Acive Sereo (Laser Scanning) One wa o solve he aperre problem Creae or own ere b projecing ligh paerns ono he objec Mos precise wa is o se a laser Trianglae as before, b beween laser and sensor Figres b Brian Crless, 1999 Sanford s Digial Michelangelo Projec hp://graphics.sanford.ed/projecs/mich/ maimm heigh of ganr: 7.5 meers weigh inclding sbbase: 800 kilograms 11

Saisics abo he scan 480 individall aimed scans 2 billion polgons 7,000 color images 32 gigabes 30 nighs of scanning 1,080 man-hors 22 people 12