Professional Documents
Culture Documents
Image Denoising
Image Denoising
Image Denoising
Abstract ever, for object tracking, which does not require all of the de-
tailed edge part, an edge detection algorithm with a flexible
A novel method for edge component detection based on im- edge size is necessary. The use of a flexible edge size method
age power spectrum sparsity is presented. The edge size can enables the amount of data to be stored to be dramatically
be varied by changing the block size and threshold parame- reduced. Thus, in this paper, we propose a flexible edge com-
ter to obtain the desired edge component. The image is first ponent detection algorithm. The basic idea of the proposed
divided into sub-blocks and the power spectrum sparsity for method is to detect the edge component block by block in the
each sub-block is calculated. On the basis of the image power frequency domain using the image power spectrum sparsity
spectrum sparsity value, each block is verified by the thresh- by changing the block size and threshold parameter. The aim
old value to determine the edge component. The experimen- of this paper is (i) to introduce a novel edge detection com-
tal results show that the proposed method is suitable for ob- ponent method in which a novel concept named image power
ject tracking because of the novel feature of the flexible edge spectrum sparsity is used and (ii) to show that the edge size is
size, which can dramatically reduce the amount of data to be flexible so that the amount of data to be stored is significantly
stored. reduced.
The paper is organized as follows. Section 2 describes de-
1. Introduction tails of the proposed method. Section 3 discusses the experi-
mental results and conclusions are given in Section 4.
Image edge detection is a fundamental tool that plays an
important role in image processing, machine vision and com-
2. Proposed Method
puter vision. The image edge comprises the sharp changes
in brightness that make up the discontinuities of the image. In our proposed method, we measure the edge component
The discontinuities and changes describe image boundaries block by block. Firstly, the input image x(u, v) with the size
that reveal the important features of the image. Image edge of 256 × 256 is divided into n × n sub-blocks, x(j,k) (u, v)
detection dramatically reduces the amount of information to where (j, k = 1, 2, ..., n), with the desired window size
store as it filters out useless information and preserves impor- (M = 2, 4, 8 and n = 256/M ). Each sub-block x(j,k) (u, v)
tant features useful for image segmentation, object recogni- is transformed into the frequency domain, X(j,k) (u, v), by
tion and object tracking. A number of edge detectors based fast Fourier transform (FFT). The power spectrum for each
on a single derivative such as the Roberts operator, Sobel op- sub-block is calculated as
erator, Prewitt operator and Canny operator have been devel-
oped by various researchers [1]. There are also edge detectors P(j,k) (u, v) = |X(j,k) (u, v)|2 (1)
based on a second derivative, such as the Laplacian opera-
tor and Laplacian of Gaussian (LOG) operator. Among these Figure 1 shows (a) the input image divided into 64 × 64 sub-
edge detectors, the Canny operator is the optimal operator blocks with the window size of M = 4 and (b) power spec-
that can detect true edge points with the minimum error. The trum of each sub-block in (a).
Canny operator guarantees edge detection with three perfor-
mance criteria: (i) good detection, (ii) good localization and 2.1 Power spectrum sparsity
(iii) only one response to a single edge [3]. Edge detection
algorithms based on artificial neural networks are also being After determining the power spectrum for each sub-block,
developed to fulfill the increasing requirements of the accu- it is necessary to define the edge component for each image
racy of algorithms in image processing fields [4]. power spectrum sub-block. In Fig. 1(b), it can be seen that the
All of the edge detection algorithms mentioned above can edge component of the power spectrum sub-block has more
be used to detect an image edge with a fixed edge size. How- image frequencies than a flat component, which does not have
any image edge component. Therefore, by estimating the 2.2 Edge component determination by thresholding
number of image frequencies contained in the sub-block, the In order to determine the edge component for the whole
image edge can be calculated. To obtain the number of fre- image, a simple threshold is calculated as
quencies contained in the sub-block, the idea of power spec-
trum sparsity, S, introduced in [2] is applied. The power spec- T H = t × minS (3)
trum sparsity for each block is calculated as
where minS represents the smallest S value of the image
PD(j,k) (u, v) sub-block for the whole image. t is the threshold parameter,
S(j,k) (u, v) = (2) which is selected in accordance with the image type. The
PDh(j,k) (u, v) + PDv(j,k) (u, v)
image edge component is obtained as
where PD(j,k) (u, v), PDh(j,k) (u, v) and PDv(j,k) (u, v) rep-
resent the sum of the whole sub-block region, the horizon- x Max(x(u, v)), S(j,k) (u, v) ≤ T H
(j,k) (u, v) =
tal region and the vertical region of the image power spec- 255 − Max(x(u, v)), S(j,k) (u, v) > T H
trum of the corresponding sub-block, respectively, as shown (4)
in Fig. 2. The image power spectrum sparsity S gives the A sub-block whose S value is less than or equal to T H is
number of image frequencies contained in the image. For the defined as the edge component by assigning the maximum
image sub-block, S is maximum when it contains no image intensity value, and a sub-block whose S value is greater than
frequency components in the horizontal or vertical region of T H is defined as the non edge component by subtracting the
the image power spectrum sub-block or when the image sub- maximum intensity value from 255. Finally, the image edge
block is flat with the same texture [2]. In other words, when component is obtained.
(a)Original image (b)Sobel [4] J. Gu, Y. Pan and H. Wang: Research on the improvement
of image edge detection algorithm based on artificial neu-
ral network, Optik 126, pp. 2974-2978, 2015.
(c)Prewitt (d)Canny
(g)Proposed (M = 8, t = 10)
References