Journal of System Simulation ›› 2015, Vol. 27 ›› Issue (10): 2359-2364.

Previous Articles     Next Articles

Color Transfer Based on K-means Clustering Algorithm and Region Matching

Zhang Ziying1,2, Zhou Mingquan1,2, Shui Wuyang1,2, Wu Zhongke1,2, Zheng Xia3   

  1. 1. College of Information Science and Technology, Beijing Normal University, Beijing 100875, China;
    2. Engineering Research Center of Virtual Reality and Applications, Ministry of Education, Beijing 100875, China;
    3. Department of Culture Heritage and Museology, Hangzhou 310058, China
  • Received:2015-06-13 Revised:2015-07-24 Online:2015-10-08 Published:2020-08-07

Abstract: For color transfer between colorful images, we used K-means clustering to classify image pixels and we also proposed nearest region matching algorithm. This algorithm can avoid the problem that multiple regions matched to the same region, and it can get the best match results between the two images. Translate the color space from RGB to for the two images. Divide color image and luminance mapped shape image using K-means models into the same number of classes. Determine the relationship between regions of the two images using Euclidean distance and the nearest region matching algorithm. Complete color transfer from color image to the shape image. Experimental results show that the algorithm can achieve the color transfer better for colorful images.

Key words: K-means clustering, region matching, color transfer, colorful image

CLC Number: