The maximum quantization error is given by
From (11) and (12),
if
,
we have
and
,
where
xmax, ymax,
xmin, ymin denote the maximum and the minimum
values of the coordinates x,y of discrete sampling points
on the same line.
In the same way,
we can calculate
and
for
.
As a result, we have
![]() |
(28) |
![]() |
(29) |
has the minimum value
at
.
Since the image is square,
the length of the line, l, has the maximum value
at the same value of
.
Hence, the upper bound of the sampling interval
is given as follows.
Upper Bound of the Sampling Interval for -
parameterization:
We have another interesting coincidence between
our discussion and a previous work.
Van Veen et al. derived the boundary between the oversampling
and the subsampling of the quantization of parameter space [3].
The boundary is given by
The distance between two parallel lines adjacent each other
in the discrete image is
measured perpendicular to the lines.
It is quite natural that the upper bound of the sampling interval
of
is given by
.
Here let us suppose the parameter space is quantized by
.
Note that this sampling interval will provide us with
the Hough Transform which requires less memory.
The length of the longest line segment in the square image is given
by
.
Substituting the sampling interval and the line length into (32),
we obtain
![]() |
(33) |