Real-time motion segmentation of sparse feature points at any speed.
We present a real-time incremental approach to motion segmentation operating on sparse feature points. In contrast to previous work, the algorithm allows for a variable number of image frames to affect the segmentation process, thus enabling an arbitrary number of objects traveling at different relative speeds to be detected. Feature points are detected and tracked throughout an image sequence, and the features are grouped using a spatially constrained expectation-maximization (EM) algorithm that models the interactions between neighboring features using the Markov assumption. The primary parameter used by the algorithm is the amount of evidence that must accumulate before features are grouped. A statistical goodness-of-fit test monitors the change in the motion parameters of a group over time in order to automatically update the reference frame. Experimental results on a number of challenging image sequences demonstrate the effectiveness and computational efficiency of the technique.
Department of Electrical and Computer Engineering, Clemson University, Clemson, SC 29634-5124, USA.
Shrinivas J
SJ
Pundlik
Stanley T
ST
Birchfield
D000465:Algorithms; D001185:Artificial Intelligence; D003199:Computer Systems; D007089:Image Enhancement / Q000379:methods; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D009038:Motion; D010363:Pattern Recognition, Automated / Q000379:methods*