1024 search results - page 1 / 205 » The Generalized PatchMatch Correspondence Algorithm |
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
CVPR
2011
IEEE
13 years 11 days ago
2011
IEEE
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
JANCL
2008
13 years 5 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
JMIV
2007
13 years 4 months ago
2007
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
ICCV
2007
IEEE
14 years 6 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...