A probabilistic spectral framework for grouping and segmentation

Pattern Recognition

Volumn 37, Issue 7, 2004, Pages 1387-1405

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

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Graph spectral methods; Maximum likelihood; Motion segmentation; Perceptual grouping

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PARAMETER ESTIMATION; PROBABILITY DISTRIBUTIONS;

LINK-WEIGHT MATRIX; PAIRWISE CLUSTERING; PERCEPTUAL GROUPING; PROBABILISTIC SPECTRAL FRAMEWORK;

PATTERN RECOGNITION;

PATTERN RECOGNITION;

EID: 2442428183     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2003.10.017     Document Type: Article

References (34)

1. G.L. Scott, H.C. Longuet-Higgins, Feature grouping by relocalisation of eigenvectors of the proximity matrix, in: British Machine Vision Conference, 1990, pp. 103-108.
2. Sarkar S. Boyer K.L. Quantitative measures of change based on feature organization: eigenvalues and eigenvectors Comput. Vision Image Understanding 71 1 1998 110-136
3. P. Perona, W.T. Freeman, Factorization approach to grouping, in: Proceedings of ECCV, Freiburg, Germany, 1998, pp. 655-670.
4. J. Shi, J. Malik, Normalized cuts and image segmentations, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 1997, pp. 731-737.
5. Y. Weiss, Segmentation using eigenvectors: a unifying view, in: IEEE International Conference on Computer Vision, 1999, pp. 975-982.
6. M. Meila, J. Shi, Learning segmentation by random walks, in: Advances in Neural Information Processing Systems, Vol. 13, MIT Press, Cambridge, MA, 2001, pp. 873-879.
7. Tishby N. Slonim N. Data clustering by markovian relaxation and the information bottleneck method Leen T.K. Dietterich T.G. Tresp V. Advances in Neural Information Processing Systems Vol. 13 2001 640-646 MIT Press Cambridge, MA
8. C. Fowlkes, S. Belongie, J. Malik, Efficient spatiotemporal grouping using the Nyström method, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, Kauai, Hawaii, USA, 2001, pp. I:231-238.
9. S. Belongie, C. Fowlkes, F. Chung, J. Malik, Spectral partitioning with indefinite kernels using the Nyström extension, in: Proceedings of the European Conference on Computer Vision, Copenhagen, Denmark, 2002, pp. III: 531-542.
10. P. Soundararajan, S. Sarkar, Investigation of measures for grouping by graph partitioning, in: IEEE Conference on Computer Vision and Pattern Recognition, Vol. 1, 2001, pp. 239-246.
11. B. Mohar, Some applications of Laplace eigenvalues of graphs, Graph Symmetry: Algebraic Methods and Applications, Kluwer Academic Publishers, Dordrecht, 2000, pp. 225-275.
12. R. Kannan, S. Vampala, A. Vetta, On clusterings: good, bad and spectral, in: Proceedings of the 41st Symposium on the Foundations of Computer Science, Redondo Beach, California, USA, 2000, pp. 367-377.
13. Dickson W. Feature grouping in a hierarchical probabilistic network Image Vision Comput. 9 1 1991 51-57
14. Cox I.J. Rehg J.M. Hingorani S. A bayesian multiple-hypothesis approach to edge grouping and contour segmentation Int. J. Comput. Vision 11 1 1993 5-24
15. Leite J.A.F. Hancock E.R. Iterative curve organisation with the em algorithm Pattern Recognition Lett. 18 1997 143-155
16. Castaño R. Hutchinson S. A probabilistic approach to perceptual grouping Comput. Vision Image Understanding 64 3 1996 339-419
17. Crevier D. A probabilistic method for extracting chains of collinear segments Image Vision Comput. 76 1 1999 36-53
18. Amir A. Lindenbaum M. A generic grouping algorithm and its quantitative analysis Trans. Pattern Anal. Mach. Intell. 20 2 1998 168-185
19. Hofmann T. Buhmann M. Pairwise data clustering by deterministic annealing IEEE Trans. Pattern Anal. Mach. Intell. 19 1 1997 1-14
20. Y. Gdalyahu, D. Weinshall, M. Werman, A randomized algorithm for pairwise clustering, in: Advances in Neural Information Processing Systems, Vol. 11, MIT Press, Cambridge, MA, 1999, pp. 424-430.
21. A. Shashua, S. Ullman, Structural saliency: the detection of globally salient structures using a locally connected network, in: Proceedings of the 2nd International Conference in Computer Vision, Tarpon Springs, Florida, USA, 1988, pp. 321-327.
22. Guy G. Medioni G. Inferring global perceptual contours from local features Int. J. Comput. Vision 20 1/2 1996 113-133
23. Parent P. Zucker S. Trace inference, curvature consistency and curve detection IEEE Trans. Pattern Anal. Mach. Intell. 11 8 1989 823-839
24. Robles-Kelly A. Hancock E.R. An expectation-maximisation framework for segmentation and grouping Image and Vision Comput. 20 9-10 2002 725-738
25. Dieci L. Considerations on computing real logarithms of matrices, hamiltonian logarithms and skew-symmetric logarithms Linear Algebra its Appl. 244 1996 35-54
26. J.S. Bridle, Training stochastic model recognition algorithms can lead to maximum mutual information estimation of parameters, in: NIPS, Vol. 2, Denver, Colorado, USA: MIT, 1990, pp. 211-217.
27. Ghahramani Z. Jordan M. Factorial hidden markov models Mach. Learning 29 2-3 1997 245-273
28. Horn R.A. Johnson C.R. Topics in Matrix Analysis 1991 Cambridge University Press Cambridge, MA
29. Varga R.S. Matrix Iterative Analysis 2nd Edition 2000 Springer Berlin
30. Gantmacher F.R. Matrix Theory Vol. 2 1971 Chelsea New York
31. F. Heitger, R. von der Heydt, A computational model of neural contour processing, in: IEEE Conference on Computer Vision and Pattern Recognition, 1993, pp. 32-40.
32. Williams L.R. Jacobs D.W. Stochastic completion fields: a neural model of illusory contour shape and salience Neural Comput. 9 4 1997 837-858
33. Peng-Yeng Yin Algorithms for straight line fitting using k-means Pattern Recognition Lett. 19 1998 31-41
34. Hsieh C.H. Lu P.C. Shyn J.S. Lu E.H. Motion estimation algorithm using inter-block correlation IEE Electron. Lett. 26 5 1990 276-277