Please use this identifier to cite or link to this item:
|Title:||Generalizing Wiberg algorithm for rigid and nonrigid factorizations with missing components and metric constraints||Authors:||Zheng, Y.
|Issue Date:||2012||Citation:||Zheng, Y.,Sugimoto, S.,Yan, S.,Okutomi, M. (2012). Generalizing Wiberg algorithm for rigid and nonrigid factorizations with missing components and metric constraints. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition : 2010-2017. ScholarBank@NUS Repository. https://doi.org/10.1109/CVPR.2012.6247904||Abstract:||In spite of intensive endeavor over decades, rigid and nonrigid factorizations under metric constraints, possibly in the presence of missing components, remain to be very challenging. In this work, we try to break the hard nut by generalizing to these problems the Wiberg algorithm, one of the most successful solutions for unconstrained bilinear factorization. To properly handle missing components, we advocate a bilinear factorization formulation with an extra mean vector. In spirit of the Wiberg algorithm, we first propose an efficient and initialization-insensitive algorithm for unconstrained factorization, posterior correction of whose solution offers reasonable initialization for metric upgrade. For factorization with metric constraints, we reformulate it into an unconstrained problem through quaternion parametrization, which merges elegantly into our unconstrained factorization algorithm. Extensive experiment results verify that our proposed methods are fast, accurate and robust to high percentage of missing components. © 2012 IEEE.||Source Title:||Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition||URI:||http://scholarbank.nus.edu.sg/handle/10635/70416||ISBN:||9781467312264||ISSN:||10636919||DOI:||10.1109/CVPR.2012.6247904|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 10, 2019
checked on Sep 8, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.