Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a n...
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and...
Manuel Abellanas, Ferran Hurtado, Christian Icking...
The paper tackles the problem of feature points matching between pair of images of the same scene. This is a key problem in computer vision. The method we discuss here is a versio...