Sciweavers

111 search results - page 3 / 23
» The Generalized Singular Value Decomposition and the Method ...
Sort
View
ICIP
2009
IEEE
13 years 5 months ago
Fast subspace-based tensor data filtering
Subspace-based methods rely on dominant element selection from second order statistics. They have been extended to tensor processing, in particular to tensor data filtering. For t...
Julien Marot, Caroline Fossati, Salah Bourennane
CVPR
2008
IEEE
14 years 9 months ago
Spectrally optimal factorization of incomplete matrices
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...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...
IJCV
2000
133views more  IJCV 2000»
13 years 7 months ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
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...
Yoram Leedan, Peter Meer
FOCM
2011
175views more  FOCM 2011»
13 years 2 months ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
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 ...
Donald Goldfarb, Shiqian Ma
CSDA
2002
77views more  CSDA 2002»
13 years 7 months ago
Numerically stable cointegration analysis
Cointegration analysis involves the solution of a generalized eigenproblem involving moment matrices and inverted moment matrices. These formulae are unsuitable for actual computa...
Jurgen A. Doornik, R. J. O'Brien