Please use this identifier to cite or link to this item:
|Title:||Manifold optimisation for motion factorisation|
|Citation:||19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6,3555-3558|
|Abstract:||This paper presents a novel formulation for the popular factorisation based solution for Structure from Motion. Since our measurement matrices are populated with incomplete and inaccurate data, SVD based total least squares solution are less than appropriate. Instead, we approach the problem as a non-linear unconstrained minimisation problem on the product manifold of the Special Euclidean Group (SE(3)). The restriction of the domain of optimisation to the SE(3) product manifold not only implies that each intermediate solution is a plausible object motion, but also ensures better intrinsic stability for the minimisation algorithm. We compare our method with existing state of art, and show that our algorithm exhibits superior performance.|
|Appears in Collections:||Proceedings papers|
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.