4.7 Article

M-GCN: Multi-Branch Graph Convolution Network for 2D Image-based on 3D Model Retrieval

Journal

IEEE TRANSACTIONS ON MULTIMEDIA
Volume 23, Issue -, Pages 1962-1976

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TMM.2020.3006371

Keywords

Three-dimensional displays; Solid modeling; Two dimensional displays; Computational modeling; Visualization; Feature extraction; Predictive models; Cross-domain retrieval; 3D model retrieval; multi-head attention; multiple graphs

Funding

  1. National Natural Science Foundation of China [61772359, 61572356, 61872267, 61902277]
  2. 2019 Tianjin New Generation Artificial Intelligence Major Program [18ZXZNGX00150, 19ZXZNGX00110]
  3. Open Project Program of the State Key Lab of CAD & CG, Zhejiang University [A2005, A2012]
  4. Tianjin Science Foundation for Young Scientists of China [19JCQNJC00500]

Ask authors/readers for more resources

The study introduces a novel approach for 3D model retrieval based on 2D images, utilizing a multi-branch graph convolution network and a multi-head attention mechanism to enhance the relationship between nodes and improve retrieval performance.
2D image based 3D model retrieval is a challenging research topic in the field of 3D model retrieval. The huge gap between two modalities - 2D image and 3D model, extremely constrains the retrieval performance. In order to handle this problem, we propose a novel multi-branch graph convolution network (M-GCN) to address the 2D image based 3D model retrieval problem. First, we compute the similarity between 2D image and 3D model based on visual information to construct one cross-modalities graph model, which can provide the original relationship between image and 3D model. However, this relationship is not accurate because of the difference of modalities. Thus, the multi-head attention mechanism is employed to generate a set of fully connected edge-weighted graphs, which can predict the hidden relationship between 2D image and 3D model to further strengthen the correlation for the embedding generation of nodes. Finally, we apply the max-pooling operation to fuse the multi-graphs information and generate the fusion embeddings of nodes for retrieval. To validate the performance of our method, we evaluated M-GCN on the MI3DOR dataset, Shrec 2018 track and Shrec 2014 track. The experimental results demonstrate the superiority of our proposed method over the state-of-the-art methods.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available