图像处理(十一) 细化算法

**细化算法 **

欢迎在下面留言

原理:以后再补,原理差不多,

代码:

/*细化算法
 */
void *Thinning(QImage &image,QImage &optImage)
{
    int height = image.height();
    int width = image.width();

    //四个条件

    bool bCondition1;
    bool bCondition2;
    bool bCondition3;
    bool bCondition4;


    //5 x 5 领域
    unsigned char neighbour[5][5];

    bool bModified = true;

    while (bModified)
    {
        bModified = false;
        for(int i = 2; i<height-2; i++)
        {
            for(int j = 2; j<width-2; j++)
            {
                bCondition1 = false;
                bCondition2 = false;
                bCondition3 = false;
                bCondition4 = false;

                BYTE data = QColor(image.pixel(j,i)).red();

                if(data == 255)
                {
                    continue;
                }


                //获得当前5 x 5领域内的黑色的点,白色用 0 代表,黑色用 1 代表
                for(int h = 0; h<5; h++)
                {
                    for(int w = 0; w<5; w++)
                    {
                        neighbour[h][w] = (QColor(image.pixel(j,i)).red() == 0);
                    }
                }

                //逐个判断条件
                //判断  2<=NZ(P1)<=6
                int nCount = neighbour[1][1] + neighbour[1][2] + neighbour[1][3] +
                             neighbour[2][1] + neighbour[2][3] +
                             neighbour[3][1] + neighbour[3][2] + neighbour[3][3];
                if(nCount >=2 && nCount<=6)
                {
                    bCondition1 = true;
                }

                //判断Z0(P1) = 1
                nCount = 0;

                if(neighbour[1][2] == 0 && neighbour[1][1] == 1)
                {
                    nCount ++;
                }

                if(neighbour[1][1] == 0 && neighbour[2][1] == 1)
                {
                    nCount ++;
                }

                if(neighbour[2][1] == 0 && neighbour[3][1] == 1)
                {
                    nCount ++;
                }

                if(neighbour[3][1] == 0 && neighbour[3][2] == 1)
                {
                    nCount ++;
                }

                if(neighbour[3][2] == 0 && neighbour[3][3] == 1)
                {
                    nCount ++;
                }

                if(neighbour[3][3] == 0 && neighbour[2][3] == 1)
                {
                    nCount ++;
                }

                if(neighbour[2][3] == 0 && neighbour[1][3] == 1)
                {
                    nCount ++;
                }

                if(neighbour[1][3] == 0 && neighbour[1][2] == 1)
                {
                    nCount ++;
                }

                if(nCount == 1)
                {
                    bCondition2 = true;
                }

                //P2 x P4 x P8 = 0 或者Z0(P2) != 1
                if(neighbour[1][2] * neighbour[2][1] * neighbour[2][3] == 0)
                {
                    bCondition3 = true;
                }
                else {
                    nCount = 0;

                    if(neighbour[0][2] == 0 && neighbour[0][1] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[0][1] == 0 && neighbour[1][1] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[1][1] == 0 && neighbour[2][1] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[2][1] == 0 && neighbour[2][2] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[2][2] == 0 && neighbour[2][3] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[2][3] == 0 && neighbour[1][3] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[1][3] == 0 && neighbour[0][3] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[0][3] == 0 && neighbour[0][2] == 1)
                    {
                        nCount ++;
                    }

                    if(nCount != 1)
                    {
                        bCondition3 = true;
                    }
                }

                //判断P2 x P4 x P6 = 0; 或者Z0(P4) != 1;
                if(neighbour[1][2] * neighbour[2][1] * neighbour[3][2] == 0)
                {
                    bCondition4 = true;
                }
                else {
                    nCount = 0;

                    if(neighbour[1][1] == 0 && neighbour[1][0] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[1][0] == 0 && neighbour[2][0] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[2][0] == 0 && neighbour[3][0] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[3][0] == 0 && neighbour[3][1] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[3][1] == 0 && neighbour[3][2] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[3][2] == 0 && neighbour[2][2] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[2][2] == 0 && neighbour[1][2] == 1)
                    {
                        nCount ++;
                    }

                    if(neighbour[1][2] == 0 && neighbour[1][1] == 1)
                    {
                        nCount ++;
                    }

                    if(nCount != 1)
                    {
                        bCondition4 = true;
                    }
                }

                //如果四个条件满足的话就进行细化
                if(bCondition1 && bCondition2 && bCondition3 && bCondition4)
                {
                    optImage.setPixel(j,i,qRgb(255,255,255));
                    bModified = true;
                }
                else {
                    optImage.setPixel(j,i,qRgb(0,0,0));
                }
            }
        }
    }


    return 0;
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值