Edge detection in multispectral images using the self-organizing map

Embed Size (px)

Text of Edge detection in multispectral images using the self-organizing map

  • muor

    P.J. Toivanen a,*, J. Ansamaaki b, J.P.S. Parkkinen c, J. Mielikaainen a

    determines the amount of found edges. If the SOM is taught using a large color vector database, the same SOM can be

    1996) a new edge detection method is presented,

    which is derived from an adaptive 2-D edge model.

    in this paper, multi- and hyperspectral images are

    used, and all operations are performed on the

    spectral vectors.

    One approach in gray-level images is to see the

    pixel values as an ordering of pixels. From this

    image, in which an ordering scalar is associated

    Pattern Recognition Letters 24 (20* Corresponding author. Tel.: +358-5-621-2812; fax: +358-5-utilized for numerous images.

    2003 Elsevier B.V. All rights reserved.

    Keywords: Multispectral image edge detection; Ordering of multivariate data; Self-organizing maps; Feature extraction; Pattern

    recognition; Machine vision

    1. Introduction

    There exists a large number of methods for edge

    detection in digital images. In (Qian and Huang,

    It is optimal in terms of signal-to-noise ratio

    (SNR) and edge localization accuracy (ELA). A

    new edge detection method for 3-component color

    images is presented in (Fan et al., 2001). However,a Laboratory of Information Processing, Department of Information Technology, Lappeenranta University of Technology,

    P.O. Box 20, FIN-53851 Lappeenranta, Finlandb Kouvola Business Department, Kymenlaakso Polytechnic, Salpausselaantie 57, FIN-45100 Kouvola, Finland

    c Department of Computer Science, University of Joensuu, P.O. Box 111, FIN-80101 Joensuu, Finland

    Received 26 June 2002; received in revised form 12 May 2003


    In this paper, two new methods for edge detection in multispectral images are presented. They are based on the use

    of the self-organizing map (SOM) and a grayscale edge detector. With the 2-dimensional SOM the ordering of pixel

    vectors is obtained by applying the Peano scan, whereas this can be omitted using the 1-dimensional SOM. It is shown

    that using the R-ordering based methods some parts of the edges may be missed. However, they can be found using the

    proposed methods. Using them it is also possible to nd edges in images which consist of metameric colors. Finally, it is

    shown that the proposed methods nd the edges properly from real multispectral airplane images. The size of the SOMEdge detection inusing the self-621-2899.

    E-mail address: pekka.toivanen@lut. (P.J. Toivanen).

    0167-8655/$ - see front matter 2003 Elsevier B.V. All rights reservdoi:10.1016/S0167-8655(03)00159-4ltispectral imagesganizing map

    03) 29872994

    www.elsevier.com/locate/patrecwith every pixel vector, the edges are found using

    an edge detection operator.


  • dj kxj xkk; 1

    ognition Letters 24 (2003) 29872994It is not possible to dene uniquely the ordering

    of multivariate data. A number of ways have been

    proposed to perform multivariate data ordering.

    They are usually classied into the following cate-

    gories: marginal ordering (M-ordering), reduced

    or aggregate ordering (R-ordering), partial order-ing (P-ordering), and conditional ordering (C-

    ordering) (Barnett, 1976). Of these ordering

    methods, the R-ordering is the most used in edge

    detection and ltering of multispectral images

    (Trahanias and Venetsanopoulos, 1993). It gives a

    natural denition of the vector median as the rst

    sample in the sorted vectors, and large values of

    the aggregate distance give an accurate descriptionof the vector outliers (Astola et al., 1990). Fur-

    thermore, the other ordering methods suer from

    certain drawbacks in the case of color image pro-

    cessing. M-ordering corresponds actually to a

    componentwise processing and P-ordering implies

    the construction of convex hulls which is very

    dicult in 3 and higher dimensions. C-ordering is

    simply an ordering according to a specic compo-nent and it does not utilize the information con-

    tent of the other signal components. A thorough

    discussion of the ordering method is given in

    (Barnett, 1976).

    Conventionally, edge detection methods of mul-

    tispectral images are based on gradient methods

    (Cumani, 1991) or ordering the spectral vectors

    rst using a suitable ordering method, e.g. R-ordering (Trahanias and Venetsanopoulos, 1993).

    Unfortunately the gradient approach is unsatis-

    factory in cases where the image gradients show

    the same strength but in opposite directions. Then,

    the vector sum of the gradients would provide a

    null gradient (Zenzo, 1986).

    This paper is organized as follows. Section 2

    presents the R-ordering and the proposed newordering methods of multispectral image pixels for

    edge detection purposes. It is shown in Section 3

    that the R-ordering based methods may miss some

    parts of the edges, because R-ordering gives the

    same scalar value to some pixels which lie in dif-

    ferent areas. These edges can be found using the

    proposed methods. Also, the obtained results

    using real multispectral airplane images are shownin Section 3. Section 4 presents a discussion on the

    2988 P.J. Toivanen et al. / Pattern Recissue.k1

    where k k represents an appropriate vector norm.An arrangement of the djs in ascending order,d16 d26 6 dn, associates the same ordering tothe multivariate xjs, x16x26 6 xn. x1 is thevector median of the data samples (Astola et al.,

    1990). As a result of the R-ordering, the original

    multispectral image is transformed to a scalar


    2.2. The self-organizing map and Peano scan

    The basic idea of the self-organizing map

    (SOM) (Kohonen, 1989) assumes a sequence of

    input vectors fxj; j 1; 2; . . . ; ng, where n is thenumber of the vectors. The set of representative

    neuron vectors which form the SOM at the iter-

    ation phase j is denoted by fmji ; i 1; 2; . . . ; kg.The number of vectors in the SOM is denotedby k. Every mji is a p-dimensional vector.

    In the learning phase, it is assumed that the m0ihave been initialized in some proper way; random

    selection will often do. Every input xj is comparedto all the mji . The input signal vector x

    j, the rep-

    resentative neuron vectors in the SOM mji , andbest matching unit c are related by Eq. (2),

    j j j j2. Edge detection by ordering pixels

    2.1. R-ordering

    In this paper, a multispectral image is viewed asa vector eld, represented by a discrete vector-

    valued function g : Z2 ! Zp, where Z representsthe set of integers and p is an integer.

    Let x represent a p-dimensional vector x x1;x2; . . . ; xpT, where xl, l 1; 2; . . . ; p, are the spec-tral components of a pixel and let xj, j 1; 2; . . . ;n, be the pixel j in the image g. n is the number ofpixels in the image g. Each xj is a p-dimensionalvector xj xj1; xj2; . . . ; xjpT. In R-ordering, eachvector xj is reduced to a scalar value dj in thefollowing way:

    Xnkx mck mini fkx mikg; 2

  • vector of the original image. An input vector x,the Peano vectors in the Peano matrix P p1;

    ognitwhere k k represents an appropriate vector norm.In this paper, the Euclidean norm is used (Koho-

    nen, 1989).

    Updating the SOM in the learning phase is

    done according to Eqs. (3) and (4),

    mj1i mji ajxj mji 8i 2 Njc ; 3

    mj1i mji 8i 62 Njc : 4Njc is a topological neighborhood which is centeredaround that representative neuron vector for

    which the best match with input xj is found. Theradius of Njc is shrinking monotonically with time.aj is a scalar parameter that decreases monotoni-cally during the course of the process, 0 < a < 1(Kohonen, 1989).

    When a 2-dimensional SOM is used, afterteaching every vector in the SOM is traversed

    using the Peano scan. As a result, we get a 2-

    dimensional matrix P which orders the vectors insuch a way that a scalar can be given to every

    column vector. The Peano curve used in this paper

    is quantized to match the size of the SOM. The

    Peano curve is one of the family of fractal curves

    discussed in more detail by Mandelbrot (1977).Patrick et al. (1968) showed how similar curves

    could be used to map multidimensional data onto

    a line for dierent applications. A general mathe-

    matical approach to the algorithms for generating

    these curves is reported by Butz (1971). The rele-

    vant properties of the Peano scan for this paper

    can be found in (Stevens et al., 1993). Fig. 2 shows

    the ordering process with the 2-dimensional SOM.P is dened by

    P p1; p2; . . . ; pk; 5where k is the number of neurons in the SOM.In this paper, k 32 32 1024 or k 6464 4096. Then, each Peano vector pi is denedby

    pi pi1; pi2; . . . ; piM T; 6where M 61 in the articial images or M 25 inthe real-world image is the number of components

    of the vectors. Furthermore, Peano vectors pi

    which are near each other in the Peano matrix Pare also quite near each other according Euclidean

    P.J. Toivanen et al. / Pattern Recdistance in the 61-dimensional or 25-dimensionalp2; . . . ; pN, and the best matching unit c arerelated as follows:

    kx pck minifkx pikg: 7

    The scalar value of this best matching unit c isinserted into a new image f to replace the vector ofthe same location in g:

    f x; y c; 8where f f x; y denotes the new order image,which is a gray-level image. The edges in f are theneasy to nd using any grayscale edge detector. In

    this paper, the Laplace and Canny operators are


    In the case of 1-dimensional SOM the neigh-