Shape and motion from image streams under orthography: a factorization method
International Journal of Computer Vision
Separability of Pose and Expression in Facial Tracking and Animation
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Damped Newton Algorithms for Matrix Factorization with Missing Data
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Separating Style and Content with Bilinear Models
Neural Computation
Photometric Stereo with General, Unknown Lighting
International Journal of Computer Vision
Nonrigid Structure-from-Motion: Estimating Shape and Motion with Hierarchical Priors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Estimating 3D shape from degenerate sequences with missing data
Computer Vision and Image Understanding
Journal of Signal Processing Systems
Region filling and object removal by exemplar-based image inpainting
IEEE Transactions on Image Processing
Structure from motion and photometric stereo for dense 3D shape recovery
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
A method for asteroids 3D surface reconstruction from close approach distances
ICVS'11 Proceedings of the 8th international conference on Computer vision systems
Articulated motion segmentation of point clouds by group-valued regularization
EG 3DOR'12 Proceedings of the 5th Eurographics conference on 3D Object Retrieval
Fast regularization of matrix-valued images
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III
Hi-index | 0.00 |
This paper presents a unified approach to solve different bilinear factorization problems in Computer Vision in the presence of missing data in the measurements. The problem is formulated as a constrained optimization problem where one of the factors is constrained to lie on a specific manifold. To achieve this, we introduce an equivalent reformulation of the bilinear factorization problem. This reformulation decouples the core bilinear aspect from the manifold specificity. We then tackle the resulting constrained optimization problem with Bilinear factorization via Augmented Lagrange Multipliers (BALM). The mechanics of our algorithm are such that only a projector onto the manifold constraint is needed. That is the strength and the novelty of our approach: it can handle seamlessly different Computer Vision problems. We present experiments and results for two popular factorization problems: Non-rigid Structure from Motion and Photometric Stereo.