ASIA unversity:Item 310904400/19041
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90453/105672 (86%)
造访人次 : 12146429      在线人数 : 765
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 資訊學院 > 資訊傳播學系 > 期刊論文 >  Item 310904400/19041


    题名: Fast heuristics for polygonal approximation of a 2D shape
    作者: 王玲玲;Wang, Ling-Ling
    贡献者: 資訊傳播學系
    关键词: Image processing;Heuristic methods;Approximation theory;Algorithmsl;Digital filters;Computational methods;Computational geometry
    日期: 1997-04
    上传时间: 2012-11-26 15:16:16 (UTC+8)
    摘要: Two algorithms for polygonal approximation of a two-dimensional (2D) shape boundary are proposed in this paper. If the number of vertices in the obtained polygonal representation is large, the representation will characterize the shape boundary with high accuracy, while the cost for storing or transmitting the representation will be high. That is, the larger the compression ratio is, the more detail is lost in the obtained polygonal representation. The proposed first algorithm automatically determines a suitable spread parameter of a Gaussian filter for smoothing a shape boundary. No human intervention is required in this algorithm. Curvature extrema in the smoothed boundary are used as vertices of the polygonal representation. The second algorithm allows users to specify a lower bound of the compression ratio in the obtained polygonal representation. This algorithm produces a polygonal representation of the given shape boundary, whose compression ratio is only a little larger than or equal to the given lower bound. The proposed algorithms are computationally simple and efficient. Experimental results show the proposed algorithms are indeed efficient and effective; they are very useful in early processing of object recognition and analysis.
    显示于类别:[資訊傳播學系] 期刊論文


    档案 描述 大小格式浏览次数


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