2011
DOI: 10.1016/j.image.2010.10.006
|View full text |Cite
|
Sign up to set email alerts
|

3D model retrieval using weighted bipartite graph matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
46
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 103 publications
(46 citation statements)
references
References 34 publications
0
46
0
Order By: Relevance
“…2017, 9, 92 6 of 16 Subsequently, a bipartite graph G = {B, U, E} is constructed, where E represents the edges linking the vertices in point sets B and U. The bipartite graph G can be defined with |G| = |B| + |U| vertices, where |.| is the cardinality and |B| = |U| = n. According to [6,60,61], the weight of the edges from vertices in B to vertices in U is defined by the distance in the spatial domain, as shown in Figure 2b.…”
Section: Bipartite Graph Matchingmentioning
confidence: 99%
See 1 more Smart Citation
“…2017, 9, 92 6 of 16 Subsequently, a bipartite graph G = {B, U, E} is constructed, where E represents the edges linking the vertices in point sets B and U. The bipartite graph G can be defined with |G| = |B| + |U| vertices, where |.| is the cardinality and |B| = |U| = n. According to [6,60,61], the weight of the edges from vertices in B to vertices in U is defined by the distance in the spatial domain, as shown in Figure 2b.…”
Section: Bipartite Graph Matchingmentioning
confidence: 99%
“…An increasing number of applications, such as urban planning, training simulations, virtual tourism, real-time emergency response, personal navigation, and homeland security, require 3D building models as an input source [2][3][4][5][6]. The 3D building models provide quick access to the urban topography, human-made structures, and our surrounding environment.…”
Section: Introductionmentioning
confidence: 99%
“…With user feedback, these low level features are mapped to high level semantic space, which is another Euclidean space and can be regarded as a dimension reduction or feature selection method. A bipartite graph learning method is introduced in [38], where the comparison between two groups of multiple views is formulated in a bipartite graph. A learning-based method for bipartite graph matching is proposed in [39].…”
Section: Related Workmentioning
confidence: 99%
“…We proposed to employ bipartite graphs to formulate the relationship between two groups of views from two 3-D objects [27]. The representative views are first generated from each object and all representative views from one object are denoted by one part of the bipartite graph.…”
Section: • Bipartite Graph Matching and Learningmentioning
confidence: 99%