Abstract
Randomized algorithms for processing massive data sets have shown to be a promising alternative to deterministic techniques. Sampling strategies are an essential aspect of randomized algorithms for matrix computations. In this work, we show that strategies that are effective or even optimal in the general case, can fail when applied to ill-conditioned matrices. Our experimental study suggests that there exists a relationship between sampling performance and conditioning of the matrices involved. We present an explanation for this behavior and propose a novel, efficient, and accurate sampling strategy for randomized multiplication of affinity matrices in image segmentation.
Chapter PDF
Similar content being viewed by others
References
Carasso, A.: Determining surface temperatures from interior observations. SIAM J. Appl. Math. 42, 558–574 (1982)
Cour, T., Yu, S., Shi, J.: Normalized Cuts Segmentation Code, Copyright University of Pennsylvania, Computer and Information Science Department (2004), http://www.seas.upenn.edu/~timothee/software/ncut/ncut.html
Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices I: approximating matrix multiplication. SIAM J. Comput. 36, 132–157 (2006)
Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices II: computing a low-rank approximation to a matrix. SIAM J. Comput. 36, 158–183 (2006)
Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices III: computing a compressed approximate matrix decomposition. SIAM J. Comput. 36, 184–206 (2006)
Eriksson-Bique, S., Solbrig, M., Stefanelli, M., Warkentin, S., Abbey, R., Ipsen, I.C.F.: Importance sampling for a Monte Carlo matrix multiplication algorithm, with application to information retrieval. SIAM J. Sci. Comput. 33, 1689–1706 (2011)
Fowlkes, C., Belongie, S., Chung, F., Malik, J.: Spectral grouping using the Nyström method. IEEE T. Pattern Anal. 26, 214–225 (2004)
Friedland, S., Mehrmann, V., Miedlar, A., Nkengla, M.: Fast low rank approximations of matrices and tensors. Electron. J. Linear Al. 22, 1031–1048 (2011)
Hansen, P.C.: Regularization Tools Version 4.0 for Matlab 7.3. Numer. Algo. 46, 189–194 (2007)
Kumar, S., Mohri, M., Talwalkar, A.: Sampling Techniques for the Nyström Method. In: Proceedings of the 12th International Conference on Artificial Intelligence and Statistics, AISTATS (2009)
Lehoucq, R.B., Sorensen, D.C., Yang, C.: ARPACK User’s Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods. SIAM, Philadelphia (1998)
Liberty, E., Zucker, S.W.: The Mailman algorithm: A note on matrix-vector multiplication. Inform. Process. Lett. 109, 179–182 (2009)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE T. Pattern Anal. 22, 888–905 (2000)
Sorensen, D.C.: Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. A. 13, 357–385 (1992)
Woolfe, F., Liberty, E., Rokhlin, V., Tygert, M.: A fast randomized algorithm for the approximation of matrices. Appl. Comput. Harmon. Anal. 25, 335–366 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Madrid, H., Guerra, V., Rojas, M. (2012). Sampling Techniques for Monte Carlo Matrix Multiplication with Applications to Image Processing. In: Carrasco-Ochoa, J.A., MartÃnez-Trinidad, J.F., Olvera López, J.A., Boyer, K.L. (eds) Pattern Recognition. MCPR 2012. Lecture Notes in Computer Science, vol 7329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31149-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-31149-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31148-2
Online ISBN: 978-3-642-31149-9
eBook Packages: Computer ScienceComputer Science (R0)