Recognition and characterization of digitized curves
We consider the graphs of functions representable in the form h( x) = Σ j=1 n a j f j ( x) where the f j constitute a linearly independent set of functions over R. These graphs are digitized by the set of lattice points ( i, ⌊ h( i)⌋). An algorithm is presented to determine if a given set of lattice...
Saved in:
Published in | Pattern recognition letters Vol. 5; no. 3; pp. 207 - 213 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
01.03.1987
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We consider the graphs of functions representable in the form
h(
x) =
Σ
j=1
n
a
j
f
j
(
x) where the
f
j
constitute a linearly independent set of functions over
R. These graphs are digitized by the set of lattice points (
i, ⌊
h(
i)⌋). An algorithm is presented to determine if a given set of lattice points is part of such a digitization.
We also study the digitization of polynomials. An important tool used is the set of differences of the
y-coordinates (digital derivatives). For example, if
h(
x) is a polynomial of degree
n, then its
n-th digital derivative is cyclic and its (
n + 1)st digital derivative has a bound which depends only on
n. |
---|---|
ISSN: | 0167-8655 1872-7344 |
DOI: | 10.1016/0167-8655(87)90065-1 |