GraphMatch: Efficient Large-Scale Graph Construction for Structure from Motion

by   Qiaodong Cui, et al.

We present GraphMatch, an approximate yet efficient method for building the matching graph for large-scale structure-from-motion (SfM) pipelines. Unlike modern SfM pipelines that use vocabulary (Voc.) trees to quickly build the matching graph and avoid a costly brute-force search of matching image pairs, GraphMatch does not require an expensive offline pre-processing phase to construct a Voc. tree. Instead, 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.


page 1

page 2

page 3

page 4


Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information

Driven by many real applications, we study the problem of seeded graph m...

A Unified View-Graph Selection Framework for Structure from Motion

View-graph is an essential input to large-scale structure from motion (S...

Efficient Initial Pose-graph Generation for Global SfM

We propose ways to speed up the initial pose-graph generation for global...

High-Order Relation Construction and Mining for Graph Matching

Graph matching pairs corresponding nodes across two or more graphs. The ...

Efficient Approximate Search for Sets of Vectors

We consider a similarity measure between two sets A and B of vectors, th...

A deterministic balancing score algorithm to avoid common pitfalls of propensity score matching

Propensity score matching (PSM) is the de-facto standard for estimating ...

SMARAGD: Synthesized sMatch for Accurate and Rapid AMR Graph Distance

The semantic similarity of graph-based meaning representations, such as ...