Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Multi-projective Parameter Estimation for Sets of Homogeneous Matrices|
Van Den Hengel, A.
|Citation:||Digital Image Computing: Techniques and Applications (DICTA) Proceedings, 2009: pp. 119-124|
|Conference Name:||Digital Image Computing: Techniques and Applications (2009 : Melbourne, Australia)|
|Wojciech Chojnacki, Rhys Hill, Anton van den Hengel, Michael J. Brooks|
|Abstract:||A number of problems in computer vision require the estimation of a set of matrices, each of which is defined only up to an individual scale factor and represents the parameters of a separate model, under the assumption that the models are intrinsically interconnected. One example of such a set is a family of fundamental matrices sharing an infinite homography. Here an approach is presented to estimating a general set of interdependent matrices defined to within separate scales. The input data is assumed to consist of individually estimated matrices for particular models, which when considered collectively may fail to satisfy the constraints representing the inter-model relationships. Two cost functions are proposed for upgrading, via optimisation, the data of this sort to a collection of matrices satisfying the inter- model constraints. One of these functions incorporates error covariances. Each function is invariant to any change of scale for the input estimates. The proposed approach is applied to the particular problem of estimating a set of fundamental matrices of the form of the example set above. Experimental results are given which demonstrate the effectiveness of the approach.|
|Keywords:||multi-projective parameter estimation; scale independence; maximum likelihood; covariance; homogeneous matrix; fundamental matrix; homography; infinite homography|
|Rights:||© 2009 IEEE|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.