are narrow pulse-like waveforms, since the
backscattering occurs at almost a single distance.
The shape of these peaks is mainly defined by the
bandwidth of the detection channel and the rate of
the analog-to-digital conversion.
3 RECOGNITION STRATEGY
3.1 Characterization
As seen from (3), the shape of the smoke-plume
signatures in the lidar signal depends in a
complicated way on the profiles of the extinction
and backscattering coefficients along the beam
propagation direction. Although important for
prediction of the lidar range, gas-dynamic smoke-
plume models do not provide a solid basis for the
extraction of the characteristic features of the
smoke-plume signature. Due to this lack of reliable
parametric models, automated fire surveillance is
mainly based on artificial-intelligence algorithms
such as neural network (NN) methods.
In principle, lidar identifies targets with the
precision of a few meters, thus allowing for a very
accurate location of the fire. The angular target
position (the azimuth
ϕ
and elevation
ϑ
, see Fig. 2)
is given by the laser beam direction, but the
calculation of the distance to the smoke plume R
sp
is
carried out by the signal analysis unit.
NN architectures and algorithms suited for lidar
data extraction have been discussed in the literature
since the 1990s (Bhattacharya et al., 1997). It was
established that waveforms containing small
retroreflection from distributed targets could not be
directly presented to a neural network. A simple and
fast preprocessing method was developed for
facilitating the recognition, ensuring, at the same
time, that the processed waveforms properly reflect
subtle variations in the original waveforms.
Following the same principles as the radial-basis
function algorithms (Bishop, 1995; Haykin, 1999),
the recognition efficiency of a perceptron-based NN
is enhanced by a special binarization procedure that
uses a 2D grid in the signal-distance plane for the
waveform representation and a point-to-node
proximity criterion for assigning one or zero to the
grid nodes. Each node is treated as a separate input
component, increasing the network input dimension,
number of adjustable weights and, according to
Cover's theorem (Haykin, 1999), improving pattern
separability.
3.2 Problems
The application in question is characterized by the
following difficulties:
1. The length of the discrete-time sequence to be
processed,
RRi
/
maxmax
~6.7×10
3
, is much
larger than in other lidar applications, such as
underwater object detection (Mitra et al., 2003). As a
result, the conventional NN algorithms
(Bhattacharya et al., 1997; Mitra et al., 2003) cannot
be straightforwardly applied because they require
excessive computation time and resources. In
addition, fire may occur anywhere within the
surveillance range, so no narrower region of interest
can be selected a priori.
2. Smoke-plume signatures are compact. As seen
from Eq. (3), for a starting fire the characteristic
spread of a smoke-plume signature
ss
RΔ , within
which the backscattering factor
β
is sufficiently
large to produce the signal above the noise level, is
restricted by the spread of the plume:
10
spss
RR m. Well-developed fires result in
much wider plumes, but denser smoke increases the
laser-beam extinction up to the values
α
~ 0.2 m
–1
(Kozlov and Panchenko, 1996). In these
circumstances, the smoke-plume signature decreases
down to the noise level at distances of the order of
α
–1
due to the Beer-Lambert absorption of both the
laser beam and retroreflected light, resulting in
ss
R
~ 5 m. Measured as number of points in the
digitized signal,
RRN
ssss
/
, the signature
spread is always much less than that for the cases
described by Bhattacharya et al. (1997) and Mitra et
al. (2003), typically consisting of 5-10 points. The
short signature width and the great variety of
possible waveforms impede application of statistics-
based algorithms for noise reduction and signal
compression, which effectively reduce the
computational load in many other applications
(Mitra et al., 2003).
3. The fact that the distance to the target R
sp
must
be determined during the recognition may
complicate the NN structure: for the straightforward
algorithms, it turns the multiple input - single output
classification scheme into one with multiple outputs,
in which the additional neurons codify, in an analog
or digital way, the value of R
sp.
4. Due to the fact that a constant background can
be represented as a sum of uniformly distributed
peaks, the problem of peak recognition is not
linearly separable a priory and cannot be solved
without introduction of preprocessing and/or non-
linearity.
A SIMPLE NEURAL-NETWORK ALGORITHM FOR CLASSIFICATION OF LIDAR SIGNALS APPLIED TO
FOREST-FIRE DETECTION
571