What went where

Research output: Contribution to journalConference articleResearchpeer-review

We present a novel framework for motion segmentation that combines the concepts of layer-based methods and feature-based motion estimation. We estimate the initial correspondences by comparing vectors of filter outputs at interest points, from which we compute candidate scene relations via random sampling of minimal subsets of correspondences. We achieve a dense, piecewise smooth assignment of pixels to motion layers using a fast approximate graph-cut algorithm based on a Markov random field formulation. We demonstrate our approach on image pairs containing large inter-frame motion and partial occlusion. The approach is efficient and it successfully segments scenes with inter-frame disparities previously beyond the scope of layer-based motion segmentation methods.

Original languageEnglish
JournalProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Volume1
Pages (from-to)I/37-I/44
ISSN1063-6919
Publication statusPublished - 2003
Externally publishedYes
Event2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Madison, WI, United States
Duration: 18 Jun 200320 Jun 2003

Conference

Conference2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
CountryUnited States
CityMadison, WI
Period18/06/200320/06/2003
SponsorIEEE Computer Society TCPAMI

ID: 302056514