检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学计算机学院,陕西西安710071
出 处:《西安电子科技大学学报》2008年第1期121-124,188,共5页Journal of Xidian University
基 金:国家自然科学基金资助(60573139)
摘 要:提出一种相对势能分水岭算法,通过计算分水岭的相对势能,并与预先设定的阈值进行比较,去掉不必要的细节,得到重要轮廓信息.在快速分水岭的模型上引入该方法,能够有效抑制过度分割,避免再进行区域融合,从而提高了效率.与原有区域融合算法相比,该算法的运算效率提高了14.3%,明显地改善了过度分割的现象.A watersheds algorithm for relative potential energy is presented. The presented algorithm calculates the relative potential energy of watersheds and compares them with the preestablished thresholds to remove the unnecessary details and get the important contour information. This method is introduced on the basis of the fast watersheds model As a result, over-segmentation is effectively restrained, region fusing is avoided and the efficiency improved accordingly. Experimental results have shown that, compared with the original region-fusing algorithm, the efficiency has increased by 14.3 %, and that the over-segmentation phenomenon has been obviously improved.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15