# Automatic Side-Scan Sonar Image Enhancement in Curvelet Transform Domain

Authors: Yan Zhou; Qingwu Li; Guanying Huo
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

We propose a novel automatic side-scan sonar image enhancement algorithm based on curvelet transform. The proposed algorithm uses the curvelet transform to construct a multichannel enhancement structure based on human visual system (HVS) and adopts a new adaptive nonlinear mapping scheme to modify the curvelet transform coefficients in each channel independently and automatically. Firstly, the noisy and low-contrast sonar image is decomposed into a low frequency channel and a series of high frequency channels by using curvelet transform. Secondly, a new nonlinear mapping scheme, which coincides with the logarithmic nonlinear enhancement characteristic of the HVS perception, is designed without any parameter tuning to adjust the curvelet transform coefficients in each channel. Finally, the enhanced image can be reconstructed with the modified coefficients via inverse curvelet transform. The enhancement is achieved by amplifying subtle features, improving contrast, and eliminating noise simultaneously. Experiment results show that the proposed algorithm produces better enhanced results than state-of-the-art algorithms.


---

## Body

## 1. Introduction

Acoustic remote sensing technologies, such as high-resolution multibeam and side-scan sonars imaging in water, are widely used in marine geology, commercial fishing, offshore oil prospecting and drilling, and so forth [1–4]. Due to transmission loss and acoustic wave scattering, sonar images are notorious for low contrast, edge-blurring, and being full of noise. Therefore it is necessary to amplify faint edges and eliminate noise in sonar images simultaneously for further image processing, such as image segmentation and object detection and classification.Image enhancement approaches can generally be divided into two categories: spatial domain methods and transform domain methods. Spatial domain enhancement methods deal with the image pixels. Desired enhancement can be achieved by manipulating the pixel values. Commonly-used spatial techniques are linear stretch, histogram equalization (HE) [5], convolution mask enhancement, adaptive histogram equalization, and so forth. The conventional histogram equalization has received considerable attention due to its simple and straightforward implementation, but it often amplifies noise, blurs subtle edges, and tends to over-enhance the image contrast if there are high peaks in the histogram [6]. These spatial domain methods usually cannot effectively discriminate edges from noise, because edges and noise have similar properties in spatial domain.One way to solve this problem is to use multiscale geometric analysis (MGA) to decompose the image into different frequency bands and process the image in each band independently. It belongs to transform domain methods, the second category. Multiscale wavelet-based image enhancement algorithms have achieved promising results over the last decades [7, 8]. However, two-dimensional (2D) wavelet transform commonly used is a separable extension of 1D wavelet transform, which does not work very well in capturing the image’s geometric edges because of its isotropy. To overcome the limitation of the wavelet transform, other multiscale analyses have been developed during the past decade, including curvelet transform [9] and nonsubsampled contourlet transform (NSCT) [10]. These approaches capture edges better than the wavelet transform owing to their high directional sensitivity and anisotropy. The curvelet transform therefore has been widely applied in the image processing field [11–15]. A contrast enhancement method based on curvelet transform has been developed, which uses a gain function with four parameters to modify the curvelet transform coefficients [11]. However, it requires appropriate manual parameter settings for different images that might otherwise result in image degradations. Lu et al. [16] proposed a piecewise function based enhancement method in curvelet transform domain (PFBE) to enhance the sonar image’s contrast. This method reduces the complexity of parameter adjustment by using an improved gain function with only one parameter, but it still requires parameter selection, which is manually set according to the input sonar images. In order to avoid manual parameter tuning, an automatic image enhancement method based on NSCT (AIE-NSCT) is proposed, which adjusts the NSCT coefficients by using a nonlinear mapping function [17]. This state-of-the-art image enhancement method has achieved good results in both grayscale and colour images. When processing the sonar image which has very low signal-to-noise ratio and strong noise, AIE-NSCT cannot sufficiently adjust contrast and eliminate noise. Furthermore, owing to the high redundancy of NSCT, NSCT-based methods are more time-consuming than curvelet-based methods.Curvelet transform is better in representing edges and removing noise than classical wavelet transform for its anisotropy and multidirectional decomposition capabilities, and it is also faster than many other multiscale geometric transforms for its less redundancy. Moreover, curvelet transform well coincides with the sparse coding mechanism and the multichannel processing mechanism of the human visual system (HVS), which is composed of a series of parallel channels with each channel corresponding to a specific range of image spatial frequencies. Therefore, we propose an automatic side-scan sonar image enhancement method based on curvelet transform in this paper. The proposed algorithm utilizes the curvelet transform to model a multichannel enhancement structure based on the HVS and adopts a new adaptive nonlinear mapping scheme to modify the curvelet transform coefficients in each channel independently and automatically. Experiment results show that the proposed method can effectively enhance the contrast while eliminating noise and preserving edges in side-scan sonar images. The proposed method outperforms the state-of-the-art enhancement techniques in both qualitative and quantitative assessments.The remainder of this paper is organized as follows. Section2 describes the curvelet transform. Section 3 presents the curvelet-based multichannel enhancement structure, which is inspired by the multichannel processing mechanism of the HVS. Also in this section, an adaptive nonlinear mapping integrating noise removal with feature enhancement is proposed for each independent channel. The experimental results and performance evaluation are given in Section 4. The conclusions are drawn finally in Section 5.


## 2. Curvelet Transform

