OpenCV
4.1.0
Open Source Computer Vision
|
Classes | |
class | cv::AgastFeatureDetector |
Wrapping class for feature detection using the AGAST method. : More... | |
class | cv::AKAZE |
Class implementing the AKAZE keypoint detector and descriptor extractor, described in. More... | |
class | cv::BRISK |
Class implementing the BRISK keypoint detector and descriptor extractor, described in. More... | |
class | cv::FastFeatureDetector |
Wrapping class for feature detection using the FAST method. : More... | |
class | cv::GFTTDetector |
Wrapping class for feature detection using the goodFeaturesToTrack function. : More... | |
class | cv::KAZE |
Class implementing the KAZE keypoint detector and descriptor extractor, described in. More... | |
class | cv::MSER |
Maximally stable extremal region extractor. More... | |
class | cv::ORB |
Class implementing the ORB (oriented BRIEF) keypoint detector and descriptor extractor. More... | |
class | cv::SimpleBlobDetector |
Class for extracting blobs from an image. : More... | |
Functions | |
void | cv::AGAST (InputArray image, std::vector< KeyPoint > &keypoints, int threshold, bool nonmaxSuppression=true) |
void | cv::AGAST (InputArray image, std::vector< KeyPoint > &keypoints, int threshold, bool nonmaxSuppression, AgastFeatureDetector::DetectorType type) |
Detects corners using the AGAST algorithm. | |
void | cv::FAST (InputArray image, std::vector< KeyPoint > &keypoints, int threshold, bool nonmaxSuppression=true) |
void | cv::FAST (InputArray image, std::vector< KeyPoint > &keypoints, int threshold, bool nonmaxSuppression, FastFeatureDetector::DetectorType type) |
Detects corners using the FAST algorithm. | |
void cv::AGAST | ( | InputArray | image, |
std::vector< KeyPoint > & | keypoints, | ||
int | threshold, | ||
bool | nonmaxSuppression = true |
||
) |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
void cv::AGAST | ( | InputArray | image, |
std::vector< KeyPoint > & | keypoints, | ||
int | threshold, | ||
bool | nonmaxSuppression, | ||
AgastFeatureDetector::DetectorType | type | ||
) |
Detects corners using the AGAST algorithm.
image | grayscale image where keypoints (corners) are detected. |
keypoints | keypoints detected on the image. |
threshold | threshold on difference between intensity of the central pixel and pixels of a circle around this pixel. |
nonmaxSuppression | if true, non-maximum suppression is applied to detected corners (keypoints). |
type | one of the four neighborhoods as defined in the paper: AgastFeatureDetector::AGAST_5_8, AgastFeatureDetector::AGAST_7_12d, AgastFeatureDetector::AGAST_7_12s, AgastFeatureDetector::OAST_9_16 |
For non-Intel platforms, there is a tree optimised variant of AGAST with same numerical results. The 32-bit binary tree tables were generated automatically from original code using perl script. The perl script and examples of tree generation are placed in features2d/doc folder. Detects corners using the AGAST algorithm bymair2010_agast .
void cv::FAST | ( | InputArray | image, |
std::vector< KeyPoint > & | keypoints, | ||
int | threshold, | ||
bool | nonmaxSuppression = true |
||
) |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
void cv::FAST | ( | InputArray | image, |
std::vector< KeyPoint > & | keypoints, | ||
int | threshold, | ||
bool | nonmaxSuppression, | ||
FastFeatureDetector::DetectorType | type | ||
) |
Detects corners using the FAST algorithm.
image | grayscale image where keypoints (corners) are detected. |
keypoints | keypoints detected on the image. |
threshold | threshold on difference between intensity of the central pixel and pixels of a circle around this pixel. |
nonmaxSuppression | if true, non-maximum suppression is applied to detected corners (keypoints). |
type | one of the three neighborhoods as defined in the paper: FastFeatureDetector::TYPE_9_16, FastFeatureDetector::TYPE_7_12, FastFeatureDetector::TYPE_5_8 |
Detects corners using the FAST algorithm byRosten06 .