Multilinear Constraints in the Infinitesimal-Time Cas
Abstract
In this paper we study the infinitesimal-time case of the so called multilinear constraints that exist for each subsequence in a sequence of images. These constraints link the infinitesimal motion of the image points with the infinitesimal viewer motion. The analysis is done both for calibrated and uncalibrated cameras. Two simplifications are also presented for the uncalibrated camera case. One simplification is made using affine reduction and kinetic depth. The second simplification is based upon a projective reduction with respect to the image of a planar patch
Cite
Text
Åström and Heyden. "Multilinear Constraints in the Infinitesimal-Time Cas." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1996. doi:10.1109/CVPR.1996.517168Markdown
[Åström and Heyden. "Multilinear Constraints in the Infinitesimal-Time Cas." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1996.](https://mlanthology.org/cvpr/1996/astrom1996cvpr-multilinear/) doi:10.1109/CVPR.1996.517168BibTeX
@inproceedings{astrom1996cvpr-multilinear,
title = {{Multilinear Constraints in the Infinitesimal-Time Cas}},
author = {Åström, Kalle and Heyden, Anders},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1996},
pages = {833-838},
doi = {10.1109/CVPR.1996.517168},
url = {https://mlanthology.org/cvpr/1996/astrom1996cvpr-multilinear/}
}