Abstract

In this paper, we presents a new method for extracting interest points from RGB images by complex network analysis theory. Firstly, the RGB images are expressed as the multi-level complex network model. The nodes in the complex network model are the maximum degree pixel of subgraphs and the links are the similarity and distance between the maximum degree pixels. Then three different algorithms were proposed to locate these interest points based on three topology features of high-level complex network model, which are degree, closeness and betweenness centrality. In order to verify the effectiveness of our algorithm, we use our algorithm for four different test images. It is remarkable that the identify targets by degree centrality algorithm are similar to Harris and SIFT algorithm, and the accuracy are more than them. The results show that our algorithm could identify interest points from the images effectively.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call