This paper presents an iterative maximum likelihood framework for motion segmentation. Our representation of the segmentation problem is based on a similarity matrix for the motion vectors for pairs of pixel blocks. By applying eigendecomposition to the similarity matrix, we develop a maximum likelihood method for grouping the pixel blocks into objects which share a common motion vector. We experiment with the resulting clustering method on a number of real-world motion sequences. Here ground truth data indicates that the method can result in motion classification errors as low as 3%.
Maximum likelihood motion segmentation using eigendecomposition
2001-01-01
645813 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Maximum Likelihood Motion Segmentation Using Eigendecomposition
British Library Conference Proceedings | 2001
|A Maximum Likelihood Framework for Iterative Eigendecomposition
British Library Conference Proceedings | 2001
|Gravity Gradient Tensor Eigendecomposition for Spacecraft Positioning
Online Contents | 2015
|