Learning-Based Bipartite Graph Matching for View-Based 3D Model Retrieval
Lists
Only you see this
Abstract
Distance measure between two sets of views is one central task in view-based 3D model retrieval. In this paper, we introduce a distance metric learning method for bipartite graph matching-based 3D object retrieval framework. In this method, the relationship among 3D models is formulated by a graph structure with semisupervised learning to estimate the model relevance. More specially, we model two sets of views by using a bipartite graph, on which their optimal matching is estimated. Then, we learn a refined distance metric by using the user's relevance feedback. The proposed method has been evaluated on four data sets and the experimental results and comparison with the state-of-the-art methods demonstrate the effectiveness of the proposed method.
BibTeX
@article{lu2014learning,
author = {Ke Lu and Rongrong Ji and Jinhui Tang and Yue Gao},
title = {{Learning-Based Bipartite Graph Matching for View-Based 3D Model Retrieval}},
journal = {IEEE Trans. Image Process.},
year = {2014},
url = {https://openreview.net/forum?id=2h79bWK2uZC},
}Loading related content...