ASIA unversity:Item 310904400/19041
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90452/105769 (86%)
Visitors : 11946654      Online Users : 393
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/19041


    Title: Fast heuristics for polygonal approximation of a 2D shape
    Authors: 王玲玲;Wang, Ling-Ling
    Contributors: 資訊傳播學系
    Keywords: Image processing;Heuristic methods;Approximation theory;Algorithmsl;Digital filters;Computational methods;Computational geometry
    Date: 1997-04
    Issue Date: 2012-11-26 15:16:16 (UTC+8)
    Abstract: 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.
    Relation: SIGNAL PROCESSING
    Appears in Collections:[Department of Information Communication] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML102View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


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