A linear algorithm for computing the homography from conics in correspondence

被引:21
|
作者
Sugimoto, A [1 ]
机构
[1] Hitachi Ltd, Adv Res Lab, Kokubunji, Tokyo 185, Japan
关键词
conic correspondences; homography; uncalibrated images; tensor product; linear computation; 2-D objects;
D O I
10.1023/A:1026571913893
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a study, based on conic correspondences, on the relationship between two perspective images acquired by an uncalibrated camera. We show that for a pair of corresponding conics, the parameters representing the conics satisfy a linear constraint. To be more specific, the parameters that represent a conic in one image are transformed by a five-dimensional projective transformation to the parameters that represent the corresponding conic in another image. We also show that this transformation is expressed as the symmetric component of the tensor product of the transformation based on point/line correspondences and itself In addition, we present a Linear algorithm for uniquely determining the corresponding point-based transformation from a given conic-based transformation up to a scale factor. Accordingly, conic correspondences enable us to easily handle both points and Lines in uncalibrated images of a planar object.
引用
收藏
页码:115 / 130
页数:16
相关论文
共 50 条
  • [21] A stereo matching algorithm and uncertainty based on homography
    Tian, JS
    Su, JB
    2004 1ST INTERNATIONAL CONFERENCE ON POWER ELECTRONICS SYSTEMS AND APPLICATIONS PROCEEDINGS, 2004, : 248 - 253
  • [22] A Linear-Time Parameterized Algorithm for Computing the Width of a
    Caceres, Manuel
    Cairo, Massimo
    Mumey, Brendan
    Rizzi, Romeo
    Tomescu, Alexandru, I
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2021, 2021, 12911 : 257 - 269
  • [23] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES
    HIRSCHBERG, DS
    COMMUNICATIONS OF THE ACM, 1975, 18 (06) : 341 - 343
  • [24] An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
    Salagean, Ana
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (10) : 4695 - 4700
  • [25] Algorithm for computing the covering constant of a linear operator on a cone
    Zhukovskiy, S. E.
    Zhukovskaya, Z. T.
    COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2016, 56 (08) : 1373 - 1381
  • [26] Computing Extensions of Linear Codes using a Greedy Algorithm
    Grassl, Markus
    Han, Sunghyu
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [27] Algorithm for computing the covering constant of a linear operator on a cone
    S. E. Zhukovskiy
    Z. T. Zhukovskaya
    Computational Mathematics and Mathematical Physics, 2016, 56 : 1373 - 1381
  • [28] An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
    Salagean, Ana
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1746 - 1750
  • [29] A general algorithm for computing distance transforms in linear time
    Meijster, A
    Roerdink, JBTM
    Hesselink, WH
    MATHEMATICAL MORPHOLOGY AND ITS APPLICATIONS TO IMAGE AND SIGNAL PROCESSING, 2000, 18 : 331 - 340
  • [30] A Linear Algorithm for Computing Convex Hulls for Random Lines
    Berend, Daniel
    Braverman, Vladimir
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (04)