Home
last modified time | relevance | path

Searched refs:BRIEF (Results 1 – 14 of 14) sorted by relevance

/external/opencv3/doc/py_tutorials/py_feature2d/py_brief/
Dpy_brief.markdown1 BRIEF (Binary Robust Independent Elementary Features) {#tutorial_py_brief}
8 - We will see the basics of BRIEF algorithm
27 BRIEF comes into picture at this moment. It provides a shortcut to find the binary strings directly
38 One important point is that BRIEF is a feature descriptor, it doesn't provide any method to find the
40 recommends to use CenSurE which is a fast detector and BRIEF works even slightly better for CenSurE
43 In short, BRIEF is a faster method feature descriptor calculation and matching. It also provides
46 BRIEF in OpenCV
49 Below code shows the computation of BRIEF descriptors with the help of CenSurE detector. (CenSurE
61 # Initiate BRIEF extractor
62 brief = cv2.DescriptorExtractor_create("BRIEF")
[all …]
/external/opencv3/doc/py_tutorials/py_feature2d/py_orb/
Dpy_orb.markdown1 ORB (Oriented FAST and Rotated BRIEF) {#tutorial_py_orb}
19 ORB is basically a fusion of FAST keypoint detector and BRIEF descriptor with many modifications to
30 Now for descriptors, ORB use BRIEF descriptors. But we have already seen that BRIEF performs poorly
31 with rotation. So what ORB does is to "steer" BRIEF according to the orientation of keypoints. For
37 precomputed BRIEF patterns. As long as the keypoint orientation \f$\theta\f$ is consistent across v…
40 BRIEF has an important property that each bit feature has a large variance and a mean near 0.5. But
59 decides number of points that produce each element of the oriented BRIEF descriptor. By default it
61 If WTA_K is 3 or 4, which takes 3 or 4 points to produce BRIEF descriptor, then matching distance
/external/clang/test/CodeGenObjC/
Dextended-block-signature-encode.m2 …c1 -fblocks -triple x86_64-apple-darwin -emit-llvm %s -o - | FileCheck %s -check-prefix=CHECK-BRIEF
15 // CHECK-BRIEF: @{{.*}} = private unnamed_addr constant [14 x i8] c"@?24@?0@?8d16\00"
/external/opencv3/modules/java/src/
Dfeatures2d+DescriptorExtractor.java30 BRIEF = 4, field in DescriptorExtractor
37 OPPONENT_BRIEF = OPPONENTEXTRACTOR + BRIEF,
/external/autotest/client/tests/reaim/
Dreaim.config30 # BRIEF 1
/external/opencv3/modules/features2d/misc/java/test/
DBRIEFDescriptorExtractorTest.java31 extractor = DescriptorExtractor.create(DescriptorExtractor.BRIEF); in setUp()
DBruteForceHammingLUTDescriptorMatcherTest.java50 DescriptorExtractor extractor = DescriptorExtractor.create(DescriptorExtractor.BRIEF);
DBruteForceHammingDescriptorMatcherTest.java51 DescriptorExtractor extractor = DescriptorExtractor.create(DescriptorExtractor.BRIEF);
/external/opencv3/modules/features2d/misc/java/src/cpp/
Dfeatures2d_manual.hpp318 BRIEF = 4,
331 OPPONENT_BRIEF = OPPONENTEXTRACTOR + BRIEF,
/external/opencv3/doc/py_tutorials/py_feature2d/
Dpy_table_of_contents_feature2d.markdown41 calculate it first. There comes BRIEF which gives the shortcut to find binary descriptors with
/external/opencv3/doc/tutorials/introduction/transition_guide/
Dtransition_guide.markdown153 Some algorithms (FREAK, BRIEF, SIFT, SURF) has been moved to _opencv_contrib_ repository, to _xfeat…
157 - cv::xfeatures2d::BriefDescriptorExtractor - Class for computing BRIEF descriptors (2.4 location: …
/external/libpng/contrib/gregbook/
DREADME163 RUNNING THE PROGRAMS: (VERY) BRIEF INTRO
/external/opencv3/doc/py_tutorials/py_feature2d/py_matcher/
Dpy_matcher.markdown21 string based descriptors like ORB, BRIEF, BRISK etc, cv2.NORM_HAMMING should be used, which used
/external/bison/doc/
Dbison.info1094 ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES.