619 search results - page 19 / 124 » Random Bichromatic Matchings |
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Althoug...
TIT
2008
13 years 8 months ago
2008
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
ICALP
1991
Springer
14 years 8 days ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...