# Edge-Detection in Noisy Images Using Independent Component Analysis

Authors: Kaustubha Mendhurwar; Shivaji Patil; Harsh Sundani; Priyanka Aggarwal; Vijay Devabhaktuni
Journal: ISRN Signal Processing
 (2011)

---

## Abstract

Edges in a digital image provide important information
about the objects contained within the image since they constitute boundaries between objects in the image. This paper proposes a new approach based on independent component analysis (ICA) for edge-detection in noisy images. The proposed approach works in two phases—the training phase and the edge-detection phase. The training phase is carried out only once to determine parameters for the ICA. Once calculated, these ICA parameters can be employed for edge-detection in any number of noisy images. The edge-detection phase deals with transitioning in and out of ICA domain and recovering the original image from a noisy image. Both gray scale as well as colored images corrupted with Gaussian noise are studied using the proposed approach, and remarkably improved results, compared to the
existing edge-detection techniques, are achieved. Performance evaluation of the proposed approach using both subjective as well as objective methods is presented.


---

## Body

## 1. Introduction

In typical images, edges characterize the object boundaries with sharp changes in intensity levels. Edges are useful for segmentation, registration, and identification of objects in a given scene. Most of these operations have edge-detection as the preprocessing step. Consequently, the success of these image processing tasks depends strictly on the performance of edge-detection step. Detection of these edges, therefore, not only helps in more accurate representation of an image, but it also significantly simplifies its processing. The edge  detection usually involves calculation of derivative of the image intensity function at a given pixel location owing to the fact that image intensity shows sudden changes at edges. Pixels with relatively higher magnitude of derivative of the image intensity function are classified into edge pixels. To this end, Gradient and Laplacian operators/masks such as Prewitt, Roberts, Sobel, Canny [1–3] are usually employed for the purpose of edge-detection. These operators work well for specific cases; however, they fail for others. For instance, the Prewitt edge detector works quite well for digital images corrupted with Poisson noise, whereas its performance decreases sharply for other kinds of noise [4]. Moreover, these operators/masks are chosen independent of the image under consideration. As such, the performance of these operators masks degrades considerably with the increase in noise levels in images [2]. Unfortunately, digital images are inevitably degraded by noise during acquisition and/or transmission. Furthermore, most of the edge-detection operators assume that images contain regions separated by clear boundaries. However, this assumption is not valid for images corrupted with noise. Alternatively, better results can be obtained if the images are denoised employing an appropriate filter (e.g., linear/smoothing filter, nonlinear filter) before applying the operators/masks [2, 4]. However, filters while smoothing out the noise also remove genuine high-frequency edge features, degrade localization and detection of low-contrast edges, and, therefore are incapable of providing satisfactory results [2–4].This paper proposes a new approach for edge-detection in noisy images. Proposed approach employs the independent component analysis (ICA) concept [5–7] in conjunction with the traditional edge-detection methods to obtain much better results for images corrupted with Gaussian noise. ICA has been previously applied for the purpose of edge-detection [8–11]. In the proposed approach, basic edge-detection method (i.e., Canny) is used along with ICA for the first time to improve the accuracy of edge-detection in noisy gray-scale and colored images. ICA provides a linear representation of non-Gaussian (i.e., super-Gaussian and sub-Gaussian) data making all the components statistically independent [12–16]. The proposed approach functions in two phases. In the first phase, FastICA algorithm which is a neural network learning algorithm based on a Gradient approach is used to find the separation matrix. In second phase, this obtained separation matrix is used for transitioning in and out of ICA domain, thereby facilitating denoising of noisy images. We apply the proposed approach to several gray-scale and colored images corrupted with high levels of Gaussian noise. Edge-detection results obtained from the proposed approach illustrate better performance than those obtained using Canny along with the nonlocal means filter.A brief introduction of ICA followed by the information regarding basis functions, fast ICA algorithm, and edge-detection are given in Section2. Section 3 presents the proposed approach and discusses key points involved in obtaining the improved results. Illustration of the proposed approach applied to gray scale as well as colored images is presented in Section 4, and conclusions with possible future work are included in Section 5.


## 2. Independent Component Analysis (ICA)

Typically, ICA is used for blind source separation [14], which facilitates separation of a set of signals from mixed signals, with very little information about the source signals or the mixing process. In contrast to the correlation-based transformations, like principal component analysis (PCA) [15], ICA decorrelates the signals (2nd-order statistics) and also reduces higher-order statistical dependencies, in attempt to make signals as independent as possible [7]. Since all the natural images contain similar statistical information, a set of noise-free images can be used for the training phase of ICA [12]. The transform obtained from ICA is then employed for denoising a noisy image.


### 2.1. Definition of ICA

Letxm×1=[x1,x2,x3,…,xm] be a linear mixture vector with m linear mixtures of n independent sources, sn×1=[s1,s2,s3,…,sn]. The relation between mixture vector x and the source vector s can be expressed as(1)xj=aj1s1+aj2s2+aj3s3+⋯+ajnsn,forj=1,2,…,m,
where A is called the mixing matrix of size (m×n), and each column aj is called basis function. As such, basis functions project the independent sources to produce linear mixtures. Thus, (1) can be expressed mathematically as(2)x=As.
The above model (2) is known as the ICA model. Figure 1 illustrates a block diagram for ICA where s has two elements – s1 and s2. Mixtures x1 and x2 obtained from s are fed to ICA as inputs. Therefore, only mixture vector x is available, from which A and s are estimated by the ICA.Figure 1
Representative block diagram of ICA for the case of two sources.ICA starts with an assumption that elements of vectors are statistically independent. The distributions of elements of s, although unknown, are assumed to be non-Gaussian. Furthermore, for the sake of simplicity, mixing matrix A is assumed to be a square matrix. The objective of ICA is to find a matrix W which, when multiplied with the observed mixture vector x, gives the source vector s, that is, (3)s=Wx.W is referred to as the separation matrix, and its inverse results in the mixing matrix A. There are numerous ways of finding matrix W, but we employed “fixed-point FastICA algorithm” as it is computationally efficient and robust [5–7].


### 2.2. Implementation of Fixed-Point FastICA

Sample image data obtained from the noise-free images is whitened, in order to makeW and A unitary and then fed to FastICA algorithm. The computation steps for matrix W are detailed below.Step 1.
Random image samples of size8×8 each, from the database that we have created, are fed to FastICA.Step 2.
MatrixW (size 64×64) is obtained from FastICA that performs orthogonalization during each iteration.Step 3.
Each row vector ofW corresponds to a basis function, and kurtosis k is computed, as explained in the next section, for all the basis functions.Step 4.
Row vectors ofW, that is, the basis functions, are then arranged in descending order of computed k value.In this paper, we usem=n=64. As such, both W and A have size of 64×64. Obtained matrix W from FastICA is an orthogonal matrix, and therefore A is simply WT. A detailed explanation of the use of FastICA algorithm and MATLAB code can be obtained from [17].


### 2.3. Edge-Detection

Signal mixtures tend to have Gaussian probability density functions (PDFs), while source signals have non-Gaussian pdf [18]. Hence, ICA is optimized to obtain non-Gaussian signals at the output. In practice, there are two types of non-Gaussian signals, commonly referred to as Platykurtotic (i.e., super-Gaussian) and Leptokurtotic (i.e., sub-Gaussian) [18]. The super-Gaussian signals have most of the values centered at zero, unlike sub-Gaussian signals. This implies that the former signals have relatively higher peaks compared to the latter. Peaky nature of the signals is formally described by what is called kurtosis of the signal’s PDF, which is the 4th moment of PDF. The kurtosis of row vector w of matrix W is computed as [18](4)k=(1/n)∑i=1n(wi-wm)4(1/n)∑i=1n(wi2-wm2)2-3,
where wm is the mean of w. Constant “3” guarantees that the Gaussian, super-Gaussian (sparse), and sub-Gaussian signals have, respectively, zero, positive, and negative values of k. Essentially, kurtosis provides a measure for the 4th central moment, which takes a given signal’s variance into account. The proposed algorithm (as explained below) arranges the rows of W in descending order of their k values. This is to select the sparse components of an image as they represent edges of the image.


## 2.1. Definition of ICA

Letxm×1=[x1,x2,x3,…,xm] be a linear mixture vector with m linear mixtures of n independent sources, sn×1=[s1,s2,s3,…,sn]. The relation between mixture vector x and the source vector s can be expressed as(1)xj=aj1s1+aj2s2+aj3s3+⋯+ajnsn,forj=1,2,…,m,
where A is called the mixing matrix of size (m×n), and each column aj is called basis function. As such, basis functions project the independent sources to produce linear mixtures. Thus, (1) can be expressed mathematically as(2)x=As.
The above model (2) is known as the ICA model. Figure 1 illustrates a block diagram for ICA where s has two elements – s1 and s2. Mixtures x1 and x2 obtained from s are fed to ICA as inputs. Therefore, only mixture vector x is available, from which A and s are estimated by the ICA.Figure 1
Representative block diagram of ICA for the case of two sources.ICA starts with an assumption that elements of vectors are statistically independent. The distributions of elements of s, although unknown, are assumed to be non-Gaussian. Furthermore, for the sake of simplicity, mixing matrix A is assumed to be a square matrix. The objective of ICA is to find a matrix W which, when multiplied with the observed mixture vector x, gives the source vector s, that is, (3)s=Wx.W is referred to as the separation matrix, and its inverse results in the mixing matrix A. There are numerous ways of finding matrix W, but we employed “fixed-point FastICA algorithm” as it is computationally efficient and robust [5–7].


## 2.2. Implementation of Fixed-Point FastICA

