Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching.
Hing-Fung TingXiangzhong XiangPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- matching algorithm
- maximum weight
- graph matching
- maximum cardinality
- object matching
- online algorithms
- edge weights
- online learning
- significant improvement
- bipartite graph matching
- learning algorithm
- weighted graph
- matching process
- matching scheme
- data structure
- data sets
- association graph
- subpixel accuracy
- image processing
- multiscale
- minimum distance
- stereo correspondence
- string matching
- computational cost
- bipartite graph
- real time
- computational complexity
- keypoints
- orders of magnitude
- theoretical analysis
- feature points
- worst case