Abstract

In this paper, we present a new approach for shape/image retrieval by efficiently fusing different shape similarities, called Pair-Graph Diffusion. Different from other algorithms which linearly integrate different similarity measures, our algorithm adopts Tensor Product Graph(TPG) to combine two shape similarities by fusing two single-graphs into a multi-graph for fusion process. In such way, we gain more shape information in a higher order, and the multigraph is able to better reveal the intrinsic relation between shapes especially when the two input similarities are very complementary. We perform the experiments on two popular image datasets: MPEG-7 shape dataset and Nister and Stewenius (N-S) dataset, and achieve state-of-arts retrieval rates: 98.87% on MPEG-7 dataset and 3.69 on N-S dataset. The results demonstrate that the proposed method can effectively fuse two similarities. In addition, Multi-graph Diffusion is a general similarity learning algorithm, and it can be easily applied other tasks for ranking/retrieval.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.