Name
Abstract | ||
|---|---|---|
•We formulate hypergraph matching of visual features as hypergraph clustering of candidate matches.•We find it is costly to obtain a large number of matches with one single ESS group and discuss the reasons.•We propose to extract an appropriate number of clusters to increase the number of matches efficiently.•Experiments show that our algorithm generates a large number of matches with a high matching accuracy efficiently. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.patcog.2022.108526 | Pattern Recognition |
Keywords | DocType | Volume |
Feature matching,Hypergraph matching,Game-theoretic,Hypergraph clustering | Journal | 125 |
Issue | ISSN | Citations |
1 | 0031-3203 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Hou | 1 | 126 | 17.11 |
| Marcello Pelillo | 2 | 1888 | 150.33 |
| Huaqiang Yuan | 3 | 0 | 0.34 |