The Implementation and Application of Image Adaptive Dictionary Algorithm Based on Manifold

Article Preview

Abstract:

As an important field of image processing, image restoration has ever been a hot research topic. Our paper will focus on the adpative dictionary. We propose a novel improved adaptived dictionary learning algorithm. Utilizing the thoughts of manifold, for each atom in dictionry, we calculate the principal components of responding representaion errors as the tangent vector of the atom, which improves the representaion ability of dicitonary. Meanwhile, dictionary learned from the origin image is better at image denoising than adpative dictionary.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

781-785

Citation:

Online since:

February 2014

Authors:

Export:

Price:

* - Corresponding Author

[1] ZHU S C, MUMFORD D B. Filters, random fields and maximum entropy (FRAME): Towards a unified theory for texture modeling. International Journal of Computer Vision, 1998, 27(2): 107-126.

DOI: 10.1109/cvpr.1996.517147

Google Scholar

[2] S. Roth and M. J. Black. Fields of experts: A framework for learning image priors. IEEE Conference on Computer Vision and Pattern Recognition. Washington, DC: IEEE Computer Society, 2005, 2: 860-867.

DOI: 10.1109/cvpr.2005.160

Google Scholar

[3] M. P. Wand and M. C. Jones, Kernel Smoothing, ser. Monographs on Statistics and Applied Probability. London; New York: Chapman and Hall, (1995).

Google Scholar

[4] R. Gonzalez and J. Woods, Digital Image Processing, Third Edition. Prentice Hall, (2008).

Google Scholar

[5] C. Tomasi and R. Manduchi. Bilateral filtering for gray and color images. IEEE International Conference of Compute Vision, Bombay, India, pp.836-846, January (1998).

DOI: 10.1109/iccv.1998.710815

Google Scholar

[6] A. Buades, B. Coll, and J. M. Morel. A review of image denoising algorithms, with a new one. Multiscale Modeling and Simulation, vol. 4, no. 2, pp.490-530, (2005).

DOI: 10.1137/040616024

Google Scholar

[7] M. Aharon, M. Elad, and A. Bruckstein. The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. IEEE Transactions on Signal Processing, vol. 54, no. 11, pp.4311-4322, November (2006).

DOI: 10.1109/tsp.2006.881199

Google Scholar