Computing Ritz Approximations of Primary Images
Abstract
Ritz vectors approximate eigenvectors that are a common choice for primary images in content based indexing. They can be computed efficiently even when the images are accessed through slow communication such as the Internet. We develop an algorithm that computes Ritz vectors in one pass through the images. When iterated, the algorithm can recover the exact eigenvectors. In applications to image indexing and learning it may be necessary to compute primary images for indexing many sub-categories of the image set. The proposed algorithm can compute these age data. Similar computation by other algorithms is much more costly even when access to the images is inexpensive.
Cite
Text
Schweitzer. "Computing Ritz Approximations of Primary Images." IEEE/CVF International Conference on Computer Vision, 1998. doi:10.1109/ICCV.1998.710711Markdown
[Schweitzer. "Computing Ritz Approximations of Primary Images." IEEE/CVF International Conference on Computer Vision, 1998.](https://mlanthology.org/iccv/1998/schweitzer1998iccv-computing/) doi:10.1109/ICCV.1998.710711BibTeX
@inproceedings{schweitzer1998iccv-computing,
title = {{Computing Ritz Approximations of Primary Images}},
author = {Schweitzer, Haim},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1998},
pages = {139-144},
doi = {10.1109/ICCV.1998.710711},
url = {https://mlanthology.org/iccv/1998/schweitzer1998iccv-computing/}
}