Multilinear Constraints in the Infinitesimal-time Case
(1996) IEEE Conference on Computer Vision and Pattern Recognition, 1996 p.833-838- 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
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/787300
- author
- Åström, Karl
LU
and Heyden, Anders LU
- organization
- publishing date
- 1996
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- image sequences, motion estimation
- host publication
- Computer Vision and Pattern Recognition
- pages
- 833 - 838
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE Conference on Computer Vision and Pattern Recognition, 1996
- conference location
- San Francisco, CA, United States
- conference dates
- 1996-06-18 - 1996-06-20
- external identifiers
-
- scopus:0029711434
- ISBN
- 0 8186 7258 7
- DOI
- 10.1109/CVPR.1996.517168
- language
- English
- LU publication?
- yes
- id
- 0cd9fffe-ceb1-44b7-a461-49ebc7d4cc6f (old id 787300)
- alternative location
- http://www.maths.lth.se/matematiklth/personal/andersp/publ/cvpr96.ps
- date added to LUP
- 2016-04-04 12:14:14
- date last changed
- 2023-11-30 19:02:58
@inproceedings{0cd9fffe-ceb1-44b7-a461-49ebc7d4cc6f, 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}}, author = {{Åström, Karl and Heyden, Anders}}, booktitle = {{Computer Vision and Pattern Recognition}}, isbn = {{0 8186 7258 7}}, keywords = {{image sequences; motion estimation}}, language = {{eng}}, pages = {{833--838}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Multilinear Constraints in the Infinitesimal-time Case}}, url = {{http://dx.doi.org/10.1109/CVPR.1996.517168}}, doi = {{10.1109/CVPR.1996.517168}}, year = {{1996}}, }