opencv(C++)四種不同訪問方式及速度對比

摘要:

比較一下opencv四種不同的訪問方式的效率,多次測試的結(jié)論就是用指針的方式是最快的,方法2、3、4都是指針的方式,在release模式下,方法2、方法3、方法4很接近,沒多少差別,在不同尺度下稍微各有一點點優(yōu)劣,我個人常用方法3,因為它簡潔高效,方法2看起來似乎也不錯,方法4需要圖像數(shù)據(jù)是連續(xù)的才能用。

假設(shè):圖像image為3通道8bit的圖像,現(xiàn)在要訪問它的第row行,第col列的r,g,b值

1. 方法一:Mat.at<vec>(row,col)

//Mat.at<vec>(i,j)方式訪問
cv::Vec3b bgr = image.at<cv::Vec3b>(row, col);
blue  = bgr[0];
green = bgr[1];
red   = bgr[2];

2. 方法二:Mat.ptr<vec>(row)

//Mat.at<vec>(i,j)方式訪問
cv::Vec3b *bgr = image.ptr<cv::Vec3b>(row);
blue  = bgr[col][0];
green = bgr[col][1];
red   = bgr[col][2];

3. 方法三:Mat.ptr<uchar>(row)

uchar *ptr = image.ptr<uchar>(row);//獲得圖像第row行的首地址
blue  = *(ptr + col*3 );
green = *(ptr + col*3 + 1);
red   = *(ptr + col*3 + 2);

4. 方法四:Mat.data + 偏移量

//image.data是圖像矩陣的首地址
uchar *ptr = image.data + row * image.cols * 3 +  col*3;
blue  = *(ptr);
green = *(ptr + 1);
red   = *(ptr + 2);

注:其他數(shù)據(jù)類型的訪問可參考http://www.itdecent.cn/p/cfe373dc8c95

測試

圖片尺寸427 * 640 * 3,重復(fù)顏色反轉(zhuǎn)操作99次,顯示平均時間在圖片上

  • debug模式下


    debug.png
  • release模式下


    image.png

完整源碼

#include "opencv.hpp"
#include "imageProcess.h"

#define TIMES 1

//Mat.at<vec>(i,j)方式訪問
void method_1(cv::Mat image)
{
    //cv::Mat image = image_.clone();
    double startTime = cv::getTickCount();
    int w = image.cols;
    int h = image.rows;
    for (int times = 0; times < TIMES; times++)
    {
        for (int row = 0; row < h; row++)
        {
            for (int col = 0; col < w; col++)
            {
                image.at<cv::Vec3b>(row, col)[0] = 255 - image.at<cv::Vec3b>(row, col)[0];
                image.at<cv::Vec3b>(row, col)[1] = 255 - image.at<cv::Vec3b>(row, col)[1];
                image.at<cv::Vec3b>(row, col)[2] = 255 - image.at<cv::Vec3b>(row, col)[2];
            }
        }
    }
    double endTime = cv::getTickCount();
    double t = ((endTime - startTime) / cv::getTickFrequency()) * 1000 / TIMES;
    std::ostringstream ss;
    ss << "Execute time : " << std::fixed << std::setprecision(2) << t << " ms ";
    putText(image, ss.str(), cv::Point(20, 20), cv::FONT_HERSHEY_SIMPLEX, 0.75, cv::Scalar(0, 0, 255), 2, 8);
    imshow("method1", image);
}

//Mat.ptr<vec3b>(row);
void method_2(cv::Mat image)
{
    //cv::Mat image = image_.clone();
    //cv::imshow("2", image);
    double startTime = cv::getTickCount();
    int w = image.cols;
    int h = image.rows;
    cv::Vec3b* curr=NULL;
    for (int times = 0; times < TIMES; times++)
    {
        for (int row = 0; row < h; row++) 
        {
            curr = image.ptr<cv::Vec3b>(row);
            for (int col = 0; col < w; col++) 
            {
                curr[col][0] = 255 - curr[col][0];
                curr[col][1] = 255 - curr[col][1];
                curr[col][2] = 255 - curr[col][2];
            }
        }
    }
    
    double endTime = cv::getTickCount();
    double t = ((endTime - startTime) / cv::getTickFrequency()) * 1000 / TIMES;
    std::ostringstream ss;
    ss << "Execute time : " << std::fixed << std::setprecision(2) << t << " ms ";
    putText(image, ss.str(), cv::Point(20, 20), cv::FONT_HERSHEY_SIMPLEX, 0.75, cv::Scalar(0, 0, 255), 2, 8);
    imshow("method2", image);
}


