MVE - Multi-View Environment mve-devel
|
Bundler Component: Matching between views in an MVE scene. More...
#include <bundler_matching.h>
Classes | |
struct | Options |
Options for feature matching. More... | |
struct | Progress |
Public Types | |
enum | MatcherType { MATCHER_EXHAUSTIVE , MATCHER_CASCADE_HASHING } |
Public Member Functions | |
Matching (Options const &options, Progress *progress=nullptr) | |
void | compute (PairwiseMatching *pairwise_matching) |
Computes the pairwise matching between all pairs of views. | |
void | init (ViewportList *viewports) |
Initialize matching by passing features to the matcher for preprocessing. | |
Bundler Component: Matching between views in an MVE scene.
For every view the feature embedding is loaded and matched to all other views with smaller ID (since the matching is symmetric). Two-view matching involves RANSAC to compute the fundamental matrix (geometric filtering). Only views with a minimum number of matches are considered "connected".
The global matching result can be saved to and loaded from file. The file format is a binary sequence of numbers and IDs (all int32_t):
<number of results> <view ID 1> <view ID 2> <number of matches> <match 1 feature ID 1> <match 1 feature ID 2> <match 2 feature ID 1> <match 2 feature ID 2> ... <view ID 3> <view ID 4> <number of matches> ...
Note:
Definition at line 49 of file bundler_matching.h.
Enumerator | |
---|---|
MATCHER_EXHAUSTIVE | |
MATCHER_CASCADE_HASHING |
Definition at line 52 of file bundler_matching.h.
Definition at line 27 of file bundler_matching.cc.
void sfm::bundler::Matching::compute | ( | PairwiseMatching * | pairwise_matching | ) |
Computes the pairwise matching between all pairs of views.
Computation requires both descriptor data and 2D feature positions in the viewports.
Definition at line 59 of file bundler_matching.cc.
void sfm::bundler::Matching::init | ( | ViewportList * | viewports | ) |
Initialize matching by passing features to the matcher for preprocessing.
Definition at line 45 of file bundler_matching.cc.