Efros and Freeman [1]} and Liang et al. [2]} both propose algorithms similar to [3]} in that they synthesize the the output texture in raster order and condition on a region of overlap with the texture synthesized so far. However, instead of sampling each pixel independently, entire patches are sampled at once. If we consider the size of patches sampled jointly to be the algorithm's 'stride' then the algorithm of [3]} can be considered to be these algorithms with a 'stride' of one. When the 'stride' is greater than one the question arises of how to blend new patches with those selected so far. In [2]} overlapping patches are blended using cross edge smoothing (i.e. feathering). To avoid synthesizing overly smooth textures [1]} propose joining the patches along a minimum error boundary cut, which finds the (often irregular) discontinuity minimizing edge to switch between patches.
