From f4985026de97855454a1213a717c384d338682ea Mon Sep 17 00:00:00 2001 From: Saijin-Naib <19295950+Saijin-Naib@users.noreply.github.com> Date: Tue, 9 Nov 2021 16:51:46 -0500 Subject: [PATCH] Update config.py Add AKAZE to --feature-type, re-order --feature-type to be alphabetical, Add bruteforce to --matcher-type, re-order --matcher-type to be alphabetical, add description for bruteforce. --- opendm/config.py | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/opendm/config.py b/opendm/config.py index c59a8beb..f6d5d16d 100755 --- a/opendm/config.py +++ b/opendm/config.py @@ -133,7 +133,7 @@ def config(argv=None, parser=None): metavar='', action=StoreValue, default='sift', - choices=['sift', 'orb', 'hahog'], + choices=['akaze', 'hahog', 'orb', 'sift'], help=('Choose the algorithm for extracting keypoints and computing descriptors. ' 'Can be one of: %(choices)s. Default: ' '%(default)s')) @@ -151,8 +151,8 @@ def config(argv=None, parser=None): metavar='', action=StoreValue, default='flann', - choices=['flann', 'bow'], - help=('Matcher algorithm, Fast Library for Approximate Nearest Neighbors or Bag of Words. FLANN is slower, but more stable. BOW is faster, but can sometimes miss valid matches. ' + choices=['bow', 'bruteforce'. 'flann'], + help=('Matcher algorithm, Fast Library for Approximate Nearest Neighbors or Bag of Words. FLANN is slower, but more stable. BOW is faster, but can sometimes miss valid matches. BRUTEFORCE is very slow but robust.' 'Can be one of: %(choices)s. Default: ' '%(default)s'))