main field of interest for it was cartography. Many
well known geographic information systems are
equipped with algorithms that allow creating a photo
layer to display them on a map.
The most important feature of such photography is
that the objects shown on it are attached to their
location by coordinates of the real world. With the
improvement of technologies and rise of calculation
powers of computer systems new usage possibilities
for these images have appeared, for example
evaluation of specific objects.
Using algorithms for object recognition in images
can be performed in three modes – automatic, half
automatics and manual. Each of the mentioned
modes has well known precondition – photo quality
which can be described by many components such
as color, contrast, graininess, the amount of objects
and others. The relationship between quality and
automation level can be stated – for higher quality
higher automation level can be used.
Acquiring useful image is not a trivial task, because
many factors such as weather, time of the year,
quality of equipment must be taken into account.
Also height of flight is very important and can be
altered depending on the goals of photography. For
example, if the main task is to get the density of
trees in some region then the height can be
comparatively big, but if it is necessary to find the
size of leafage or even a kind of a tree, the height
must be small. In the first situation the main benefit
can be found in the fact that for describing some
region a smaller number of photos can be taken then
in the second situation. A specific task can be solved
only when all needed data is acquired for the
territory of interest.
Aero photography has many use cases, but for
taxation the most important ones are:
1. Finding the number and coordinates of a
tree;
2. Finding the size of a leafage ;
3. Finding the kind of a tree;
4. Finding the borderlines of a territory;
5. Finding forest vistas and roads;
6. Evaluating territories gutted by fire;
7. Evaluating windfalls.
Image processing algorithms are needed for solving
all of the mentioned tasks. The first, the fourth, and
the fifth tasks need photos with the smallest
resolution. All other tasks need qualitative pictures
which contain plenty of data to use methods that can
separate tree leafage and measure its parameters. For
all of the pictures widely known algorithms or
simple each pixel overlooking loops can be used. In
this situation a very popular group of segmentation
an algorithm that needs to know a number of clusters
cannot be utilized because it is the parameter that the
system is looking for.
If the system finds specific segments by using these
methods, then by knowing the height of a flight and
the angle of a camera, the size of leafage can be
calculated.
For tree kind determination it is necessary to
recognize the structure of an object, were at a certain
scale contours of a leaf which is taken from the
image and searched in the previously defined
collection. Another way of solving this task is by
using colored recognition (each tree kind has its
specific color). The main drawback of this method is
that the color depends on weather and photo filters
used in the picture making. It means that automatic
use of this method is almost impossible.
4.2 Tree Identification using Aero
Photography
Crating automatic methods is a very difficult task
and the first step in it is to understand half automatic
or even manual solutions. We will describe an
algorithm for identifying a tree that works in a half
automatic mode. For this method images attached to
GIS coordinates are needed and also a full photo
cannot be used, but only a part of it where the angle
of photography and surface is close to 90
o
, because
in other case it is a side-view. So the images must
overlap and cover some part of the same territory.
Tops of a tree on the images usually can be well
separated from the background and their color
depends on the time of the year and weather.
Therefore to realize half automatic way of
recognition it is necessary to select a few pixels from
tree tops (2 to 5). Every shown point gives us
information of the possible color and by adding
some dispersion to it (recommended 5-15%) we
define a pattern to look for in the rest of a picture.
Dispersion and location of points are parameters that
user can change depending on results. Minimal
(R
min
) and maximal (R
max
) radius is given in
numbers and by using them in combination with tree
top color dispersion, searching for a particular tree
can be preformed.
Algorithm for finding tree center works with one
correction (Fig. 2) – searching is performed on X
and Y scales by using colors. First of all, tree top
start point x
1
and end point x
2
have to be found, then
an average value x
0
is calculated x
0
= (x
2
+x
1
)/2. From
the point x
0
on Y scale minimal y
1
and maximal y
2
values are found. In the same way as x
0
the value of
y
0
is calculated y
0
= (y
2
+y
1
)/2.
ALGORITHMS FOR ESTIMATING FOREST INVENTORY PARAMETERS FROM DATA ACQUIRED BY REMOTE
SENSING METHODS
585