CANDIDATE PRUNING FOR PATCH TRANSFORMS

Systems and methods for performing image editing operations may divide an input image into overlapping patches and assign those patches to locations in a reconstructed output image such that visual artifacts are minimized. The methods may use belief propagation to compute a joint probability for the assignment of active patch labels to output image nodes. The computation may include an exclusivity term, steering the solution such that each patch is preferably only used once in the output image. The methods may include a pre-computation of a pruned list of candidate patches for placing next to each patch in the output image, dependent on local evidence (e.g., color, intensity, or user-driven placement) for each patch. The pre-computation may include determining groupings of patches, each forming a highly compatible loop of neighboring patches for a given candidate patch. The methods may be implemented as program instructions executable by a CPU and/or GPU.