1054 search results - page 5 / 211 » Fast Approximated SIFT |
100
click to vote
ICPR
2008
IEEE
15 years 5 months ago
2008
IEEE
Object recognition forms a ubiquitous problem in digital image processing. The detection of robust image features of high distinctiveness is one important key in this regard. We p...
160
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
116
click to vote
PAMI
2011
14 years 6 months ago
2011
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...