337 search results - page 38 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
NIPS
2004
13 years 9 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
Super-resolution image zooming is possible when the image has some geometric regularity. We introduce a general class of non-linear inverse estimators, which combines linear estima...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...