Abstract
In this paper we provide a direct link between the EM algorithm and matrix factorisation methods for grouping via pairwise clustering. We commence by placing the pairwise clustering process in the setting of the EM algorithm. We represent the clustering process using two sets of variables which need to be estimated. The first of these are cluster-membership indicators. The second are revised link-weights between pairs of nodes. We work with a model of the grouping process in which both sets of variables are drawn from a Bernoulli distribution. The main contributioin in this paper is to show how the cluster-memberships may be estimated using the leading eigenvector of the revised link-weight matrices. We also establish convergence conditions for the resulting pair-wise clustering process. The method is demonstrated on the problem of multiple moving object segmentation.
Supported by CONACYT, under grant No. 146475/151752.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Dempster, N. Laird and D. Rubin. Maximum-likehood from incomplete data via the EM algorithm. J. Royal Statistical Soc. Ser. B (methodological), 39:1–38, 1977.
Marina Meilă and Jianbo Shi. Learning segmentation by random walks. In Advances in Neural Information Processing Systems 13, pages 873–879. MIT Press, 2001.
A. G. Bors and I. Pitas. Optical flow estimation and moving object segmentation based on median radial basis function network. IEEE Trans. on Image Processing, 7(5):693–702, 1998.
J. S. Bridle. Training stochastic model recognition algorithms can lead to maximum mutual information estimation of parameters. In NIPS 2, pages 211–217, 1990.
Fan R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
J. S. Shyn C. H. Hsieh, P. C. Lu and E. H. Lu. Motion estimation algorithm using inter-block correlation. IEE Electron. Lett., 26(5):276–277, 1990.
L. Dieci. Considerations on computing real logarithms of matrices,hamiltonian logarithms and skew-symmetric logarithms. Linear Algebra and its Applications, 244:35–54, 1996.
M. Doob D. Cvetković and H. Sachs. Spectra of Graphs:Theory and Application. Academic Press, 1980.
T. Hofmann and M. Buhmann. Pairwise data clustering by deterministic annealing. IEEE Tansactions on Pattern Analysis and Machine Intelligence, 19(1):1–14, 1997.
J. M. Leitao M. Figueiredo and A. K. Jain. On fitting mixture models. In Proceedings of the Second Int. Workshop on Energy Minimization Methods in Comp. Vis. and Pattern Recognition, number 1654 in Lecture Notes in Comp. Science, pages 54–67, 1999.
Z. Ghahramani N. Ueda, R. Nakano and G. E. Hinton. Smem algorithm for mixture models. Neural Computation, 12(9):2109–2128, 2000.
J. Risanen. Stochastic Complexity in Statistical Enquiry. World Scientific, 1989.
A. Robles-Kelly and E. R. Hancock. A maximum likelihood framework for iterative eigendecomposition. In Proc. of the IEEE International Conference on Conputer Vision, 2001.
S. Sarkar and K. L. Boyer. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. Computer Vision and Image Understanding, 71(1):110–136, 1998.
J. Shi and J. Malik. Normalized cuts and image segmentations. In Proc. IEEE CVPR, pages 731–737, 1997.
Naftali Tishby and Noam Slonim. Data clustering by markovian relaxation and the information bottleneck method. In Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, Advances in Neural Information Processing Systems 13, pages 640–646. MIT Press, 2001.
R. S. Varga. Matrix Iterative Analysis. Springer, second edition, 2000.
N. Vlassis and A. Likas. A kurtosis-based dynamic approach to gaussian mixture modeling. IEEE Trans. in Systems, Man and Cybernetics, 29(4):393–399, 1999.
D. Weinshall Y. Gdalyahu and M. Werman. A randomized algorithm for pairwise clustering. In Advances in Neural Information Processing Systems 11, pages 424–430. MIT Press, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Robles-Kelly, A., Hancock, E.R. (2002). Pairwise Clustering with Matrix Factorisation and the EM Algorithm. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds) Computer Vision — ECCV 2002. ECCV 2002. Lecture Notes in Computer Science, vol 2351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47967-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-47967-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43744-4
Online ISBN: 978-3-540-47967-3
eBook Packages: Springer Book Archive