In the high-level operations of computer vision it is taken for granted tha
t image features have been reliably detected. This paper addresses the prob
lem of feature extraction by scale-space methods. There has been a strong d
evelopment in scale-space theory and its applications to low-level vision i
n the last couple of years. Scale-space theory for continuous signals is on
a firm theoretical basis. However, discrete scale-space theory is known to
be quite tricky, particularly for low levels of scale-space smoothing. The
paper is based on two key ideas: to investigate the stochastic properties
of scale-space representations and to investigate the interplay between dis
crete and continuous images. These investigations are then used to predict
the stochastic properties of sub-pixel feature detectors.
The modeling of image acquisition, image interpolation and scale-space smoo
thing is discussed, with particular emphasis on the influence of random err
ors and the interplay between the discrete and continuous representations.
In doing so, new results are given on the stochastic properties of discrete
and continuous random fields. A new discrete scale-space theory is also de
veloped. In practice this approach differs little from the traditional appr
oach at coarser scales, but the new formulation is better suited for the st
ochastic analysis of sub-pixel feature detectors.
The interpolated images can then be analysed independently of the position
and spacing of the underlying discretisation grid. This leads to simpler an
alysis of sub-pixel feature detectors. The analysis is illustrated for edge
detection and correlation. The stochastic model is validated both by simul
ations and by the analysis of real images. AMS 1991 Subject Classification:
Primary 68U10; 60D05; 60G60.