1024 search results - page 161 / 205 » The Generalized PatchMatch Correspondence Algorithm |
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
COMPGEOM
2011
ACM
13 years 7 days ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
Is the real problem in resolving correspondence using current stereo algorithms the lack of the "right" matching criterion? In studying the related task of reconstructin...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
We consider the task of learning to accurately follow a trajectory in a vehicle such as a car or helicopter. A number of dynamic programming algorithms such as Differential Dynami...