Curvelets were first introduced by Candès and Donoho in 1999 [9], which broke an inherent limit of wavelet in representing the geometry of image edges. The first-generation curvelet transform based on multiscale ridgelets combines with a spatial bandpass filtering operation to isolate different scales. However, this transform is very complicated and redundant, including many steps, such as subband decomposition, smooth partitioning, renormalization, and ridgelet analysis [15]. Later, a considerably simpler second-generation curvelet transform based on frequency partition technique was proposed by the same authors [18–20]. The frequency domain of image is separated into disjoint wedge regions. Then, the local Fourier transform is implemented on these regions.Assume that we work throughout in two dimensions, that is,R
2, and set x as spatial variable, ω as a frequency domain variable, r and θ as polar coordinates in the frequency domain [21]. Let W
(
r
) and V
(
t
) be a pair of nonnegative, real-valued, and smooth window functions, called “radial window” and “angular window,” respectively. These windows will always satisfy the admissibility conditions:(1)
∑
j
=
-
∞
∞
W
2
(
2
j
r
)
=
1
,
r
∈
3
4
,
3
2
,
∑
l
=
-
∞
∞
V
2
(
t
-
l
)
=
1
,
t
∈
-
1
2
,
1
2
.For each scale j
≥
j
0, we introduce the frequency window U
j defined in the Fourier domain by(2)
U
j
(
r
,
θ
)
=
2
-
3
j
/
4
W
(
2
-
j
r
)
V
2
j
/
2
θ
2
π
,where j
/
2 is the integer part of j
/
2.Define a “mother” curvelet asφ
j
(
x
), and its Fourier transform φ
^
j
(
ω
)
=
U
j
(
ω
). Then all curvelets at scale 2
-
j are obtained by rotations and translations of φ
j.Introduce the equispaced sequence of rotation anglesθ
l
=
2
π
×
2
-
j
/
2
×
l, with l
=
0,1
,
…, 0
≤
θ
l
<
2
π, and the sequence of translation parameters k
=
(
k
1
,
k
2
)
∈
Z
2. Then define curvelets at scale 2
-
j, orientation θ
l, and position x
k
(
j
,
l
)
=
R
θ
l
-
1
(
k
1
×
2
-
j
,
k
2
×
2
-
j
/
2
) by(3)
φ
j
,
l
,
k
(
x
)
=
φ
j
R
θ
l
x
-
x
k
(
j
,
l
)
,where R
θ is the rotation by θ radians. A curvelet coefficient is then given by(4)
c
(
j
,
l
,
k
)
=
f
,
φ
j
,
l
,
k
=
∫
R
2
f
(
x
)
φ
j
,
l
,
k
(
x
)
¯
d
x
.According to Plancherel’s theorem, the curvelet transform can be expressed as the integral over the frequency plane (5)
c
j
,
l
,
k
=
1
2
π
2
∫
f
^
(
ω
)
φ
^
j
,
l
,
k
(
ω
)
¯
d
ω
=
1
2
π
2
∫
f
^
(
ω
)
U
j
(
R
θ
l
ω
)
e
i
〈
x
k
(
j
,
l
)
,
ω
〉
d
ω
.Figure 1 summarizes the key components of the construction in second-generation continuous-time curvelet transform. The figure on the left represents the induced tiling of the frequency plane. The figure on the right represents the spatial Cartesian grid associated with a given scale and direction [21].Figure 1
Curvelet tiling of frequency domain and space domain.In practical implementation, we define Cartesian window by(6)
iiiiiiii
U
~
j
ω
≔
W
~
j
ω
V
j
ω
,
W
~
j
ω
=
ϕ
j
+
1
2
ω
-
ϕ
j
2
ω
,
iiii
V
j
ω
=
V
2
j
/
2
ω
2
/
ω
1
,
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
i
i
j
≥
0
,where ϕ is defined as the product of lowpass one-dimensional windows:(7)
ϕ
j
ω
1
,
ω
2
=
ϕ
2
-
j
ω
1
ϕ
2
-
j
ω
2
.Introduce the set of equispaced slopes: tan
θ
l
=
l
×
2
-
j
/
2, l
=
-
2
j
/
2
,
…
,
2
j
/
2
-
1, and define(8)
U
~
j
,
l
(
ω
)
=
W
j
(
ω
)
V
j
S
θ
l
ω
,where S
θ is the shear matrix,(9)
S
θ
=
1
0
-
tan
θ
1
.The family U
~
j implies a concentric tiling whose geometry is pictured in Figure 2.Figure 2
The digital curvelet tiling.Thus, the discrete curvelet transform is defined as(10)
c
i
,
j
,
k
=
∫
f
^
ω
U
~
j
S
θ
l
-
1
ω
e
i
S
θ
l
-
T
b
,
ω
d
ω
,where b takes on the discrete values b
=
(
k
1
×
2
-
j
,
k
2
×
2
-
j
/
2
).Two versions of fast discrete curvelet transform (FDCT), namely, FDCT via Unequispaced FFTs (USFFT) and FDCT via Wrapping, were developed [21]. They were simpler, faster, and less redundant than the first-generation curvelet transform. In this paper, the Wrapping-based version, which is faster than USFFT-based version, is chosen to implement the digital curvelet transform.


## 3. Automatic Enhancement and Denoising Algorithm

### 3.1. Multichannel Enhancement Structure Based on HVS

It is well known that for the HVS, the receptive fields of simple cells in primary visual cortex can be characterized as being spatially localized, oriented, and bandpass [22]. The HVS captures the essential information of a natural scene using a least number of visual active cells, which is called sparse coding on a natural scene. This result suggests that for an efficient computational image representation, it should be based on a local, directional, and multiresolution expression. In addition, the HVS is a multichannel processing mechanism. It is composed of a series of parallel channels and each channel runs independently of the visual cortex. There is an agreement that each channel is sensitive to a specific range of image spatial frequencies. Therefore, these channels usually can be divided into a lowpass channel and several bandpass channels.As a multiscale multidirectional transform, the curvelet transform allows an almost optimal nonadaptive sparse representation of objects with edges. Because the curvelet transform exactly coincides with the mechanism of human visual perception, we can model the multichannel enhancement structure using the curvelet transform. The low frequency subband of the curvelet transform corresponds to the lowpass channel of the HVS, and each high frequency directional subband corresponds to each bandpass channel. Figure3 shows a multiscale decomposition of a side-scan sonar image using the curvelet transform, from which we can see the outstanding capability of multiscale edges representation of the curvelet transform.Figure 3
Curvelet decomposition of a side-scan sonar image. (a) Original image. (b) Reconstruction of low frequency subband. (c)–(e) Reconstruction of high frequency subband: scales from coarse to fine.
(a)
(b)
(c)
(d)
(e)


### 3.2. Adaptive Nonlinear Mapping Scheme

Because sonar images are full of strong noise, the critical problem for sonar image enhancement is to effectively remove noise while adaptively adjusting dynamic range and amplifying weak edges. After curvelet decomposition on a sonar image, the low frequency subband, which is almost noiseless, contains overall contrast information. While the high frequency subband in each scale and direction contains not only edges but also noise. Edges are geometric structures, while noise is not, so we can use the curvelet transform to distinguish edges from noise. Consequently, the low frequency subband, which corresponds to the lowpass channel of the HVS, needs to be stretched appropriately. However each high frequency subband, which corresponds to each bandpass channel of the HVS, needs to be sufficiently enhanced with denoising. According to the fundamental requirements proposed by Laine et al. in [23], an ideal design of a nonlinear mapping function should satisfy the following rules:(1)
low contrast area should be enhanced more than high contrast area;
(2)
sharp edges should not be blurred;
(3)
the nonlinear function should be monotonically increasing, in order to maintain the location of local extrema and avoid generating new extrema;
(4)
the nonlinear function should be antisymmetric, for example,E
(
-
x
)
=
-
E
(
x
), in order to preserve the polarity of phases and avoid the phenomenon of ring.To achieve the adaptive multichannel enhancement, we propose a nonlinear mapping scheme to modify the curvelet transform coefficients in each channel independently.


#### 3.2.1. Adaptive Nonlinear Mapping of Low Frequency Channel

