Lu, C. and Yuan, Y. and Yan, P. and Yuan, Y. and Li, Xuelong (2012) Geometry constrained sparse coding for single image super-resolution. In: UNSPECIFIED (ed.) IEEE Conference on Computer Vision and Pattern Recognition. Washington, USA: IEEE Computer Society, pp. 1648-1655. ISBN 9781467312264.
Abstract
The choice of the over-complete dictionary that sparsely represents data is of prime importance for sparse coding-based image super-resolution. Sparse coding is a typical unsupervised learning method to generate an over-complete dictionary. However, most of the sparse coding methods for image super-resolution fail to simultaneously consider the geometrical structure of the dictionary and corresponding coefficients, which may result in noticeable super-resolution reconstruction artifacts. In this paper, a novel sparse coding method is proposed to preserve the geometrical structure of the dictionary and the sparse coefficients of the data. Moreover, the proposed method can preserve the incoherence of dictionary entries, which is critical for sparse representation. Inspired by the development on non-local self-similarity and manifold learning, the proposed sparse coding method can provide the sparse coefficients and learned dictionary from a new perspective, which have both reconstruction and discrimination properties to enhance the learning performance. Extensive experimental results on image super-resolution have demonstrated the effectiveness of the proposed method.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 06 Jun 2013 12:51 |
| Last Modified: | 09 Aug 2023 12:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7311 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
