Skoči na glavni sadržaj

Izvorni znanstveni članak

Improved support vector clustering algorithm for color image segmentation

Yongqing Wang ; Department of Computer Science and Applications, Zhengzhou Institute of Aeronautical Industry Management, Zhengzhou 450015, China
Xiling Liu ; College of Information & Business, Zhongyuan University of Technology, Zhengzhou 450007, China

Puni tekst: engleski PDF 1.127 Kb

str. 121-129

preuzimanja: 354



Color image segmentation has attracted more and more attention in various application fields during the past few years. Essentially speaking, color image segmentation problem is a process of clustering according to the color of pixels. But, traditional clustering methods do not scale well with the number of training sample, which limits the ability of handling massive data effectively. With the utilization of an improved approximate Minimum Enclosing Ball algorithm, this article develops an fast support vector clustering algorithm for computing the different clusters of given color images in kernel-introduced space to segment the color images. We prove theoretically that the proposed algorithm converges to the optimum within any given precision quickly. Compared to other popular algorithms, it has the competitive performances both on training time and accuracy. Color image segmentation experiments on both synthetic and real-world data sets demonstrate the validity of the proposed algorithm.

Ključne riječi

Image processing, Color image segmentation, Support vector clustering, MEB algorithm, Massive data

Hrčak ID:



Posjeta: 611 *