Sample image data obtained from the noise-free images is whitened, in order to makeW and A unitary and then fed to FastICA algorithm. The computation steps for matrix W are detailed below.Step 1.
Random image samples of size8×8 each, from the database that we have created, are fed to FastICA.Step 2.
MatrixW (size 64×64) is obtained from FastICA that performs orthogonalization during each iteration.Step 3.
Each row vector ofW corresponds to a basis function, and kurtosis k is computed, as explained in the next section, for all the basis functions.Step 4.
Row vectors ofW, that is, the basis functions, are then arranged in descending order of computed k value.In this paper, we usem=n=64. As such, both W and A have size of 64×64. Obtained matrix W from FastICA is an orthogonal matrix, and therefore A is simply WT. A detailed explanation of the use of FastICA algorithm and MATLAB code can be obtained from [17].


## 2.3. Edge-Detection

Signal mixtures tend to have Gaussian probability density functions (PDFs), while source signals have non-Gaussian pdf [18]. Hence, ICA is optimized to obtain non-Gaussian signals at the output. In practice, there are two types of non-Gaussian signals, commonly referred to as Platykurtotic (i.e., super-Gaussian) and Leptokurtotic (i.e., sub-Gaussian) [18]. The super-Gaussian signals have most of the values centered at zero, unlike sub-Gaussian signals. This implies that the former signals have relatively higher peaks compared to the latter. Peaky nature of the signals is formally described by what is called kurtosis of the signal’s PDF, which is the 4th moment of PDF. The kurtosis of row vector w of matrix W is computed as [18](4)k=(1/n)∑i=1n(wi-wm)4(1/n)∑i=1n(wi2-wm2)2-3,
where wm is the mean of w. Constant “3” guarantees that the Gaussian, super-Gaussian (sparse), and sub-Gaussian signals have, respectively, zero, positive, and negative values of k. Essentially, kurtosis provides a measure for the 4th central moment, which takes a given signal’s variance into account. The proposed algorithm (as explained below) arranges the rows of W in descending order of their k values. This is to select the sparse components of an image as they represent edges of the image.


## 3. Proposed Approach

As mentioned earlier, the proposed approach works in two phases—the training phase and the edge-detection phase. Training phase is carried out only once to find the matrixW, which is then employed for edge-detection in any number of noisy images. Both the phases are described below.


### 3.1. Training Phase

Training phase of the proposed approach consists of two main steps, that is, database creation and ICA followed by kurtosis computation.


#### 3.1.1. Database Creation

Selective images are taken from a website [19] to serve as a database. As can be seen in Figure 2, natural images are selected, since the ICA filters have more sparsely distributed (kurtotic) outputs on natural scenes [20].Figure 2
Images selected for the training phase [19].


#### 3.1.2. ICA and Kurtosis Computation

A detailed flow chart of the training phase is given in Figure3(a). Random image samples, each of size 8×8, are selected and fed to FastICA as input. FastICA algorithm, as explained earlier, computes the separation matrix W of size 64×64. This W is orthogonalized during each iteration to avail several benefits stated in [20]. Reduced arithmetic operations, and relatively easier matrix inversion, are a few of the benefits. Orthogonalization of  W is carried out using(5)W=real((WTW)-1/2)W.Flowchart of the proposed approach with (a) training phase for estimating the sparse matrix and (b) edge-detection in the noisy gray-scale image are shown.
(a)(b)Kurtosisk (i.e., the degree to which a statistical frequency curve is peaked) is then computed for each row vector w of matrix W. Positive values of k are required for sparsity of the elements. Constant “3” in (4) ensures high sparseness of the elements. The row vectors of W are arranged in descending order of their corresponding computed k values. This ensures use of sparse components that represent edges. Separation matrix W obtained after above-mentioned processing can be used for edge-detection in any noisy image [20].


### 3.2. Edge-Detection Phase

The flowchart for edge-detection in noisy images is given in Figure3(b). This phase makes use of the separation matrix W, computed in training phase, to transition the given noisy image in and out of the ICA domain. A major advantage of ICA domain is that a set of adaptive basis functions can be obtained from the image alone. The sparse code shrinkage is employed for denoising in the ICA domain.


#### 3.2.1. Transitioning In and Out of the ICA Domain

As described above, processing in ICA domain allows stating of a set of adaptive basis functions from the image alone. Windowing approach is employed where an image sample is processed and replaced. An image samplex of size 8×8 is first projected in the ICA domain by multiplying it with W. We denote the projection of the image in ICA domain as s. For transitioning out of the ICA domain, s is to be multiplied by W-1. However, W is orthogonal, that is, W-1=WT; therefore, s is simply multiplied by WT. For computational purpose, x is reshaped to 64×1 while entering and again 8×8 while exiting ICA domain.


#### 3.2.2. Denoising

