一种复杂网长度的快速测量法  

A Rapid Measure Algorithm of Complex Network Length

作　　者：韩明峰[1] 

机构地区：[1]山东工业大学计算机科学与技术系,济南250061

出　　处：《计算机工程》1999年第8期63-63,104,共2页Computer Engineering

摘　　要：针对细化后提取对象的骨架结构，提出了一种一次扫描的长度测量算法，并且给出了算法的证明。该算法运算量小，精度高，并且与对象复杂度无关。Based on the skelets of objects we get by Thinning algorithm,a new way to measure the length with only one scanning ispresented in this paper.The algorithm is proved to be right .The new algorithm needs little calculation and can get high accurate .In addition,the running speed is no longer with the degree of complexity.,

关 键 词：复杂网 长度测量 细化算法 图像分析 目标识别 

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