For the low frequency subband (s
=
1), the nonlinear mapping function is defined as (11)
C
^
(
s
,
d
,
m
,
n
)
=
q
×
C
max
⁡
(
s
,
d
)
sign
C
(
s
,
d
,
m
,
n
)
sin
π
2
C
(
s
,
d
,
m
,
n
)
C
max
⁡
(
s
,
d
)
p
/
q
,where(12)
p
=
log
⁡
C
-
(
s
,
d
)
/
C
max
⁡
(
s
,
d
)
log
⁡
sin
π
/
2
·
C
-
(
s
,
d
)
/
C
max
⁡
(
s
,
d
)
,
(13)
q
=
C
-
(
s
,
d
)
+
σ
(
s
,
d
)
C
-
(
s
,
d
)
,where C
(
s
,
d
,
m
,
n
) is an original curvelet transform coefficient at location (
m
,
n
) in the subband indexed by scale s and direction d. C
^
(
s
,
d
,
m
,
n
) is the curvelet transform coefficient processed. For the low frequency subband, s
=
1. Consider(14)
C
max
⁡
(
s
,
d
)
=
max
⁡
abs
C
(
s
,
d
)
,where C
max
⁡
(
s
,
d
) denotes the maximum absolute coefficient amplitude in the subband indexed by scale s and direction d. One has(15)
C
-
(
s
,
d
)
=
mean
abs
C
(
s
,
d
)
,where C
-
(
s
,
d
) denotes the mean value of absolute coefficient amplitude in the subband indexed by scale s and direction d. Consider(16)
σ
(
s
,
d
)
=
1
M
N
∑
m
=
1
M
∑
n
=
1
N
C
s
,
d
,
m
,
n
-
C
-
s
,
d
2
1
/
2
,where σ
(
s
,
d
) denotes the standard deviation of absolute coefficient amplitude in the subband indexed by scale s and direction d.Subjective brightness (intensity as perceived by the HVS) is a nonlinear logarithmic function of the light intensity incident on the eye, as shown in Figure4 [5]. Figure 5(a) shows the nonlinear mapping curve representing the enhanced curvelet transform coefficients versus the original coefficients in the low frequency subband. From Figure 5(a), it is observed that the proposed nonlinear mapping function is an approximate logarithmic mapping, which is consistent with the characteristics of the HVS perception. Therefore, the dynamic range in the low frequency subband is well stretched by the proposed mapping function as shown in Figure 5(a).Figure 4
The nonlinear logarithmic property of the HVS.Figure 5
Mapping curve of curvelet transform coefficients for Figure3(a).
(a)
The low frequency subband
(b)
The high frequency subband (s
=
2, d
=
1)


#### 3.2.2. Adaptive Nonlinear Mapping of High Frequency Channel

For the high frequency subband in each scale and direction(
s
>
1
), the nonlinear mapping function is defined as (17)
C
^
(
s
,
d
,
m
,
n
)
=
0
,
if
C
(
s
,
d
,
m
,
n
)
<
T
(
s
,
d
)
s
-
1
C
max
⁡
(
s
,
d
)
sign
C
(
s
,
d
,
m
,
n
)
×
sin
π
2
C
(
s
,
d
,
m
,
n
)
-
T
(
s
,
d
)
C
max
⁡
(
s
,
d
)
-
T
(
s
,
d
)
p
/
2
,
if
C
(
s
,
d
,
m
,
n
)
≥
T
s
,
d
,where p and C
max
⁡
(
s
,
d
) are given by (12) and (14), respectively, in Section 3.2.1. For each high frequency subband, s
>
1. T
(
s
,
d
) is a hard threshold in the corresponding high frequency subband for adaptive denoising. In this paper, the threshold for each high frequency subband is given by (18)
T
(
s
,
d
)
=
k
·
σ
n
·
σ
~
s
,
d
,which has been termed as K-sigma thresholding [24]. We set k
=
4 for the finest scale and k
=
3 for the others. The noise standard deviation σ
n of the original image is estimated using the robust median operator [25]; that is, σ
n
=
median
(
abs
(
C
)
)
/
0.6745, where C refers to the curvelet transform coefficients in the finest subband. An approximate value σ
~
s
,
d
2 of the individual variances in the dth directional subband of the sth scale is calculated using Monte-Carlo simulations [26].Because the shapes of mapping curves in all the high frequency subbands are similar, the mapping curve of the high frequency subband indexed bys
=
2 and d
=
1 is given as an example in Figure 5(b). As expected, noise has been effectively suppressed by setting the coefficients which are smaller than the threshold T
(
s
,
d
) to be zeros. The absolute slope of the mapping curve in Figure 5(b) is decreasing with the increasing of the absolute coefficient amplitude in the enhanced intervals C
(
s
,
d
,
m
,
n
)
≥
T
(
s
,
d
). Therefore, compared with strong edges, weak edges which correspond to smaller coefficients will be enhanced more obviously. The proposed mapping function is in accord with the nonlinear logarithmic property of the HVS and can well balance noise reduction and edge enhancement, as shown in Figure 5(b). Moreover, the proposed mapping function also well satisfies the rules of monotonicity and antisymmetry.In summary, the proposed nonlinear mapping achieves the following targets: preserving strong edges by keeping the large coefficients, enhancing weak edges by amplifying the small coefficients, and removing noise by eliminating noise coefficients using thresholding in the high frequency subbands(
s
>
1
). Meanwhile, it increases overall contrast by adjusting the dynamic range in the low frequency subband (
s
=
1
). Therefore, it adequately improves the visual quality of side-scan sonar images.


### 3.3. Block Diagram of the Proposed Algorithm

A block diagram of the proposed image enhancement algorithm is shown in Figure6. To summarize, the proposed algorithm can be described as follows.Figure 6
Block diagram of the proposed image enhancement algorithm.Input: original imageI.(1)
Implement the curvelet transform ofI and obtain the curvelet transform coefficients C
(
s
,
d
,
m
,
n
) in the low frequency subband and each high frequency directional subband.
(2)
Calculate the enhanced curvelet transform coefficientsC
^
(
s
,
d
,
m
,
n
) in the low frequency subband using (11).
(3)
Estimate the noise standard deviationσ
n and the individual variances σ
~
s
,
d
2 in each high frequency directional subband to obtain the threshold T
(
s
,
d
).
(4)
Calculate the enhanced curvelet transform coefficientsC
^
(
s
,
d
,
m
,
n
) in each high frequency directional subband using (17).
(5)
Reconstruct the enhanced image from the coefficientsC
^
(
s
,
d
,
m
,
n
) via inverse curvelet transform.Output: enhanced imageI
^.


## 3.1. Multichannel Enhancement Structure Based on HVS

It is well known that for the HVS, the receptive fields of simple cells in primary visual cortex can be characterized as being spatially localized, oriented, and bandpass [22]. The HVS captures the essential information of a natural scene using a least number of visual active cells, which is called sparse coding on a natural scene. This result suggests that for an efficient computational image representation, it should be based on a local, directional, and multiresolution expression. In addition, the HVS is a multichannel processing mechanism. It is composed of a series of parallel channels and each channel runs independently of the visual cortex. There is an agreement that each channel is sensitive to a specific range of image spatial frequencies. Therefore, these channels usually can be divided into a lowpass channel and several bandpass channels.As a multiscale multidirectional transform, the curvelet transform allows an almost optimal nonadaptive sparse representation of objects with edges. Because the curvelet transform exactly coincides with the mechanism of human visual perception, we can model the multichannel enhancement structure using the curvelet transform. The low frequency subband of the curvelet transform corresponds to the lowpass channel of the HVS, and each high frequency directional subband corresponds to each bandpass channel. Figure3 shows a multiscale decomposition of a side-scan sonar image using the curvelet transform, from which we can see the outstanding capability of multiscale edges representation of the curvelet transform.Figure 3
Curvelet decomposition of a side-scan sonar image. (a) Original image. (b) Reconstruction of low frequency subband. (c)–(e) Reconstruction of high frequency subband: scales from coarse to fine.
(a)
(b)
(c)
(d)
(e)


