检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐超[1,2,3] 黄风华[1,4] 毛政元[1,2,3]
机构地区:[1]福州大学福建省空间信息工程研究中心,福建福州350002 [2]福州大学空间数据挖掘与信息共享教育部重点实验室,福建福州350002 [3]福州大学地理空间信息技术国家地方联合工程研究中心,福建福州350002 [4]福州大学阳光学院,福建福州350015
出 处:《电子技术应用》2016年第12期108-111,共4页Application of Electronic Technique
基 金:国家自然科学基金项目(41501451)
摘 要:Otsu算法,也被称之为最大类间方差算法,是实现阈值分割的经典算法之一。二维Otsu算法是一维Otsu算法的推广,它充分考虑了图像的灰度信息和空间邻域信息,可以有效滤除噪声影响,但是同样存在着运算量大、时效性差的问题。对此提出了一种改进的二维Otsu快速阈值分割算法,先将二维Otsu算法分解为两个一维Otsu算法,并集成类间和类内方差信息构造了一种新的阈值判别函数,同时通过降维,进一步降低计算量。实验结果表明,该算法在时间效率与分割效果两方面明显优于传统的二维Otsu算法与快速二维Otsu算法。Otsu algorithm, also called the method of maximum classes square error, is one of classical methods for image threshold segmentation. As generalization of 1D Otsu algorithm, 2D Otsu algorithm fully considers information of both the image gray and the neighborhood relationship among pixels, thus it is able to filter noise effectively. However, it is time consuming because of its huge amount of calculation. Concerning the problem, this article presents an improved fast 2D Otsu segmentation algorithm, which further cuts down the amount of computation by decomposing the original 2D Otsu algorithm into two 1D Otsu algorithm, constructing a new threshold recognition function through integrating inter-class variance with intra-class variance, and reducing dimension. Experiment results show that the improved method is superior to the other two methods in terms of segmentation efficiency and effect.
分 类 号:TN911.73[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.86.137