无聊之作-图像细化(骨架)

理论部分参考:

https://blog.csdn.net/klose93/article/details/54564519

https://www.cnblogs.com/xianglan/archive/2011/01/01/1923779.html

 

import cv2 as cv
import numpy as np

def thin(img):
    f=np.zeros([img.shape[0],img.shape[1]])
    m=np.zeros([img.shape[0],img.shape[1]])

    for i in range(1,img.shape[0]-1):
        for j in range(1,img.shape[1]-1):
            if img[i,j]==0:
                f[i][j]=min([f[i-1][j],f[i-1][j-1],f[i][j-1],f[i-1][j+1]])+1

    for i in range(img.shape[0]-2,0,-1):
        for j in range(img.shape[1]-2,0,-1):
            if img[i,j]==0:
                m[i][j]=min([m[i][j+1],m[i+1][j-1],m[i+1][j],m[i+1][j+1]])+1

    fm = np.zeros([img.shape[0], img.shape[1]])
    for i in range(0,fm.shape[0]):
        for j in range(0,fm.shape[1]):
            fm[i][j]=min(f[i][j],m[i][j])

    res=np.zeros([img.shape[0],img.shape[1]])

    for i in range(1,img.shape[0]-1):
        for j in range(1,img.shape[1]-1):
            if fm[i][j]>0 and fm[i][j]>=fm[i-1][j-1] and fm[i][j]>=fm[i-1][j] and fm[i][j]>=fm[i-1][j+1] and fm[i][j]>=fm[i][j-1] and fm[i][j]>=fm[i][j+1] and fm[i][j]>=fm[i+1][j-1] and fm[i][j]>=fm[i+1][j] and fm[i][j]>=fm[i+1][j+1]:
                res[i][j]=255

    return res


image = cv.imread('pikaqiu.png')
gray = cv.cvtColor(image, cv.COLOR_RGB2GRAY)

ret, binary = cv.threshold(gray, 0, 255, cv.THRESH_BINARY | cv.THRESH_TRIANGLE)


cv.namedWindow("Image")
cv.imshow("Image",image)
cv.waitKey(0)

cv.namedWindow("binary")
cv.imshow("binary",binary)
cv.waitKey(0)

res_img=thin(binary)

cv.namedWindow("res")
cv.imshow("res",res_img)
cv.waitKey(0)

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值