Recovering the original image from a noisy image is complex. This work, therefore, aims at estimating an image, which is significantly better than the noisy image.Probability densities encountered in image denoising can be classified as (i) mildly sparse and (ii) strongly sparse [7]. In this work, we employ the strongly sparse density, which, for any si in s, is given by [21, 22](6)p(si)=(α+2)[α(α+1)/2](α/2+1)[(α(α+1)/2)+|si/d|](α+3).Here,d is the standard deviation, and α controls the sparseness. We first estimate p(0) and d, using which, α is evaluated as(7)α=2-k+k(k+4)2k-1,
where(8)k=d2p(0)2,d=E{si2}.
Next, the maximum a posteriori (MAP) estimation of the density model (6) is found using the shrinkage function given by
(9)g(si)=12dsign⁡(si)m′,
where(10)m′=max⁡(0,|si|-ad2+12(si+ad)2-4σ2(α+3)),(11)a=α(α+1)2.
In (10), σ represents noise level. Using the above equations, the value of p(0) is approximated to be 0.707.


#### 3.2.3. Discussion

The edge-detection phase implemented in this work is based on the sparse code shrinkage algorithm [8], where a sample is initially transformed into the ICA domain using W. Thereafter, these components are shrunk using the shrinkage function given in (9), and the sample is then taken out of the ICA domain using WT. Finally, Canny edge-detection algorithm [1] is applied to the image.


## 3.1. Training Phase

Training phase of the proposed approach consists of two main steps, that is, database creation and ICA followed by kurtosis computation.


### 3.1.1. Database Creation

Selective images are taken from a website [19] to serve as a database. As can be seen in Figure 2, natural images are selected, since the ICA filters have more sparsely distributed (kurtotic) outputs on natural scenes [20].Figure 2
Images selected for the training phase [19].


### 3.1.2. ICA and Kurtosis Computation

A detailed flow chart of the training phase is given in Figure3(a). Random image samples, each of size 8×8, are selected and fed to FastICA as input. FastICA algorithm, as explained earlier, computes the separation matrix W of size 64×64. This W is orthogonalized during each iteration to avail several benefits stated in [20]. Reduced arithmetic operations, and relatively easier matrix inversion, are a few of the benefits. Orthogonalization of  W is carried out using(5)W=real((WTW)-1/2)W.Flowchart of the proposed approach with (a) training phase for estimating the sparse matrix and (b) edge-detection in the noisy gray-scale image are shown.
(a)(b)Kurtosisk (i.e., the degree to which a statistical frequency curve is peaked) is then computed for each row vector w of matrix W. Positive values of k are required for sparsity of the elements. Constant “3” in (4) ensures high sparseness of the elements. The row vectors of W are arranged in descending order of their corresponding computed k values. This ensures use of sparse components that represent edges. Separation matrix W obtained after above-mentioned processing can be used for edge-detection in any noisy image [20].


## 3.1.1. Database Creation

Selective images are taken from a website [19] to serve as a database. As can be seen in Figure 2, natural images are selected, since the ICA filters have more sparsely distributed (kurtotic) outputs on natural scenes [20].Figure 2
Images selected for the training phase [19].


## 3.1.2. ICA and Kurtosis Computation

A detailed flow chart of the training phase is given in Figure3(a). Random image samples, each of size 8×8, are selected and fed to FastICA as input. FastICA algorithm, as explained earlier, computes the separation matrix W of size 64×64. This W is orthogonalized during each iteration to avail several benefits stated in [20]. Reduced arithmetic operations, and relatively easier matrix inversion, are a few of the benefits. Orthogonalization of  W is carried out using(5)W=real((WTW)-1/2)W.Flowchart of the proposed approach with (a) training phase for estimating the sparse matrix and (b) edge-detection in the noisy gray-scale image are shown.
(a)(b)Kurtosisk (i.e., the degree to which a statistical frequency curve is peaked) is then computed for each row vector w of matrix W. Positive values of k are required for sparsity of the elements. Constant “3” in (4) ensures high sparseness of the elements. The row vectors of W are arranged in descending order of their corresponding computed k values. This ensures use of sparse components that represent edges. Separation matrix W obtained after above-mentioned processing can be used for edge-detection in any noisy image [20].


## 3.2. Edge-Detection Phase

The flowchart for edge-detection in noisy images is given in Figure3(b). This phase makes use of the separation matrix W, computed in training phase, to transition the given noisy image in and out of the ICA domain. A major advantage of ICA domain is that a set of adaptive basis functions can be obtained from the image alone. The sparse code shrinkage is employed for denoising in the ICA domain.


### 3.2.1. Transitioning In and Out of the ICA Domain

As described above, processing in ICA domain allows stating of a set of adaptive basis functions from the image alone. Windowing approach is employed where an image sample is processed and replaced. An image samplex of size 8×8 is first projected in the ICA domain by multiplying it with W. We denote the projection of the image in ICA domain as s. For transitioning out of the ICA domain, s is to be multiplied by W-1. However, W is orthogonal, that is, W-1=WT; therefore, s is simply multiplied by WT. For computational purpose, x is reshaped to 64×1 while entering and again 8×8 while exiting ICA domain.


### 3.2.2. Denoising

