Determining correspondence between image regions

A system comprising:

• a computer readable storage memory device configured to store visual content including pixels, the visual content including a first region with a first patch to be mapped to a second region in the visual content;
• a processor to implement iterations of a propagation component and a random-search component, the propagation component configured to perform nearby-pixel mapping evaluation to find mappings for the first patch and the random-search component configured to perform random-perturbation mapping evaluation to find mappings for the first patch, at least one of the nearby-pixel mapping evaluation or the random-perturbation mapping evaluation performed on a different number of candidate patches than second patches found in the second region in at least one of the iterations;
• and
• the computer readable storage memory device further configured to store the second patches of the second region found by at least one of the propagation component and the random-search component.

A computer-implemented method for determining correspondence between image regions, the method comprising:

• selecting, by a computer system, an image descriptor for first and second regions of visual content, the first region comprising a first patch to be mapped to the second region;
• selecting a distance metric for evaluating mappings for the first patch;
• performing iterations to find the mappings for the first patch, the iterations including nearby-pixel mapping evaluation and random-perturbation mapping evaluation, the iterations using the selected image descriptor and the selected distance metric, as well as a heap reflecting patch distance from the first patch to find second patches in the second region, the heap corresponding to k patches;
• determining whether a new patch from the iterations has a smaller patch distance from the first patch than one of the k patches that has a greatest patch distance in the heap, and if so, removing the patch that has the greatest patch distance from the heap and adding the new patch to the heap;
• eliminating any duplicate patches from the k patches before determining patch distance;
• and
• recording at least one second patch in the second region found using the iterations.

A computer-implemented method for determining correspondence between image regions, the method comprising:

• selecting, by a computer system, first and second regions of visual content that includes pixels, the first region comprising a first patch to be mapped to the second region;
• performing iterations to find mappings for the first patch, the iterations including nearby-pixel mapping evaluation and random-perturbation mapping evaluation, the nearby-pixel mapping evaluation and the random-perturbation mapping evaluation configured to result in a single patch being identified in the second region;
• defining a constraint for each iteration of the nearby-pixel mapping evaluation and the random-perturbation mapping evaluation, the constraint prohibiting selection of a patch previously selected;
• retaining all patches identified by the nearby-pixel mapping evaluation and the random-perturbation mapping evaluation;
• and
• recording the retained patches as the second patches found using the iterations.

A computer-implemented method for determining correspondence between image regions, the method comprising:

• selecting, by a computer system, first and second regions of visual content that includes pixels, the first region comprising a first patch to be mapped to the second region;
• selecting at least two heuristics for use in mapping the first patch to the second region, the heuristics selected from the group consisting of:
• (i) nearby-pixel mapping evaluation;
• (ii) random-perturbation mapping evaluation;
• (iii) evaluation of multiple mapping candidates identified in an iterative search process;
• and
• (iv) enrichment to increase a collection of mapping candidates;
• utilizing a heap reflecting patch distance from the first patch to find second patches in the second region, the heap corresponding to k patches;
• determining whether a new patch from the iterations has a smaller patch distance from the first patch than one of the k patches that has a greatest patch distance in the heap, and if so, removing the patch that has the greatest patch distance from the heap, and adding the new patch to the heap;
• eliminating any duplicate patches from the k patches before determining patch distance;
• and
• identifying, using the selected heuristics, at least one patch in the second region for the first patch.