10146 search results - page 89 / 2030 » Fast FAST |
156
click to vote
PAMI
2012
13 years 4 months ago
2012
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
130
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
105
click to vote
ICIP
2004
IEEE
16 years 4 months ago
2004
IEEE
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
101
Voted
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
ISCAS
2008
IEEE
15 years 8 months ago
2008
IEEE
— We present an efficient technique for the fast and accurate extraction of inductance of large-scale on-chip interconnects. Several simulation techniques exploit the sparsity o...