Segmentation of PolSAR image by using an automatic initialized variational model and a dual optimization approach

  • Zongjie Cao1Email author,

    Affiliated with

    • Ying Tan1 and

      Affiliated with

      • Jilan Feng1

        Affiliated with

        EURASIP Journal on Wireless Communications and Networking20132013:34

        DOI: 10.1186/1687-1499-2013-34

        Received: 24 December 2012

        Accepted: 16 January 2013

        Published: 19 February 2013

        Abstract

        This paper presents a variational model based segmentation approach for polarimetric synthetic aperture radar (PolSAR) images. The formulation for PolSAR image segmentation is based on a scaled Wishart distribution based continuous Potts model, which can partition the image domain into distinct regions with respect to the statistical property of PolSAR data. To make the segmentation efficient, a duality based optimization approach is utilized to minimize the energy functional. Moreover, an automatic initialization approach which takes the unsupervised Ha classification result of the polarimetric data as input is used to initialize the segmentation process. This approach can estimate the appropriate number of clusters and the corresponding classification map for the PolSAR data, which are used as the input of the following variational segmentation approach. In such a way, the proposed approach is carried out in a fully unsupervised way. Both of the polarimetric decomposition features and the statistical characteristics are used to get the final segmentation result, which helps to increase the accuracy. Experimental results demonstrate the effectiveness of the proposed approach. Without any artificial supervision, the proposed approach can produce superior segmentation results than results obtained with random initialized variational approach and Wishart–H–a classification approach.

        Keywords

        PolSAR Image segmentation Variational model Primal-dual method Polarimetric decomposition Automatic initialization

        1. Introduction

        Segmentation is an important step for SAR image processing and interpretation. It can provide useful information for many SAR applications such as automatic target recognition, classification, crop monitoring and so on. SAR images are inherently corrupted by speckle noise, which degrades the quality of SAR data and makes the segmentation of SAR images difficult. Speckle filters, such as Lee filter and Frost filter, can be used to smooth the speckle noise before segmentation [1, 2]. However, speckle reduction methods also cause information loss, which is undesired for further processing. Other methods based on wavelet transform and multi-scale analysis are also utilized for SAR image segmentation [3]. Nevertheless, there is no universal segmentation methods exist due to the variety and complexity of SAR images.

        The emergence of variational methods provides another sort of methods for SAR image segmentation. Using of variational models for image segmentation started from the application of Snakes model [4], and got a great advancement when Osher and Sethian put forward the level set method [5]. I. B. Ayed et al. [6] proposed a level set based SAR image segmentation method. The energy functional for SAR image segmentation is built based on the Gamma distribution, which can model the statistical property of SAR data. Then they extended their level set based SAR image segmentation approach to deal with PolSAR image segmentation [7]. PolSAR images are different from single-channel SAR images in the data storage form. The vector or matrix valued PolSAR data brings new issues such as data modeling and computational complexity. In [7], the segmentation of PolSAR images is tackled by taking advantage of the scaled Wishart distribution of coherency matrix and a multi-phase level set approach. Although this methods shows effectiveness for PolSAR image segmentation, there are still spaces to explore. Firstly, the level set method is known to be time-consuming, especially for multi-phase image segmentation. Furthermore, the signed-distance function based representation makes the energy functional to be non-convex with respect to the level set functions, which causes energy optimization issues such as the existence of local minimum. Last but not the least, artificial supervision is still a crucial factor for obtaining satisfactory segmentation results for previous variational PolSAR image segmentation approaches. The number of clusters is often pre-determined by subjective observation. Due to the existence of local minimum, a good initialization is also in need because different initializations may lead to different segmentation results.

        In order to deal with the aforementioned problems, in this paper a variational model based PolSAR image segmentation approach is presented. First of all, based on the continuous Potts model, the energy functional for PolSAR images is established by taking advantage of the scaled Wishart distribution of the coherency matrix. In this model, clusters are represented by indicator functions. Compared to level set based region representation, using of cluster indicator functions is more direct and clear. It also makes it possible to relax the energy functional to be convex, which is a great advantage for optimizing consideration. The scaled Wishart distribution based energy is minimized with a duality based approach, which has shown its efficiency for optimizing continuous Potts model based energies [8]. This approach can obtain global optimal value for the Potts model, which is a desired property for the segmentation of PolSAR images with complex scene. Nevertheless, in the approach of [8], the feature model parameters for every cluster should be estimated before the energy minimization is performed. The number of clusters also needs to be determined. This difficulty is tackled by using a polarimetric decomposition based automatic initialization technique [9]. Cloude and Pottier [10] proposed an unsupervised classification method by using the H–a decomposition. The H–a plane which represents the scattering mechanisms is divided into eight zones, resulting in the partition of terrains with different physical scattering characteristics. This method is unsupervised but the result is rough due to the effect of speckle noise. The output of this rough classification could be used as initialization conditions for other more sophistic classification methods. However, the optimal number of clusters is not always equal to eight. So another step is added to estimate the appropriate number of clusters. The automatic initializing step brings two benefits. Firstly, the number of clusters and the initialization statement for the segmentation are both determined by PolSAR data itself. As a result, the proposed PolSAR image segmentation approach is fully unsupervised. A good initialization also increases the efficiency of the segmentation process. Secondly, the proposed approach combines the polarimetric decomposition based classification method and the statistical based variational segmentation method together. This means different features are integrated into the proposed approach to determine the final segmentation result, which helps to increase the segmentation accuracy.

        The outline of this paper is as follows: In Section 2, the proposed variational segmentation approach is presented, including the scaled Wishart distribution based Potts model and the duality based optimizing method. The H–a decomposition based automatic initialization method is introduced in Section 3. In Section 4, the experiments are carried out by using the real polarimetric SAR datas collected by AIRSAR and UAVSAR. The effectiveness of the proposed PolSAR segmentation approach is verified. Results of several other methods, including the Wishart–H–a classification method and traditional variational segmentation method with random/artificial initialization, are also provided and compared with the result of the proposed approach. The paper is concluded in Section 5.

        2. The proposed segmentation model

        In this section, the energy functional for PolSAR image segmentation and the energy minimization approach is introduced. The energy functional is based on the continuous Potts model, but makes use of the scaled Wishart distribution, which is suitable for modeling the statistical property of PolSAR data. The established energy is minimized with a duality based method.

        2.1. Scaled Wishart distribution and maximum likelihood classification of PolSAR data

        The data of fully polarimetric SAR is collected and stored in the scattering matrix S. Each element S pq represents the complex scattering coefficient of transmitting polarization state p and receiving polarization state q. By using the Pauli decomposition, the scattering matrix S can be transformed into a scattering vector k. For the reciprocal backscattering case S hv  = S vh the scattering vector can be written as
        k = 1 2 S hh + S vv , S hh S vv , 2 S hv T http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ1_HTML.gif
        (1)
        After multi-look processing, the coherency matrix is given as
        T = 1 l i = 1 l k i k i * T http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ2_HTML.gif
        (2)

        where l is the number of looks, * is the complex conjugate and k is the i–th sample scattering vector.

        Assuming that the scattering vector has a Gaussian distribution, the coherency matrix could have a scaled Wishart distribution with n degrees of freedom, i.e.
        p T ; C = n qn T n q exp tr n C - 1 T K n , q C n http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ3_HTML.gif
        (3)

        where K(n, q) = π(1/2)q(q − 1)Γ(n) ⋯  Γ(n − q + 1), tr is the operator to compute the trace of a matrix, the polarimetric dimension q = 3 for the reciprocal case, and C is the cluster center coherency matrix.

        The PolSAR data can be classified according to the maximum-likelihood (ML) criterion. Define the distance between one PolSAR data sample T and a cluster center C i as:
        d m T , C i = In C i + tr C i 1 T http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ4_HTML.gif
        (4)
        where
        C i = k = 1 N i T k / N i http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equa_HTML.gif
        is the mean coherency matrix of the i–th cluster, m is the number of clusters. The pixel belongs to the i–th cluster if
        d m T , C i < d m T , C j , j = 1 , , m , j i http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ5_HTML.gif
        (5)

        then the images can be classified by using equation (5) if the cluster center is given. However, the pixel based ML classification is easy to be affected by speckle noise. Variational segmentation models add another regularization term to overcome the impact of speckle noise.

        2.2. Scaled Wishart distribution based Potts model

        One of the widely used variational models for image segmentation is the Potts model [11] which was proposed by Potts in 1952. It can partition the continuous domain into disjoint subdomains by minimizing [8]:
        min Ω i i = 1 m E = i = 1 m Ω i f i x , y dxdy + λ i = 1 m Ω i s . t . i = 1 m Ω i = Ω , Ω k Ω l , k l http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ6_HTML.gif
        (6)

        where each f i (x, y) is defined on Ω and expresses the characteristic of the i–th subdomain, | ∂ Ω i | expresses the length of the boundaries of subdomains Ω i .

        Let function u i (x, y) ∈ [0, 1] denotes the indicator function of disjoint subdomains Ω i , i = 1 … m. The function f i (x, y) is defined as the distance between one PolSAR data sample T(x, y) and the mean coherency matrix of the i–th region C i :
        f i x , y = d T , C i = In C i + tr C i 1 T http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ7_HTML.gif
        (7)
        Then the scaled Wishart distribution based Potts energy functional can be written as follows:
        min u Δ + E u = i = 1 m Ω u i x , y f i x , y dxdy + λ i = 1 m Ω u i dxdy http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ8_HTML.gif
        (8)
        where
        Δ + = u i x , y | i = 1 m u i x , y = 1 ; u i x , y 0 , i = 1 m http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ9_HTML.gif
        (9)

        2.3. Energy minimization by using a dual method

        E. Bae et al. [8] proposed a dual method to minimize the Potts model. We adopt this method to minimize our scaled Wishart distribution based segmentation energy for the sake of computational efficiency.

        The minimization of the total variation (TV) term in (8) can be converted to a max problem [12, 13]:
        λ Ω u dxdy = max p C λ Ω u · p dxdy = max p C λ Ω udiv p dxdy http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ10_HTML.gif
        (10)
        where p is an auxiliary variable. The discrete divergence operator div : Y → X is defined by div = − ∇ * (∇ * is the adjoint operator of ∇). For every p ∈ Y and u ∈ X we have 〈  − divp, u X  = 〈 p, ∇ u Y . If Y and X be the same set, the second equal sign in formula (10) is established. In the rest of this paper, the variable u is called primal variable and p is called dual variables [8]. According to the max-min theorem in references [14] and the constraint of u i (x, y) in formula (9), equation (8) can be changed into the following format, i.e. the dual model:
        max p i C λ E p = Ω min f 1 x , y + div p 1 , , f m x , y + div p m dxdy http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ11_HTML.gif
        (11)

        where C λ  = {p : Ω → R2|‖p2 ≤ λ, pm| ∂ Ω = 0} and C λ is a convex set.

        As the dual model (11) is non-smooth and non-differentiable, the minimization is difficult. To deal with this problem, E. Bae et al. [8] proposed an smooth approximation model. This approximation is based on the observation that one could use a function g (u) to approximate an asymptotic function g via
        g = lim s 0 g s z : = sg s 1 z . http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equb_HTML.gif
        Therefore the dual model (11) can be approximated by:
        max p i C λ E s > 0 p = s Ω log i = 1 m exp f i div p i s dxdy http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ12_HTML.gif
        (12)

        The smooth Potts model (12) can be efficiently solved by a projected gradient algorithm. The basic idea of the projected gradient algorithm is that maximum the dual model (12) with respect to the variables p i , i = 1, …, m can be decomposed into two steps. At the first step, the variables p i , i = 1, …, m are updated by using the gradient-descend algorithm. Then they are projected into the domain C λ . This algorithm can be summarized as Algorithm 1 [8]:

        Algorithm 1:
        1. (1)
          Let arbitrary time step-size δ > 0, s > 0, k = 0,
          p i 0 = 0 http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equc_HTML.gif
          , i = 1, …, m, and get
          u i 0 http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equd_HTML.gif

          , i = 1, …, m from the automatic initialization method;

           
        2. (2)
          Compute C i on the basis of
          u i k http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Eque_HTML.gif

          , i = 1, …, m,

           
        3. (3)
          Compute
          f i = f i ( x , y ) = d ( T , C i ) = I n | C i | + t r ( C i - 1 T ) http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equf_HTML.gif
           
        4. (4)
          Update
          p i k + 1 http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equg_HTML.gif
          , = 1, …, m by
          p i k + 1 = Pr o j C λ p i k + δ u i k http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ13_HTML.gif
          (13)
           
        5. (5)
          Let k = k + 1, compute
          u i k = e f i div p i k s j = 1 m e f j div p j k s , i = 1 , , m http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ14_HTML.gif
          (14)
           
        6. (6)

          Repeat step (2)-(5) until some convergence criterion is satisfied;

           
        7. (7)
          Finally, u i , i = 1, …, m is recovered by
          u l = { 1 if l = arg min i = 1 , , m f i + div p i . 0 otherwise http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ15_HTML.gif
          (15)
           

        Because the energy incorporates the definition f i  = f i (x, y) = d(T, C i ), this algorithm is suitable for PolSAR image segmentation. However, this algorithm requires the initial value of u i , i = 1, …, m as input. Thus the initialization is a key issue for the segmentation. In the next section, an automatic initialization approach is introduced for initializing the segmentation process.

        3. Automatic initialization of the segmentation

        The initialization plays a crucial role in the segmentation of PolSAR images. As the number of clusters is an important parameter in segmentation [9], most segmentation methods about fully polarimetric SAR data use a predefined number of clusters. However, to determine the number of clusters by subjective observation is not suitable for processing huge amount of PolSAR data. In practice, it is preferred to determine the number of clusters automatically based on the property of fully polarimetric SAR data. There are several methods for adaptive clustering, which can select the optimal number of clusters [1517]. For PolSAR data, the H-α decomposition [10] based classification methods can partition the data into 8 clusters in an unsupervised manner. Although the classification result is rough due to the impact of speckle noise, it can still provide a good initialization of other sophistic classification methods. However, the number of clusters is fixed to 8, which is not always the truth for PolSAR images with various scenes. In the work of Cao et al. [9], the authors stated a method to get the appropriate number of clusters and the corresponding classification map. They use the SPAN/H/a/A initialization method to define the value of the M. In this paper, we just use the H/a initialization method to determine the value of M and adopt the similar method to define the number of the clusters. The experiment results demonstrate that this initialization method of M = 8can also get a good segmentation results. In the next parts, the H-α decomposition and automatic initialization method will be presented.

        3.1. Cloude-pottier decomposition

        The Cloude-Pottier decomposition is based on the eigenvalue analysis of the polarimetric coherence matrix T[10]. Due to the matrix T is a positive semi-definite Hermite matrix, T can be decomposed into the following format:
        T = U 3 λ 1 0 0 0 λ 2 0 0 0 λ 3 U 3 H http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ16_HTML.gif
        (16)
        where λ i , i = 1, 2, 3 are the eigenvalues of matrix T. The matrix U3 can be written as:
        U 3 = cos α 1 e i ϕ 1 cos α 2 e i ϕ 2 cos α 3 e i ϕ 3 sin α 1 cos β 1 e i δ 1 sin α 2 cos β 2 e i δ 2 sin α 3 cos β 3 e i δ 3 sin α 1 sin β 1 e i γ 1 sin α 2 sin β 2 e i γ 2 sin α 3 sin β 3 e i γ 3 http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ17_HTML.gif
        (17)

        where α i , i = 1, 2, 3 is the targets scattering type, β i , i = 1, 2, 3 is the targets azimuth angle, ϕ i , δ i , γ i , i = 1, 2, 3 are the targets phase angles.

        Equation (16) can be further decomposed into
        T = λ 1 e 1 e 1 * T + λ 2 e 2 e 2 * T + λ 3 e 3 e 3 * T http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ18_HTML.gif
        (18)

        where e i are eigenvectors of matrix T.

        The definition of the entropy H and angle a are given as follows:
        { H = i = 1 3 p i log 3 p i α = i = 1 3 p i α i p i = λ i / i = 1 3 λ i http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ19_HTML.gif
        (19)

        The entropy H characterizes the randomness of the target scattering. When H is low, the medium can be considered as weakly depolarizing, and a dominant scattering mechanism exists, which corresponds to the largest eigenvalue. When H is high, the situation will be opposite and full eigenvalue spectrum should be consider. Especially when H = 1, the scattering degrades to random noise and no information can be acquired by polarimetric observation.

        Angle α is a continuous parameter ranging from 00 to 900 which represents the average targets scattering mechanism. The definitions of α i , i = 1, 2, 3 are as formula (17). Specifically, when α = 00, the scattering mechanism can be considered as isotropic scattering. As α increases, the scattering mechanism will move from dipole scattering (α = 450) to double bounced scattering (α > 450), and finally reach to the dihedral mechanism (α = 900).

        3.2. Merge the similar clusters

        To estimate the appropriate number of clusters, the similar clusters should be merged to given the classification map with different number of clusters. To determine if two clusters should be merged, the following hypothesis is made:
        { H 0 : C i = C j H 1 : C i C j http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ20_HTML.gif
        (20)
        Under H0 hypothesis, it can be assumed that C i  = C j  = C On the basis of formula (3), the likelihood function is:
        L C | φ i φ j = k = 1 N i p T k ; C l = 1 N j p T l ; C http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ21_HTML.gif
        (21)
        Under H1 hypothesis, it is
        L C | φ i L C | φ j = k = 1 N i p T k ; C i l = 1 N j p T l ; C j http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ22_HTML.gif
        (22)
        Where Ci and Ci are the i–th andj–th cluster center coherency matrices respectively, N i and N i are the number of data within i-th and j–th cluster respectively, and i ≠ j. Let:
        C ~ i = 1 N i l = 1 N i T l , C ~ j = 1 N j l = 1 N j T l , C ~ = 1 N i + N j l = 1 N i + N j T l http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ23_HTML.gif
        (23)
        then the likelihood-ratio can be expressed as:
        Λ ij = L C | φ i φ j L C | φ i L C | φ j http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ24_HTML.gif
        (24)
        Taking the logarithm of formula (24), and ignoring the constant terms, the distance measure D m (C i , C j ) between Ci and C i at the m–th iteration can be given by
        D m C i , C j = 1 n I n Λ ij = N i + N j I n C ~ N i I n C ~ i N j I n C ~ j http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ25_HTML.gif
        (25)

        Then the two clusters with the minimum distance D m (C i , C j ) can be merged. Perform the cluster merging procedure recursively until the number of clusters is equal to the permitting minimal number of clusters.

        3.3. Estimating the number of clusters

        With the classification result of different number of clusters, the optimal number of clusters can be selected as following. Let m be the current number of clusters. Giving a cluster φ i and the corresponding cluster center C i , in accordance with formula (3), the probability density function of T can be written as
        p T ; φ i = n qn T n q exp tr n C i 1 T K n , q C i n http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ26_HTML.gif
        (26)
        For m clusters, the mixture probability density function is:
        p T ; Φ m = i = 1 m p i p T ; φ i http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ27_HTML.gif
        (27)

        where p(i) = N i /N,N i is the number of data within cluster φ i ,N is the number of the whole data.

        Denote X = {T1, …, T N } the whole set of sample coherency matrices, the m–th data log-likelihood can be given by:
        L m X = In l = 1 N p T l ; Φ m http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ28_HTML.gif
        (28)
        By using the equations (26), (27) and (28) and omit the constant terms, the log-likelihood becomes:
        L m X = l = 1 N In i = 1 m p i exp n · d T l , C i http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ29_HTML.gif
        (29)
        The value of L m (X) is depend on m only, and L m (X) is a non-decreasing function about m. As a result the number of clusters cannot be estimated by L m (X) However, the change in the value of L m (X) provides useful information for determine the number of clusters. The change of the data log-likelihood can be measured by:
        D m X = L m + 1 X L m X http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ30_HTML.gif
        (30)
        Then, the optimum clusters can be decided by using the following expression:
        m opt = min m | D m X ε , m = 1 , , M 1 http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Equ31_HTML.gif
        (31)

        Where ε is a small threshold. In the work of Cao et al. [9], ε is determined in an automatic way. Here, the value of ε is set in an experiential way, but it can still lead to a reasonable result. Then the appropriate number of clusters is obtained with the minimum D m (X).

        In this paper, the value of M is 8 as the Ha classification is used. The classification map corresponding to the optimal number of clusters can be also obtained. Then they are feed into the variational segmentation block, which is taken as the initializing condition for the iteration minimization process. The whole process of the proposed PolSAR segmentation process is demonstrated in Figure 1.
        http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Fig1_HTML.jpg
        Figure 1

        The flow chart of the algorithm.

        4. Experimental results

        Real PolSAR datas are taken to test the proposed approach. We take the AIRSAR data and UAVSAR data as examples to verify the effectiveness of our method. These data sets are part of real fully PolSAR data sets that collected by the AIRSAR and UAVSAR respectively. The types of both datas are multi-look, and the sizes are 400 × 600 for the two data sets. We don’t use the speckle filter to preprocess them. For the two data sets, we set the threshold as ε = 1e − 10. When the number has been determined, the automatic initialization can be obtained on the basis of the Section 3. Moreover, the results validate the effectiveness of the automatic initialization approach.

        4.1. Segmentation results of AIRSAR data

        For the AIRSAR data (Flevoland area), the D m (X) is drawn in Figure 2(a). The chart shows that the optimal number of clusters is seven. Figure 3 presents the segmentation results of Flevoland area. The power image and the Wishart–H–a classification result are put in Figure 3(a) and in Figure 3(b) respectively, to make us compare conveniently. In Figure 3(c), one primal variable is set as the background, that is the black cluster. The other 6 primal variables are random circles with other six colors. Figure 3(d) is the corresponding segmentation result, which is rough due to the unreasonable initialized cluster centers. In Figure 3(d), the orange cluster and green cluster occupy the most areas of the image, some other colors have embedded in the orange cluster and some areas have been mixed with several colors. Thus, the segmentation result in Figure 3(d) shows that this initializing method could not get a reasonable result. In Figure 3(e), 6 primal variables are initialized by manual quadrangles and the last one is initialized as the black background. The result is shown in Figure 3(f). In Figure 3(f), the white cluster has some pixels that belong to the light green cluster, and some clusters do not have smooth edges. Even though it is realizable to segment the PolSAR data into seven clusters in a general way, the manual quadrangles contain the artificial prior knowledge which is assumed by people. The automatic initialization based on the scaled Wishart distribution and H–a decomposition is in Figure 3(g), and Figure 3(h) is the corresponding result. The proposed approach unites scattering characteristic with statistical characteristic, resulting in a better segmentation result when there is no a priori knowledge. Clusters are well separated in Figure 3(h) with little cluster mixing phenomenon. The edges are also smooth.
        http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Fig2_HTML.jpg
        Figure 2

        D m ( X ) of PolSAR data (a) AIRSAR data, (b) the UAVSAR data.

        http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Fig3_HTML.jpg
        Figure 3

        Segmentation result on an AIRSAR image (a) the power image, (b) the Wishart-H-a classification, (c) the random initialization, (d) segmentation result corresponding to (c), (e) initialization by manual quadrangles, (f) segmentation result corresponding to (e), (g) the automatic initialization, (h) segmentation result of our approach.

        4.2. Segmentation results of UAVSAR data

        For the UAVSAR data, from the colored span image that shown in Figure 4(a), it can be observe that this scene is covered by 5 or 6 terrain types. In Figure 2(b), the value of D m (X) with different number of clusters is shown. We can determine the optimal number of clusters is 6 on the basis of the automatic initialization procedure. It is expected to segment this data into 6 clusters, i.e. the white forest, green forest, dark green fields, light green fields, dark red-brown fields, and blue fields. The segmentation results of the proposed method and several other PolSAR image segmentation methods are given in Figure 4. In Figure 4(b), the segmentation result of the Wishart−H–a method is presented. The impact of speckle noise can be clearly observed. Many pixels in the cluster of green forest are misclassified. The segmentation result obtained by using the variational model with various initialization conditions are also given in Figure 4(c)-(h). The initialization in Figure 4(c) of primal variables is set to be some circles, which leads that the cluster center coherency matrices are set unreasonable. It can be observed that the segmentation result is poor, as the Figure 4(d) explains. There are some clusters have been mixed, like the black cluster and white cluster. We can’t distinguish the white forest from the green forest. In Figure 4(e), the initialization of primal variable is set artificially as some irregular polygons, the corresponding result is given in Figure 4(f). Compared to the result in Figure 4(d), the segmentation is smoother because the cluster center coherency matrices are set artificially in a supervised way. All 6 clusters are well distinguished. But the segmentation result shows that some part of the dark green fields has been divided into the blue fields or the light green fields. The comparison of Figure 4(d) and Figure 4(f) clearly show the effect of the initial conditions on the final segmentation result. So a reasonable initialization is in need. The automatic initialization on the basis of H–a decomposition is as Figure 4(g). The initial value of M is 8. According to the formula (31) and the estimated number of m, the minimum D m (C i , C j ) should be merged until m = 6. The segmentation result is in Figure 4(h), which is close to the result in Figure 4(f). This demonstrated the effectiveness of the proposed automatic initialized variational segmentation approach. Moreover, in clusters which have complex scattering mechanism the power image, the segmentation result of the proposed approach can discriminative different scattering mechanisms better than the result in Figure 4(f).
        http://static-content.springer.com/image/art%3A10.1186%2F1687-1499-2013-34/MediaObjects/13638_2012_Article_641_Fig4_HTML.jpg
        Figure 4

        Segmentation result on a UAVSAR image (a) the power image, (b) the Wishart-H-a classification, (c) the random initialization, (d) segmentation result corresponding to (c), (e) initialization by manual quadrangles, (f) segmentation result corresponding to (e), (g) the automatic initialization, (h) segmentation result of our approach.

        These results show that the proposed approach is more convictive than the traditional variational segmentation and Wishart–H–a classification approach for segmentations of PolSAR images in a completely unsupervised way.

        5. Conclusion

        This paper proposed a novel dual model and an automatic initialization approach for the PolSAR image segmentation problems. Since we employ the projected gradient algorithm to segment images, we could get the segmentation results of PolSAR images in a short time. Besides, the results of random initialization and manual quadrangles initialization declare that inappropriate initializations would generate unsatisfactory segmentation results. The automatic initialization includes scaled Wishart distribution and Ha decomposition, which combine scattering characteristic with statistical characteristic, giving rise to a better segmentation result. The traditional method don’t use the scattering characteristic, the results in Section 4 show that our automatic algorithm outperforms the general initialization under the condition of unsupervised.

        Declarations

        Funding

        This work is supported by the Fundamental Research Funds for the Central Universities under Projects ZYGX2009Z005 and the National Natural Science Foundation of China under Projects 61271287.

        Authors’ Affiliations

        (1)
        School of Electronic Engineering, University of Electronic Science and Technology of China

        References

        1. Lee JS, Grunes MR, Mango SA: Speckle reduction in multi-frequency and multi-polrizationsarimagery. IEEE Trans. Geosci. Remote Sens. 1997, 29: 534-544.
        2. Xiao J, Li J, Moody A: A detail-preserving and flexible adaptive filter for speckle suppression in SAR imagery. Int. J. Remote Sens. 2003, 24: 2451-2465. 10.1080/01431160210154885View Article
        3. Mingolla E: A neural network for enhancing boundaries and surface synthetic aperture radar images. Neural Networks 1999, 12(3):499-511. 10.1016/S0893-6080(98)00144-0View Article
        4. Kass M, Witkin A, Terzopoulos D: Snakes: Active contour models. Int. J. Comput. Vis. 1987, 4(1):321-331.
        5. Osher S, Sethian J: Fronts propagating with curvature dependent speed: algorithms based on the hamilton-jacbion formulation. Journal of Computational Physics 1988, 79(1):12-49. 10.1016/0021-9991(88)90002-2MathSciNetView Article
        6. Ayed IB, Mitiche A, Belhadj Z: Multiregion level-set partitioning of synthetic aperture radar images. IEEE Trans. Pattern Analysis and Machine Intelligence 2005, 27: 793-800.View Article
        7. Ayed B, Mitiche A, Belhadj Z: Polarimetric image segmentation via maximum- likelihood approximationand efficient multiphase level-sets. IEEE Trans. Pattern Analysis and Machine Intelligence 2006, 28: 1493-1500.View Article
        8. Bae E, Yuan J, Tai XC: Global minimization for continuous multiphase partitioning problems usingdual approach. Int. J. Comput Vis. 2011, 92(1):112-129. 10.1007/s11263-010-0406-yMathSciNetView Article
        9. Cao F, Hong W, Wu Y, Pottier E: An unsupervised segmentation with an adaptive number of clusters using the span/h/ α /a space and the complex wishart clustering for fully polarimetric sar data analysis. IEEE Trans. Geosci. Remote Sens. 2007, 45: 3454-3467.View Article
        10. Cloude SR, Pottier E: An entropy based classication scheme for land applications of polarimetric SAR. IEEE Trans. Geosci. Remote Sens. 1997, 35(1):68-78. 10.1109/36.551935View Article
        11. Potts RB: Some generalized order–disorder transformations. Proceedings of the Cambridge PhilosophicalSociety 1952, 48: 106-109. 10.1017/S0305004100027419MathSciNetView Article
        12. Chambolle A: An algorithm for total variation minimization and applications. Journal of MathematicalImaging and Vision 2004, 20(1–2):89-97.MathSciNet
        13. Meyer Y: Oscillating Patterns in Image Processing and Nonlinear Evolution Equations. Boston, MA, USA: American Mathematical Society: The Fifteenth Dean Jacqueline B. Lewis Memorial Lectures; 2001.View Article
        14. Ekeland I, Teman R: Convex Analysis and Variational Problems. Society for Industrial and Applied Mathematics Philadelphia: PA. USA; 1999.View Article
        15. Lehsaini M, Guyennet H, Feham M: An efficient cluster-based self-organisation algorithm for wireless sensor networks. International Journal of Sensor Networks 2010, 7(1–2):85-94.View Article
        16. Raghuvanshi AS, Tiwari S, Tripathi R, Kishor N: Optimal number of clusters in wireless sensor networks: a FCM approach. International Journal of Sensor Networks 2012, 12(1):16-24. 10.1504/IJSNET.2012.047707View Article
        17. Singh B, Lobiyal DK: An energy-efficient adaptive clustering algorithm with load balancing for wireless sensor network. International Journal of Sensor Networks 2012, 12(1):37-52. 10.1504/IJSNET.2012.047714View Article

        Copyright

        © Cao et al.; licensee Springer. 2013

        This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://​creativecommons.​org/​licenses/​by/​2.​0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.