Accuracy Bounds and Optimal Computation of Homography for Image Mosaicing Applications
Abstract
We describe a theoretically optimal algorithm for computing the homography between two images in relation to image mosaicing applications. First, we derive a theoretical accuracy bound based on a mathematical model of image noise and do simulation to confirm that our renormalization technique effectively attains that bound; our algorithm is optimal in that sense. Then, we apply our technique to mosaicing of images with small overlaps. By using real images, we show how our algorithm reduces the instability of the image mapping.
Cite
Text
Kanatani and Ohta. "Accuracy Bounds and Optimal Computation of Homography for Image Mosaicing Applications." IEEE/CVF International Conference on Computer Vision, 1999. doi:10.1109/ICCV.1999.791200Markdown
[Kanatani and Ohta. "Accuracy Bounds and Optimal Computation of Homography for Image Mosaicing Applications." IEEE/CVF International Conference on Computer Vision, 1999.](https://mlanthology.org/iccv/1999/kanatani1999iccv-accuracy/) doi:10.1109/ICCV.1999.791200BibTeX
@inproceedings{kanatani1999iccv-accuracy,
title = {{Accuracy Bounds and Optimal Computation of Homography for Image Mosaicing Applications}},
author = {Kanatani, Ken-ichi and Ohta, Naoya},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1999},
pages = {73-78},
doi = {10.1109/ICCV.1999.791200},
url = {https://mlanthology.org/iccv/1999/kanatani1999iccv-accuracy/}
}