View-based 3D Object Retrieval by Bipartite Graph Matching

Bipartite graph matching has been investigated in multiple view matching for 3D object retrieval. However, existing methods employ one-to-one vertex matching scheme while more than two views may share close semantic meanings in practice. In this work, we propose a bipartite graph matching method to...

Full description

Saved in:
Bibliographic Details
Main Authors: WEN, Yue, GAO, Yue, HONG, Richang, LUAN, Huanbo, LIU, Qiong, SHEN, Jialie, JI, Rongrong
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2012
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/1648
http://dx.doi.org/10.1145/2393347.2396341
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-2647
record_format dspace
spelling sg-smu-ink.sis_research-26472018-07-13T03:09:30Z View-based 3D Object Retrieval by Bipartite Graph Matching WEN, Yue GAO, Yue HONG, Richang LUAN, Huanbo LIU, Qiong SHEN, Jialie JI, Rongrong Bipartite graph matching has been investigated in multiple view matching for 3D object retrieval. However, existing methods employ one-to-one vertex matching scheme while more than two views may share close semantic meanings in practice. In this work, we propose a bipartite graph matching method to measure the distance between two objects based on multiple views. In the proposed method, representative views are first selected by using view clustering for each object, and the corresponding weights are given based on the cluster results. A bipartite graph is constructed by using the two groups of representative views from two compared objects. To calculate the similarity between two objects, the bipartite graph is first partitioned to several subsets, and the views in the same sub-set are with high possibility to be with similar semantic meanings. The distances between two objects within individual subsets are then assembled through the graph to obtain the final similarity. Experimental results and comparison with the state-of-the-art methods demonstrate the effectiveness of the proposed algorithm. 2012-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/1648 info:doi/10.1145/2393347.2396341 http://dx.doi.org/10.1145/2393347.2396341 http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University 3D object retrieval bipartite graph graph matching Databases and Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic 3D object retrieval
bipartite graph
graph matching
Databases and Information Systems
spellingShingle 3D object retrieval
bipartite graph
graph matching
Databases and Information Systems
WEN, Yue
GAO, Yue
HONG, Richang
LUAN, Huanbo
LIU, Qiong
SHEN, Jialie
JI, Rongrong
View-based 3D Object Retrieval by Bipartite Graph Matching
description Bipartite graph matching has been investigated in multiple view matching for 3D object retrieval. However, existing methods employ one-to-one vertex matching scheme while more than two views may share close semantic meanings in practice. In this work, we propose a bipartite graph matching method to measure the distance between two objects based on multiple views. In the proposed method, representative views are first selected by using view clustering for each object, and the corresponding weights are given based on the cluster results. A bipartite graph is constructed by using the two groups of representative views from two compared objects. To calculate the similarity between two objects, the bipartite graph is first partitioned to several subsets, and the views in the same sub-set are with high possibility to be with similar semantic meanings. The distances between two objects within individual subsets are then assembled through the graph to obtain the final similarity. Experimental results and comparison with the state-of-the-art methods demonstrate the effectiveness of the proposed algorithm.
format text
author WEN, Yue
GAO, Yue
HONG, Richang
LUAN, Huanbo
LIU, Qiong
SHEN, Jialie
JI, Rongrong
author_facet WEN, Yue
GAO, Yue
HONG, Richang
LUAN, Huanbo
LIU, Qiong
SHEN, Jialie
JI, Rongrong
author_sort WEN, Yue
title View-based 3D Object Retrieval by Bipartite Graph Matching
title_short View-based 3D Object Retrieval by Bipartite Graph Matching
title_full View-based 3D Object Retrieval by Bipartite Graph Matching
title_fullStr View-based 3D Object Retrieval by Bipartite Graph Matching
title_full_unstemmed View-based 3D Object Retrieval by Bipartite Graph Matching
title_sort view-based 3d object retrieval by bipartite graph matching
publisher Institutional Knowledge at Singapore Management University
publishDate 2012
url https://ink.library.smu.edu.sg/sis_research/1648
http://dx.doi.org/10.1145/2393347.2396341
_version_ 1770571389786390528