Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/7092
Title: | Least squares fitting of digital polynomial segments | Authors: | Žunić J. Acketa D. |
Issue Date: | 1-Jan-1996 | Journal: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Abstract: | © Springer-Verlag Berlin Heidelberg 1996. It is proved that digital polynomial segments and their least squares polynomial fits are in one-to-one correspondence. This enables an efficient representation of digital polynomial segments by n+3 parameters, under the condition that an upper bound, say n, for the degrees of the digitized polynomials is assumed. One of such representations is (x 1, m, an, an−1,…, a 0), where x 1 and m are the x-coordinate of the left endpoint and the number of digital points, respectively, while a n, a n−1,..., a 0 are the coefficients of the least squares polynomial fit Y=a nXn+an− 1Xn−1+ ...+a0, for a given digital polynomial segment. | URI: | https://open.uns.ac.rs/handle/123456789/7092 | ISBN: | 9783540620051 | ISSN: | 3029743 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
1
checked on Feb 22, 2020
Page view(s)
11
Last Week
7
7
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.