## 3.2. Adaptive Nonlinear Mapping Scheme

Because sonar images are full of strong noise, the critical problem for sonar image enhancement is to effectively remove noise while adaptively adjusting dynamic range and amplifying weak edges. After curvelet decomposition on a sonar image, the low frequency subband, which is almost noiseless, contains overall contrast information. While the high frequency subband in each scale and direction contains not only edges but also noise. Edges are geometric structures, while noise is not, so we can use the curvelet transform to distinguish edges from noise. Consequently, the low frequency subband, which corresponds to the lowpass channel of the HVS, needs to be stretched appropriately. However each high frequency subband, which corresponds to each bandpass channel of the HVS, needs to be sufficiently enhanced with denoising. According to the fundamental requirements proposed by Laine et al. in [23], an ideal design of a nonlinear mapping function should satisfy the following rules:(1)
low contrast area should be enhanced more than high contrast area;
(2)
sharp edges should not be blurred;
(3)
the nonlinear function should be monotonically increasing, in order to maintain the location of local extrema and avoid generating new extrema;
(4)
the nonlinear function should be antisymmetric, for example,E
(
-
x
)
=
-
E
(
x
), in order to preserve the polarity of phases and avoid the phenomenon of ring.To achieve the adaptive multichannel enhancement, we propose a nonlinear mapping scheme to modify the curvelet transform coefficients in each channel independently.


### 3.2.1. Adaptive Nonlinear Mapping of Low Frequency Channel

For the low frequency subband (s
=
1), the nonlinear mapping function is defined as (11)
C
^
(
s
,
d
,
m
,
n
)
=
q
×
C
max
⁡
(
s
,
d
)
sign
C
(
s
,
d
,
m
,
n
)
sin
π
2
C
(
s
,
d
,
m
,
n
)
C
max
⁡
(
s
,
d
)
p
/
q
,where(12)
p
=
log
⁡
C
-
(
s
,
d
)
/
C
max
⁡
(
s
,
d
)
log
⁡
sin
π
/
2
·
C
-
(
s
,
d
)
/
C
max
⁡
(
s
,
d
)
,
(13)
q
=
C
-
(
s
,
d
)
+
σ
(
s
,
d
)
C
-
(
s
,
d
)
,where C
(
s
,
d
,
m
,
n
) is an original curvelet transform coefficient at location (
m
,
n
) in the subband indexed by scale s and direction d. C
^
(
s
,
d
,
m
,
n
) is the curvelet transform coefficient processed. For the low frequency subband, s
=
1. Consider(14)
C
max
⁡
(
s
,
d
)
=
max
⁡
abs
C
(
s
,
d
)
,where C
max
⁡
(
s
,
d
) denotes the maximum absolute coefficient amplitude in the subband indexed by scale s and direction d. One has(15)
C
-
(
s
,
d
)
=
mean
abs
C
(
s
,
d
)
,where C
-
(
s
,
d
) denotes the mean value of absolute coefficient amplitude in the subband indexed by scale s and direction d. Consider(16)
σ
(
s
,
d
)
=
1
M
N
∑
m
=
1
M
∑
n
=
1
N
C
s
,
d
,
m
,
n
-
C
-
s
,
d
2
1
/
2
,where σ
(
s
,
d
) denotes the standard deviation of absolute coefficient amplitude in the subband indexed by scale s and direction d.Subjective brightness (intensity as perceived by the HVS) is a nonlinear logarithmic function of the light intensity incident on the eye, as shown in Figure4 [5]. Figure 5(a) shows the nonlinear mapping curve representing the enhanced curvelet transform coefficients versus the original coefficients in the low frequency subband. From Figure 5(a), it is observed that the proposed nonlinear mapping function is an approximate logarithmic mapping, which is consistent with the characteristics of the HVS perception. Therefore, the dynamic range in the low frequency subband is well stretched by the proposed mapping function as shown in Figure 5(a).Figure 4
The nonlinear logarithmic property of the HVS.Figure 5
Mapping curve of curvelet transform coefficients for Figure3(a).
(a)
The low frequency subband
(b)
The high frequency subband (s
=
2, d
=
1)


### 3.2.2. Adaptive Nonlinear Mapping of High Frequency Channel

For the high frequency subband in each scale and direction(
s
>
1
), the nonlinear mapping function is defined as (17)
C
^
(
s
,
d
,
m
,
n
)
=
0
,
if
C
(
s
,
d
,
m
,
n
)
<
T
(
s
,
d
)
s
-
1
C
max
⁡
(
s
,
d
)
sign
C
(
s
,
d
,
m
,
n
)
×
sin
π
2
C
(
s
,
d
,
m
,
n
)
-
T
(
s
,
d
)
C
max
⁡
(
s
,
d
)
-
T
(
s
,
d
)
p
/
2
,
if
C
(
s
,
d
,
m
,
n
)
≥
T
s
,
d
,where p and C
max
⁡
(
s
,
d
) are given by (12) and (14), respectively, in Section 3.2.1. For each high frequency subband, s
>
1. T
(
s
,
d
) is a hard threshold in the corresponding high frequency subband for adaptive denoising. In this paper, the threshold for each high frequency subband is given by (18)
T
(
s
,
d
)
=
k
·
σ
n
·
σ
~
s
,
d
,which has been termed as K-sigma thresholding [24]. We set k
=
4 for the finest scale and k
=
3 for the others. The noise standard deviation σ
n of the original image is estimated using the robust median operator [25]; that is, σ
n
=
median
(
abs
(
C
)
)
/
0.6745, where C refers to the curvelet transform coefficients in the finest subband. An approximate value σ
~
s
,
d
2 of the individual variances in the dth directional subband of the sth scale is calculated using Monte-Carlo simulations [26].Because the shapes of mapping curves in all the high frequency subbands are similar, the mapping curve of the high frequency subband indexed bys
=
2 and d
=
1 is given as an example in Figure 5(b). As expected, noise has been effectively suppressed by setting the coefficients which are smaller than the threshold T
(
s
,
d
) to be zeros. The absolute slope of the mapping curve in Figure 5(b) is decreasing with the increasing of the absolute coefficient amplitude in the enhanced intervals C
(
s
,
d
,
m
,
n
)
≥
T
(
s
,
d
). Therefore, compared with strong edges, weak edges which correspond to smaller coefficients will be enhanced more obviously. The proposed mapping function is in accord with the nonlinear logarithmic property of the HVS and can well balance noise reduction and edge enhancement, as shown in Figure 5(b). Moreover, the proposed mapping function also well satisfies the rules of monotonicity and antisymmetry.In summary, the proposed nonlinear mapping achieves the following targets: preserving strong edges by keeping the large coefficients, enhancing weak edges by amplifying the small coefficients, and removing noise by eliminating noise coefficients using thresholding in the high frequency subbands(
s
>
1
). Meanwhile, it increases overall contrast by adjusting the dynamic range in the low frequency subband (
s
=
1
). Therefore, it adequately improves the visual quality of side-scan sonar images.


