Pairwise clustering with matrix factorisation and the EM algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2351, Issue , 2002, Pages 63-77

  Robles Kelly, Antonio ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; COMPUTER VISION; FACTORIZATION; IMAGE SEGMENTATION;

BERNOULLI DISTRIBUTIONS; CLUSTER MEMBERSHIPS; CLUSTERING PROCESS; CONVERGENCE CONDITIONS; GROUPING PROCESS; MATRIX FACTORISATION; MULTIPLE MOVING OBJECTS; PAIRWISE CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 84948957580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47967-8_5     Document Type: Conference Paper

References (19)

1. 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.
2. Marina Meilă and Jianbo Shi. Learning segmentation by random walks. In Advances in Neural Information Processing Systems 13, pages 873–879. MIT Press, 2001.
3. 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.
4. J. S. Bridle. Training stochastic model recognition algorithms can lead to maximum mutual information estimation of parameters. In NIPS 2, pages 211–217, 1990.
5. Fan R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
6. 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.
7. L. Dieci. Considerations on computing real logarithms of matrices,hamiltonian logarithms and skew-symmetric logarithms. Linear Algebra and its Applications, 244:35–54, 1996.
8. M. Doob, D. Cvetković and H. Sachs. Spectra of Graphs:Theory and Application. Academic Press, 1980.
9. T. Hofmann and M. Buhmann. Pairwise data clustering by deterministic annealing. IEEE Tansactions on Pattern Analysis and Machine Intelligence, 19(1):1–14, 1997.
10. 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.
11. Z. Ghahramani, N. Ueda, R. Nak ano and G. E. Hinton. Smem algorithm for mixture models. Neural Computation, 12(9):2109–2128, 2000.
12. J. Risanen. Stochastic Complexity in Statistical Enquiry. World Scientific, 1989.
13. A. Robles-Kelly and E. R. Hanco ck. A maximum likelihood framework for iterative eigendecomposition. In Proc. of the IEEE International Conference on Conputer Vision, 2001.
14. 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.
15. J. Shi and J. Malik. Normalized cuts and image segmentations. In Proc. IEEE CVPR, pages 731–737, 1997.
16. Naftali Tishby and Noam Slonim. Data clustering by markovian relaxation and the information bottleneck method. In Todd K. Leen, Thomas G. Dietteric h, and Volker Tresp, editors, Advances in Neural Information Processing Systems 13, pages 640–646. MIT Press, 2001.
17. R. S. Varga. Matrix Iterative Analysis. Springer, second edition, 2000.
18. 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.
19. 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.