Struct opencv::features2d::BFMatcher
source · [−]pub struct BFMatcher { /* private fields */ }
Expand description
Brute-force descriptor matcher.
For each descriptor in the first set, this matcher finds the closest descriptor in the second set by trying each one. This descriptor matcher supports masking permissible matches of descriptor sets.
Implementations
sourceimpl BFMatcher
impl BFMatcher
sourcepub fn new(norm_type: i32, cross_check: bool) -> Result<BFMatcher>
pub fn new(norm_type: i32, cross_check: bool) -> Result<BFMatcher>
Brute-force matcher constructor (obsolete). Please use BFMatcher.create()
C++ default parameters
- norm_type: NORM_L2
- cross_check: false
sourcepub fn create(norm_type: i32, cross_check: bool) -> Result<Ptr<BFMatcher>>
pub fn create(norm_type: i32, cross_check: bool) -> Result<Ptr<BFMatcher>>
Brute-force matcher create method.
Parameters
- normType: One of NORM_L1, NORM_L2, NORM_HAMMING, NORM_HAMMING2. L1 and L2 norms are preferable choices for SIFT and SURF descriptors, NORM_HAMMING should be used with ORB, BRISK and BRIEF, NORM_HAMMING2 should be used with ORB when WTA_K==3 or 4 (see ORB::ORB constructor description).
- crossCheck: If it is false, this is will be default BFMatcher behaviour when it finds the k nearest neighbors for each query descriptor. If crossCheck==true, then the knnMatch() method with k=1 will only return pairs (i,j) such that for i-th query descriptor the j-th descriptor in the matcher’s collection is the nearest and vice versa, i.e. the BFMatcher will only return consistent pairs. Such technique usually produces best results with minimal number of outliers when there are enough matches. This is alternative to the ratio test, used by D. Lowe in SIFT paper.
C++ default parameters
- norm_type: NORM_L2
- cross_check: false
Trait Implementations
sourceimpl AlgorithmTrait for BFMatcher
impl AlgorithmTrait for BFMatcher
sourceimpl AlgorithmTraitConst for BFMatcher
impl AlgorithmTraitConst for BFMatcher
fn as_raw_Algorithm(&self) -> *const c_void
sourcefn write(&self, fs: &mut FileStorage) -> Result<()>
fn write(&self, fs: &mut FileStorage) -> Result<()>
Stores algorithm parameters in a file storage
sourcefn write_with_name(&self, fs: &Ptr<FileStorage>, name: &str) -> Result<()>
fn write_with_name(&self, fs: &Ptr<FileStorage>, name: &str) -> Result<()>
simplified API for language bindings Stores algorithm parameters in a file storage Read more
sourcefn empty(&self) -> Result<bool>
fn empty(&self) -> Result<bool>
Returns true if the Algorithm is empty (e.g. in the very beginning or after unsuccessful read
sourcefn save(&self, filename: &str) -> Result<()>
fn save(&self, filename: &str) -> Result<()>
Saves the algorithm to a file. In order to make this method work, the derived class must implement Algorithm::write(FileStorage& fs). Read more
sourcefn get_default_name(&self) -> Result<String>
fn get_default_name(&self) -> Result<String>
Returns the algorithm string identifier. This string is used as top level xml/yml node tag when the object is saved to a file or string. Read more
sourceimpl BFMatcherTrait for BFMatcher
impl BFMatcherTrait for BFMatcher
fn as_raw_mut_BFMatcher(&mut self) -> *mut c_void
sourceimpl BFMatcherTraitConst for BFMatcher
impl BFMatcherTraitConst for BFMatcher
fn as_raw_BFMatcher(&self) -> *const c_void
fn is_mask_supported(&self) -> Result<bool>
sourceimpl Boxed for BFMatcher
impl Boxed for BFMatcher
sourceimpl DescriptorMatcher for BFMatcher
impl DescriptorMatcher for BFMatcher
fn as_raw_mut_DescriptorMatcher(&mut self) -> *mut c_void
sourcefn add(&mut self, descriptors: &dyn ToInputArray) -> Result<()>
fn add(&mut self, descriptors: &dyn ToInputArray) -> Result<()>
Adds descriptors to train a CPU(trainDescCollectionis) or GPU(utrainDescCollectionis) descriptor collection. Read more
sourcefn match_(
&mut self,
query_descriptors: &dyn ToInputArray,
matches: &mut Vector<DMatch>,
masks: &dyn ToInputArray
) -> Result<()>
fn match_(
&mut self,
query_descriptors: &dyn ToInputArray,
matches: &mut Vector<DMatch>,
masks: &dyn ToInputArray
) -> Result<()>
Finds the best match for each descriptor from a query set. Read more
sourcefn knn_match(
&mut self,
query_descriptors: &dyn ToInputArray,
matches: &mut Vector<Vector<DMatch>>,
k: i32,
masks: &dyn ToInputArray,
compact_result: bool
) -> Result<()>
fn knn_match(
&mut self,
query_descriptors: &dyn ToInputArray,
matches: &mut Vector<Vector<DMatch>>,
k: i32,
masks: &dyn ToInputArray,
compact_result: bool
) -> Result<()>
Finds the k best matches for each descriptor from a query set. Read more
sourcefn radius_match(
&mut self,
query_descriptors: &dyn ToInputArray,
matches: &mut Vector<Vector<DMatch>>,
max_distance: f32,
masks: &dyn ToInputArray,
compact_result: bool
) -> Result<()>
fn radius_match(
&mut self,
query_descriptors: &dyn ToInputArray,
matches: &mut Vector<Vector<DMatch>>,
max_distance: f32,
masks: &dyn ToInputArray,
compact_result: bool
) -> Result<()>
For each query descriptor, finds the training descriptors not farther than the specified distance. Read more
fn read(&mut self, file_name: &str) -> Result<()>
fn read_1(&mut self, unnamed: &FileNode) -> Result<()>
sourceimpl DescriptorMatcherConst for BFMatcher
impl DescriptorMatcherConst for BFMatcher
fn as_raw_DescriptorMatcher(&self) -> *const c_void
sourcefn get_train_descriptors(&self) -> Result<Vector<Mat>>
fn get_train_descriptors(&self) -> Result<Vector<Mat>>
Returns a constant link to the train descriptor collection trainDescCollection .
sourcefn empty(&self) -> Result<bool>
fn empty(&self) -> Result<bool>
Returns true if there are no train descriptors in the both collections.
sourcefn is_mask_supported(&self) -> Result<bool>
fn is_mask_supported(&self) -> Result<bool>
Returns true if the descriptor matcher supports masking permissible matches.
sourcefn train_match(
&self,
query_descriptors: &dyn ToInputArray,
train_descriptors: &dyn ToInputArray,
matches: &mut Vector<DMatch>,
mask: &dyn ToInputArray
) -> Result<()>
fn train_match(
&self,
query_descriptors: &dyn ToInputArray,
train_descriptors: &dyn ToInputArray,
matches: &mut Vector<DMatch>,
mask: &dyn ToInputArray
) -> Result<()>
Finds the best match for each descriptor from a query set. Read more
sourcefn knn_train_match(
&self,
query_descriptors: &dyn ToInputArray,
train_descriptors: &dyn ToInputArray,
matches: &mut Vector<Vector<DMatch>>,
k: i32,
mask: &dyn ToInputArray,
compact_result: bool
) -> Result<()>
fn knn_train_match(
&self,
query_descriptors: &dyn ToInputArray,
train_descriptors: &dyn ToInputArray,
matches: &mut Vector<Vector<DMatch>>,
k: i32,
mask: &dyn ToInputArray,
compact_result: bool
) -> Result<()>
Finds the k best matches for each descriptor from a query set. Read more
sourcefn radius_train_match(
&self,
query_descriptors: &dyn ToInputArray,
train_descriptors: &dyn ToInputArray,
matches: &mut Vector<Vector<DMatch>>,
max_distance: f32,
mask: &dyn ToInputArray,
compact_result: bool
) -> Result<()>
fn radius_train_match(
&self,
query_descriptors: &dyn ToInputArray,
train_descriptors: &dyn ToInputArray,
matches: &mut Vector<Vector<DMatch>>,
max_distance: f32,
mask: &dyn ToInputArray,
compact_result: bool
) -> Result<()>
For each query descriptor, finds the training descriptors not farther than the specified distance. Read more
fn write(&self, file_name: &str) -> Result<()>
fn write_1(&self, unnamed: &mut FileStorage) -> Result<()>
impl Send for BFMatcher
Auto Trait Implementations
impl RefUnwindSafe for BFMatcher
impl !Sync for BFMatcher
impl Unpin for BFMatcher
impl UnwindSafe for BFMatcher
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more