کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
532790 869994 2008 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Optimized polygonal approximation by dominant point deletion
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Optimized polygonal approximation by dominant point deletion
چکیده انگلیسی

An algorithm for polygonal approximation based on dominant point (DP) deletion is presented in this paper. The algorithm selects an initial set of DPs and starts eliminating them one by one depending upon the error associated with each DP. The associated error value is based on global measure. A local optimization of few neighboring points is performed after each deletion. Although the algorithm does not guarantee an optimal solution, the combination of local and global optimization is expected to produce optimal results. The algorithm is extensively tested on various shapes with varying number of DPs and error threshold. In general, optimal results were observed for about 96% of the times. A good comparative study is also presented in this paper

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition - Volume 41, Issue 1, January 2008, Pages 227–239
نویسندگان
,