45 search results - page 2 / 9 » The Beta-Jacobi Matrix Model, the CS Decomposition, and Gene... |
IJCV
2000
13 years 4 months ago
2000
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
CVPR
2008
IEEE
14 years 6 months ago
2008
IEEE
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
FOCM
2011
12 years 11 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
SCIA
2009
Springer
13 years 11 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
CVPR
2010
IEEE
13 years 2 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 ...