ROBUST SKYLINE EXTRACTION ALGORITHM FOR
MOUNTAINOUS IMAGES
Sung Woo Yang, Ihn Cheol Kim and Jin Soo Kim
3-1-2, Agency for Defense Development, Yuseong P.O. BOX 35, Daejeon, Republic of Korea
Keywords: Skyline extraction, mountainous images, canny edge images, skyline candidate pixel.
Abstract: Skyline extraction in mountainous images which has been used for navigation of vehicles or micro
unmanned air vehicles is very hard to implement because of the complexity of skyline shapes, occlusions by
environments, difficulties to detect precise edges and noises in an image. In spite of these difficulties,
skyline extraction is a very important theme that can be applied to the various fields of unmanned vehicles
applications. In this paper, we developed a robust skyline extraction algorithm using two-scale canny edge
images, topological information and location of the skyline in an image. Two-scale canny edge images are
composed of High Scale Canny edge image that satisfies good localization criterion and Low Scale Canny
edge image that satisfies good detection criterion. By applying each image to the proper steps of the
algorithm, we could obtain good performance to extract skyline in images under complex environments.
The performance of the proposed algorithm is proved by experimental results using various images and
compared with an existing method.
1 INTRODUCTION
Skyline extraction is similar to a segmentation
problem which partitions the image into the sky and
non-sky areas. The skyline extraction in mountain-
ous images is very useful in that we can obtain many
local spatial features from skyline that hardly change
even though time goes by. It is used for navigation
of vehicles or micro unmanned air vehicles (Ettinger
et al., 2002; Messi, 2003; Truchetel, 2006). And it
can also be used for rendering cartographic data,
rendering self-shadowing textures, accelerating
flight simulation, visualizing scientific data, path
planning to avoid detection etc (Stewart, 1998). But
it is very difficult to extract skyline from moun-
tainous images because of compexity and diversity
of the skyline and influence by the noise caused by
complex environments. Clouds, fog and backlight by
the sun in an outdoor environment make the skyline
ambiguous. And they also make it hard to extract
skyline. Because of these difficulties, skyline extra-
ction in mountainous images is one of the most
difficult problems to solve in computer vision fields.
There are two approaches to skyline extraction. One
is region-based approach which uses the
characteristics of images that the sky often occupies
the upper part of an image (Fang et al., 1993; Stein
el al., 1992; Cozman et al., 1997, 2000). And the
other is edge-based approach which uses the fact that
skyline can be regarded as a boundary between two
distinctive regions (Talluri and Aggarwal, 1992; Lie
et al.,2005; Woo et al., 2005).
The approach proposed in Fang et al.’s work (1993)
uses the threshold to find the skyline. They calculate
the threshold using ten small sub-windows and the
contrast of the image. After the threshold is
determined, a vertical-line search from top to bottom
is performed. Then, the pixels whose intensity is
below the threshold are determined as skyline. Their
approach has weak robustness when the image has
complex environments, such as clear clouds above
the skyline. Cozman et al.’s approach(2000) also
uses vertical-line search. However, they use the
smoothed intensity gradient image. This approach
also has the drawback of weak robustness for
complex environments. In the Stein et al.’s work
(1992), they find the skyline using the segmentation
method which segments the sky and the ground. But
they don’t mention the crucial segmentation step,
and general segmentation methods have a limitation
to find exact skyline. Talluri and Aggarwal(1992)
use gradient value to extract the skyline based on
edge-based approach. But their approach is too
simplified to be applicable to complex images. A
more practical approach is advocated by Woo et al.
(2005) and Lie et al.(2005). They also use edge-
based approach. In Woo et al.’s work, they use
Dynamic Programming using contrast cost and
253