ML Anthology

Theoretical Analysis on Reconstruction-Based Super-Resolution for an Arbitrary PSF

Masayuki Tanaka, Masatoshi Okutomi
CVPR 2005 pp. 947-954
doi:10.1109/CVPR.2005.343 /cvpr/2005/tanaka2005cvpr-theoretical/

Abstract

This study presents and proves a condition number theorem for super-resolution (SR). The SR condition number theorem provides the condition number for an arbitrary space-invariant point spread function (PSF) when using an infinite number of low resolution images. A gradient restriction is also derived for maximum likelihood (ML) method. The gradient restriction is presented as an inequality which shows that the power spectrum of the PSF suppresses the spatial frequency component of the gradient of ML cost function. A Box PSF and a Gaussian PSF are analyzed with the SR condition number theorem. Effects of the gradient restriction on super-resolution results are shown using synthetic images.

CVPR Semantic Scholar

Cite

Text

Tanaka and Okutomi. "Theoretical Analysis on Reconstruction-Based Super-Resolution for an Arbitrary PSF." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005. doi:10.1109/CVPR.2005.343

Markdown

[Tanaka and Okutomi. "Theoretical Analysis on Reconstruction-Based Super-Resolution for an Arbitrary PSF." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005.](https://mlanthology.org/cvpr/2005/tanaka2005cvpr-theoretical/) doi:10.1109/CVPR.2005.343

BibTeX

@inproceedings{tanaka2005cvpr-theoretical,
  title     = {{Theoretical Analysis on Reconstruction-Based Super-Resolution for an Arbitrary PSF}},
  author    = {Tanaka, Masayuki and Okutomi, Masatoshi},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2005},
  pages     = {947-954},
  doi       = {10.1109/CVPR.2005.343},
  url       = {https://mlanthology.org/cvpr/2005/tanaka2005cvpr-theoretical/}
}