Journal of Jilin University (Information Science Edition) ›› 2019, Vol. 37 ›› Issue (2): 148-154.

Previous Articles     Next Articles

Improved k-Means Algorithm Based on Lab Space for Color Image Segmentation#br#

HUO Fengcai1a,1 b,SUN Xueting1a,REN Weijian1a,1 b,YANG Di2,YU Tao3   

  1. 1a. School of Electrical Engineering and Information; 1b. Heilongjiang Provincial Key Laboratory of Networking and Intelligent Control,Northeast Petroleum University,Daqing 163318,China;
    2. Institute of Planning and Design for Second Oil Production Plants,Daqing Oil Field Company,Daqing 163461,China;
    3. Institute of Planning and Design for Fourth Oil Production Plants,Daqing Oil Field Company,Daqing 163511,China
  • Received:2018-11-08 Online:2019-03-25 Published:2019-06-10

Abstract: In order to reduce the influence of the high linear correlation of each color component in the RGB( Red Green Blue) space and the scale correlation of the Euclidean distance to the image segmentation results in classical k-means algorithm,the Lab color space can overcome the defect of uneven color distribution in RGB space,an improved k-means clustering method for color image segmentation based on Lab color space is proposed. Firstly,the color space is converted from RGB to Lab,and each pixel can be represented by the combination of L,a and b. Secondly,mahalanobis distance is used to replace Euclidean distance,and the improved k-means algorithm is used to cluster the pixels of the image to achieve the purpose of segmentation.Finally,experiment results show that the improved algorithm has better segmentation effect and accuracy than the classical k-means algorithm.

Key words: cluster, image segmentation, color space, mahalanobis distance

CLC Number: 

  • TP18