Periodic Motion Detection via Approximate Sequence Alignment Ivan Laptev*, Serge Belongie**, Patrick Perez* *IRISA/INRIA, Rennes, France **Univ. of California,

Slides:



Advertisements
Similar presentations
3D Model Matching with Viewpoint-Invariant Patches(VIP) Reporter :鄒嘉恆 Date : 10/06/2009.
Advertisements

The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Space-time interest points Computational Vision and Active Perception Laboratory (CVAP) Dept of Numerical Analysis and Computer Science KTH (Royal Institute.
Two-View Geometry CS Sastry and Yang
Matching with Invariant Features
Local Descriptors for Spatio-Temporal Recognition
3D Computer Vision and Video Computing 3D Vision Topic 4 of Part II Visual Motion CSc I6716 Fall 2011 Cover Image/video credits: Rick Szeliski, MSR Zhigang.
Scene Planes and Homographies class 16 Multiple View Geometry Comp Marc Pollefeys.
1 Interest Operators Find “interesting” pieces of the image –e.g. corners, salient regions –Focus attention of algorithms –Speed up computation Many possible.
Today Feature Tracking Structure from Motion on Monday (1/29)
Motion based Correspondence for Distributed 3D tracking of multiple dim objects Ashok Veeraraghavan.
1 Interest Operator Lectures lecture topics –Interest points 1 (Linda) interest points, descriptors, Harris corners, correlation matching –Interest points.
Video: savior, or “more of the same”? : Learning-Based Methods in Vision A. Efros, CMU, Spring 2009 © A.A. Efros.
Computing motion between images
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
CSc83029 – 3-D Computer Vision/ Ioannis Stamos 3-D Computational Vision CSc Optical Flow & Motion The Factorization Method.
Synchronization and Calibration of Camera Networks from Silhouettes Sudipta N. Sinha Marc Pollefeys University of North Carolina at Chapel Hill, USA.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Two-view geometry Epipolar geometry F-matrix comp. 3D reconstruction Structure comp.
Independent Motion Estimation Luv Kohli COMP Multiple View Geometry May 7, 2003.
COMP 290 Computer Vision - Spring Motion II - Estimation of Motion field / 3-D construction from motion Yongjik Kim.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
3D Computer Vision and Video Computing 3D Vision Topic 8 of Part 2 Visual Motion (II) CSC I6716 Spring 2004 Zhigang Zhu, NAC 8/203A
Epipolar geometry Class 5. Geometric Computer Vision course schedule (tentative) LectureExercise Sept 16Introduction- Sept 23Geometry & Camera modelCamera.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
Automatic Camera Calibration
Overview Introduction to local features
Computer vision: models, learning and inference
Action recognition with improved trajectories
IRISA / INRIA Rennes Computational Vision and Active Perception Laboratory (CVAP) KTH (Royal Institute of Technology)
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Brief Introduction to Geometry and Vision
Linearizing (assuming small (u,v)): Brightness Constancy Equation: The Brightness Constraint Where:),(),(yxJyxII t  Each pixel provides 1 equation in.
The Brightness Constraint
The Measurement of Visual Motion P. Anandan Microsoft Research.
Example: line fitting. n=2 Model fitting Measure distances.
CSCE 643 Computer Vision: Structure from Motion
Correspondence-Free Determination of the Affine Fundamental Matrix (Tue) Young Ki Baik, Computer Vision Lab.
Robot Vision SS 2007 Matthias Rüther 1 ROBOT VISION Lesson 6a: Shape from Stereo, short summary Matthias Rüther Slides partial courtesy of Marc Pollefeys.
© 2005 Martin Bujňák, Martin Bujňák Supervisor : RNDr.
Computing F. Content Background: Projective geometry (2D, 3D), Parameter estimation, Algorithm evaluation. Single View: Camera model, Calibration, Single.
Communication Systems Group Technische Universität Berlin S. Knorr A Geometric Segmentation Approach for the 3D Reconstruction of Dynamic Scenes in 2D.
Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Evaluation and comparison.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
Lecture 9 Feature Extraction and Motion Estimation Slides by: Michael Black Clark F. Olson Jean Ponce.
Linearizing (assuming small (u,v)): Brightness Constancy Equation: The Brightness Constraint Where:),(),(yxJyxII t  Each pixel provides 1 equation in.
Structure from Motion Paul Heckbert, Nov , Image-Based Modeling and Rendering.
776 Computer Vision Jan-Michael Frahm Spring 2012.
Multi-view Synchronization of Human Actions and Dynamic Scenes Emilie Dexter, Patrick Pérez, Ivan Laptev INRIA Rennes - Bretagne Atlantique
Model Refinement from Planar Parallax Anthony DickRoberto Cipolla Department of Engineering University of Cambridge.
Automatic 3D modelling of Architecture Anthony Dick 1 Phil Torr 2 Roberto Cipolla 1 1 Department of Engineering 2 Microsoft Research, University of Cambridge.
Linearizing (assuming small (u,v)): Brightness Constancy Equation: The Brightness Constraint Where:),(),(yxJyxII t  Each pixel provides 1 equation in.
776 Computer Vision Jan-Michael Frahm Spring 2012.
Reconstruction of a Scene with Multiple Linearly Moving Objects Mei Han and Takeo Kanade CISC 849.
Segmentation of Dynamic Scenes
The Brightness Constraint
Presented by Omer Shakil
Paper Presentation: Shape and Matching
Homography From Wikipedia In the field of computer vision, any
3D Photography: Epipolar geometry
Multiple View Geometry Comp Marc Pollefeys
Features Readings All is Vanity, by C. Allan Gilbert,
The Brightness Constraint
The Brightness Constraint
CSE 455 – Guest Lectures 3 lectures Contact Interest points 1
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Computational Photography
Presented by Xu Miao April 20, 2005
Presentation transcript:

Periodic Motion Detection via Approximate Sequence Alignment Ivan Laptev*, Serge Belongie**, Patrick Perez* *IRISA/INRIA, Rennes, France **Univ. of California, San Diego, USA May 9-10, 2005

Motivation Dominant motion estimation Works very well for a panning camera and static backgrounds Problems for scenes with motion parallax and multiple motions

Motivation Dominant motion estimation Works very well for a panning camera and static backgrounds Problems for scenes with motion parallax and multiple motions

Motivation Assumptions about background motion e.g. Homography:  Target == Outlier Assumptions about target motion Detect motion of specific type (Target == Inlier) - more difficult than for dominant motion - may have advantages in complex scenes Here: the type of target motion --- periodic

Periodic motion Periodic views can be approximately treated as stereopairs

Periodic motion Periodic views can be approximately treated as stereopairs Fundamental matrix is generally time-dependent  Periodic motion estimation ~ sequence alignment

Sequence alignment Generally hard problem Unknown positions and motions of cameras Unknown temporal offset Possible time warping Prior work treats special cases Caspi and Irani “Spatio-temporal alignment of sequences”, PAMI 2002 Rao et.al. “View-invariant alignment and matching of video sequences”, ICCV 2003 Tuytelaars and Van Gool “Synchronizing video sequences”, CVPR 2004 Useful in Reconstruction of dynamic scenes Recognition of dynamic scenes

Assumptions Constant translation Assume the camera is translating with velocity relatively to the object  For sequences corresponding points are related by  All corresponding periodic points are on the same epipolar line Points with non-constant motion Rejects trivial case of pure translation Can be detected by maximizing local variation of space-time gradients (Laptev and Lindeberg, IJCV 2005)

Space-time interest points c1 c2 c3 c4 Second-moment matrix Local maxima of H over (x,y,t) Detected points Points with similar neighborhoods

Periodic motion detection 1.Corresponding points have similar descriptors 2. Same period for all features 3. Spatial arrangement of features across periods satisfy epipolar constraint:  Use RANSAC to estimate F and p

Periodic motion detection Original space-time features RANSAC estimation of F,p

Periodic motion detection Original space-time features RANSAC estimation of F,p

Periodic motion detection Original space-time features RANSAC estimation of F,p

Periodic motion detection Original space-time features RANSAC estimation of F,p

Periodic motion segmentation Assume periodic objects are planar  Periodic points can be related by a dynamic homography: linear in time

Periodic motion segmentation Assume periodic objects are planar  Periodic points can be related by a dynamic homography:  RANSAC estimation of H and p linear in time

Object-centered stabilization

Segmentation Disparity estimation Graph-cut segmentation

Segmentation

Conclusion Direct method for periodic motion detection and segmentation Constant translation assumption might be relaxed by tracking the modeling H and F as non-linear matrix functions Extension to non-periodic motion recognition via sequence alignment using corresponding space- time points

Segmentation