粘连对象剥离中基于距离变换的种子点优化算法  

A Seed Optimized Arithmetic Based on Distance Transform in Separating Clustered Particle

作　　者：黄学雨[1] 刘琮[1] 张良[2] 

机构地区：[1]江西理工大学信息工程学院,江西赣州341000 [2]黄河科技学院通讯工程系,河南郑州450052

出　　处：《计算机与现代化》2008年第3期77-79,82,共4页Computer and Modernization

摘　　要：粘连对象剥离中利用距离函数法求种子点时,在部分对象的核区存在不连续的冗余种子点使分水岭分割出现过分割问题。本文研究、总结了三条冗余种子点特征,并依此提出一个利用填充算法的种子点优化算法。实验证明此算法在保证粘连颗粒正确剥离的基础上,有效改善了过分割问题,而且算法时间没有增加很多。Seed arithmetic based on distance transform has a problem of over-segment. After research, we found the reason for over-segment is redundancy seed. We concluded three features in this paper for redundancy seed and proposed an arithmetic reducing the over-segment using these features, Experiment proved that our arithmetic effectively reduce the over-segment when keeping reasonable separate clustered particle, and spend not much time,

关 键 词：粘连对象剥离 极限腐蚀 距离函数 过分割 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]