# High-Resolution Algorithm for Image Segmentation in the Presence of Correlated Noise

Authors: Haiping Jiang; Salah Bourennane; Caroline Fossati
Journal: Journal of Electrical and Computer Engineering
 (2010)

---

## Abstract

Multiple line characterization is a most common issue in image processing. A specific formalism turns the contour detection issue of image processing into a source localization issue of array processing. However, the existing methods do not address correlated noise. As a result, the detection performance is degraded. In this paper, we propose to improve the subspace-based high-resolution methods by computing the fourth-order slice cumulant matrix of the received signals instead of second-order statistics, and we estimate contour parameters out of images impaired with correlated Gaussian noise. Simulation results are presented and show that the proposed methods improve line characterization performance compared to second-order statistics.


---

## Body

## 1. Introduction

It has been shown that a specific signal generation process yields, when applied to an image containing multiple lines, to signals which follow an array processing model. Then high-resolution methods, such as MUSIC [1] and ESPRIT [2] algorithms, are used. Subspace-based Line DEtection (SLIDE) algorithm [3] and recently other methods [4] have been proposed, which can be effectively exploited to estimate line parameters (orientation and offset).However, these methods assume that the noise is white and are based exclusively on second-order statistics. When the noise is correlated, these developed algorithms are not efficient.That is the fact that correlated noise exists in several circumstances. For instance, correlated noise occurs in many imaging systems such as scanners and push-broom imagers. In medical X-ray imaging, while noise in an X-ray beam is uncorrelated, it is correlated in observed images. This is due to the detectors, where X-ray photons typically evoke multiple light photons that can contribute to different pixels.In Section2, we first model the image data and formulate the problem by introducing cumulant-based model. In Section 3, high-resolution algorithms for estimating line orientation, which are MUSIC-like algorithm and improved TLS-ESPRIT algorithm, are derived from fourth-order cumulant of the signal realizations received by virtual array sensors. After orientation estimation, the extension of Hough transform is applied to find a line offset. In Section 4, numerical simulations are presented to show that cumulant-based methods are efficient when the processed image is impaired by correlated noise.


## 2. Problem Formulation

### 2.1. Image Data Model

Let us consider 2-dimensional binary imageI(x,y) (see Figure 1), where a line is characterized by its x-axis offset and the angle that it makes with the normal to the x-axis at the interception point, with positive angles defined for lines having positive y-axis offsets. The “1”-valued pixels represent useful pixels and form the outline of the estimated contour, while the background is demonstrated by “0”-valued pixels. The image consists of N rows and C columns in Figure 1. In order to make the image data representation similar to sensor array processing, array sensors are supposed to be placed aside the image, each sensor receiving signals only from its corresponding row in the matrix [3]. All the pixels in image are assumed to propagate narrowband electromagnetic waves with zero initial phases. Furthermore, assume that the waves emanating from pixels in a given row of the image matrix are confined to travel only along that row towards the corresponding sensor. In this propagation environment, each straight line in the image will in effect be equivalent to a wavefront of a traveling plane wave. For this purpose some signals are generated out of the image data. When there is only one line in image and no outlier pixels, the signal received by each sensor is: ri=e-jμxi(i=1,…,N), where μ is a propagation parameter [3] and xi is the x-axis offset in ith row, xi=x0-(i-1)tan(θ).image data model.
(a)(b)If there ared straight lines and also outlier pixels in image, the signal received by each sensor can be extended
(1)ri=∑k=1de-jμxik=∑k=1de-jμx0kejμ(i-1)tan(θk)+n(i),
where n(i) is the effect of noise in the ith row. We denote a(θk)=ejμ(i-1)tan(θk) and sk=e-jμx0k, at the same time, consider that the image is impaired by the noise, we can be express all the signals in matrix form(2)r=A(θ)·s+N,
where r=[r1,r2,…,rN]T, s=[s1,s2,…,sd]T, and A(θ)=[a(θ1),a(θ2),…,a(θd)] with kth column a(θk)=[1,ejμtan(θk),…,ejμ(N-1)tan(θk)]T, therein “T” denotes transposition operation.


### 2.2. Fourth-Order Cumulant-Based Model

For complex variable, the fourth-order cumulant can be generally defined as(3)cum4(x1,x2,x3*,x4*)=E{x1x2x3*x4*}-E{x1x3*}E{x2x4*}-E{x1x4*}E{x2x3*}-E{x1x2}E{x3*x4*},
where “*” denotes conjugate operation. Quite often the complex random variables are analytical signal, so the fourth item of the right side is identically zero. Note that the definition of cumulant of complex random variables is nonunique. In practical terms, continuous signals are often turned into discrete time-series to calculate fourth-order cumulant.Providing that there is only one source signalsi(p), that is, only one line in image data, the signals received by array sensors is defined as ri(p). So for all the source signals, the received signals at the pth snapshot are r=∑i=1dri(p)=∑i=1da(θi)·si(p), where si(p)=ej(p-1)μtanθi·e-jμx0i(p=1,…,d) is the ith source signal at pth snapshot.We define the vectoryi(p) by
(4)yi(p)=ri(p)⊗riH(p)=(a(θi)⊗a*(θi))·si(p)si*(p),
where “⊗” denotes Kronecker product. Based on the independence property of cumulant and that the fourth-order cumulants of the Gaussian noise are identically zero [5, 6], we can get the following fourth-order cumulant of image data after some calculations:(5)Crr,4=∑i=1d(a(θi)⊗a*(θi))·cum4(si(p),si(p),si*(p),si*(p))·(a(θi)⊗a*(θi))H.To make the analogy of the formulation as sensor array processing, we do not have time-dependent measurement signal vectors, because the signals generated by image data is deterministic. There is only a single snapshot across a very large array (see (2)). Therefore, to exploit high-resolution methods with fourth-order cumulant in array processing to image signals, the signals received by array sensors in image model are considered to be spatially smoothed and a new matrix RP is rearranged as(6)RP=[r(1)r(2)⋯r(P)]=[z1⋮zM]=[r1r2⋯rN-M+1⋮⋮⋱⋮rMrM+1⋯rN],
where M=N-P+1 and d<M≤N-d+1. For every snapshot, r(p)=A(θ)s(p)+n(p)(p=1,…,P), where A(θ) is M×d matrix and n(p) is the noise vector acquired by the same rearrangement of the snapshot vectors. Then, all the signals generated by image data can be written in matrix form
(7)RP=A(θ)SP+NP,
where SP=[s(1),…,s(P)] and NP=[n(1),…,n(P)]. In this way, a single snapshot across a very large array in (2) is transformed to P snapshots. Now we are ready to get the similar signal as in sensor array processing.


## 2.1. Image Data Model

Let us consider 2-dimensional binary imageI(x,y) (see Figure 1), where a line is characterized by its x-axis offset and the angle that it makes with the normal to the x-axis at the interception point, with positive angles defined for lines having positive y-axis offsets. The “1”-valued pixels represent useful pixels and form the outline of the estimated contour, while the background is demonstrated by “0”-valued pixels. The image consists of N rows and C columns in Figure 1. In order to make the image data representation similar to sensor array processing, array sensors are supposed to be placed aside the image, each sensor receiving signals only from its corresponding row in the matrix [3]. All the pixels in image are assumed to propagate narrowband electromagnetic waves with zero initial phases. Furthermore, assume that the waves emanating from pixels in a given row of the image matrix are confined to travel only along that row towards the corresponding sensor. In this propagation environment, each straight line in the image will in effect be equivalent to a wavefront of a traveling plane wave. For this purpose some signals are generated out of the image data. When there is only one line in image and no outlier pixels, the signal received by each sensor is: ri=e-jμxi(i=1,…,N), where μ is a propagation parameter [3] and xi is the x-axis offset in ith row, xi=x0-(i-1)tan(θ).image data model.
(a)(b)If there ared straight lines and also outlier pixels in image, the signal received by each sensor can be extended
(1)ri=∑k=1de-jμxik=∑k=1de-jμx0kejμ(i-1)tan(θk)+n(i),
where n(i) is the effect of noise in the ith row. We denote a(θk)=ejμ(i-1)tan(θk) and sk=e-jμx0k, at the same time, consider that the image is impaired by the noise, we can be express all the signals in matrix form(2)r=A(θ)·s+N,
where r=[r1,r2,…,rN]T, s=[s1,s2,…,sd]T, and A(θ)=[a(θ1),a(θ2),…,a(θd)] with kth column a(θk)=[1,ejμtan(θk),…,ejμ(N-1)tan(θk)]T, therein “T” denotes transposition operation.


## 2.2. Fourth-Order Cumulant-Based Model

For complex variable, the fourth-order cumulant can be generally defined as(3)cum4(x1,x2,x3*,x4*)=E{x1x2x3*x4*}-E{x1x3*}E{x2x4*}-E{x1x4*}E{x2x3*}-E{x1x2}E{x3*x4*},
where “*” denotes conjugate operation. Quite often the complex random variables are analytical signal, so the fourth item of the right side is identically zero. Note that the definition of cumulant of complex random variables is nonunique. In practical terms, continuous signals are often turned into discrete time-series to calculate fourth-order cumulant.Providing that there is only one source signalsi(p), that is, only one line in image data, the signals received by array sensors is defined as ri(p). So for all the source signals, the received signals at the pth snapshot are r=∑i=1dri(p)=∑i=1da(θi)·si(p), where si(p)=ej(p-1)μtanθi·e-jμx0i(p=1,…,d) is the ith source signal at pth snapshot.We define the vectoryi(p) by
(4)yi(p)=ri(p)⊗riH(p)=(a(θi)⊗a*(θi))·si(p)si*(p),
where “⊗” denotes Kronecker product. Based on the independence property of cumulant and that the fourth-order cumulants of the Gaussian noise are identically zero [5, 6], we can get the following fourth-order cumulant of image data after some calculations:(5)Crr,4=∑i=1d(a(θi)⊗a*(θi))·cum4(si(p),si(p),si*(p),si*(p))·(a(θi)⊗a*(θi))H.To make the analogy of the formulation as sensor array processing, we do not have time-dependent measurement signal vectors, because the signals generated by image data is deterministic. There is only a single snapshot across a very large array (see (2)). Therefore, to exploit high-resolution methods with fourth-order cumulant in array processing to image signals, the signals received by array sensors in image model are considered to be spatially smoothed and a new matrix RP is rearranged as(6)RP=[r(1)r(2)⋯r(P)]=[z1⋮zM]=[r1r2⋯rN-M+1⋮⋮⋱⋮rMrM+1⋯rN],
where M=N-P+1 and d<M≤N-d+1. For every snapshot, r(p)=A(θ)s(p)+n(p)(p=1,…,P), where A(θ) is M×d matrix and n(p) is the noise vector acquired by the same rearrangement of the snapshot vectors. Then, all the signals generated by image data can be written in matrix form
(7)RP=A(θ)SP+NP,
where SP=[s(1),…,s(P)] and NP=[n(1),…,n(P)]. In this way, a single snapshot across a very large array in (2) is transformed to P snapshots. Now we are ready to get the similar signal as in sensor array processing.


## 3. Detection Algorithms

### 3.1. Angle Estimation

#### 3.1.1. MUSIC-Like Algorithm

In order to reduce the computational load, a slice cumulant matrix (e.g.,Crr,4′, here the first row of Crr,4), instead of above-mentioned cumulant (see (5)), and offers the same properties [5]
(8)Crr,4′={cum4(z1(p),zi(p),z1*(p),zj*(p))},=A(θ)·Γ·AH(θ),i=1,…,M;j=1,…,M;p=1,…,P.
where zi(p) is the signal received by ith senor at pth snapshot, and  Γ=diag(cum4(s1(p),s1*(p), s1(p),s1*(p)),…,cum4(sd(p), sd*(p),sd(p),sd*(p))), the diagonal elements of which are the kurtosis. Equation  (8) shows that there is no noise term in the cumulant slice matrix computed out of the generated signals. Therefore, when this matrix is computed, the parameters can be better estimated. Obviously, this reshaped matrix is the Hermitian matrix and its dimension is reduced to M×M from M2×M2, so the computational load is hugely decreased.From the definition of matrixA(θ) (see (2)), which shows that the columns of A(θ) are linearly independent, it is easy to get that Crr,4′ has the rank of d. The MUSIC-like algorithm relies on the singular value decomposition (SVD) of matrix Crr,4′:(9)Crr,4′=[U1U2][Λ000][U1HU2H].For the independent sources, the columns ofU1(M×d) span the signal subspace, and the columns ofU2(M×(M-d)) span the noise subspace [1], Λ=diag(λ1,λ2,…,λd), where λi is the eigenvalue associating with the ith eigenvector. Hence, U2 is orthogonal to the steering vector of A(θ). The pseudo spectrum of the MUSIC method is given by(10)MUSIC(θk)=1∥aH(θk)·U2∥2.In conclusion, practical application of the algorithm involves the following steps.(1)
Estimate the cumulant matrix by (5), (6), and (8).(2)
Find the eigendecomposition of the cumulant matrix by 8 and get the noise subspaceU2. If the number of line is unknown, the Minimum Description Length (MDL) or Akaike Information Criterion (AIC) [7] criterion are used.(3)
ComputeMUSIC(θk) by  (10). The straight line orientations are estimated through the research of the maxima of MUSIC(θk).


#### 3.1.2. Improved TLS-ESPRIT Algorithm

In this subsection, we define a matrix for implementing SVD operation, which is more appropriate to the improved TLS-ESPRIT algorithm and is different from the fourth-order cumulant matrix in MUSIC-like algorithm(11)Crr,4′′={cum4(zi(p),zi(p),zi*(p),zj*(p))},i=1,…,N;j=1,…,N;p=1,…,P.After spatial smoothing procedure is applied to image data as in (6), the multiple snapshots obtained have length M, and Crr,4′′ is also M×M dimensional matrix.In order to follow the key steps of TLS-ESPRIT algorithm, we firstly derive the following four(M-1)×(M-1) submatrices from (11):(12)C11={cum4(zi,zi,zi*,zj*)},i=1,…,M-1;j=1,…,M-1,C12={cum4(zi,zi,zi*,zj*)},i=1,…,M-1;j=2,…,M,C21={cum4(zi,zi,zi*,zj*)},i=2,…,M;j=1,…,M-1,C22={cum4(zi,zi,zi*,zj*)},i=2,…,M;j=2,…,M.
Then, the following matrix can be used to implement SVD operation in place of the covariance matrix:(13)C=[C11C12C21C22].The overall improved TLS-ESPRIT algorithm-based cumulant can be summarized as follows.(1)
Form the matrixCrr,4′′ by (5), (6), and (11).(2)
Generate four submatrices from (12) and reconstruct the matrix C by (13);(3)
Perform SVD operation withC(14)C=EΛEH,
where Λ=diag(λ1,…,λ2(M-1)) with the eigenvalues λ1≥λ2≥⋯≥λd≥⋯λ2(M-1) and λ1,λ2,…,λd corresponding to the signal subspace. Depending on the known conditions, AIC or MDL criterion is used.(4)
LetE1 be the 2(M-1)×d upper-left matrix of E and let E2 be 2(M-1)×d matrix formed by deleting the first row of matrix E. We carry out the eigen-decomposition
(15)[E1HE2H][E1E2]=FΛFFHF=[F11F12F21F22].(5)
Extract the submatricesF12 and F22, then find the eigenvalues {γk} of -F12F22-1.(6)
Estimate every line's orientation byθk=tan-1(1μIm(lnγk|γk|)E1HE2H)E1HE2H,k=1,…,d.


### 3.2. Offset Detection

After we estimate the line's angles, steering matrixA(θ) can be computed by (2), so that the maximum likelihood function or other similar methods can be used to find the offsets of  lines. In practice, we estimate the offsets using the "Extension of the Hough Transform" [8].


## 3.1. Angle Estimation

### 3.1.1. MUSIC-Like Algorithm

In order to reduce the computational load, a slice cumulant matrix (e.g.,Crr,4′, here the first row of Crr,4), instead of above-mentioned cumulant (see (5)), and offers the same properties [5]
(8)Crr,4′={cum4(z1(p),zi(p),z1*(p),zj*(p))},=A(θ)·Γ·AH(θ),i=1,…,M;j=1,…,M;p=1,…,P.
where zi(p) is the signal received by ith senor at pth snapshot, and  Γ=diag(cum4(s1(p),s1*(p), s1(p),s1*(p)),…,cum4(sd(p), sd*(p),sd(p),sd*(p))), the diagonal elements of which are the kurtosis. Equation  (8) shows that there is no noise term in the cumulant slice matrix computed out of the generated signals. Therefore, when this matrix is computed, the parameters can be better estimated. Obviously, this reshaped matrix is the Hermitian matrix and its dimension is reduced to M×M from M2×M2, so the computational load is hugely decreased.From the definition of matrixA(θ) (see (2)), which shows that the columns of A(θ) are linearly independent, it is easy to get that Crr,4′ has the rank of d. The MUSIC-like algorithm relies on the singular value decomposition (SVD) of matrix Crr,4′:(9)Crr,4′=[U1U2][Λ000][U1HU2H].For the independent sources, the columns ofU1(M×d) span the signal subspace, and the columns ofU2(M×(M-d)) span the noise subspace [1], Λ=diag(λ1,λ2,…,λd), where λi is the eigenvalue associating with the ith eigenvector. Hence, U2 is orthogonal to the steering vector of A(θ). The pseudo spectrum of the MUSIC method is given by(10)MUSIC(θk)=1∥aH(θk)·U2∥2.In conclusion, practical application of the algorithm involves the following steps.(1)
Estimate the cumulant matrix by (5), (6), and (8).(2)
Find the eigendecomposition of the cumulant matrix by 8 and get the noise subspaceU2. If the number of line is unknown, the Minimum Description Length (MDL) or Akaike Information Criterion (AIC) [7] criterion are used.(3)
ComputeMUSIC(θk) by  (10). The straight line orientations are estimated through the research of the maxima of MUSIC(θk).


### 3.1.2. Improved TLS-ESPRIT Algorithm

In this subsection, we define a matrix for implementing SVD operation, which is more appropriate to the improved TLS-ESPRIT algorithm and is different from the fourth-order cumulant matrix in MUSIC-like algorithm(11)Crr,4′′={cum4(zi(p),zi(p),zi*(p),zj*(p))},i=1,…,N;j=1,…,N;p=1,…,P.After spatial smoothing procedure is applied to image data as in (6), the multiple snapshots obtained have length M, and Crr,4′′ is also M×M dimensional matrix.In order to follow the key steps of TLS-ESPRIT algorithm, we firstly derive the following four(M-1)×(M-1) submatrices from (11):(12)C11={cum4(zi,zi,zi*,zj*)},i=1,…,M-1;j=1,…,M-1,C12={cum4(zi,zi,zi*,zj*)},i=1,…,M-1;j=2,…,M,C21={cum4(zi,zi,zi*,zj*)},i=2,…,M;j=1,…,M-1,C22={cum4(zi,zi,zi*,zj*)},i=2,…,M;j=2,…,M.
Then, the following matrix can be used to implement SVD operation in place of the covariance matrix:(13)C=[C11C12C21C22].The overall improved TLS-ESPRIT algorithm-based cumulant can be summarized as follows.(1)
Form the matrixCrr,4′′ by (5), (6), and (11).(2)
Generate four submatrices from (12) and reconstruct the matrix C by (13);(3)
Perform SVD operation withC(14)C=EΛEH,
where Λ=diag(λ1,…,λ2(M-1)) with the eigenvalues λ1≥λ2≥⋯≥λd≥⋯λ2(M-1) and λ1,λ2,…,λd corresponding to the signal subspace. Depending on the known conditions, AIC or MDL criterion is used.(4)
LetE1 be the 2(M-1)×d upper-left matrix of E and let E2 be 2(M-1)×d matrix formed by deleting the first row of matrix E. We carry out the eigen-decomposition
(15)[E1HE2H][E1E2]=FΛFFHF=[F11F12F21F22].(5)
Extract the submatricesF12 and F22, then find the eigenvalues {γk} of -F12F22-1.(6)
Estimate every line's orientation byθk=tan-1(1μIm(lnγk|γk|)E1HE2H)E1HE2H,k=1,…,d.


## 3.1.1. MUSIC-Like Algorithm

In order to reduce the computational load, a slice cumulant matrix (e.g.,Crr,4′, here the first row of Crr,4), instead of above-mentioned cumulant (see (5)), and offers the same properties [5]
(8)Crr,4′={cum4(z1(p),zi(p),z1*(p),zj*(p))},=A(θ)·Γ·AH(θ),i=1,…,M;j=1,…,M;p=1,…,P.
where zi(p) is the signal received by ith senor at pth snapshot, and  Γ=diag(cum4(s1(p),s1*(p), s1(p),s1*(p)),…,cum4(sd(p), sd*(p),sd(p),sd*(p))), the diagonal elements of which are the kurtosis. Equation  (8) shows that there is no noise term in the cumulant slice matrix computed out of the generated signals. Therefore, when this matrix is computed, the parameters can be better estimated. Obviously, this reshaped matrix is the Hermitian matrix and its dimension is reduced to M×M from M2×M2, so the computational load is hugely decreased.From the definition of matrixA(θ) (see (2)), which shows that the columns of A(θ) are linearly independent, it is easy to get that Crr,4′ has the rank of d. The MUSIC-like algorithm relies on the singular value decomposition (SVD) of matrix Crr,4′:(9)Crr,4′=[U1U2][Λ000][U1HU2H].For the independent sources, the columns ofU1(M×d) span the signal subspace, and the columns ofU2(M×(M-d)) span the noise subspace [1], Λ=diag(λ1,λ2,…,λd), where λi is the eigenvalue associating with the ith eigenvector. Hence, U2 is orthogonal to the steering vector of A(θ). The pseudo spectrum of the MUSIC method is given by(10)MUSIC(θk)=1∥aH(θk)·U2∥2.In conclusion, practical application of the algorithm involves the following steps.(1)
Estimate the cumulant matrix by (5), (6), and (8).(2)
Find the eigendecomposition of the cumulant matrix by 8 and get the noise subspaceU2. If the number of line is unknown, the Minimum Description Length (MDL) or Akaike Information Criterion (AIC) [7] criterion are used.(3)
ComputeMUSIC(θk) by  (10). The straight line orientations are estimated through the research of the maxima of MUSIC(θk).


## 3.1.2. Improved TLS-ESPRIT Algorithm

In this subsection, we define a matrix for implementing SVD operation, which is more appropriate to the improved TLS-ESPRIT algorithm and is different from the fourth-order cumulant matrix in MUSIC-like algorithm(11)Crr,4′′={cum4(zi(p),zi(p),zi*(p),zj*(p))},i=1,…,N;j=1,…,N;p=1,…,P.After spatial smoothing procedure is applied to image data as in (6), the multiple snapshots obtained have length M, and Crr,4′′ is also M×M dimensional matrix.In order to follow the key steps of TLS-ESPRIT algorithm, we firstly derive the following four(M-1)×(M-1) submatrices from (11):(12)C11={cum4(zi,zi,zi*,zj*)},i=1,…,M-1;j=1,…,M-1,C12={cum4(zi,zi,zi*,zj*)},i=1,…,M-1;j=2,…,M,C21={cum4(zi,zi,zi*,zj*)},i=2,…,M;j=1,…,M-1,C22={cum4(zi,zi,zi*,zj*)},i=2,…,M;j=2,…,M.
Then, the following matrix can be used to implement SVD operation in place of the covariance matrix:(13)C=[C11C12C21C22].The overall improved TLS-ESPRIT algorithm-based cumulant can be summarized as follows.(1)
Form the matrixCrr,4′′ by (5), (6), and (11).(2)
Generate four submatrices from (12) and reconstruct the matrix C by (13);(3)
Perform SVD operation withC(14)C=EΛEH,
where Λ=diag(λ1,…,λ2(M-1)) with the eigenvalues λ1≥λ2≥⋯≥λd≥⋯λ2(M-1) and λ1,λ2,…,λd corresponding to the signal subspace. Depending on the known conditions, AIC or MDL criterion is used.(4)
LetE1 be the 2(M-1)×d upper-left matrix of E and let E2 be 2(M-1)×d matrix formed by deleting the first row of matrix E. We carry out the eigen-decomposition
(15)[E1HE2H][E1E2]=FΛFFHF=[F11F12F21F22].(5)
Extract the submatricesF12 and F22, then find the eigenvalues {γk} of -F12F22-1.(6)
Estimate every line's orientation byθk=tan-1(1μIm(lnγk|γk|)E1HE2H)E1HE2H,k=1,…,d.


## 3.2. Offset Detection

After we estimate the line's angles, steering matrixA(θ) can be computed by (2), so that the maximum likelihood function or other similar methods can be used to find the offsets of  lines. In practice, we estimate the offsets using the "Extension of the Hough Transform" [8].


## 4. Simulation Results

In this section, simulation results are presented and the performance of our proposed algorithms is evaluated.


### 4.1. Correlated Gaussian Noise Simulation

To evaluate realistically the algorithms, correlated Gaussian noise is simulated by the following steps. First, the 2-dimensional random Gaussian noise matrix is generated, which has the same dimensions as the initial binary image and obeys a Gaussian distribution with mean 0 and varianceσ2. Then, let generated Gaussian noise matrix pass the spatial Gaussian low pass filter, so that we can obtain expected correlated Gaussian noise by choosing the filter's parameter. The impulse response of the filter is h(x,y)=(1/2πσ1σ2)e-(x2/2σ12)-(y2/2σ22), where σ1 and σ2 are vertical and horizontal variances, determining the correlation strength of noise image. Specially, σ1=σ2 means an isotropic Gaussian low pass filter. In the simulation, the filter function h(x,y) should be discretized to get the filter template, which is center symmetric. Herein, the correlation length (CL) of correlated Gaussian noise is defined as CL=(CLx+CLy)/2, where CLx and CLy are 2σ1 and 2σ2.


### 4.2. Algorithm Simulation

We set the size of detected image as100×100. As an example in Figure 2, standard variance of white Gaussian noise is 6 and CL of correlated Gaussian noise is 6. For initial image (see Figure 2(a)), there are two straight lines whose angles are 32° and 20° and offsets are 95 and 55, respectively. The estimation results provided by cumulant-based MUSIC-like algorithm (see Figure 2(c)) and by the improved TLS-ESPRIT algorithm (see Figure 2(d)) are more accurate than those provided by second-order-based algorithms (see Figure 2(b)). The orientations of two lines are, respectively, 32.3° and 20.4° for MUSIC-like algorithm, and 31.8° and 19.9° for improved TLS-ESPRIT algorithm. For the offsets, they are, respectively, 93.8 and 52.9 by MUSIC-like algorithm, and 92.6 and 54.8 by TLS-ESPRIT algorithm. Especially when the images are severely corrupted by correlated Gaussian noise, the cumulant-based algorithms still correctly characterize the lines, while the algorithms using second-order statistics yield a large bias.Initial image and estimated results for two lines with 32 and 20 degrees. (a) Initial scaled image. (b) Result without cumulant. (c) MUSIC-like algorithm. (d) TLS-ESPRIT algorithm.
(a)(b)(c)(d)ForK trials, the mean error ME and standard deviation Std are defined like: ME=1/K∑k=1K|xi-x̅| and Std=1/K∑k=1K(xi-x̅)2, where xk is each estimated angle and x̅ is the mean of all estimated angles. From Table 1, we can see that, as the augmentation of correlated noise's CL, it is insensitive to the mean and standard deviation of estimated angle when using MUSIC-like algorithm, compared to the improved TLS-ESPRIT algorithm. Moreover, we also see in the table that the performance of MUSIC-like algorithm is better than improved TLS-ESPRIT algorithm. Since both MUSIC-like algorithm and improved TLS-ESPRIT algorithm should choose the slice cumulant matrices to implement eigen-decomposition, these different choices of the matrices have some impacts on the performance of the algorithms.Table 1
Results with increase of CL.
CL=81216ME(MUSIC-like)32°0.28590.28310.280120°0.53580.27880.276Std(MUSIC-like)32°0.28580.26160.180720°0.30660.28150.2766ME(TLS-ESPRIT)32°0.78850.37330.178220°1.40140.82470.3527Std(TLS-ESPRIT)32°1.19630.69730.290520°2.4271.65920.9817The following experiments aim at studying the high-resolution capabilities of the proposed algorithm. Firstly, two lines with15° and 45° are considered in the image. The standard variance of white Gaussian noise is set to be 12, and CL is 16. After we operate 100 trials, the means of estimated angles for MUSIC-like algorithm are, respectively, 14.8° and 45.3°, and they are 14.5° and 45.7° for improved TLS-ESPRIT algorithm. Then we change the angles to be 32° and 28°, the mean values of estimated angles are 32.3° and 27.9° for 100 trials. For improved TLS-ESPRIT algorithm, we can also get the similar results, their means are 33.4° and 29.1°.Finally, to evaluate the computational load, we also compute the time elapsed to estimate the angle for the MUSIC-like algorithm and improved TLS-ESPRIT algorithm. Our simulation run on the same system for two algorithms: Intel 2 Quad CPU, 2.83 GHz, with the memory 4 G. In the simulation, we set two lines with the angles15∘ and 45∘ in the image. The time consumed by MUSIC-like algorithm is 0.29 seconds to obtain the estimations of angle values, while it is 0.10 seconds for improved TLS-ESPRIT algorithm.


## 4.1. Correlated Gaussian Noise Simulation

To evaluate realistically the algorithms, correlated Gaussian noise is simulated by the following steps. First, the 2-dimensional random Gaussian noise matrix is generated, which has the same dimensions as the initial binary image and obeys a Gaussian distribution with mean 0 and varianceσ2. Then, let generated Gaussian noise matrix pass the spatial Gaussian low pass filter, so that we can obtain expected correlated Gaussian noise by choosing the filter's parameter. The impulse response of the filter is h(x,y)=(1/2πσ1σ2)e-(x2/2σ12)-(y2/2σ22), where σ1 and σ2 are vertical and horizontal variances, determining the correlation strength of noise image. Specially, σ1=σ2 means an isotropic Gaussian low pass filter. In the simulation, the filter function h(x,y) should be discretized to get the filter template, which is center symmetric. Herein, the correlation length (CL) of correlated Gaussian noise is defined as CL=(CLx+CLy)/2, where CLx and CLy are 2σ1 and 2σ2.


## 4.2. Algorithm Simulation

We set the size of detected image as100×100. As an example in Figure 2, standard variance of white Gaussian noise is 6 and CL of correlated Gaussian noise is 6. For initial image (see Figure 2(a)), there are two straight lines whose angles are 32° and 20° and offsets are 95 and 55, respectively. The estimation results provided by cumulant-based MUSIC-like algorithm (see Figure 2(c)) and by the improved TLS-ESPRIT algorithm (see Figure 2(d)) are more accurate than those provided by second-order-based algorithms (see Figure 2(b)). The orientations of two lines are, respectively, 32.3° and 20.4° for MUSIC-like algorithm, and 31.8° and 19.9° for improved TLS-ESPRIT algorithm. For the offsets, they are, respectively, 93.8 and 52.9 by MUSIC-like algorithm, and 92.6 and 54.8 by TLS-ESPRIT algorithm. Especially when the images are severely corrupted by correlated Gaussian noise, the cumulant-based algorithms still correctly characterize the lines, while the algorithms using second-order statistics yield a large bias.Initial image and estimated results for two lines with 32 and 20 degrees. (a) Initial scaled image. (b) Result without cumulant. (c) MUSIC-like algorithm. (d) TLS-ESPRIT algorithm.
(a)(b)(c)(d)ForK trials, the mean error ME and standard deviation Std are defined like: ME=1/K∑k=1K|xi-x̅| and Std=1/K∑k=1K(xi-x̅)2, where xk is each estimated angle and x̅ is the mean of all estimated angles. From Table 1, we can see that, as the augmentation of correlated noise's CL, it is insensitive to the mean and standard deviation of estimated angle when using MUSIC-like algorithm, compared to the improved TLS-ESPRIT algorithm. Moreover, we also see in the table that the performance of MUSIC-like algorithm is better than improved TLS-ESPRIT algorithm. Since both MUSIC-like algorithm and improved TLS-ESPRIT algorithm should choose the slice cumulant matrices to implement eigen-decomposition, these different choices of the matrices have some impacts on the performance of the algorithms.Table 1
Results with increase of CL.
CL=81216ME(MUSIC-like)32°0.28590.28310.280120°0.53580.27880.276Std(MUSIC-like)32°0.28580.26160.180720°0.30660.28150.2766ME(TLS-ESPRIT)32°0.78850.37330.178220°1.40140.82470.3527Std(TLS-ESPRIT)32°1.19630.69730.290520°2.4271.65920.9817The following experiments aim at studying the high-resolution capabilities of the proposed algorithm. Firstly, two lines with15° and 45° are considered in the image. The standard variance of white Gaussian noise is set to be 12, and CL is 16. After we operate 100 trials, the means of estimated angles for MUSIC-like algorithm are, respectively, 14.8° and 45.3°, and they are 14.5° and 45.7° for improved TLS-ESPRIT algorithm. Then we change the angles to be 32° and 28°, the mean values of estimated angles are 32.3° and 27.9° for 100 trials. For improved TLS-ESPRIT algorithm, we can also get the similar results, their means are 33.4° and 29.1°.Finally, to evaluate the computational load, we also compute the time elapsed to estimate the angle for the MUSIC-like algorithm and improved TLS-ESPRIT algorithm. Our simulation run on the same system for two algorithms: Intel 2 Quad CPU, 2.83 GHz, with the memory 4 G. In the simulation, we set two lines with the angles15∘ and 45∘ in the image. The time consumed by MUSIC-like algorithm is 0.29 seconds to obtain the estimations of angle values, while it is 0.10 seconds for improved TLS-ESPRIT algorithm.


## 5. Conclusion

In this paper, the problem of contour detection in image is investigated by using array processing. Considering the circumstance of correlated Gaussian noise, fourth-order cumulant-based MUSIC-like and improved TLS-ESPRIT algorithm for non-Gaussian virtual generated signal from the image are presented to estimate the orientations of lines, while the offsets of lines are estimated by “Extension of the Hough Transform.” Numerical simulation shows that using cumulant-based algorithms improves the detection performance when correlated noise exists in image. These methods can also be extended to detect other contours in image, such as a curve line and a circle.



---

*Source: 630768-2010-03-14.xml*