Neighborhood Similarity-Based Color Transfer Algorithm

Color transfer produces a new image and keeps the content of source image and the color of reference image. The technology is widely used in areas such as prepress image processing and multimedia post-production. The article proposes an adaptive local color transfer algorithm based on neighborhood similarity. Firstly, two classical algorithms—Reinhard algorithm and Welsh algorithm—are analyzed on the applicability and deficiency according to the experiments. Then, a new method is introduced to improve Welsh algorithm on incomplete point neighborhood description and the low efficiency of searching for matching points, which is calculating the neighborhood average value by adding high-frequency texture information to describe neighborhood features, and local hierarchical matching points searching strategy. The matching points searching strategy includes dividing the target image into blocks, searching for matching point based on neighborhood similarity firstly, and searching the global image to find best matching points finally. Experiments demonstrate that the improved algorithm can transfer the referential color effectively without any user intervention.

[1]  D. Ruderman,et al.  Statistics of cone responses to natural images: implications for visual coding , 1998 .

[2]  Zhaojiong Chen,et al.  A Color Transfer Algorithm Based on Neighborhood Correlation and Optimization Techniques , 2011, 2011 Fourth International Symposium on Computational Intelligence and Design.

[3]  Klaus Mueller,et al.  Transferring color to greyscale images , 2002, ACM Trans. Graph..

[4]  Erik Reinhard,et al.  Color Transfer between Images , 2001, IEEE Computer Graphics and Applications.

[5]  Dani Lischinski,et al.  Colorization using optimization , 2004, SIGGRAPH 2004.