Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Aitken, A. C. (1956). Determinants and Matrices, Oliver and Boyd.
Arcelli, L. and Masarotti, A. (1978). On the parallel generation of straight digital lines, Computer Graphics and Image Processing, 7, 67–83.
Bongiovanni, G., Luccio, G. F. and Zurat A. (1975). The discrete equation of a straight line, IEEE Trans. Comput., 24, 310–313.
Boshernitzan, M. and Fraenkel, A. S. (1981). Nonhomogeneous spectra of numbers, Discrete Mathematics, 34, 325–327.
Boshernitzan, M. and Fraenkel, A. S. (1984). A linear algorithm for nonhomogeneous spectra of numbers, J. Algorithms, 5, 187–198.
Burr, I. W. (1974). Applied Statistical Methods, Academic Press.
Dorst, L. and Smeulders, A. W. M. (1984). Discrete representation of straight lines, IEEE Trans. Pattern Analysis and Machine Intelligence, 6, 450–463.
Graham, R. L., Lin. and Lin, C.-S. (1978). Spectra of numbers, Mathematics Magazine, 51, 174–176.
Kim, C. E. (1984). Digital disks, IEEE Trans. Pattern Analysis and Machine Intelligence, 6, 372–374.
Klassman, H. (1975). Some aspects of the accuracy of the approximated position of a straight line on a square grid, Computer Graphics and Image Processing, 4, 225–235.
Klette, R., Stojmenović, I. and Žunić J. (1996). A parametrization of digital planes by least square fits and generalizations, Graphical Models and Image Processing, 58, No. 3, 295–300.
Krechmar, V. A. (1974). A Problem Book in Algebra. Mir Publishers, Moscow.
Kovalevsky, V. A. (1990). New definition and fast recognition of digital straight segments and arcs, IEEE Proc. of Tenth Int. Conf. on Pattern Recognition, 10662, 31–34.
Lindenbaum, M. and Koplowitz, J. (1991). A new parametrization of digital straight lines, IEEE Trans. Pattern Analysis and Machine Intelligence, 13, 847–852.
Melter, R. A. and Rosenfeld, A. New views of linearity and connectedness in digital geometry, Pattern Recognition Letters, 10, 9–16.
Melter, R. A., Stojmenović, I. and Žunić, J. (1993). A new characterization of digital lines by least square fits, Pattern Recognition Letters, 14, 83–88.
Nakamura, A. and Aizawa, K. (1984). Digital circles, Computer Vision, Graphics and Image Processing, 26, 242–255.
Rosenfeld, A. (1974). Digital straight line segments, IEEE Trans. Comput., 23, 1264–1269.
Sauer, P. (1993). On the recognition of digital circles in linear time, Computational Geometry: Theory and Applications, 2, 287–302.
Žunić, J. (1995). A coding scheme for certain sets of digital curves, Pattern Recognition Letters, 16, 97–104.
Žunić, J. and Koplowitz, J. (1994). A representation of digital parabolas by least square fits, SPIE Proc., 2356, 71–78.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Žunić, J., Acketa, D.M. (1996). Least squares fitting of digital polynomial segments. In: Miguet, S., Montanvert, A., Ubéda, S. (eds) Discrete Geometry for Computer Imagery. DGCI 1996. Lecture Notes in Computer Science, vol 1176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62005-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-62005-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62005-1
Online ISBN: 978-3-540-49595-6
eBook Packages: Springer Book Archive