检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]复旦大学计算机科学与工程系 认知算法模型实验室,上海200433
出 处:《模式识别与人工智能》2007年第4期439-449,共11页Pattern Recognition and Artificial Intelligence
基 金:国家自然科学基金项目(No.60303007);国家973重点基础研究发展规划项目(No.2001CB309401)
摘 要:边缘或轮廓是实现图像理解的最重要线索之一,其中直线边缘占很大比例.边缘检测之后得到的仍然是离散的点,直线检测可将它们汇聚起来.本文提出一种基于3-像素基元组合的直线描述与检测方法,用于将可形成直线段的若干邻接像素点向量化.先定义在栅格方式下能够组合构成锯齿状直线的基本单元,接着定义由基元组合成直线段的规则,并证明这一组合规则是可行的,然后给出在基元基础上的直线聚类算法.通过在真实场景上与以往经典直线检测算法相比,本算法在时间、内存消耗、检测准确性上都有较显著的进步,其结果不需施加端点确定、假直线过滤、多条共线直线段的分割等后继操作.One of the most important clues to image understanding is the edges and profiles of the objects, and line-edges take a high proportion. By applying edge detectors to image, only some discrete points are obtained, and line detection can integrate them. A method of line description and line detection is proposed, which is based on combinations of multiple three-pixel micro patterns. This method includes defining primary units that can be combined into dentate line segment in grid manner, establishing the combination rules of different type units in different positions, and proving the feasibility of the combination rules. Then a unit-based clustering algorithm is given. Finally, this method is tested on many real pictures with background, and compared with other classical line detection algorithms. The experimental results show the proposed method has made great improvements over computation time, memory requirement and detection accuracy. The output of the proposed method can be taken as the input of subsequent object recognition procedures directly, and searching line end points, filtering false lines, segmenting collinear line segments are needless.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249