Abstract: There is provided a system and method for parallel coherent random walk search for image processing. There is provided a method comprising selecting a present candidate from coherent texels of a target texel in an output texture, assigning a position of the present candidate as a random search center position within an input exemplar, and repeating iterations of a random walk search while an area exceeds a cut-off. Each iteration comprises: retrieving a random candidate within the area centered on the random search center position, updating the present candidate and the random search center position to the random candidate if the random candidate is a closer match, and reducing the area. The initial present candidate selection may use parallel k-coherence with k=1. The parallel coherent random walk search is particularly applicable for texture by numbers (TBN), as the random walk allows for faster convergence of transition areas between textures.

Abstract: There is provided a system and method for parallel coherent random walk search for image processing. There is provided a method comprising selecting a present candidate from coherent texels of a target texel in an output texture, assigning a position of the present candidate as a random search center position within an input exemplar, and repeating iterations of a random walk search while an area exceeds a cut-off. Each iteration comprises: retrieving a random candidate within the area centered on the random search center position, updating the present candidate and the random search center position to the random candidate if the random candidate is a closer match, and reducing the area. The initial present candidate selection may use parallel k-coherence with k=1. The parallel coherent random walk search is particularly applicable for texture by numbers (TBN), as the random walk allows for faster convergence of transition areas between textures.