Spectral partitioning with indefinite kernels using the nyström extension

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

Volumn 2352, Issue , 2002, Pages 531-542

  Belongie, Serge ^a   Fowlkes, Charless ^b   Chung, Fan ^a   Malik, Jitendra ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; TEXTURES;

COLOR AND TEXTURES; GROUPING ALGORITHM; IMAGE SIMILARITY; INDEFINITE KERNEL; ORTHOGONALIZATION; POSITIVE DEFINITE; SPECTRAL PARTITIONING; WEIGHTED ADJACENCY MATRIXES;

COMPUTER VISION;

EID: 84949998208     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47977-5_35     Document Type: Conference Paper

References (20)

1. C. Berg, J. P. R. Christensen, and P. Ressel. Harmonic Analysis on Semigroups. Springer-Verlag, New York, 1984.
2. R. Bhatia. Matrix Analysis. Springer Verlag, 1997.
3. O. Chapelle, P. Haffner, and V. Vapnik. SVMs for histogram based image classification. IEEE Trans. Neural Networks, 10(5):1055–1064, September 1999.
4. F. R. K. Chung. Spectral Graph Theory. Number 92 in CBMS Regional Conference Series in Mathematics. AMS, 1997.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1991.
6. J. de Leeuw. Multidimensional scaling. UCLA Dept. of Statistics, Preprint no. 274, 2000.
7. C. Fowlkes, S. Belongie, and J. Malik. Efficient spatiotemporal grouping using the Nyström method. In Proc. IEEE Conf. Comput. Vision and Pattern Recognition, December 2001.
8. Yoram Gdalyahu, Daphna Weinshall, and Michael Werman. Stochastic image segmentation by typical cuts. In CVPR, 1999.
9. R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge Univ Press, 1985.
10. T. Leung and J. Malik. Contour continuity in region-based image segmentation. In H. Burkhardt and B. Neumann, editors, Proc. Euro. Conf. Computer Vision, volume 1, pages 544–59, Freiburg, Germany, June 1998. Springer-Verlag.
11. J. Malik, S. Belongie, T. Leung, and J. Shi. Contour and texture analysis for image segmentation. Int’l. Journal of Computer Vision, 43(1):7–27, June 2001.
12. R. Mathias. An arithmetic-geometric-harmonic mean inequality involving Hadamard products. Linear Algebra and its Applications, 184:71–78, 1993.
13. P. Perona and W. T. Freeman. A factorization approach to grouping. In Proc. 5th Europ. Conf. Comput. Vision, 1998.
14. J. Puzicha and S. Belongie. Model-based halftoning for color image segmentation. In ICPR, volume 3, pages 629–632, 2000.
15. J. Puzicha, T. Hofmann, and J. Buhmann. Non-parametric similarity measures for unsupervised texture segmentation and image retrieval. In Proc. IEEE Conf. Computer Vision and Pattern Recognition, pages 267–72, San Juan, Puerto Rico, Jun. 1997.
16. B. Schölkopf and A. Smola. Learning with Kernels. Cambridge, MA: MIT Press, 2001. in preparation.
17. B. Schölkopf, A. Smola, and K.-R. Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:1299–1319, 1998.
18. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence, 22(8):888–905, August 2000.
19. Y. Weiss. Segmentation using eigenvectors: a unifying view. In Proc. 7th Int’l. Conf. Computer Vision, pages 975–982, 1999.
20. C. Williams and M. Seeger. Using the Nyström method to speed up kernel machines. In T. K. Leen, T. G. Dietterich, and V. Tresp, editors, Advances in Neural Information Processing Systems 13: Proceedings of the 2000 Conference, pages 682–688, 2001.