k-Partite graph reinforcement and its application in multimedia information retrieval
Information Sciences: an International Journal
Hi-index | 0.00 |
This paper proposes a structural matching algorithm for 3D retrieval. It decomposes the 3D object into meaningful patches, and performs similarity calculation by bipartite matching. The retrieving performance of the proposed algorithm will remain almost no any decreasing for connected objects. While the performance will be a great improvement if the database contains disconnected objects.