## 3.2.1. Adaptive Nonlinear Mapping of Low Frequency Channel

For the low frequency subband (s
=
1), the nonlinear mapping function is defined as (11)
C
^
(
s
,
d
,
m
,
n
)
=
q
×
C
max
⁡
(
s
,
d
)
sign
C
(
s
,
d
,
m
,
n
)
sin
π
2
C
(
s
,
d
,
m
,
n
)
C
max
⁡
(
s
,
d
)
p
/
q
,where(12)
p
=
log
⁡
C
-
(
s
,
d
)
/
C
max
⁡
(
s
,
d
)
log
⁡
sin
π
/
2
·
C
-
(
s
,
d
)
/
C
max
⁡
(
s
,
d
)
,
(13)
q
=
C
-
(
s
,
d
)
+
σ
(
s
,
d
)
C
-
(
s
,
d
)
,where C
(
s
,
d
,
m
,
n
) is an original curvelet transform coefficient at location (
m
,
n
) in the subband indexed by scale s and direction d. C
^
(
s
,
d
,
m
,
n
) is the curvelet transform coefficient processed. For the low frequency subband, s
=
1. Consider(14)
C
max
⁡
(
s
,
d
)
=
max
⁡
abs
C
(
s
,
d
)
,where C
max
⁡
(
s
,
d
) denotes the maximum absolute coefficient amplitude in the subband indexed by scale s and direction d. One has(15)
C
-
(
s
,
d
)
=
mean
abs
C
(
s
,
d
)
,where C
-
(
s
,
d
) denotes the mean value of absolute coefficient amplitude in the subband indexed by scale s and direction d. Consider(16)
σ
(
s
,
d
)
=
1
M
N
∑
m
=
1
M
∑
n
=
1
N
C
s
,
d
,
m
,
n
-
C
-
s
,
d
2
1
/
2
,where σ
(
s
,
d
) denotes the standard deviation of absolute coefficient amplitude in the subband indexed by scale s and direction d.Subjective brightness (intensity as perceived by the HVS) is a nonlinear logarithmic function of the light intensity incident on the eye, as shown in Figure4 [5]. Figure 5(a) shows the nonlinear mapping curve representing the enhanced curvelet transform coefficients versus the original coefficients in the low frequency subband. From Figure 5(a), it is observed that the proposed nonlinear mapping function is an approximate logarithmic mapping, which is consistent with the characteristics of the HVS perception. Therefore, the dynamic range in the low frequency subband is well stretched by the proposed mapping function as shown in Figure 5(a).Figure 4
The nonlinear logarithmic property of the HVS.Figure 5
Mapping curve of curvelet transform coefficients for Figure3(a).
(a)
The low frequency subband
(b)
The high frequency subband (s
=
2, d
=
1)


## 3.2.2. Adaptive Nonlinear Mapping of High Frequency Channel

For the high frequency subband in each scale and direction(
s
>
1
), the nonlinear mapping function is defined as (17)
C
^
(
s
,
d
,
m
,
n
)
=
0
,
if
C
(
s
,
d
,
m
,
n
)
<
T
(
s
,
d
)
s
-
1
C
max
⁡
(
s
,
d
)
sign
C
(
s
,
d
,
m
,
n
)
×
sin
π
2
C
(
s
,
d
,
m
,
n
)
-
T
(
s
,
d
)
C
max
⁡
(
s
,
d
)
-
T
(
s
,
d
)
p
/
2
,
if
C
(
s
,
d
,
m
,
n
)
≥
T
s
,
d
,where p and C
max
⁡
(
s
,
d
) are given by (12) and (14), respectively, in Section 3.2.1. For each high frequency subband, s
>
1. T
(
s
,
d
) is a hard threshold in the corresponding high frequency subband for adaptive denoising. In this paper, the threshold for each high frequency subband is given by (18)
T
(
s
,
d
)
=
k
·
σ
n
·
σ
~
s
,
d
,which has been termed as K-sigma thresholding [24]. We set k
=
4 for the finest scale and k
=
3 for the others. The noise standard deviation σ
n of the original image is estimated using the robust median operator [25]; that is, σ
n
=
median
(
abs
(
C
)
)
/
0.6745, where C refers to the curvelet transform coefficients in the finest subband. An approximate value σ
~
s
,
d
2 of the individual variances in the dth directional subband of the sth scale is calculated using Monte-Carlo simulations [26].Because the shapes of mapping curves in all the high frequency subbands are similar, the mapping curve of the high frequency subband indexed bys
=
2 and d
=
1 is given as an example in Figure 5(b). As expected, noise has been effectively suppressed by setting the coefficients which are smaller than the threshold T
(
s
,
d
) to be zeros. The absolute slope of the mapping curve in Figure 5(b) is decreasing with the increasing of the absolute coefficient amplitude in the enhanced intervals C
(
s
,
d
,
m
,
n
)
≥
T
(
s
,
d
). Therefore, compared with strong edges, weak edges which correspond to smaller coefficients will be enhanced more obviously. The proposed mapping function is in accord with the nonlinear logarithmic property of the HVS and can well balance noise reduction and edge enhancement, as shown in Figure 5(b). Moreover, the proposed mapping function also well satisfies the rules of monotonicity and antisymmetry.In summary, the proposed nonlinear mapping achieves the following targets: preserving strong edges by keeping the large coefficients, enhancing weak edges by amplifying the small coefficients, and removing noise by eliminating noise coefficients using thresholding in the high frequency subbands(
s
>
1
). Meanwhile, it increases overall contrast by adjusting the dynamic range in the low frequency subband (
s
=
1
). Therefore, it adequately improves the visual quality of side-scan sonar images.


## 3.3. Block Diagram of the Proposed Algorithm

A block diagram of the proposed image enhancement algorithm is shown in Figure6. To summarize, the proposed algorithm can be described as follows.Figure 6
Block diagram of the proposed image enhancement algorithm.Input: original imageI.(1)
Implement the curvelet transform ofI and obtain the curvelet transform coefficients C
(
s
,
d
,
m
,
n
) in the low frequency subband and each high frequency directional subband.
(2)
Calculate the enhanced curvelet transform coefficientsC
^
(
s
,
d
,
m
,
n
) in the low frequency subband using (11).
(3)
Estimate the noise standard deviationσ
n and the individual variances σ
~
s
,
d
2 in each high frequency directional subband to obtain the threshold T
(
s
,
d
).
(4)
Calculate the enhanced curvelet transform coefficientsC
^
(
s
,
d
,
m
,
n
) in each high frequency directional subband using (17).
(5)
Reconstruct the enhanced image from the coefficientsC
^
(
s
,
d
,
m
,
n
) via inverse curvelet transform.Output: enhanced imageI
^.


