Least squares fitting of digital polynomial segments

DOI10.1007/3-540-62005-2_2MaRDI QIDQ6567731zbMATH OpenFDO

Authors Joviša Žunić, D. Acketa

Publication date 5 July 2024

Full work available at URL https://doi.org/10.1007/3-540-62005-2_2

zbMATH Keywords

codingcomputer visiondigital polynomial segmentimage processingleast squares fitting

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• A new characterization of digital lines by least square fits
• scientific article; zbMATH DE number 1873272
• A constant space representation of digital cubic parabolas
• A General Coding Scheme for Families of Digital Curve Segments
• Fast Polynomial Segmentation of Digitized Curves

Cites work

• A linear algorithm for nonhomogeneous spectra of numbers
• A new characterization of digital lines by least square fits
• Digital Disks
• Digital Straight Line Segments
• Discrete Representation of Straight Lines
• scientific article; zbMATH DE number 3521341 (Why is no real title available?)
• New views of linearity and connectedness in digital geometry
• Nonhomogeneous spectra of numbers
• On the recognition of digital circles in linear time
• Spectra of Numbers
• The Discrete Equation of the Straight Line

This page was built for publication: Least squares fitting of digital polynomial segments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567731)