检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《岳阳师范学院学报(自然科学版)》2002年第3期11-13,共3页Journal of Yueyang Normal University
摘 要:提出了一种能快速有序搜索边界点的新方法 ,通过比较任一起始边界点S与周边 8个像素点Pfi的值 ,实现按顺时针方向自动识别边界点并记录其坐标。该方法具有编程简单且仅在最小范围局部搜索边界点的特点 。A new method which can quickly and orderly search the figure boundary spot is proposed. To automatically recognize the boundary spot and to record the coordinate in a clockwise direction are realized through the comparison of the value between the starting randomly boundary spot 'S' and 8 pixels Pfi around 'S'. This method has the character which can program easily and partly search the boundary spot at the minimal range and can overcome the disadvantage of large amount of computation, which the normal method has by overall situation search.
关 键 词:快速有序搜索 边界点 像素点 图形搜索 图像识别 图像重建
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.223.97.46