大津算法（python实现）

最新推荐文章于 2023-11-22 11:23:51 发布

新时代农民1

最新推荐文章于 2023-11-22 11:23:51 发布

阅读量936

点赞数

文章标签： python 算法开发语言

本文链接：https://blog.csdn.net/qq_53324408/article/details/121780090

版权

def ostu(im):
    a = im.shape[0]
    b = im.shape[1]
    total = a * b  # 总像素数
    histogram = [0 for i in range(256)]  # 灰度直方图
    for i in range(a):
        for j in range(b):
            histogram[im[i][j]] += 1
    sum1 = 0
    for i in range(256):
        sum1 += i * histogram[i]
    wB = 0
    sumB = 0
    max_var = 0
    threshold = 0
    for i in range(256):
        wB += histogram[i]
        if wB == 0:
            continue
        wF = total - wB
        if wF == 0:
            break
        sumB += i * histogram[i]
        mB = sumB / wB
        mF = (sum1 - sumB) / wF
        var1 = wB * wF * (mB - mF) ** 2
        if var1 >= max_var:
            threshold = i
            max_var = var1
    return threshold

具体算法描述参见大津算法 - 万维百科