Sciweavers

1068 search results - page 12 / 214
» Factorization as a Rank 1 Problem
Sort
View
CVPR
2010
IEEE
14 years 7 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
ECIR
2010
Springer
14 years 7 months ago
Maximum Margin Ranking Algorithms for Information Retrieval
Abstract. Machine learning ranking methods are increasingly applied to ranking tasks in information retrieval (IR). However ranking tasks in IR often differ from standard ranking t...
Shivani Agarwal, Michael Collins
103
Voted
CVPR
2011
IEEE
14 years 6 months ago
Non-Rigid Structure from Motion with Complementary Rank-3 Spaces
Non-rigid structure from motion (NR-SFM) is a difficult, underconstrained problem in computer vision. This paper proposes a new algorithm that revises the standard matrix factori...
Paulo Gotardo, Aleix Martinez
86
Voted
ECCV
2006
Springer
15 years 11 months ago
Incorporating Non-motion Cues into 3D Motion Segmentation
We address the problem of segmenting an image sequence into rigidly moving 3D objects. An elegant solution to this problem is the multibody factorization approach in which the mea...
Amit Gruber, Yair Weiss
ICPR
2008
IEEE
15 years 4 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel