The distribution of SAR image Test for Equality of Two Complex Wishart Matrices KI

2. METHOD

2.1 The distribution of SAR image

A p-dimensional random complex vector Z satisfies with a complex multivariate normal distribution as follow:   1 [Z .... Z ] 0, p c Z N    1 And its frequency function presents:     1 1 exp [ ] T p f z tr zz        2 Where  denotes the determinant; tr denotes the trace of a matrix; and T  denotes complex conjugation  and transpose T . And a Hermitian positive definite random pp matrix X satisfies with a complex Wishart distribution as follow:   , n, c X W p   3 And its frequency function presents:   1 1 1 exp n p n p w x x tr w n            4 Where: 1 2 1 1 p p p p j n n j          5 The w is positive definite. And if X and Y follow the complex Wishart distribution and are independent, their sum follows complex Wishart distribution. , , c S X Y W p n m      6

2.2 Test for Equality of Two Complex Wishart Matrices

In process of change detection, we always distinguish the image in changed part and un-changed part based on similarity of multi-temporal data, and using the assumption of null hypothesis and alternative hypothesis replaces the un-change and change. We consider the null hypothesis : x y H    means that two matrices are equal and deem that is un-change. We consider the alternative hypothesis 1 : x y H    means that two matrices are difference and deem that is change. The likelihood ratio presents as follow, L Q L L x y x y     7 Here:   1 1 exp n n p x x p L X X ntrI n n       8 Putting the formula 8 into formula 7, the desired likelihood- ratio test statistic presents as follow: + n m p n m n m pn pm X Y n m Q n m X Y     9 The typically case for change detection is n m  , we get 2 ln Q   as follow: 2 ln 2 2 ln 2 ln +ln 2ln Q n p X Y X Y         10 Here: 2 2 1 1 1 1 1 6 p p n m n m        11 The formula 10 uses to generate the similarity measure based on multi-temporal SAR images.

2.3 KI

From the result of test-statistic, we obtain the single image of similarity measure. We assume that grey level values of an image are g from the interval of 0~n. And each of the two components | p g i of the changed and unchanged pixels follow generalized Gaussian distribution GGD with mean i  , standard deviation i  and prior probability i p as follows: b i g a p T h g    12 g b i i g a T h g p T     13 2 2 { } b i i i g a T g u T h g p T      14 Where, 0, 1 1,i 2 i a T        15 , 1 ,i 2 T i b n       16 Using the model of | , h g i T , the conditional probability , e g T can be replaced as follow: , | , i e g T h g i T p T h g  17 As h g is independent of both i and T, we can represents , g T  as follow, , 2 log , g T e g T    18 1, 2, g T i g T       19 Which can be considered as an alternative index of correct classification performance. The average performance figure of the whole image can be characterized by the criterion function , g J T h g g T    20 The role of this criterion function in finding the approximate minimum error threshold is subtle and the formula shows as follow, min T J r J T  21 The criterion J T can be expressed as follow: 1 1 2 2 1 1 2 2 1 2[ log log ] 2[ log log ] J T p T T p T T p T p T p T p T        22

2.4 The flow of algorithm