NAPA and DIBP accelerate A* consensus maximization tree search by orders of magnitude while preserving global optimality, making exact robust fitting practical on previously infeasible inputs.
Robust fitting in computer vision: Easy or hard? In European Con- ference on Computer Vision (ECCV), 2018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Consensus Maximization Tree Search Revisited
NAPA and DIBP accelerate A* consensus maximization tree search by orders of magnitude while preserving global optimality, making exact robust fitting practical on previously infeasible inputs.