A tensor decomposition for geometric grouping and segmentation

• Published in: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) Vol. 1; pp. 1150 - 1157 vol. 1
• Main Author: Govindu, V.M.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Clustering algorithms; Clustering methods; Computer vision; Data analysis; Information geometry; Laplace equations; Matrix decomposition; Motion segmentation; Tensile stress; Venus
• ISBN: 0769523722; 9780769523729
• ISSN: 1063-6919; 1063-6919
• DOI: 10.1109/CVPR.2005.50

While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matrix. However many geometric problems with parametric forms require more than two observations to estimate a similarity measure, e.g. epipolar geometry. In such cases we can only define the probability of belonging to the same cluster for an n-tuple of points and not just a pair, leading to an n-dimensional probability tensor. However spectral clustering methods are not available for tensors. In this paper we present an algorithm to infer a similarity matrix by decomposing the n-dimensional probability tensor. Our method exploits the super-symmetry of the probability tensor to provide a randomised scheme that does not require the explicit computation of the probability tensor. Our approach is fast and accurate and its applicability is illustrated on two significant problems, namely perceptually salient geometric grouping and parametric motion segmentation (like affine, epipolar etc).