Sciweavers

8669 search results - page 37 / 1734
» Computing matrix representations
Sort
View
BMVC
2002
13 years 10 months ago
A New Constrained Parameter Estimator: Experiments in Fundamental Matrix Computation
In recent work the authors proposed a wide-ranging method for estimating parameters that constrain image feature locations and satisfy a constraint not involving image data. The p...
Anton van den Hengel, Michael J. Brooks, Wojciech ...
SC
2003
ACM
14 years 28 days ago
Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Computations
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
Kai Wang, Jun Zhang, Chi Shen
CVPR
2010
IEEE
13 years 5 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
PPAM
2005
Springer
14 years 1 months ago
SILC: A Flexible and Environment-Independent Interface for Matrix Computation Libraries
We propose a new framework, named Simple Interface for Library Collections (SILC), that gives users access to matrix computation libraries in a flexible and environment-independen...
Tamito Kajiyama, Akira Nukada, Hidehiko Hasegawa, ...
IEICET
2007
131views more  IEICET 2007»
13 years 7 months ago
High Accuracy Fundamental Matrix Computation and Its Performance Evaluation
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem ...
Ken-ichi Kanatani, Yasuyuki Sugaya