Advanced

Multilinear Constraints in the Infinitesimal-time Case

Åström, Karl LU and Heyden, Anders LU (1996) IEEE Conference on Computer Vision and Pattern Recognition, 1996 In Computer Vision and Pattern Recognition 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:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
image sequences, motion estimation
in
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
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
2008-03-31 14:35:10
date last changed
2016-10-13 04:50:27
@misc{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},
  isbn         = {0 8186 7258 7},
  keyword      = {image sequences,motion estimation},
  language     = {eng},
  pages        = {833--838},
  publisher    = {ARRAY(0x8916b20)},
  series       = {Computer Vision and Pattern Recognition},
  title        = {Multilinear Constraints in the Infinitesimal-time Case},
  url          = {http://dx.doi.org/10.1109/CVPR.1996.517168},
  year         = {1996},
}