## 4. Experimental Results and Discussion

In this section, the effectiveness of the proposed algorithm is validated through computer simulation. We compare our algorithm with three image enhancement algorithms: HE [5], AIE-NSCT [17], and PFBE [16]. HE and AIE-NSCT are free of parameter selection for optical image enhancement, but PFBE requires parameter tuning for sonar image enhancement. We use the fast discrete curvelet transform via Wrapping in our experiments [21].


### 4.1. Qualitative Assessment

Four typical side-scan sonar images, shown in Figure7, are chosen as test images and enhancement results on sonar images are given in Figures 8(a)–8(d), 9(a)–9(d), 10(a)–10(d), and 11(a)–11(d) respectively. In order to further evaluate the performance of the different enhancement algorithms, we also use the Canny edge detector to extract the corresponding edges of the enhanced images, as shown in Figures 8(e)–8(h), 9(e)–9(h), 10(e)–10(h), and 11(e)–11(h). The gray-level mapping curves of the enhanced image versus the original image are shown in Figure 12.Figure 7
Original side-scan sonar images. (a)Sand. (b)Plane. (c)River landform. (d)Bridge pier.
(a)
(b)
(c)
(d)Figure 8
Enhancement results for imageSand. (a)–(d) Enhanced images using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. (e)–(h) Corresponding edge images of (a)–(d), respectively, using a Canny edge detector.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)Figure 9
Enhancement results for imagePlane. (a)–(d) Enhanced images using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. (e)–(h) Corresponding edge images of (a)–(d), respectively, using a Canny edge detector.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)Figure 10
Enhancement results for imageRiver landform. (a)–(d) Enhanced images using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. (e)–(h) Corresponding edge images of (a)–(d), respectively, using a Canny edge detector.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)Figure 11
Enhancement results for imageBridge pier. (a)–(d) Enhanced images using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. (e)–(h) Corresponding edge images of (a)–(d), respectively, using a Canny edge detector.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)Figure 12
Mapping curves of enhanced images. Key: green solid line, no-change mapping; cyan solid line, HE; red dash-dotted line, AIE-NSCT; blue solid line, PFBE; black dashed line, the proposed algorithm.
(a)
Sand
(b)
Plane
(c)
River landform
(d)
Bridge pierThe original imageSand in Figure 7(a) is a dark side-scan sonar image of the seafloor sand ripple. Figures 8(a)–8(d) show the enhanced images by using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. HE overenhances the image. This over enhancement is represented as a sharp change of its mapping curve in Figure 12(a). Moreover, it produces the brightness distortion of the sand ripple’s bottom; that is, the dark region at the bottom becomes too bright. The mapping curve verifies the observation, where input gray levels in the range of 0–20 are mapped to output gray levels in the range of 36–138. AIE-NSCT is able to enhance the contrast to some extent, but the overall contrast enhancement is not satisfactory and some details are still faint. It can also be seen from the mapping curve that the stretching of the dynamic range is insufficient. For PFBE, we choose the parameter c
=
3 to obtain the best enhanced image. PFBE increases the overall brightness of the image but cannot provide an adequate contrast enhancement. This is verified by its mapping curve, which is linear and almost parallel to the no-change mapping. However, the proposed algorithm efficiently emphasizes the subtle features. Meanwhile, it improves the overall contrast and removes noise. This is verified by its mapping curve in Figure 12(a), where input low gray-level range is compressed and high gray-level range is stretched sufficiently.The original imagePlane in Figure 7(b) is a side-scan sonar image of the plane wreckage in Lake Washington obtained by Marine Sonic Technology, Ltd. Figures 9(a)–9(d) show the enhancement results by adopting HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. HE again overenhances the image accompanied with annoying amplified noise, resulting in the overbrightness of the fuselage. This is verified by the mapping curve in Figure 12(b), where the rising slope of the curve is the largest. AIE-NSCT enhances the contrast of some of the image structures, but the boundary of the plane’s shadow area is still unclear. For PFBE, we choose the parameter c
=
4.5 to get the optimal enhanced image. PFBE improves the overall contrast, but the edges of the plane are a little fuzzy. The proposed algorithm well distinguishes the background, the plane, and the shadow area, simultaneously yielding visually pleasing brightness. It can be seen from Figure 12(b) that our mapping curve is located between the mapping curve of HE and that of PFBE.The original imageRiver landform in Figure 7(c) is a side-scan sonar image of the riverbed in Changzhou city section of China Grand Canal. Figures 10(a)–10(d) show the enhancement results by using the four algorithms, respectively. HE obviously amplifies noise, resulting in the undesired blur of weak edges. AIE-NSCT can preserve edges and reduce noise partly, but the overall contrast enhancement is not noticeable for its limited dynamic range adjustment. For PFBE, we choose the parameter c
=
2 to obtain the best enhanced image. Although the noise is effectively suppressed by PFBE, the perceived contrast is not significantly improved. The proposed algorithm efficiently enhances the dynamic range and edges while simultaneously removing noise. Furthermore, it can recover the details of small silt pits at the left bottom. This is verified by the mapping curves in Figure 12(c), where the input gray levels are stretched either excessively in HE or inadequately in AIE-NSCT and PFBE but appropriately in our algorithm.The original imageBridge pier in Figure 7(d) is a side-scan sonar image of the Huai De bridge pier across Changzhou city section of China Grand Canal. We choose the parameter c
=
2 to get the optimal enhanced image for PFBE. The proposed algorithm is the only approach which can simultaneously enhance the contrast, sharpen the edges, and reduce noise. This can be illustrated by the visual results shown in Figures 11(a)–11(d) and the mapping curves shown in Figure 12(d).The corresponding edge detection results of the enhanced images are shown in Figures8(e)–8(h), 9(e)–9(h), 10(e)–10(h), and 11(e)–11(h), respectively. The over enhancement and amplified noise provided by HE give rise to many false edge points, which can be seen in Figures 8(e), 9(e), 10(e) and 11(e). Owing to the insufficient contrast enhancement and edge details blurring produced by AIE-NSCT and PFBE, the detected edges are incomplete (e.g., the loss of weak edges in the middle ofSand shown in Figures 8(f)-8(g), the edge loss of the plane tail and wings in the shadow area ofPlane shown in Figures 9(f)-9(g), the loss of texture details in bottom right ofRiver landform in Figures 10(f)-10(g), and the incomplete outer contour ofBridge pier in Figures 11(f)-11(g)). Because the proposed method can significantly reduce noise and strengthen edges, it obtains more accurate, clean, and complete edges, which can be clearly observed in Figures 8(h), 9(h), 10(h), and 11(h). These edge detection results further demonstrate that the proposed method has a significant advantage of being able to suppress noise while preserving edges.


### 4.2. Quantitative Assessment

To acquire quantitative evaluation of enhancement results, the image contrast measure called the measure of enhancement by entropy or EME using entropy is proposed in [27]:(19)
EMEE
=
1
M
N
∑
m
=
1
M
∑
n
=
1
N
I
max
⁡
;
m
,
n
I
min
⁡
;
m
,
n
+
c
ln
⁡
I
max
⁡
;
m
,
n
I
min
⁡
;
m
,
n
+
c
,where an image is split into M
×
N blocks B
(
m
,
n
) of size 4
×
4, and I
max
⁡
;
m
,
n, I
min
⁡
;
m
,
n are the maximum and minimum values of the pixels in each block B
(
m
,
n
), respectively. c is a small constant equal to 0.0001 to avoid dividing by 0.The EME by entropy (EMEE), which is of the entropy formula form XlogX, is actually measuring the entropy, or information, in the contrast of the image [28]. The EMEE value should increase by a significant magnitude when the contrast of an image is enhanced noticeably. We use the EMEE to compare the enhancement performance of different algorithms as listed in Table 1. Because HE overenhances the images ofSand andPlane, the maximum and minimum values of each block simultaneously become large, resulting in small EMEE values. Forthe images ofRiver landform andBridge pier, HE amplifies noise, resulting in large EMEE values. It is observed that the proposed algorithm offers the largest value of EMEE for each test image, which indicates that the enhanced images of our algorithm have the highest contrast. Both subjective and quantitative assessments have shown that the proposed algorithm outperforms other algorithms in enhancing image contrast, improving edge sharpness, and suppressing noise.Table 1
Comparison of EMEEs.
Image
Original
HE
AIE-NSCT
PFBE
Proposed
Sand
233.22
10.42
8591.70
2029.00
31008.00
Plane
582.06
3.21
529.90
1558.00
2173.50
River landform
233.59
4977.50
699.02
614.95
12465.00
Bridge pier
458.23
1447.20
2296.50
881.44
4085.70


### 4.3. Comparison of Running Time

All the algorithms are implemented under MATLAB R2011b environment on a PC with 3 GHz Pentium(R) Dual-core CPU E5700 and 2 GB RAM. The running times of the four methods are given in Table2. The test images areSand,Plane,River landform, andBridge pier, respectively with 500 × 512 pixels, 256 × 256 pixels, 500 × 500 pixels, and 300 × 300 pixels. For all the methods, the running time is proportional to the size of the image. The larger the size of the image is, the longer the running time is. The results indicate that our algorithm consumes much less time than AIE-NSCT because of the lower computational complexity of the curvelet transform. Meanwhile, compared with HE, our algorithm produces much better enhanced images though it costs a little more time. Compared with PFBE, our algorithm is also faster. It should be noticed that an extra time is needed for PFBE to select the optimal parameter manually, and the time is not included in the running time of PFBE in Table 2 because it is difficult to determine.Table 2
Comparison of running time (s).
Image
HE
AIE-NSCT
PFBE
Proposed
Sand
0.03
81.97
2.52
1.13
Plane
0.02
21.03
0.75
0.33
River landform
0.03
79.80
2.46
1.11
Bridge pier
0.02
28.73
0.97
0.48


## 4.1. Qualitative Assessment

Four typical side-scan sonar images, shown in Figure7, are chosen as test images and enhancement results on sonar images are given in Figures 8(a)–8(d), 9(a)–9(d), 10(a)–10(d), and 11(a)–11(d) respectively. In order to further evaluate the performance of the different enhancement algorithms, we also use the Canny edge detector to extract the corresponding edges of the enhanced images, as shown in Figures 8(e)–8(h), 9(e)–9(h), 10(e)–10(h), and 11(e)–11(h). The gray-level mapping curves of the enhanced image versus the original image are shown in Figure 12.Figure 7
Original side-scan sonar images. (a)Sand. (b)Plane. (c)River landform. (d)Bridge pier.
(a)
(b)
(c)
(d)Figure 8
Enhancement results for imageSand. (a)–(d) Enhanced images using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. (e)–(h) Corresponding edge images of (a)–(d), respectively, using a Canny edge detector.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)Figure 9
Enhancement results for imagePlane. (a)–(d) Enhanced images using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. (e)–(h) Corresponding edge images of (a)–(d), respectively, using a Canny edge detector.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)Figure 10
Enhancement results for imageRiver landform. (a)–(d) Enhanced images using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. (e)–(h) Corresponding edge images of (a)–(d), respectively, using a Canny edge detector.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)Figure 11
Enhancement results for imageBridge pier. (a)–(d) Enhanced images using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. (e)–(h) Corresponding edge images of (a)–(d), respectively, using a Canny edge detector.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)Figure 12
Mapping curves of enhanced images. Key: green solid line, no-change mapping; cyan solid line, HE; red dash-dotted line, AIE-NSCT; blue solid line, PFBE; black dashed line, the proposed algorithm.
(a)
Sand
(b)
Plane
(c)
River landform
(d)
Bridge pierThe original imageSand in Figure 7(a) is a dark side-scan sonar image of the seafloor sand ripple. Figures 8(a)–8(d) show the enhanced images by using HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. HE overenhances the image. This over enhancement is represented as a sharp change of its mapping curve in Figure 12(a). Moreover, it produces the brightness distortion of the sand ripple’s bottom; that is, the dark region at the bottom becomes too bright. The mapping curve verifies the observation, where input gray levels in the range of 0–20 are mapped to output gray levels in the range of 36–138. AIE-NSCT is able to enhance the contrast to some extent, but the overall contrast enhancement is not satisfactory and some details are still faint. It can also be seen from the mapping curve that the stretching of the dynamic range is insufficient. For PFBE, we choose the parameter c
=
3 to obtain the best enhanced image. PFBE increases the overall brightness of the image but cannot provide an adequate contrast enhancement. This is verified by its mapping curve, which is linear and almost parallel to the no-change mapping. However, the proposed algorithm efficiently emphasizes the subtle features. Meanwhile, it improves the overall contrast and removes noise. This is verified by its mapping curve in Figure 12(a), where input low gray-level range is compressed and high gray-level range is stretched sufficiently.The original imagePlane in Figure 7(b) is a side-scan sonar image of the plane wreckage in Lake Washington obtained by Marine Sonic Technology, Ltd. Figures 9(a)–9(d) show the enhancement results by adopting HE, AIE-NSCT, PFBE, and the proposed algorithm, respectively. HE again overenhances the image accompanied with annoying amplified noise, resulting in the overbrightness of the fuselage. This is verified by the mapping curve in Figure 12(b), where the rising slope of the curve is the largest. AIE-NSCT enhances the contrast of some of the image structures, but the boundary of the plane’s shadow area is still unclear. For PFBE, we choose the parameter c
=
4.5 to get the optimal enhanced image. PFBE improves the overall contrast, but the edges of the plane are a little fuzzy. The proposed algorithm well distinguishes the background, the plane, and the shadow area, simultaneously yielding visually pleasing brightness. It can be seen from Figure 12(b) that our mapping curve is located between the mapping curve of HE and that of PFBE.The original imageRiver landform in Figure 7(c) is a side-scan sonar image of the riverbed in Changzhou city section of China Grand Canal. Figures 10(a)–10(d) show the enhancement results by using the four algorithms, respectively. HE obviously amplifies noise, resulting in the undesired blur of weak edges. AIE-NSCT can preserve edges and reduce noise partly, but the overall contrast enhancement is not noticeable for its limited dynamic range adjustment. For PFBE, we choose the parameter c
=
2 to obtain the best enhanced image. Although the noise is effectively suppressed by PFBE, the perceived contrast is not significantly improved. The proposed algorithm efficiently enhances the dynamic range and edges while simultaneously removing noise. Furthermore, it can recover the details of small silt pits at the left bottom. This is verified by the mapping curves in Figure 12(c), where the input gray levels are stretched either excessively in HE or inadequately in AIE-NSCT and PFBE but appropriately in our algorithm.The original imageBridge pier in Figure 7(d) is a side-scan sonar image of the Huai De bridge pier across Changzhou city section of China Grand Canal. We choose the parameter c
=
2 to get the optimal enhanced image for PFBE. The proposed algorithm is the only approach which can simultaneously enhance the contrast, sharpen the edges, and reduce noise. This can be illustrated by the visual results shown in Figures 11(a)–11(d) and the mapping curves shown in Figure 12(d).The corresponding edge detection results of the enhanced images are shown in Figures8(e)–8(h), 9(e)–9(h), 10(e)–10(h), and 11(e)–11(h), respectively. The over enhancement and amplified noise provided by HE give rise to many false edge points, which can be seen in Figures 8(e), 9(e), 10(e) and 11(e). Owing to the insufficient contrast enhancement and edge details blurring produced by AIE-NSCT and PFBE, the detected edges are incomplete (e.g., the loss of weak edges in the middle ofSand shown in Figures 8(f)-8(g), the edge loss of the plane tail and wings in the shadow area ofPlane shown in Figures 9(f)-9(g), the loss of texture details in bottom right ofRiver landform in Figures 10(f)-10(g), and the incomplete outer contour ofBridge pier in Figures 11(f)-11(g)). Because the proposed method can significantly reduce noise and strengthen edges, it obtains more accurate, clean, and complete edges, which can be clearly observed in Figures 8(h), 9(h), 10(h), and 11(h). These edge detection results further demonstrate that the proposed method has a significant advantage of being able to suppress noise while preserving edges.


## 4.2. Quantitative Assessment

To acquire quantitative evaluation of enhancement results, the image contrast measure called the measure of enhancement by entropy or EME using entropy is proposed in [27]:(19)
EMEE
=
1
M
N
∑
m
=
1
M
∑
n
=
1
N
I
max
⁡
;
m
,
n
I
min
⁡
;
m
,
n
+
c
ln
⁡
I
max
⁡
;
m
,
n
I
min
⁡
;
m
,
n
+
c
,where an image is split into M
×
N blocks B
(
m
,
n
) of size 4
×
4, and I
max
⁡
;
m
,
n, I
min
⁡
;
m
,
n are the maximum and minimum values of the pixels in each block B
(
m
,
n
), respectively. c is a small constant equal to 0.0001 to avoid dividing by 0.The EME by entropy (EMEE), which is of the entropy formula form XlogX, is actually measuring the entropy, or information, in the contrast of the image [28]. The EMEE value should increase by a significant magnitude when the contrast of an image is enhanced noticeably. We use the EMEE to compare the enhancement performance of different algorithms as listed in Table 1. Because HE overenhances the images ofSand andPlane, the maximum and minimum values of each block simultaneously become large, resulting in small EMEE values. Forthe images ofRiver landform andBridge pier, HE amplifies noise, resulting in large EMEE values. It is observed that the proposed algorithm offers the largest value of EMEE for each test image, which indicates that the enhanced images of our algorithm have the highest contrast. Both subjective and quantitative assessments have shown that the proposed algorithm outperforms other algorithms in enhancing image contrast, improving edge sharpness, and suppressing noise.Table 1
Comparison of EMEEs.
Image
Original
HE
AIE-NSCT
PFBE
Proposed
Sand
233.22
10.42
8591.70
2029.00
31008.00
Plane
582.06
3.21
529.90
1558.00
2173.50
River landform
233.59
4977.50
699.02
614.95
12465.00
Bridge pier
458.23
1447.20
2296.50
881.44
4085.70


## 4.3. Comparison of Running Time

All the algorithms are implemented under MATLAB R2011b environment on a PC with 3 GHz Pentium(R) Dual-core CPU E5700 and 2 GB RAM. The running times of the four methods are given in Table2. The test images areSand,Plane,River landform, andBridge pier, respectively with 500 × 512 pixels, 256 × 256 pixels, 500 × 500 pixels, and 300 × 300 pixels. For all the methods, the running time is proportional to the size of the image. The larger the size of the image is, the longer the running time is. The results indicate that our algorithm consumes much less time than AIE-NSCT because of the lower computational complexity of the curvelet transform. Meanwhile, compared with HE, our algorithm produces much better enhanced images though it costs a little more time. Compared with PFBE, our algorithm is also faster. It should be noticed that an extra time is needed for PFBE to select the optimal parameter manually, and the time is not included in the running time of PFBE in Table 2 because it is difficult to determine.Table 2
Comparison of running time (s).
Image
HE
AIE-NSCT
PFBE
Proposed
Sand
0.03
81.97
2.52
1.13
Plane
0.02
21.03
0.75
0.33
River landform
0.03
79.80
2.46
1.11
Bridge pier
0.02
28.73
0.97
0.48


## 5. Conclusion

In this study, a new automatic side-scan sonar image enhancement algorithm in curvelet transform domain is proposed. We present an adaptive multichannel enhancement structure based on the HVS, combining the nonlinear mapping scheme with the curvelet transform. The proposed nonlinear mapping scheme is well designed to achieve the following goals: in the high frequency subbands, amplifying the coefficients of weak edges, preserving the coefficients of strong edges, and inhibiting noise coefficients, and in the low frequency subband, adjusting the dynamic range adequately. The nonlinear mapping is adaptive without any parameter tuning and is consistent with the nonlinear logarithmic property of the HVS. Therefore, the proposed algorithm can automatically achieve noise suppressing, edge sharpening, and contrast enhancement for side-scan sonar images. The proposed algorithm is tested on real sonar images and is compared with some popular enhancement algorithms. Experiment results demonstrate that the proposed algorithm outperforms the existing enhancement algorithms in terms of subjective visual evaluation and objective quantitative evaluation measure of EMEE. Moreover, compared with HE, the proposed algorithm can enhance the image much better with only a bit more time consumption. Compared with NSCT-based enhancement algorithm, our algorithm not only produces better results but also consumes much less time. Compared with PFBE, which is a nonadaptive curvelet-based enhancement algorithm, our algorithm can achieve better enhancement results without adjusting parameters manually. Therefore, the proposed approach can be easily and effectively used for sonar image enhancement.



---

*Source: 493142-2015-04-07.xml*