检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马长青[1]
机构地区:[1]山东科技大学机电工程系,山东泰安271019
出 处:《农机化研究》2008年第12期166-168,172,共4页Journal of Agricultural Mechanization Research
基 金:山东省教育厅科技计划项目(J05F52)资助
摘 要:在分析已有区域标记算法的基础上,提出了一种新的二值图像连通区域准确标记算法。顺序扫描和标记二值图像的各个像素点,准确判断标记过程中出现的标记冲突,并建立标记冲突的模型,在算法中增加回溯扫描算法,消除标记冲突引起的标记误差。实验证明:该算法可以准确地标记出各种形状的连通区域,与已有算法相比,扫描重复率低,运行准确,速度快,具有很好的应用前景。The basic characteristic of current labeling algorithms were analyzed and a new algorithm for exact labeling of connected regions in binary images was put forward. First, scan and label all the pixel points in turn and judge the labeling conflicts exactly occurring during the labeling source and build the models of them, moreover add the rescan algorithm in order to eliminate label connected regions of the labeling errors aroused by label conflicts. Experimental result shows that the algorithm can any shape exactly and compared with the current labeling algorithms, this one has lower rate of repeated scan and higher efficiency and more exact veracity in speed, so it has wider application.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42