Record Details

Manifold optimisation for motion factorisation

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Manifold optimisation for motion factorisation
 
Creator SHAJI, A
CHANDRAN, S
SUTER, D
 
Description 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.
 
Publisher IEEE
 
Date 2011-10-27T18:45:51Z
2011-12-15T09:12:46Z
2011-10-27T18:45:51Z
2011-12-15T09:12:46Z
2008
 
Type Proceedings Paper
 
Identifier 19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6,3555-3558
978-1-4244-2174-9
1051-4651
http://dspace.library.iitb.ac.in/xmlui/handle/10054/16389
http://hdl.handle.net/100/2885
 
Source 19th International Conference on Pattern Recognition (ICPR 2008),Tampa, FL,DEC 08-11, 2008
 
Language English