We propose a motion segmentation algorithm that aims to break a scene into its most prominent moving groups. A weighted graph is constructed on the image sequence by connecting pixels that are in the spatiotemporal neighborhood of each other. At each pixel, we define motion profile vectors which capture the probability distribution of the image velocity. The distance between motion profiles is used to assign a weight on the graph edges. Using normalised cuts we find the most salient partitions of the spatiotemporal graph formed by the image sequence. For segmenting long image sequences, we have developed a recursive update procedure that incorporates knowledge of segmentation in previous frames for efficiently finding the group correspondence in the new frame.
Motion segmentation and tracking using normalized cuts
1998-01-01
1067623 byte
Conference paper
Electronic Resource
English
Motion Segmentation and Tracking using Normalized Cuts
British Library Conference Proceedings | 1998
|Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints
British Library Online Contents | 2011
|Genetic cuts for image segmentation
British Library Online Contents | 2014
|