OpenCV遍历图像

20 篇文章 0 订阅

OpenCV遍历图像

在图形处理中,遍历每个像素点是最基本的功能,是做算法的基础,这篇文章来总结一下OpenCV遍历图像的几种方法。
本文章参考文档OpenCV tutorials的how_to_scan_images.cpp例子。

最有效率–指针

用c语言直接访问是最有效率的,最快的,下面是简单的示例。

int scan_image_c(Mat &I)
{
    int channels = I.channels();
    if (channels != 3)
    {
        printf("test support only three channel.\n");
        return -1;
    }

    for (int i = 0; i < I.rows; i++)
    {
        Vec3b *ptr = I.ptr<Vec3b>(i);
        for (int j = 0; j < I.cols; j++)
        {
            ptr[j][0] = 0;
            ptr[j][1] = 0;
            ptr[j][2] = 0;
        }
    }
    return 0;
}

最安全–迭代器

迭代器是C++中的一个概念,因为迭代器从用户手中接管了一些工作,它会保证访问的安全,所以必然会导致一些性能上的降低,简单例子如下。

int scan_image_iterator(Mat &I)
{
    int channels = I.channels();
    if (channels != 3)
    {
        printf("test support only three channel.\n");
        return -1;
    }

    MatIterator_<Vec3b> it, end;
    for( it = I.begin<Vec3b>(), end = I.end<Vec3b>(); it != end; ++it)
    {
        (*it)[0] = 0;
        (*it)[1] = 0;
        (*it)[2] = 0;
    }
    return 0;
}

最便捷–at方法

OpenCV的Mat类中有一个at方法,它可以直接返回某个像素点,示例如下。

int scan_image_random(Mat &I)
{
    int channels = I.channels();
    if (channels != 3)
    {
        printf("test support only three channel.\n");
        return -1;
    }

    for( int i = 0; i < I.rows; ++i)
    {
        for( int j = 0; j < I.cols; ++j 
        {
            I.at<Vec3b>(i, j)[0] = 0;
            I.at<Vec3b>(i, j)[1] = 0;
            I.at<Vec3b>(i, j)[2] = 0;
        }
    }

    return 0;
}

完整例子

#include <opencv2/opencv.hpp>
#include <iostream>

using namespace std;
using namespace cv;

int scan_image_c(Mat &I);
int scan_image_iterator(Mat &I);
int scan_image_random(Mat &I);

int main( int argc, char* argv[])
{
    if (argc != 2)
    {
        cout << "input parameters failed!" << endl;
        return -1;
    }

    Mat I;
    I = imread(argv[1], IMREAD_COLOR);

    if (I.empty())
    {
        cout << "The image" << argv[1] << " could not be loaded." << endl;
        return -1;
    }

    const int times = 100;
    double t = 0;

    t = (double)getTickCount();

    for (int i = 0; i < times; ++i)
    {
        cv::Mat clone_i = I.clone();
        scan_image_c(clone_i);
    }

    t = 1000*((double)getTickCount() - t)/getTickFrequency();
    t /= times;

    cout << "Time of scan_image_c        (averaged for "
         << times << " runs): " << t << " ms."<< endl;

    t = (double)getTickCount();

    for (int i = 0; i < times; ++i)
    {
        cv::Mat clone_i = I.clone();
        scan_image_iterator(clone_i);
    }

    t = 1000*((double)getTickCount() - t)/getTickFrequency();
    t /= times;

    cout << "Time of scan_image_iterator (averaged for "
        << times << " runs): " << t << " ms."<< endl;

    t = (double)getTickCount();

    for (int i = 0; i < times; ++i)
    {
        cv::Mat clone_i = I.clone();
        scan_image_random(clone_i);
    }

    t = 1000*((double)getTickCount() - t)/getTickFrequency();
    t /= times;

    cout << "Time of scan_image_random   (averaged for "
        << times << " runs): " << t << " ms."<< endl;

    return 0;
}

int scan_image_c(Mat &I)
{
    int channels = I.channels();
    if (channels != 3)
    {
        printf("test support only three channel.\n");
        return -1;
    }

    for (int i = 0; i < I.rows; i++)
    {
        Vec3b *ptr = I.ptr<Vec3b>(i);
        for (int j = 0; j < I.cols; j++)
        {
            ptr[j][0] = 0;
            ptr[j][1] = 0;
            ptr[j][2] = 0;
        }
    }
    return 0;
}

int scan_image_iterator(Mat &I)
{
    int channels = I.channels();
    if (channels != 3)
    {
        printf("test support only three channel.\n");
        return -1;
    }

    MatIterator_<Vec3b> it, end;
    for( it = I.begin<Vec3b>(), end = I.end<Vec3b>(); it != end; ++it)
    {
        (*it)[0] = 0;
        (*it)[1] = 0;
        (*it)[2] = 0;
    }
    return 0;
}

int scan_image_random(Mat &I)
{
    int channels = I.channels();
    if (channels != 3)
    {
        printf("test support only three channel.\n");
        return -1;
    }

    for( int i = 0; i < I.rows; ++i)
    {
        for( int j = 0; j < I.cols; ++j 
        {
            I.at<Vec3b>(i, j)[0] = 0;
            I.at<Vec3b>(i, j)[1] = 0;
            I.at<Vec3b>(i, j)[2] = 0;
        }
    }

    return 0;
}

运行结果如下:

Time of scan_image_c        (averaged for 100 runs): 2.04884 ms.
Time of scan_image_iterator (averaged for 100 runs): 4.77701 ms.
Time of scan_image_random   (averaged for 100 runs): 3.64237 ms.

从数据上看,c语言的方法确实是最快的,和其他两种方式拉开了一定的差距。而at遍历比迭代器遍历快了不少。
在平常使用中,我们可以根据每个方法的优点去选择不同的方法。

与我联系

QQ:1570553025
公众号
在这里插入图片描述

  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

chasentech

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值