For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
We propose a simple but flexible method for solving the generalized vector-valued TV (VTV) functional, which includes both the 2 -VTV and 1 -VTV regularizations as special cases, ...
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...