Matching Intensity for Image Visibility Graphs: A New Method to Extract Image Features

摘要

Recently, the image visibility graphs (IVG) had introduced as simple algorithms by which images map into complex networks. However, current methods based on IVG use global statistical behaviors of the resulting graph to extract image features, which leads to loss of the local structural information of the image. To extract more informative image features by using the concept of IVG, we propose a new concept called matching intensity for image visibility graphs (MIIVG). The key idea of MIIVG is to separate the image into segments and represent the structural behavior of each with reference patterns and corresponding matching intensity. Theoretical analysis shows that the operation of MIIVG can be simplified to convolution operation and provides 256 convolution kernels with clear and apparent physical meaning, through which we can extract image features from multi-viewpoints and obtained more informative image features. Theoretical analysis and experiments demonstrate that MIIVG has a remarkable computing speed and is sufficiently stable against noise. Its high performance in image feature extraction we confirmed by two experiments. In keypoint matching experiments, MIIVG achieves a competitive result compared with SIFT. In texture classification experiments, compared with LBP, MIIVG is superior to LBP in calculation speed and classification effect. Compared with several current deep learning models, they all have the best feature extraction effect and very fast, but the features extracted by MIIVG are more concise. Also, MIIVG hardware requirements are lower, so it is easier to deploy. It is worth mentioning that MIIVG achieved 99.7% classification accuracy on the Multiband datasets, which is a state of the art performance on texture classification task of Multiband datasets and fully demonstrates the effectiveness of MIIVG.