Efficient handwritten curve approximation by a B้zier curve using chebyshev polynomials

Conference proceedings article

Authors/Editors

Strategic Research Themes

No matching items found.

Publication Details

Author list: Jaroensawad R., Dejdumrong N., Prakancharoen S.

Publisher: Hindawi

Publication year: 2013

Start page: 75

End page: 78

Number of pages: 4

ISBN: 9780769550510

ISSN: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84892649352&doi=10.1109%2fCGIV.2013.22&partnerID=40&md5=c3a95871fdd0cd1d72cd58b9de33785b

Languages: English-Great Britain (EN-GB)

View on publisher site

Abstract

This paper presents two methodologies for approximating a handwritten curve by a B้zier curve using Chebyshev Polynomials. First, two different featured point selection techniques, are introduced in algorithms 1 and 2. Algorithm 1 uses frequency while algorithm 2 uses the analysis of inflection point. Then, using Chebyshev Polynomials for approximation curve, however a new curve must be adjusted by algorithm 3 because the end points of curve are swing. ฉ 2013 IEEE.

Keywords

Approximating handwritten curve, Chebyshev polynomials