• opencv学习笔记——minMaxIdx函数的含义及用法


    opencv中有时需要对Mat数据需要对其中的数据求取最大值和最小值。opencv提供了直接的函数

    CV_EXPORTS_W void minMaxLoc(InputArray src, CV_OUT double* minVal,  
                               CV_OUT double* maxVal=0, CV_OUT Point* minLoc=0,  
                               CV_OUT Point* maxLoc=0, InputArray mask=noArray());  
    CV_EXPORTS void minMaxIdx(InputArray src, double* minVal, double* maxVal,  
                              int* minIdx=0, int* maxIdx=0, InputArray mask=noArray());  

    实现代码如下所示:

        #include <iostream>  
        #include <cstdlib>  
        #include <cmath>  
        #include <iomanip>  
        #include <algorithm>  
          
        #include "opencv2/core/core.hpp"  
        #include "opencv2/highgui/highgui.hpp"  
        #include "opencv2/imgproc/imgproc.hpp"  
        #include "opencv2/contrib/contrib.hpp"  
          
        using namespace std;  
        using namespace cv;  
          
        int main(int argc, char* argv[])  
        {  
        #pragma region min_max  
          
            float Tval = 0.0;  
            float RawData[2][3] = {{4.0,1.0,3.0},{8.0,7.0,9.0}};  
            Mat RawDataMat(2,3,CV_32FC1,RawData);  
          
            for (int j = 0; j < 2; j++)  
            {  
                for (int i = 0; i < 3; i++)  
                {     
                    //Tval = RawData[j][i];             //No problem !!!  
                    Tval = RawDataMat.at<float>(j,i);  
                    cout << "(j,i) = "<<j<<","<<i<<"	"<<Tval<<endl;  
                }  
            }  
          
            double minv = 0.0, maxv = 0.0;  
            double* minp = &minv;  
            double* maxp = &maxv;  
          
            minMaxIdx(RawDataMat,minp,maxp);  
          
            cout << "Mat minv = " << minv << endl;  
            cout << "Mat maxv = " << maxv << endl;  
          
        #pragma endregion  
          
            return 0;  
        }  
  • 相关阅读:
    P1121 环状最大两段子段和
    (转)背包9讲
    P1115 最大子段和
    P1108 低价购买
    P1103 书本整理
    P1095 守望者的逃离
    P1091 合唱队形
    P1077 摆花
    hadoop记录topk
    楼天城楼教主的acm心路历程(作为励志用)
  • 原文地址:https://www.cnblogs.com/feifanrensheng/p/9133408.html
Copyright © 2020-2023  润新知