图像开运算

开运算是先腐蚀后膨胀的过程,它能去除孤点、毛刺和小桥(连接两区域的小点),消除小物体、平滑大物体的边界,并且不明显改变面积。
开运算公式如下:
这里写图片描述

#include"cv.h"
#include "highgui.h"


void erode(CvMat *src, CvMat *dst);
void dilate(CvMat *src, CvMat *dst);
void open(CvMat *src, CvMat *dst);

int main()
{
    IplImage *src = cvLoadImage("linzhilin.jpg",1);

    const int width = src->width;
    const int height = src->height;

    CvMat* gray = cvCreateMat(height, width, CV_8UC1);
    CvMat* openImg = cvCreateMat(height, width, CV_8UC1);


    cvCvtColor(src, gray, CV_BGR2GRAY);
    cvThreshold(gray, gray, 1, 255, CV_THRESH_OTSU);
    open(gray, openImg);


    cvShowImage("SRC", src);
    cvShowImage("BINARY IMAGE", gray);
    cvShowImage("OPEN", openImg);

    cvWaitKey(0);

    cvSaveImage("binImg.bmp", gray);
    cvSaveImage("open.bmp", openImg);

    cvReleaseMat(&gray);
    cvReleaseMat(&openImg);

    return 0;
}

void erode(CvMat *src, CvMat *dst)
{
    const int WIDTH = src->width;
    const int HEIGHT = src->height;

    memcpy(dst->data.ptr, src->data.ptr, WIDTH*HEIGHT);
    uchar* srcData = (uchar*)(src->data.ptr);

    for(int j = 0;  j < HEIGHT - 1;  j ++)
    {
        uchar* dstData = (uchar*)(dst->data.ptr + j * dst->step);
        for(int i = 0; i < WIDTH - 1; i ++)
        {
            bool found = false;
            dstData[i] = 255;
            for(int m = 0; m < 3; m ++)
            {
                if(found)
                    break;
                for(int n = 0; n < 3; n ++)
                {
                    if((srcData + (j + m - 1) * src->step)[i + n - 1] == 0)
                    {
                        dstData[i] = 0;
                        found = true;
                        break;
                    }
                }
            }
        }
    }
}

void dilate(CvMat *src, CvMat *dst)
{
    const int WIDTH = src->width;
    const int HEIGHT = src->height;

    memcpy(dst->data.ptr, src->data.ptr, WIDTH*HEIGHT);
    uchar* srcData = (uchar*)(src->data.ptr);

    for(int j = 0;  j < HEIGHT - 1;  j ++)
    {
        uchar* dstData = (uchar*)(dst->data.ptr + j * dst->step);
        for(int i = 0; i < WIDTH - 1; i ++)
        {
            bool found = false;
            dstData[i] = 0;
            for(int m = 0; m < 3; m ++)
            {
                if(found)
                    break;
                for(int n = 0; n < 3; n ++)
                {
                    if((srcData + (j + m - 1) * src->step)[i + n - 1] == 255)
                    {
                        dstData[i] = 255;
                        found = true;
                        break;
                    }
                }
            }
        }
    }
}
void open(CvMat *src, CvMat *dst)
{
    CvMat *openImg = cvCloneMat(src);
    erode(src, dst);
    dilate(dst, openImg);
    cvCopy(openImg, dst);
    cvReleaseMat(&openImg);
}

源图,二值图和开运算图如下所示:
这里写图片描述
这里写图片描述
这里写图片描述

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值