Sciweavers

242 search results - page 6 / 49
» Compact Fundamental Matrix Computation
Sort
View
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
14 years 7 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
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
100
Voted
IJCV
2006
132views more  IJCV 2006»
14 years 9 months ago
Two-View Multibody Structure from Motion
We present an algebraic geometric approach to 3-D motion estimation and segmentation of multiple rigid-body motions from noise-free point correspondences in two perspective views. ...
René Vidal, Yi Ma, Stefano Soatto, Shankar ...
CSDA
2006
85views more  CSDA 2006»
14 years 9 months ago
Fast and compact smoothing on large multidimensional grids
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
Paul H. C. Eilers, Iain D. Currie, María Du...
CVPR
2010
IEEE
14 years 11 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...