An experimental evaluation of a Monte-Carlo algorithm for singular value decomposition

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

Volumn 2563, Issue , 2003, Pages 279-296

  Drineas, Petros ^a   Drinea, Eleni ^b   Huggins, Patrick S ^a  

^a YALE UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; VECTOR SPACES;

EXPERIMENTAL EVALUATION; MONTE CARLO ALGORITHMS; RANDOMIZED ALGORITHMS; SAMPLING SCHEMES; SINGULAR VECTORS;

SINGULAR VALUE DECOMPOSITION;

EID: 35248881205     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-38076-0_19     Document Type: Review

References (23)

1. http://cluster.cs.yale.edu/.
2. P. Anandan and M. Irani. Factorization with uncertainty. International Journal on Computer Vision, 49(2-3):101-116, September 2002.
3. H. C. Andrews and C. L. Patterson. Singular value decomposition image coding. IEEE Transactions on Communications, pages 425-432, April 1976.
4. H. C. Andrews and C. L. Patterson. Singular value decompositions and digital image processing. IEEE Transactions on ASSP, pages 26-53, February 1976.
5. E. Drinea, P. Drineas, and P. Huggins. A randomized singular value decomposition algorithm for image processing. Proceedings 8th Panhellenic Conference on Informatics, 2001.
6. P. Drineas. Fast Monte-Carlo algorithms for Approximate matrix operations and applications. PhD thesis, Yale University, 2002.
7. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. Proceedings 10th SODA Symposium, pages 291-299, 1999.
8. P. Drineas and R. Kannan. Fast Monte-Carlo algorithm for approximate matrix multiplication. Proceedings 10th IEEE FOCS Symposium, pages 452-459, 2001.
9. P. Drineas and R. Kannan. Fast Monte-Carlo algorithms for approximating the product of matrices, under submission, 2002.
10. A. Frieze, R. Kalman, and S. Vempala. Fast Monte-Carlo algorithms for finding low rank approximations. Proceedings 39th IEEE FOCS Symposium, pages 370-378, 1998.
11. G. Golub and C. Van Loan. Matrix Computations. Johns Hopkins University Press, 1989.
12. T. Huang and P. Narendra. Image restoration by singular value decomposition. Applied Optics, 14(9):2213-2216, September 1974.
13. F. Jiang, R. Kannan, M. Littman, and S. Vempala. Efficient singular value decomposition via improved document sampling. Technical Report CS-99-5, Duke University, February 1999.
14. B. Moghaddam and A. Pentland. Probabilistic visual learning for object representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(7):696-710, 1997.
15. H. Murase and S. K. Nayar. Visual learning and recognition of 3-d objects from appearance. International Journal on Computer Vision, 14(1):5-24, January 1995.
16. M. Murphy. Comparison of transform image coding techniques for compression of tactical imagery. SPIE, 309:212-219, 1981.
17. B. Parlett. The Symmetric Eigenvalue Problem. Classics in Applied Mathematics. SIAM, 1997.
18. D. Sorensen. Implicit application of polynomial filters in a k-step arnoldi method. SIAM Journal Matrix Analysis and Applications, 13:357-375, 1992.
19. M. Turk and A. P. Pentland. Face recognition using eigenfaces. In Proceedings CVPR'91 Conference, pages 586-591, 1991.
20. P. Wu, B. S. Manjunath, and H. D. Shin. Dimensionality reduction for image retrieval. In Proceedings ICIP'00 Conference, page WP07.03, 2000.
21. www.MathWorks.com.
22. G. Zientara, L. Panych, and F. Jolesz. Dynamic adaptive MRI using multiresolution SVD encoding incorporating optical flow-based predictions. Technical report, National Academy of Sciences Committee on the "Mathematics and Physics of Emerging Dynamic Biomedical Imaging", November 1993.
23. G. Zientara, L. Panych, and F. Jolesz. Dynamically adaptive MRI with encoding by singular value decomposition. MRM, 32:268-274, 1994.