A hybrid randomized algorithm for image compression
About this article
Abstract
In this paper, we present a randomized algorithm for image compression by improving the Markov chain Monte Carlo algorithm and by applying the principal component analysis method. Some Numerical examples are provided to show that the proposed algorithm is effective.
References
[1] C. Clausen and H. Wechsler, Color image compression using PCA and ackpropagation learning, Pattern Recognition, 2000.
[2] S. Costa and S. Fiori, Image compression using principal component neural networks, Image and Vision Computing, 2011. 4 International Journal of Applied Mathematical Research
[3] I. Dimov and A. Karaivanova, Parallel computations of eigenvalues based on a Monte Carlo approach, Monte Carlo Method and Applications, 1998.
[4] B. Fathi Vajargah and F. Mehrdoust, Matrix balancing and robust Monte Carlo algorithm for evaluating dominant eigenpair, Computer Science Journal of Moldova, 2010.
[5] B. Huhle, Kernel PCA for Image Compression, Wilhelm-Schickard-Institut fur Informatik Eberhard Karls Universitat Tuubingen, 2006.
View more references (3)
[6] I. T. Jolliffe, Principal Component Analysis, Springer-Verlag, 2002.
[7] F. Mehrdoust, MCMC-PCA based compression algorithm for images, Journal of Advanced Research in Scientific Research, 2012.
[8] Y. Saad, Numerical methods for large eigenvalue problems, Manchester University Press, 1991.