Name
Abstract | ||
|---|---|---|
We present GraphMatch, an approximate yet efficient method for building the matching graph for large-scale structure-from-motion~(SfM) pipelines. GraphMatch leverages two priors that can predict which image pairs are likely to match, thereby making the matching process for SfM much more efficient. The first is a score computed from the distance between the Fisher vectors of any two images. The second prior is based on the graph distance between vertices in the underlying matching graph. GraphMatch combines these two priors into an iterative ``sample-and-propagate'' scheme similar to the PatchMatch algorithm. Its sampling stage uses Fisher similarity priors to guide the search for matching image pairs, while its propagation stage explores neighbors of matched pairs to find new ones with a high image similarity score. Our experiments show that GraphMatch finds the most image pairs as compared to competing, approximate methods while at the same time being the most efficient. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/3DV.2017.00028 | 2017 International Conference on 3D Vision (3DV) |
Keywords | DocType | Volume |
structure-from-motion,computer-vison | Conference | abs/1710.01602 |
ISSN | ISBN | Citations |
2378-3826 | 978-1-5386-2611-5 | 0 |
PageRank | References | Authors |
0.34 | 38 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qiaodong Cui | 1 | 0 | 0.68 |
| Victor Fragoso | 2 | 74 | 5.51 |
| Chris Sweeney | 3 | 101 | 7.42 |
| Pradeep Sen | 4 | 882 | 53.01 |