English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Kernel Hebbian Algorithm for single-frame super-resolution

MPS-Authors
/persons/resource/persons84014

Kim,  KI
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

/persons/resource/persons83919

Franz,  M
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

/persons/resource/persons84193

Schölkopf,  B
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

pdf2645.pdf
(Any fulltext), 3MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Kim, K., Franz, M., & Schölkopf, B. (2004). Kernel Hebbian Algorithm for single-frame super-resolution. In A. Leonardis, & H. Bischof (Eds.), ECCV 2004 Workshop on Statistical Learning in Computer Vision (SLCV 2004) (pp. 135-149).


Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-D951-6
Abstract
This paper presents a method for single-frame image super-resolution using an unsupervised learning technique. The required prior knowledge about the high-resolution images is obtained from Kernel Principal Component Analysis (KPCA). The original form of KPCA, however, can be only applied to strongly restricted image classes due to the limited number of training examples that can be processed. We therefore propose a new iterative method for performing
KPCA, the em Kernel Hebbian Algorithm. By kernelizing the
Generalized Hebbian Algorithm, one can iteratively estimate the Kernel Principal Components with only linear order memory complexity. The resulting super-resolution algorithm shows a comparable performance to the existing supervised methods on images containing faces and natural scenes.