Netinfo Security ›› 2018, Vol. 18 ›› Issue (12): 8-14.doi: 10.3969/j.issn.1671-1122.2018.12.002

Previous Articles     Next Articles

Spectral Clustering Bipartite Graph Segmentation Method Based on Color Invariant Features

Wei ZHAO1,2,3, Na ZHAO1(), Yixing ZHANG4   

  1. 1. College of Computer, National University of Defense Technology, Changsha Hunan 410073, China
    2.Department of Information Technology, Hunan Police Academy, Changsha Hunan 410073, China
    3.Key Laboratory of Network Crime Investigation, Colleges of Human Province, Changsha Hunan 410073,China
    4.Xiangzhou Brigade, Network Police Detachment of Zhuhai Public Security Bureau, Zhuhai Guangdong 519000,China
  • Received:2018-09-25 Online:2018-12-20 Published:2020-05-11

Abstract:

The segmentation results of segmentation methods based on spectral clustering are significantly affected by the performance of superpixels clustering. However, the performance of superpixels clustering mostly depends on the construction of affinity model. Bipartite graph segmentation framework with cross-affinity matrix makes superipixels clustering more efficient, but its affinity model uses simple color features without considering the effect of illuminant changes such as highlights, shading et al, which may result in failed object segmentation. To improve the coherence of superpixels clustering, this paper uses color descriptor with color invariant features and Ridge feature which reflects physical reflection of imaging surface to construct cross-affinity model. Based on the validation in Berkeley database, the spectral clustering segmentation method based on color invariant features achieves better performances compared to existing segmentation techniques.

Key words: spectral clustering, superpixels, bipartite graph segmentation, color invariance

CLC Number: