Multi-way clustering using super-symmetric non-negative tensor factorization

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

Volumn 3954 LNCS, Issue , 2006, Pages 595-608

  Shashua, Amnon ^a   Zass, Ron ^a   Hazan, Tamir ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

3D MULTI-BODY SEGMENTATION; AFFINITY ARRAY; HYPER-STOCHASTIC; MULTI-WAY CLUSTERING; SUPER-SYMMETRIC NON-NEGATIVE FACTORIZATION;

ALGORITHMS; ARRAYS; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; PROBABILISTIC LOGICS; PROBLEM SOLVING; RANDOM PROCESSES; TENSORS;

COMPUTER VISION;

EID: 33745844738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11744085_46     Document Type: Conference Paper

References (21)

1. S. Agrawal, J. Lim, L. Zelnik-Manor, P. Perona, D. Kriegman, and S. Belongie. Beyond pairwise clustering. In Proceedings of the. IEEE Conference on Computer Vision and Pattern Recognition, 2005.
2. C.J. Alpert and A.B. Kahng. Recent directions in netlist partitioning. The VLSI Journal, 19(1-2):1-81, 1995.
3. C.M. Fiduccia and R.M. Mattheyses. A linear time heuristic for improving network partitions. In Proc. of the 19th IEEE Design Automation Conference, pages 175181, 1982.
4. I.M. Gelfand, M.M. Karpanov, and A.V. Zelevinsky. Discriminants, Resultants and multidimensional determinants. Birkhauser Boston, 1994.
5. V.M. Govindu. A tensor decomposition for geometric grouping and segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2005.
6. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2), 1970.
7. D. Lee and H. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401:788-791, 1999.
8. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform rnulticommodity flow problems with applications to approximate algorithms. In Proceedings Symposium on Foundations of Comp. Sci., 1988.
9. H.C. Loiiguet-Higgiria. A computer algorithm for reconstructing a scene from two projections. Nature, 293:133-135, 1981.
10. A.Y. Ng, M.I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Proceedings of the conference on Neural Information Processing Systems (NIPS), 2001.
11. P. Perona and W. Freeman. A factorization approach to grouping. In Proceedings of the European Conference on Computer Vision, 1998.
12. J.A. Rodriguez. On the Laplacian eigenvalues and metric parameters of hypergraphs. Linear and Multilinear Algebra, 50(1):1-14, 2002.
13. A. Shashua. Illumination and view position in 3D visual recognition. In Proceedings of the conference on Neural Information Processing Systems (NIPS), Denver, CO, December 1991.
14. A. Shashua and T. Hazan. Non-negative tensor factorization with applications to statistics and computer vision. In Proceedings of the International Conference on Machine Learning (ICML), 2005.
15. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 2000.
16. R. Sinkhorn. A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist., 35:876-879, 1964.
17. S. Ullman and R. Basri. Recognition by linear combination of models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13:992-1006, 1991.
18. R. Vidai, Y. Ma, S. Soatto, and S. Sastry. Two-view multibody structure from motion. International Journal of Computer Vision, 2004.
19. L. Wolf and A. Shashua. Two-body segmentation from two perspective views. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Hawaii, Dec. 2001.
20. R. Zass and A. Shashua. A unifying approach to hard and probabilistic clustering. In Proceedings of the International Conference on Computer Vision, Beijing, China, Oct. 2005.
21. D. Zhou, J. Huang, and B. Scholkopf. Beyond pairwise classification and clustering using hypergraphs. Technical report, Max Planck Institute for Biol. Cybernetics, TR-143, August 2005.