Sciweavers

242 search results - page 7 / 49
» Compact Fundamental Matrix Computation
Sort
View
ACSC
2009
IEEE
15 years 6 months ago
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
Nikolas Askitis
IPPS
2009
IEEE
15 years 6 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
CVPR
1999
IEEE
15 years 4 months ago
Projective Rectification Without Epipolar Geometry
We present a novel algorithm performing projective rectification which does not require explicit computation of the epipolar geometry, and specifically of the fundamental matrix. ...
Francesco Isgrò, Emanuele Trucco
SIPS
2007
IEEE
15 years 6 months ago
Efficient Function Evaluations with Lookup Tables for Structured Matrix Operations
A hardware ef cient approach is introduced for elementary function evaluations in certain structured matrix computations. It is a comprehensive approach that utilizes lookup table...
Kanwaldeep Sobti, Lanping Deng, Chaitali Chakrabar...
ICCV
1995
IEEE
15 years 3 months ago
In Defence of the 8-Point Algorithm
The fundamental matrix is a basic tool in the analysis of scenes taken with two uncalibrated cameras, and the 8-point algorithm is a frequently cited method for computing the fund...
Richard I. Hartley