کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
532769 | 869991 | 2009 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A genetic algorithm with chromosome-repairing for min − # and min − ε polygonal approximation of digital curves
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A genetic algorithm with chromosome-repairing for min − # and min − ε polygonal approximation of digital curves A genetic algorithm with chromosome-repairing for min − # and min − ε polygonal approximation of digital curves](/preview/png/532769.png)
چکیده انگلیسی
A genetic algorithm for solving min − ε polygonal approximation and min − # polygonal approximation is proposed in this paper. It combines traditional split-and-merge techniques with a novel chromosome-repairing scheme to cope with constraints. Due to this combination of techniques we call our new method SMCR. In this new scheme an infeasible solution cannot only be easily transformed into a feasible one, but also be optimized. The experimental results show that the proposed SMCR has higher performance than the other GA-based methods and some non-GA-based methods.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Visual Communication and Image Representation - Volume 20, Issue 1, January 2009, Pages 45–56
Journal: Journal of Visual Communication and Image Representation - Volume 20, Issue 1, January 2009, Pages 45–56
نویسندگان
Bin Wang, Huazhong Shu, Limin Luo,