Sciweavers

2127 search results - page 72 / 426
» Computing large matchings fast
Sort
View
CVPR
2006
IEEE
16 years 5 months ago
Stereo Vision in Structured Environments by Consistent Semi-Global Matching
This paper considers the use of stereo vision in structured environments. Sharp discontinuities and large untextured areas must be anticipated, but complex or natural shapes of ob...
Heiko Hirschmüller
129
Voted
AINA
2003
IEEE
15 years 9 months ago
Fast Algorithms for Common-Multiplicand Multiplication and Exponentiation by Performing Complements
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
Chin-Chen Chang, Ying-Tse Kuo, Chu-Hsing Lin
158
Voted
AC
2000
Springer
15 years 8 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson
105
Voted
CVPR
2007
IEEE
16 years 5 months ago
A Robust Warping Method for Fingerprint Matching
This paper presents a robust warping method for minutiae based fingerprint matching approaches. In this method, a deformable fingerprint surface is described using a triangular me...
Dongjin Kwon, Il Dong Yun, Sang Uk Lee
DCC
2004
IEEE
16 years 3 months ago
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...