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...
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...
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...
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...
Samir Khuller, Stephen G. Mitchell, Vijay V. Vazir...
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...