• OpenCV 特征描述


     1 #include <stdio.h>
     2 #include <iostream>
     3 #include "opencv2/core/core.hpp"
     4 #include "opencv2/features2d/features2d.hpp"
     5 #include "opencv2/highgui/highgui.hpp"
     6 
     7 using namespace cv;
     8 
     9 void readme();
    10 
    11 /** @function main */
    12 int main( int argc, char** argv )
    13 {
    14   if( argc != 3 )
    15    { return -1; }
    16 
    17   Mat img_1 = imread( argv[1], CV_LOAD_IMAGE_GRAYSCALE );
    18   Mat img_2 = imread( argv[2], CV_LOAD_IMAGE_GRAYSCALE );
    19 
    20   if( !img_1.data || !img_2.data )
    21    { return -1; }
    22 
    23   //-- Step 1: Detect the keypoints using SURF Detector
    24   int minHessian = 400;
    25 
    26   SurfFeatureDetector detector( minHessian );
    27 
    28   std::vector<KeyPoint> keypoints_1, keypoints_2;
    29 
    30   detector.detect( img_1, keypoints_1 );
    31   detector.detect( img_2, keypoints_2 );
    32 
    33   //-- Step 2: Calculate descriptors (feature vectors)
    34   SurfDescriptorExtractor extractor;
    35 
    36   Mat descriptors_1, descriptors_2;
    37 
    38   extractor.compute( img_1, keypoints_1, descriptors_1 );
    39   extractor.compute( img_2, keypoints_2, descriptors_2 );
    40 
    41   //-- Step 3: Matching descriptor vectors with a brute force matcher
    42   BruteForceMatcher< L2<float> > matcher;
    43   std::vector< DMatch > matches;
    44   matcher.match( descriptors_1, descriptors_2, matches );
    45 
    46   //-- Draw matches
    47   Mat img_matches;
    48   drawMatches( img_1, keypoints_1, img_2, keypoints_2, matches, img_matches );
    49 
    50   //-- Show detected matches
    51   imshow("Matches", img_matches );
    52 
    53   waitKey(0);
    54 
    55   return 0;
    56   }
    57 
    58  /** @function readme */
    59  void readme()
    60  { std::cout << " Usage: ./SURF_descriptor <img1> <img2>" << std::endl; }
  • 相关阅读:
    线段树合并
    bzoj 3675 [Apio2014]序列分割
    模版总结【长期更新】
    动态规划的题目总结(长期更新)
    搜索(另类状态BFS):NOIP 华容道
    贪心(模拟费用流):NOIP2011 观光公交
    基础算法(二分,贪心):NOIP 2012 疫情控制
    模拟(堆):USACO Jan11 瓶颈
    搜索(DLX重复覆盖模板):HDU 2295 Radar
    数学:lucas定理的总结
  • 原文地址:https://www.cnblogs.com/ybqjymy/p/12170985.html
Copyright © 2020-2023  润新知