Recovering the original image from a noisy image is complex. This work, therefore, aims at estimating an image, which is significantly better than the noisy image.Probability densities encountered in image denoising can be classified as (i) mildly sparse and (ii) strongly sparse [7]. In this work, we employ the strongly sparse density, which, for any si in s, is given by [21, 22](6)p(si)=(α+2)[α(α+1)/2](α/2+1)[(α(α+1)/2)+|si/d|](α+3).Here,d is the standard deviation, and α controls the sparseness. We first estimate p(0) and d, using which, α is evaluated as(7)α=2-k+k(k+4)2k-1,
where(8)k=d2p(0)2,d=E{si2}.
Next, the maximum a posteriori (MAP) estimation of the density model (6) is found using the shrinkage function given by
(9)g(si)=12dsign⁡(si)m′,
where(10)m′=max⁡(0,|si|-ad2+12(si+ad)2-4σ2(α+3)),(11)a=α(α+1)2.
In (10), σ represents noise level. Using the above equations, the value of p(0) is approximated to be 0.707.


### 3.2.3. Discussion

The edge-detection phase implemented in this work is based on the sparse code shrinkage algorithm [8], where a sample is initially transformed into the ICA domain using W. Thereafter, these components are shrunk using the shrinkage function given in (9), and the sample is then taken out of the ICA domain using WT. Finally, Canny edge-detection algorithm [1] is applied to the image.


## 3.2.1. Transitioning In and Out of the ICA Domain

As described above, processing in ICA domain allows stating of a set of adaptive basis functions from the image alone. Windowing approach is employed where an image sample is processed and replaced. An image samplex of size 8×8 is first projected in the ICA domain by multiplying it with W. We denote the projection of the image in ICA domain as s. For transitioning out of the ICA domain, s is to be multiplied by W-1. However, W is orthogonal, that is, W-1=WT; therefore, s is simply multiplied by WT. For computational purpose, x is reshaped to 64×1 while entering and again 8×8 while exiting ICA domain.


## 3.2.2. Denoising

Recovering the original image from a noisy image is complex. This work, therefore, aims at estimating an image, which is significantly better than the noisy image.Probability densities encountered in image denoising can be classified as (i) mildly sparse and (ii) strongly sparse [7]. In this work, we employ the strongly sparse density, which, for any si in s, is given by [21, 22](6)p(si)=(α+2)[α(α+1)/2](α/2+1)[(α(α+1)/2)+|si/d|](α+3).Here,d is the standard deviation, and α controls the sparseness. We first estimate p(0) and d, using which, α is evaluated as(7)α=2-k+k(k+4)2k-1,
where(8)k=d2p(0)2,d=E{si2}.
Next, the maximum a posteriori (MAP) estimation of the density model (6) is found using the shrinkage function given by
(9)g(si)=12dsign⁡(si)m′,
where(10)m′=max⁡(0,|si|-ad2+12(si+ad)2-4σ2(α+3)),(11)a=α(α+1)2.
In (10), σ represents noise level. Using the above equations, the value of p(0) is approximated to be 0.707.


## 3.2.3. Discussion

The edge-detection phase implemented in this work is based on the sparse code shrinkage algorithm [8], where a sample is initially transformed into the ICA domain using W. Thereafter, these components are shrunk using the shrinkage function given in (9), and the sample is then taken out of the ICA domain using WT. Finally, Canny edge-detection algorithm [1] is applied to the image.


## 4. Illustration

The proposed approach is applied to both gray-scale and colored images, and the results obtained are compared with those obtained using Canny and mean filters. We have also studied the effects of step size as well as noise levels on the performance of our approach.


### 4.1. Training

For the training phase, a set of images are chosen from an image database [19] to create a local database (see Figure 2). Using the algorithm given in Figure 3(a), orthogonalized matrix W is estimated. Training phase can be accomplished with any set of noise-free images. Noise-free images for the image on hand are not required, since matrix W remains same for all known/unknown images [20].


### 4.2. Effects of Noise and Step Size

Before proceeding to application of the proposed approach to gray-scale and colored images, we consider the effects of step size and noise levels on edge-detection. Step size is the distance between two successive image samples (i.e., sample windows). To study the effects of step size, the proposed approach is applied to an image with various step sizes (see Figure4). As expected, the test image becomes increasingly susceptible to noise with increase in step size. However, increasing the step size improves the computational speed. As such, it is crucial to select a step size, which offers a compromise between the speed and immunity to noise of the proposed approach. For instance, for the image in Figure 4, a maximum step size of 4 can be used (for a step size of 8, the edges become indistinguishable). Processing of image is 16 times faster with step size 4 compared to that of step size 1.Proposed approach applied to the standard Barbara image with 3 dB Gaussian noise. The step sizes chosen are (a) 1, (b) 2, (c) 4, and (d) 8, respectively.
(a)(b)(c)(d)Figure5 illustrates the results of the proposed approach on an image corrupted with different levels of white Gaussian noise. From the results obtained, it appears that the proposed approach gives satisfactory results for noise levels as high as 6 dB. It would be of interest to test the proposed approach with real data, that is, data for which noise-free images are unavailable. However, such results are difficult to obtain and comment upon. As such, performance of the algorithm for images artificially corrupted with noise is shown. Images not used during training are tested with the proposed approach.Proposed approach applied to the Barbara image with various noise levels and step size 1.
(a)
1 dB(b)
2 dB(c)
5 dB(d)
6 dB


### 4.3. Application to Gray-Scale Images

The proposed approach is applied to a number of gray-scale images, with step size of 1. For illustration, consider Figure6. Here, three gray-scale images shown in Figures 6(a), 6(e), and 6(i) are tested with the proposed approach. Figures 6(b), 6(f), and 6(j) show the respective gray-scale images with artificially added 3 dB white Gaussian noise. nonlocal means filter [23] is used for denoising followed by Canny method for edge-detection, and the results obtained using this approach (NLMCanny) are depicted in Figures 6(c), 6(g), and 6(k). Finally, Figures 6(d), 6(h), and 6(l) show the results of the proposed approach. As can be seen from the images, due to high level of Gaussian noise (i.e., 3 dB) in the images, Canny method fails to provide satisfactory results. However, the proposed approach offers considerably better results.Application of the proposed approach to gray-scale images with step size of 1.
(a)
Original image(b)
Image with 3 dB Gaussian noise(c)
Edge-detection using NLMCanny(d)
Edge-detection using the proposed approach(e)
Original image(f)
Image with 3 dB Gaussian noise(g)
Edge-detection using NLMCanny(h)
Edge-detection using the proposed approach(i)
Original image(j)
Image with 3 dB Gaussian noise(k)
Edge-detection using NLMCanny(l)
Edge-detection using the proposed approach


### 4.4. Application to Colored Images

The proposed approach is extended to colored images. MatrixW, computed for gray scale images, is employed for the colored images as well. White Gaussian noise is added separately and edge-detection phase is repeated individually for all three components R, G, and B. The results are given in Figure 7. Three colored images 7(a), 7(e), and 7(i) are tested with the proposed approach. Figures 7(b), 7(f), and 7(j) show the respective images with 3 dB white Gaussian noise added. Figures 7(c), 7(g), and 7(k) illustrate the results of NLMCanny applied to the respective noisy images, and the results of the proposed approach are shown in Figures 7(d), 7(h) and 7(l). Canny fails to provide satisfactory results because of the high noise level. However, our approach offers noticeably improved results.Application of the proposed approach to colored images with step size of 1.
(a)
Original image(b)
Image with 3 dB Gaussian noise(c)
Edge-detection using NLMCanny(d)
Edge-detection using the proposed approach(e)
Original image(f)
Image with 3 dB Gaussian noise(g)
Edge-detection using NLMCanny(h)
Edge-detection using the proposed approach(i)
Original image(j)
Image with 3 dB Gaussian noise(k)
Edge-detection using NLMCanny(l)
Edge-detection using the proposed approach


### 4.5. Objective Evaluation of the Proposed Approach

Three important criterions must be fulfilled for the better performance of the edge-detection technique. (1) The edge detector should find all the real edges and not find any false edges. (2) The edges should be found in the correct place. (3) There should not be multiple edges found for a single edge [24]. Detailed subjective comparison for gray-scale as well as colored images is depicted in Figures 8(a), 8(c), and 8(e) in Figure 8 depict the NLMCanny results for gray-sale images. The respective proposed approach results are depicted in (b), (d), and (f) in Figure 8. Similarly. Figures 8(g), 8(i), and 8(k) depict the NLMCanny results for colored images, and the respective proposed approach results are depicted in Figures 8(h), 8(j), and 8(l). Apart from these subjective methods, there are objective methods which are used for the evaluation of edge detectors. However, these do not necessarily correlate with the human perception of the image quality. For example, an image with relatively lower error might look much worse than an image with relatively higher error. These objective measures are root-mean-square error (eRMS), peak signal-to-noise ratio (SNRPeak), signal-to-noise ratio (SNRRMS), and Pratt’s figure of merit (FOM) (refer to (12), (13), (14), and (15), resp.) [4, 24]. (12)eRMS=1MN∑r=0M-1∑c=0N-1[E(r,c)-O(r,c)]2,(13)SNRPeak=10log10(L-1)2(1/MN)∑r=0M-1∑c=0N-1[E(r,c)-O(r,c)]2,(14)SNRRMS=∑r=0M-1∑c=0N-1[E(r,c)]2∑r=0M-1∑c=0N-1[E(r,c)-O(r,c)]2,
where O(r,c) is the original image (one with added noise), E(r,c) is the final image of size M×N, and L is the number of gray levels, that is, 256. For colored images, objective measures are calculated for each channel and average is computed.  Pratt’s figure of merit is defined by [4](15)FOM=1IN∑i=1IA11+αd2,IN=max(IA,II), where II and IA represent the number of ideal and actual edge map points, α is a scaling constant, and d is the separation distance between actual and ideal edges. FOM is normalized such that FOM=1 represents a perfectly detected edge. The value of α is set to 1/9. Table 1 shows the performance comparison between NLMCanny and proposed approach using the objective methods. It can be seen that the proposed approach outperforms NLMCanny since values for SNRRMS, SNRPeak, eRMS, and FOM for the proposed approach are higher.Table 1
Objective evaluation of the proposed approach.
ImageSNRRMSSNRPeakeRMSFOMNLMCannyProposedNLMCannyProposedNLMCannyProposedNLMCannyProposedGray-scale imagesBarbara0.2400.79254.71956.4810.40840.44910.52560.6164House0.5530.80653.27256.5680.41850.45940.48200.7830Bird0.1720.56754.36356.2050.38800.39470.67140.6926Colored imagesLena0.2260.63554.21356.0320.40100.46910.71420.7470Zebra0.2900.56455.09455.3790.44880.45820.73220.7511Butterfly0.2990.64055.81456.3750.36490.39810.67500.6840Detailed edge comparison for gray-scale and colored images, where (a), (c), (e), (g), (i), and (k) are NLM Canny results and (b), (d), (f), (h), (j), and (l) are the proposed approach results.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)


## 4.1. Training

For the training phase, a set of images are chosen from an image database [19] to create a local database (see Figure 2). Using the algorithm given in Figure 3(a), orthogonalized matrix W is estimated. Training phase can be accomplished with any set of noise-free images. Noise-free images for the image on hand are not required, since matrix W remains same for all known/unknown images [20].


## 4.2. Effects of Noise and Step Size

Before proceeding to application of the proposed approach to gray-scale and colored images, we consider the effects of step size and noise levels on edge-detection. Step size is the distance between two successive image samples (i.e., sample windows). To study the effects of step size, the proposed approach is applied to an image with various step sizes (see Figure4). As expected, the test image becomes increasingly susceptible to noise with increase in step size. However, increasing the step size improves the computational speed. As such, it is crucial to select a step size, which offers a compromise between the speed and immunity to noise of the proposed approach. For instance, for the image in Figure 4, a maximum step size of 4 can be used (for a step size of 8, the edges become indistinguishable). Processing of image is 16 times faster with step size 4 compared to that of step size 1.Proposed approach applied to the standard Barbara image with 3 dB Gaussian noise. The step sizes chosen are (a) 1, (b) 2, (c) 4, and (d) 8, respectively.
(a)(b)(c)(d)Figure5 illustrates the results of the proposed approach on an image corrupted with different levels of white Gaussian noise. From the results obtained, it appears that the proposed approach gives satisfactory results for noise levels as high as 6 dB. It would be of interest to test the proposed approach with real data, that is, data for which noise-free images are unavailable. However, such results are difficult to obtain and comment upon. As such, performance of the algorithm for images artificially corrupted with noise is shown. Images not used during training are tested with the proposed approach.Proposed approach applied to the Barbara image with various noise levels and step size 1.
(a)
1 dB(b)
2 dB(c)
5 dB(d)
6 dB


## 4.3. Application to Gray-Scale Images

The proposed approach is applied to a number of gray-scale images, with step size of 1. For illustration, consider Figure6. Here, three gray-scale images shown in Figures 6(a), 6(e), and 6(i) are tested with the proposed approach. Figures 6(b), 6(f), and 6(j) show the respective gray-scale images with artificially added 3 dB white Gaussian noise. nonlocal means filter [23] is used for denoising followed by Canny method for edge-detection, and the results obtained using this approach (NLMCanny) are depicted in Figures 6(c), 6(g), and 6(k). Finally, Figures 6(d), 6(h), and 6(l) show the results of the proposed approach. As can be seen from the images, due to high level of Gaussian noise (i.e., 3 dB) in the images, Canny method fails to provide satisfactory results. However, the proposed approach offers considerably better results.Application of the proposed approach to gray-scale images with step size of 1.
(a)
Original image(b)
Image with 3 dB Gaussian noise(c)
Edge-detection using NLMCanny(d)
Edge-detection using the proposed approach(e)
Original image(f)
Image with 3 dB Gaussian noise(g)
Edge-detection using NLMCanny(h)
Edge-detection using the proposed approach(i)
Original image(j)
Image with 3 dB Gaussian noise(k)
Edge-detection using NLMCanny(l)
Edge-detection using the proposed approach


## 4.4. Application to Colored Images

The proposed approach is extended to colored images. MatrixW, computed for gray scale images, is employed for the colored images as well. White Gaussian noise is added separately and edge-detection phase is repeated individually for all three components R, G, and B. The results are given in Figure 7. Three colored images 7(a), 7(e), and 7(i) are tested with the proposed approach. Figures 7(b), 7(f), and 7(j) show the respective images with 3 dB white Gaussian noise added. Figures 7(c), 7(g), and 7(k) illustrate the results of NLMCanny applied to the respective noisy images, and the results of the proposed approach are shown in Figures 7(d), 7(h) and 7(l). Canny fails to provide satisfactory results because of the high noise level. However, our approach offers noticeably improved results.Application of the proposed approach to colored images with step size of 1.
(a)
Original image(b)
Image with 3 dB Gaussian noise(c)
Edge-detection using NLMCanny(d)
Edge-detection using the proposed approach(e)
Original image(f)
Image with 3 dB Gaussian noise(g)
Edge-detection using NLMCanny(h)
Edge-detection using the proposed approach(i)
Original image(j)
Image with 3 dB Gaussian noise(k)
Edge-detection using NLMCanny(l)
Edge-detection using the proposed approach


## 4.5. Objective Evaluation of the Proposed Approach

Three important criterions must be fulfilled for the better performance of the edge-detection technique. (1) The edge detector should find all the real edges and not find any false edges. (2) The edges should be found in the correct place. (3) There should not be multiple edges found for a single edge [24]. Detailed subjective comparison for gray-scale as well as colored images is depicted in Figures 8(a), 8(c), and 8(e) in Figure 8 depict the NLMCanny results for gray-sale images. The respective proposed approach results are depicted in (b), (d), and (f) in Figure 8. Similarly. Figures 8(g), 8(i), and 8(k) depict the NLMCanny results for colored images, and the respective proposed approach results are depicted in Figures 8(h), 8(j), and 8(l). Apart from these subjective methods, there are objective methods which are used for the evaluation of edge detectors. However, these do not necessarily correlate with the human perception of the image quality. For example, an image with relatively lower error might look much worse than an image with relatively higher error. These objective measures are root-mean-square error (eRMS), peak signal-to-noise ratio (SNRPeak), signal-to-noise ratio (SNRRMS), and Pratt’s figure of merit (FOM) (refer to (12), (13), (14), and (15), resp.) [4, 24]. (12)eRMS=1MN∑r=0M-1∑c=0N-1[E(r,c)-O(r,c)]2,(13)SNRPeak=10log10(L-1)2(1/MN)∑r=0M-1∑c=0N-1[E(r,c)-O(r,c)]2,(14)SNRRMS=∑r=0M-1∑c=0N-1[E(r,c)]2∑r=0M-1∑c=0N-1[E(r,c)-O(r,c)]2,
where O(r,c) is the original image (one with added noise), E(r,c) is the final image of size M×N, and L is the number of gray levels, that is, 256. For colored images, objective measures are calculated for each channel and average is computed.  Pratt’s figure of merit is defined by [4](15)FOM=1IN∑i=1IA11+αd2,IN=max(IA,II), where II and IA represent the number of ideal and actual edge map points, α is a scaling constant, and d is the separation distance between actual and ideal edges. FOM is normalized such that FOM=1 represents a perfectly detected edge. The value of α is set to 1/9. Table 1 shows the performance comparison between NLMCanny and proposed approach using the objective methods. It can be seen that the proposed approach outperforms NLMCanny since values for SNRRMS, SNRPeak, eRMS, and FOM for the proposed approach are higher.Table 1
Objective evaluation of the proposed approach.
ImageSNRRMSSNRPeakeRMSFOMNLMCannyProposedNLMCannyProposedNLMCannyProposedNLMCannyProposedGray-scale imagesBarbara0.2400.79254.71956.4810.40840.44910.52560.6164House0.5530.80653.27256.5680.41850.45940.48200.7830Bird0.1720.56754.36356.2050.38800.39470.67140.6926Colored imagesLena0.2260.63554.21356.0320.40100.46910.71420.7470Zebra0.2900.56455.09455.3790.44880.45820.73220.7511Butterfly0.2990.64055.81456.3750.36490.39810.67500.6840Detailed edge comparison for gray-scale and colored images, where (a), (c), (e), (g), (i), and (k) are NLM Canny results and (b), (d), (f), (h), (j), and (l) are the proposed approach results.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)


## 5. Conclusion

A new approach based on ICA has been proposed for edge-detection in noisy images and has been applied to both gray-scale and colored images. Compared to the NLMCanny method, that is, Canny coupled with a state-of-the-art nonlocal means filter, the proposed approach has yielded considerably improved results. Several step sizes have been examined, and the results for the same have been presented. Moreover, the proposed approach exhibits higher immunity to noise levels. Since all the natural images contain same type of statistics, shrinkage algorithm parameters can be computed from any set of noise-free images for denoising an image. As such, the proposed approach is very robust in the noisy environment. Results for noise levels of 1 dB, 2 dB, 5 dB, 6 dB, and so forth have been depicted. The proposed approach allows step sizes as high as 4 to be employed, thereby speedingup its execution on the computer. Change in step size from 1 to 4 increases the speed 16 times. Step size of 4 has been shown to produce acceptable results. On a 2.47 GHz PC equipped with 4 GB of RAM, NLMCanny took 238.1 seconds to process gray-scale Barbara image. The same image took 448 seconds using the proposed approach with the step size of 1 and 32.4 seconds with the step size of 4. Superiority of the proposed approach has been validated using both subjective as well as objective measures. As a continuation of this work, we plan to test the approach with images in other research areas (e.g., medical images). We also plan to test it on the images corrupted with other types of noises.



---

*Source: 672353-2011-04-10.xml*