Fast heuristics for polygonal approximation of a 2D shape

ASIA unversity > 資訊學院 > 資訊傳播學系 > 期刊論文 > Item 310904400/19041

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/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 07:16:16 (UTC+0)
摘要:	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.
關聯:	SIGNAL PROCESSING
显示于类别:	[資訊傳播學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	292	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.

数据加载中.....