129 search results - page 8 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
CVPR
2010
IEEE
13 years 6 months ago
2010
IEEE
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 ...
ECCV
1994
Springer
14 years 10 months ago
1994
Springer
We show how a special decomposition of a set of two or three general projection matrices, called canonic enables us to build geometric descriptions for a system of cameras which a...
TASLP
2008
13 years 8 months ago
2008
Source separation of musical signals is an appealing but difficult problem, especially in the single-channel case. In this paper, an unsupervised single-channel music source separa...
JCO
1998
13 years 8 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...