void method_3(cv::Mat image)
{
    //cv::Mat image = image_.clone();
    double startTime = cv::getTickCount();
    int w = image.cols;
    int h = image.rows;
    uchar * ptr=NULL;//指針定義應(yīng)該放在這里,如果放在for循環(huán)中定義會消耗一部分變量分配時間;
    for (int times = 0; times < TIMES; times++)
    {
        for (int row = 0; row < h; row++) 
        {
            ptr = image.ptr<uchar>(row);
            for (int col = 0; col < w; col++)
            {
                *(ptr + 3 * col) = 255 - *(ptr + 3 * col);
                *(ptr + 3 * col + 1) = 255 - *(ptr + 3 * col + 1);
                *(ptr + 3 * col + 2) = 255 - *(ptr + 3 * col + 2);
            }
        }
    }
    
    double endTime = cv::getTickCount();
    double t = ((endTime - startTime) / cv::getTickFrequency()) * 1000 / TIMES;
    std::ostringstream ss;
    ss << "Execute time : " << std::fixed << std::setprecision(2) << t << " ms ";
    putText(image, ss.str(), cv::Point(20, 20), cv::FONT_HERSHEY_SIMPLEX, 0.75, cv::Scalar(0, 0, 255), 2, 8);
    imshow("method3", image);
}

//當(dāng)圖像數(shù)據(jù)是連續(xù)的,就可以從矩陣的第一個元素開始
//按相對位置訪問整個矩陣
void method_4(cv::Mat image)
{
    //assert(image.isContinuous());
    //std::cout <<"image.isContinuous():"<< image.isContinuous()<< std::endl;

    double startTime = cv::getTickCount();
    int w = image.cols;
    int h = image.rows;
    uchar * imgPtr = NULL;
    for (int times = 0; times < TIMES; times++)
    {
        //image.data與image.ptr<uchar>(0)等價;
        for (int row = 0; row < h; row++) {
            imgPtr = image.data + row * image.step;
            for (int col = 0; col < w; col++) {
                //以下三種方式都是等價的,
                *(imgPtr + col*3) = 255 - *(imgPtr + col * 3);
                *(imgPtr + col * 3 + 1) = 255 - *(imgPtr + col * 3 + 1);
                *(imgPtr + col * 3 + 2) = 255 - *(imgPtr + col * 3 + 2);

                /*imgPtr[col * 3] = 255 - imgPtr[col * 3];
                imgPtr[col * 3 + 1] = 255 - imgPtr[col * 3 + 1];
                imgPtr[col * 3 + 2] = 255 - imgPtr[col * 3 + 2];*/

                /**(imgPtr++) = 255 - *(imgPtr);
                *(imgPtr++) = 255 - *(imgPtr);
                *(imgPtr++) = 255 - *(imgPtr);*/
            }
        }
    }
    double endTime = cv::getTickCount();
    double t = ((endTime - startTime) / cv::getTickFrequency()) * 1000 / TIMES;
    std::ostringstream ss;
    ss << "Execute time : " << std::fixed << std::setprecision(2) << t << " ms ";
    putText(image, ss.str(), cv::Point(20, 20), cv::FONT_HERSHEY_SIMPLEX, 0.75, cv::Scalar(0, 0, 255), 2, 8);
    imshow("method4", image);
}


int main()
{
    std::string imagePath = "K:\\deepImage\\building.jpg";
    cv::Mat m1 = cv::imread(imagePath);
    //cv::resize(m1, m1, cv::Size(1000, 1000));
    method_1(m1.clone());
    method_2(m1.clone());
    method_3(m1.clone());
    method_4(m1.clone());
    cv::waitKey(0);

    return 0;
}
?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請聯(lián)系作者
【社區(qū)內(nèi)容提示】社區(qū)部分內(nèi)容疑似由AI輔助生成,瀏覽時請結(jié)合常識與多方信息審慎甄別。
平臺聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點,簡書系信息發(fā)布平臺,僅提供信息存儲服務(wù)。

相關(guān)閱讀更多精彩內(nèi)容

友情鏈接更多精彩內(nèi)容