Paper
1 December 1993 Linear-time recognition of digital polynomial curves and surfaces that have periodic differences
Author Affiliations +
Proceedings Volume 2060, Vision Geometry II; (1993) https://doi.org/10.1117/12.164999
Event: Optical Tools for Manufacturing and Advanced Automation, 1993, Boston, MA, United States
Abstract
Digital polynomial curves and surfaces arise from the digitization of algebraic surfaces such as lines, parabolas, planes, or paraboloids. It is known that the n-th difference of a digital polynomial curve of degree n is periodic for polynomials that have rational coefficients. In this paper we consider the following problem: Suppose we have a digital curve S whose n-th difference is known to be periodic. When is S a digital rational polynomial curve? As a solution to this problem we state a simple criterion that can be checked in linear time. As a first application of this criterion we describe a linear time algorithm for the recognition of digital straight lines. In comparison to other algorithms, the advantages of the new algorithm are its simplicity, and its ability to actually find the coefficients of the rational polynomial representing the line. We then go on to discuss the applicability of this criterion to the recognition of digital curves and surfaces of arbitrary degree.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Peter Veelaert "Linear-time recognition of digital polynomial curves and surfaces that have periodic differences", Proc. SPIE 2060, Vision Geometry II, (1 December 1993); https://doi.org/10.1117/12.164999
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Reconstruction algorithms

Vision geometry

Information operations

Algorithm development

Astatine

Image analysis

Back to Top