检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机辅助设计与图形学学报》2007年第10期1263-1268,共6页Journal of Computer-Aided Design & Computer Graphics
基 金:福建省自然科学基金(2006J0036)
摘 要:对二值图像进行Hough变换后,在(ρ,θ)空间中选取了一组边界对应点,通过计算与这些边界对应点对应的图像空间中直线的交点,构造了图像目标的外接多边形;通过比较相距π/2rad的投影区间长度是否相等,或区间长度的乘积是否为最小,得到了形状外接正方形和外接最小面积矩形;利用构造形状外接多边形的方法并通过增加边的数目,构造了形状的近似凸壳.实验和理论分析表明,文中算法具有好的抗噪性能和广泛的适用范围.After a binary image is transformed by the Hough transform under the (p, θ) line parameterization, a set of pairs of boundary points in the (p,θ) space is chosen. By computing the intersecting points of the lines in the image space, which are determined by the chosen pairs, the bounding polygon of the image objects is obtained. In addition, by determining those pairs of boundary point pairs in the (p, θ) space, where the θ difference of two boundary point pairs is π/2 rad but the p lengths of the two pairs are equal, or their product is minimum, the bounding square or the minimum bounding rectangle are respectively obtained in the same way as for the bounding polygon construction. Furthermore by increasing the number of the edges in the above bounding polygon construction process, an approximate convex hull of object is achieved. Both experimental results and analysis show that our proposed algorithms have good noise-resistance ability and a large range of applicability.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15