About this Journal Submit a Manuscript Table of Contents 
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 325785, 26 pages
doi:10.1155/2012/325785
Research Article

Fractional Directional Differentiation and Its Application for Multiscale Texture Enhancement

Chaobang Gao,1 Jiliu Zhou,2 and Weihua Zhang2

1College of Information Science and Technology, Chengdu University, Chengdu 610106, China
2School of Computer Science, Sichuan University, Chengdu 610064, China

Received 11 June 2012; Revised 24 July 2012; Accepted 26 July 2012

Academic Editor: Kwok-Wo Wong

Copyright © 2012 Chaobang Gao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

This paper derives the directional derivative expression of Taylor formula for two-variable function from Taylor formula of one-variable function. Further, it proposes a new concept, fractional directional differentiation (FDD), and corresponding theories. To achieve the numerical calculation, the paper deduces power series expression of FDD. Moreover, the paper discusses the construction of FDD mask in the four quadrants, respectively, for digital image. The differential coefficients of every direction are not the same along the eight directions in the four quadrants, which is the biggest difference by contrast to general fractional differentiation and can reflect different fractional change rates along different directions, and this benefits to enlarge the differences among the image textures. Experiments show that, for texture-rich digital images, the capability of nonlinearly enhancing comprehensive texture details by FDD is better than those by the general fractional differentiation and Butterworth filter. By quantity analysis, it shows that state-of-the-art effect of texture enhancement is obtained by FDD.

1. Introduction

Fractional differentiation, also called noninteger differentiation, is not a new concept: it dates back to Cauchy, Riemann, Liouville, and Letnikov in the 19th century. Then, several theoretical physicists and mathematicians have studied fractional differential equations, especially fractional-order linear differential equations and fractional differential equations with delay [1–5], also fractional equations of fractional variational problems [6, 7]. In comparison with integer-order differentiation, the fractional differentiation of direct current or low frequency signal is often nonzero. Fractional differential processing is not only nonlinearly keeping signal's low-frequency and direct current components, but also nonlinearly enhancing the signal's high-frequency and middle-frequency components [8]. Therefore, special Mach's phenomenon appears in fractional differentiation of image. Moreover, it has a special bionic vision receptive field model for fractional differential antagonism characteristics [9, 10]. Based on the special characteristics of fractional differentiation, in the last two decades, fractional differentiation has played a very important role in various physical sciences fields, such as mechanics, electricity, chemistry, biology, economics, time and frequency domains, system identification, notably control theory, mechatronics, and robotics [9, 11, 12]. Recently, fractal theory has already been used in fractal image processing [13–16].

In image processing, texture enhancement is an important issue in many areas like pattern recognition, image restoration, medical imaging processing, robotics, interpretation of image data, and remote sensing. But, to our knowledge, only a few reliable methods focus on texture enhancing. Texture enhancement often makes use of integer-order differential operators, especially 1 -order used by the gradient and 2 -order by the Laplacian. In [13–16], the principles of fractional differential operators in image processing are introduced with implementation of fractional differential masks. But these fractional differential masks have a common flaw which the fractional differential coefficients of every direction are always the same along the eight directions in the image plane, which is not conducive to reflect the different change rates of the image along different directions and is not benefitial to enlarge the differences among textures. Based on this, we introduce the concept of directional derivative to fractional differentiation and propose a new mathematical method, fractional directional differentiation (FDD), and then try to employ it to image processing, particularly to comprehensive fractal-like texture-details enhancement. Furthermore, by taking the approximations of power series expression of FDD, we propose four novel FDD masks and corresponding numerical calculation rules. The fractional differential coefficients along the eight directions in the image plane are not the same, which can reflect different fractional change rates along different directions and is benefit to enlarge the differences among the image textures. Thus, this can lead to texture enhancement. Experiments show that FDD can effectively enhance texture details of image and has a greater calculation range than that of fractional differential for texture-enhancing.

This paper is organized as follows. Section 2 first recalls on the necessary theoretical background of directional derivative and the main definitions of Riemann-Liouville in Euclidean space. According to Taylor formula of one-variable function, we deduce the directional derivative expression of Taylor formula for two-variable function, give the definition of FDD, and further deduce power series expression of FDD. Section 3 deals with and gives four FDD masks and their calculation rules. Section 4 reports the nonlinearly enhancing capability of texture details based on FDD. By calculating five classical parameters from gray-level cooccurrence matrix in particular, information entropy, average gradient and projection of gray-level, we implement quantity analysis.

2. Theory of FDD

2.1. Directional Derivative

Assume that 𝑧 = 𝑓 ( 𝑥 , 𝑦 ) is defined in the neighborhood 𝐷 . Find the line which passes through 𝑀 0 ( 𝑥 0 , 𝑦 0 ) and parallels to 𝑙 as follows: 𝑥 − 𝑥 0 = c o s 𝛼 𝑦 − 𝑦 0 s i n 𝛼 = 𝑡 , 𝑙 = ( c o s 𝛼 , s i n 𝛼 ) , ( 2 . 1 ) where 𝛼 is the direction angle. Let 𝑀 ( 𝑥 0 + Δ 𝑥 , 𝑦 0 + Δ 𝑦 ) satisfy (2.1) and ℎ = s g n ( 𝑡 ) ⋅ 𝑀 0 𝑀 . If we take the direction of the vector 𝑀 0 𝑀 the same as 𝑙 , then 𝑡 > 0 , ℎ > 0 , otherwise, 𝑡 < 0 , ℎ < 0 , that is to say, ℎ changes along the positive or negative direction of 𝑙 . If the limit l i m ℎ → 0 𝑓 𝑀 ( 𝑀 ) − 𝑓 0 ℎ ( 2 . 2 ) exists, then (2.2) is called the directional derivative of 𝑓 ( 𝑥 , 𝑦 ) along the direction 𝑙 at 𝑀 0 , write 𝜕 𝑓 ( 𝑀 0 ) / 𝜕 𝑙 , which denotes the slope of tangent line at 𝑀 0 for the plane curve 𝑧 = 𝑓 ( 𝑥 , 𝑦 ) 𝑥 − 𝑥 0 = c o s 𝛼 𝑦 − 𝑦 0 s i n 𝛼 ( 2 . 3 ) and the geometric meaning is the same as general derivative.

It is well known, the sufficient condition which (2.2) exists is that 𝑓 ( 𝑥 , 𝑦 ) has continuous partial derivatives of first order in the neighborhood 𝐷 at the point 𝑀 0 and 𝑀 𝜕 𝑓 0 = 𝑀 𝜕 𝑙 𝜕 𝑓 0 𝑀 𝜕 𝑥 c o s 𝛼 + 𝜕 𝑓 0 𝜕 𝑦 s i n 𝛼 . ( 2 . 4 ) Clearly, for any 𝑀 0 ( 𝑥 0 , 𝑦 0 ) in 𝐷 , 𝜕 𝑓 ( 𝑀 0 ) / 𝜕 𝑙 is the function with respect to 𝑥 and 𝑦 , that is, 𝜕 𝑓 ( 𝑥 , 𝑦 ) = 𝜕 𝑙 𝜕 𝑓 ( 𝑥 , 𝑦 ) 𝜕 𝑥 c o s 𝛼 + 𝜕 𝑓 ( 𝑥 , 𝑦 ) 𝜕 𝑦 s i n 𝛼 . ( 2 . 5 ) If 𝑓 ( 𝑥 , 𝑦 ) exists continuous partial derivatives of second order in the neighborhood 𝐷 , making the direction 𝑙 fixed and by (2.5), we obtain 𝜕 2 𝑓 𝜕 𝑙 2 = 𝜕 2 𝑓 𝜕 𝑥 2 c o s 2 𝜕 𝛼 + 2 2 𝑓 𝜕 𝜕 𝑥 𝜕 𝑦 s i n 𝛼 c o s 𝛼 + 2 𝑓 𝜕 𝑦 2 s i n 2 𝜕 𝛼 ≜ c o s 𝛼 𝜕 𝜕 𝑥 + s i n 𝛼 𝜕 𝑦 2 𝑓 ( 𝑥 , 𝑦 ) . ( 2 . 6 ) Thus (2.6) is called the second order directional derivative of 𝑓 ( 𝑥 , 𝑦 ) along the direction 𝑙 at 𝑀 .

Similarly, if 𝑓 ( 𝑥 , 𝑦 ) exists 𝑛 + 1 order continuous partial derivatives in 𝐷 , we can define the 𝑘 -order directional derivative of 𝑓 ( 𝑥 , 𝑦 ) along the direction 𝑙 at 𝑀 as follows: 𝜕 𝑘 𝑓 𝜕 𝑙 𝑘 = 𝜕 c o s 𝛼 𝜕 𝜕 𝑥 + s i n 𝛼 𝜕 𝑦 𝑘 𝑓 ( 𝑥 , 𝑦 ) , 𝑘 = 1 , 2 , … , 𝑛 , 𝑛 + 1 . ( 2 . 7 )

2.2. Directional Derivative Expression of Taylor Formula for Two-Variable Function

In [17], the author deduced the Taylor series expansion of multivariable function and gave its conditions of convergence. On this basis, we will further derive the directional derivative expression of Taylor formula for multi-variable function. In this paper, we only discuss two-variable function. Actually, for multi-variable function, it is similar to two-variable function.

Let 𝑓 ( 𝑥 , 𝑦 ) have 𝑛 + 1 order continuous partial derivatives in 𝐷 , then (2.7) holds and we call that 𝑑 𝑘 𝜕 𝑓 = Δ 𝑥 𝜕 𝜕 𝑥 + Δ 𝑦 𝜕 𝑦 𝑘 𝑓 ( 𝑥 , 𝑦 ) , 𝑘 = 1 , … , 𝑛 + 1 , ( 2 . 8 ) is the 𝑘 - order ( 𝑘 ∈ 𝑍 ) differentiation of 𝑓 ( 𝑥 , 𝑦 ) , thus the Taylor formula of 𝑓 ( 𝑥 , 𝑦 ) can be expressed as follows: 𝑥 𝑓 ( 𝑥 , 𝑦 ) = 𝑓 0 , 𝑦 0 1 + 𝑑 𝑓 + 𝑑 2 ! 2 1 𝑓 + ⋯ + 𝑑 𝑛 ! 𝑛 1 𝑓 + 𝑑 ( 𝑛 + 1 ) ! 𝑛 + 1 𝑓 𝑥 0 + 𝜃 Δ 𝑥 , 𝑦 0 , + 𝜃 Δ 𝑦 ( 2 . 9 ) where 0 < 𝜃 < 1 . Now let c o s 𝛼 = Δ 𝑥 / ℎ , s i n 𝛼 = Δ 𝑦 / ℎ , ℎ = s g n ( 𝑡 ) ⋅ 𝑀 0 𝑀 , that is, when 𝑡 > 0 , ℎ = 𝑀 0 𝑀 , and when 𝑡 < 0 , ℎ = − 𝑀 0 𝑀 . Clearly, (2.8) becomes 𝑑 𝑘 𝑓 = ℎ 𝑘 Δ 𝑥 ℎ 𝜕 + 𝜕 𝑥 Δ 𝑦 ℎ 𝜕 𝜕 𝑦 𝑘 𝑓 ( 𝑥 , 𝑦 ) = ℎ 𝑘 𝜕 𝑘 𝑓 𝜕 𝑙 𝑘 , 𝑘 = 1 , 2 , … , 𝑛 + 1 . ( 2 . 1 0 ) Taking (2.10) into (2.9), we get 𝑥 𝑓 ( 𝑥 , 𝑦 ) = 𝑓 0 , 𝑦 0 + ℎ 𝜕 𝑓 + ℎ 𝜕 𝑙 2 𝜕 2 ! 2 𝑓 𝜕 𝑙 2 ℎ + ⋯ + 𝑛 𝜕 𝑛 ! 𝑛 𝑓 𝜕 𝑙 𝑛 + ℎ 𝑛 + 1 𝜕 ( 𝑛 + 1 ) ! 𝑛 + 1 𝑓 𝑥 0 + 𝜃 Δ 𝑥 , 𝑦 0 + 𝜃 Δ 𝑦 𝜕 𝑙 𝑛 + 1 , 0 < 𝜃 < 1 . ( 2 . 1 1 ) Equation (2.11) is called the directional derivative expression of Taylor formula for 𝑓 ( 𝑥 , 𝑦 ) . Compared with Taylor formula of one-variable function, they have a unified form.

2.3. Fractional Differentiation

If the signal 𝑓 ( 𝑡 ) has 𝑛 + 1 order continuous derivatives and 𝑛 is at least [ 𝑣 ] = 𝑚 − 1 ( 𝑣 ∈ 𝑅 , 𝑚 ∈ 𝑍 ) , where [ 𝑣 ] denotes the greatest integer and is less than or equal to 𝑣 , then the definitions of fractional calculus based on Grumwald-letnikov and Riemann-Liouville [4] are equivalent. Otherwise, the latter is an expansion of the former with wider applications [10]. Though the definition of fractional calculus based on Riemann-Liouville is more common, few studies involve in its numerical solution. Currently, more researches still focus on the numerical solution of fractional calculus based on Grumwald-Letnikov [10, 13–15, 18]. It is well-known that 𝑣 -order fractional integral based on Riemann-Liouville can be expressed as follows [1]: 𝑅 0 𝐼 𝑣 𝑥 1 𝑓 ( 𝑥 ) = Γ ( 𝑣 ) 𝑥 0 ( 𝑥 − 𝑡 ) 𝑣 − 1 𝑓 ( 𝑡 ) 𝑑 𝑡 , ( 2 . 1 2 ) where 𝑓 ( 𝑥 ) is continuous in [ 0 , 𝑥 ) , and 𝑣 is a positive real number.

On the basis of fractional integral, 𝑣 -order fractional differentiation based on Riemann-Liouville, write 𝑅 0 𝐷 𝑣 𝑥 , can be defined. In fact, the 𝑣 -order differential operator 𝑅 0 𝐷 𝑣 𝑥 can be viewed as 𝑅 0 𝐼 𝑥 − 𝑣 . Let − 𝑣 = − 𝑘 + 𝑟 , where 𝑘 = [ 𝑣 ] + 1 , 𝑟 = [ 𝑣 ] + 1 − 𝑣 . Obviously, 0 < 𝑟 < 1 and 𝑘 − 1 < 𝑣 < 𝑘 . Thus, 𝑣 -order differentiation of 𝑓 ( 𝑥 ) is 𝑅 0 𝐷 𝑣 𝑥 𝑓 ( 𝑥 ) = 𝑅 0 𝐼 𝑥 − 𝑣 𝑓 ( 𝑥 ) = 𝑅 0 𝐼 𝑥 − 𝑘 + 𝑟 𝑓 ( 𝑥 ) = 𝑅 0 𝐼 𝑥 − 𝑘 ⋅ 𝑅 0 𝐼 𝑟 𝑥 = 𝑑 𝑓 ( 𝑥 ) 𝑑 𝑥 𝑘 1 Γ ( 𝑟 ) 𝑥 0 ( 𝑥 − 𝑡 ) 𝑟 − 1 . 𝑓 ( 𝑡 ) 𝑑 𝑡 ( 2 . 1 3 ) Equation (2.13) shows obviously that the calculation of 𝑣 -order fractional differentiation based on Riemann-Liouville need to first find 𝑟 -order fractional integral, and then seek general 𝑘 -order derivative. Note that 𝑅 0 𝐼 𝑥 − 𝑘 and 𝑅 0 𝐼 𝑟 𝑥 must keep their order, which means that we must first find integral, then do derivative.

2.4. FDD of Two-Variable Function

In (2.11), when the direction 𝑙 is fixed at any point 𝑀 ( 𝑥 , 𝑦 ) , ℎ is a variable number along 𝑙 . Thus, (2.11) can be seen as a function with respect to the variable ℎ and denotes the variety of 𝑓 ( 𝑥 , 𝑦 ) along the direction 𝑙 at 𝑀 ( 𝑥 , 𝑦 ) . With the change of direction 𝑙 , (2.11) denotes the variety of 𝑓 ( 𝑥 , 𝑦 ) along different directions at 𝑀 ( 𝑥 , 𝑦 ) . In order to quantify the variety of 𝑓 ( 𝑥 , 𝑦 ) in a certain direction 𝑙 at the point 𝑀 ( 𝑥 , 𝑦 ) , find fractional differentiation ( 𝑣 -order) of (2.11) as follows: 𝑅 0 𝐷 𝑣 ℎ 𝑓 ( 𝑥 , 𝑦 ) = 𝑛 𝑘 = 0 1 𝜕 𝑘 ! 𝑘 𝑓 𝜕 𝑙 𝑘 𝑅 0 𝐷 𝑣 ℎ ℎ 𝑘 + 1 𝜕 ( 𝑛 + 1 ) ! 𝑛 + 1 𝑓 𝑥 0 + 𝜃 Δ 𝑥 , 𝑦 0 + 𝜃 Δ 𝑦 𝜕 𝑙 𝑅 0 𝑛 + 1 𝐷 𝑣 ℎ ℎ 𝑛 + 1 , ( 2 . 1 4 ) where 0 < 𝜃 < 1 . Equation (2.14) denotes just the fractional measurement of the variety of 𝑓 ( 𝑥 , 𝑦 ) along the direction 𝑙 at 𝑀 0 ( 𝑥 0 , 𝑦 0 ) . Equation (2.14) is called fractional directional differentiation (FDD) of 𝑓 ( 𝑥 , 𝑦 ) along the direction 𝑙 at 𝑀 0 ( 𝑥 0 , 𝑦 0 ) . Thus, the FDD depicts a fractional change rate of 𝑓 ( 𝑥 , 𝑦 ) along the direction 𝑙 at any point 𝑀 ( 𝑥 , 𝑦 ) .

3. FDD Mask and Algorithm

There are many studies on numerical calculation of fractional differentiation [1, 13, 16, 18]. Similarly, we need to discuss numerical calculation of FDD. To implement numerical calculation of (2.14), we first seek its power series expression. According to [18], 𝑅 0 𝐷 𝑣 ℎ ℎ 𝑢 ( 𝑢 > − 1 ) can be induced as follows: 𝑅 0 𝐷 𝑣 ℎ ℎ 𝑢 = 𝑅 0 𝐼 ℎ − 𝑣 ℎ 𝑢 = 𝑅 0 𝐼 ℎ 𝑅 0 − 𝑘 𝐼 𝑟 ℎ ℎ 𝑢 = 𝑑 𝑑 ℎ 𝑘 1 Γ ( 𝑟 ) ℎ 0 ( ℎ − 𝑡 ) 𝑟 − 1 𝑡 𝑢 𝑑 𝑡 𝑦 = 𝑡 / ℎ = 𝑑 𝑑 ℎ 𝑘 ℎ 𝑢 + 𝑟 Γ ( 𝑟 ) 1 0 ( 1 − 𝑦 ) 𝑟 − 1 𝑦 𝑢 = 𝑑 𝑑 𝑦 𝑑 ℎ 𝑘 ℎ 𝑢 + 𝑟 = 𝑑 Γ ( 𝑟 ) 𝐵 ( 𝑟 , 𝑢 + 1 ) 𝑑 ℎ 𝑘 ℎ 𝑢 + 𝑟 Γ ( 𝑟 ) Γ ( 𝑟 ) Γ ( 𝑢 + 1 ) = Γ ( 𝑢 + 𝑟 + 1 ) Γ ( 𝑢 + 1 ) 𝑑 Γ ( 𝑢 + 𝑟 + 1 ) 𝑑 ℎ 𝑘 ℎ 𝑢 + 𝑟 = Γ ( 𝑢 + 1 ) Γ ( 𝑢 + 𝑟 + 1 ) Γ ( 𝑢 + 𝑟 + 1 ) Γ ℎ ( 𝑢 + 𝑟 − 𝑘 + 1 ) 𝑢 + 𝑟 − 𝑘 = Γ ( 𝑢 + 1 ) ℎ Γ ( 𝑢 − 𝑣 + 1 ) 𝑢 − 𝑣 , ( 3 . 1 ) where 𝐵 ( 𝑥 , 𝑦 ) is the Beta function, and 𝑛 − 1 < 𝑣 < 𝑛 , 𝑛 is an integer. Taking (3.1) into (2.14), we obtain 𝑅 0 𝐷 𝑣 ℎ 𝑓 ( 𝑥 , 𝑦 ) = ∞ 𝑛 = 0 1 𝜕 Γ ( 𝑛 − 𝑣 + 1 ) 𝑛 𝑓 𝜕 𝑙 𝑛 ℎ 𝑛 − 𝑣 . ( 3 . 2 ) Thus, (3.2) is the power series expression of FDD for 𝑓 ( 𝑥 , 𝑦 ) .

Since the processing data of computer or digital filter is digital and finite, the maximum variety of image's grayscale is also finite. The shortest neighborhood distance between pixels can achieve only one pixel [13, 16]. Therefore, the measurement for duration of two-dimensional digital image on 𝑥 -coordinate or 𝑦 -coordinate must take pixel as unit, and the minimum division must be Δ 𝑥 = 1 , Δ 𝑦 = 1 , and since c o s 𝛼 = Δ 𝑥 / ℎ or s i n 𝛼 = Δ 𝑦 / ℎ , it has Δ 𝑥 = ℎ c o s 𝛼 , Δ 𝑦 = ℎ s i n 𝛼 . ( 3 . 3 )

Next, we will implement numerical calculation and seek the masks of FDD in four quadrants, respectively. In the first quadrant, the forward differences of 𝜕 𝑓 / 𝜕 𝑥 , 𝜕 𝑓 / 𝜕 𝑦 , 𝜕 2 𝑓 / 𝜕 𝑥 2 , 𝜕 2 𝑓 / 𝜕 𝑦 2 , and 𝜕 2 𝑓 / 𝜕 𝑥 𝜕 𝑦 can be expressed as: 𝑥 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑥 ≈ 𝑓 0 + 1 , 𝑦 0 𝑥 − 𝑓 0 , 𝑦 0 , 𝑥 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑦 ≈ 𝑓 0 , 𝑦 0 𝑥 + 1 − 𝑓 0 , 𝑦 0 , 𝜕 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑥 2 𝑥 ≈ 𝑓 0 + 2 , 𝑦 0 𝑥 − 2 𝑓 0 + 1 , 𝑦 0 𝑥 + 𝑓 0 , 𝑦 0 , 𝜕 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑦 2 𝑥 ≈ 𝑓 0 , 𝑦 0 𝑥 + 2 − 2 𝑓 0 , 𝑦 0 𝑥 + 1 + 𝑓 0 , 𝑦 0 , 𝜕 2 𝑓 𝑥 0 , 𝑦 0 𝑥 𝜕 𝑥 𝜕 𝑦 ≈ 𝑓 0 + 1 , 𝑦 0 𝑥 + 1 − 𝑓 0 + 1 , 𝑦 0 𝑥 − 𝑓 0 , 𝑦 0 𝑥 + 1 + 𝑓 0 , 𝑦 0 . ( 3 . 4 ) Taking (3.4) into (3.2) and by (2.7), (3.3), when 𝑛 = 2 in (3.2), we get 𝑅 0 𝐷 𝑣 ℎ 𝑓 𝑥 0 , 𝑦 0 ≈ ℎ − 𝑣 𝑓 𝑥 Γ ( 1 − 𝑣 ) 0 , 𝑦 0 + ℎ 1 − 𝑣 𝑥 Γ ( 2 − 𝑣 ) 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑥 c o s 𝛼 + 𝜕 𝑓 0 , 𝑦 0 + ℎ 𝜕 𝑦 s i n 𝛼 2 − 𝑣 𝜕 Γ ( 3 − 𝑣 ) 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑥 2 c o s 2 𝜕 𝛼 + 2 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝜕 𝑥 𝜕 𝑦 s i n 𝛼 c o s 𝛼 + 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑦 2 s i n 2 𝛼 = ℎ − 𝑣 𝑓 𝑥 Γ ( 1 − 𝑣 ) 0 , 𝑦 0 + ℎ 1 − 𝑣 𝑓 𝑥 Γ ( 2 − 𝑣 ) 0 + 1 , 𝑦 0 ℎ c o s 𝛼 − 1 − 𝑣 𝑓 𝑥 Γ ( 2 − 𝑣 ) 0 , 𝑦 0 + ℎ c o s 𝛼 1 − 𝑣 𝑓 𝑥 Γ ( 2 − 𝑣 ) 0 , 𝑦 0 ℎ + 1 s i n 𝛼 − 1 − 𝑣 𝑓 𝑥 Γ ( 2 − 𝑣 ) 0 , 𝑦 0 + ℎ s i n 𝛼 2 − 𝑣 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 + 2 , 𝑦 0 c o s 2 ℎ 𝛼 − 2 2 − 𝑣 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 + 1 , 𝑦 0 c o s 2 𝛼 + ℎ 2 − 𝑣 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 c o s 2 ℎ 𝛼 + 2 2 − 𝑣 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 + 1 , 𝑦 0 ℎ + 1 s i n 𝛼 c o s 𝛼 − 2 2 − 𝑣 Γ 𝑓 𝑥 ( 3 − 𝑣 ) 0 + 1 , 𝑦 0 ℎ s i n 𝛼 c o s 𝛼 − 2 2 − 𝑣 Γ 𝑓 𝑥 ( 3 − 𝑣 ) 0 , 𝑦 0 ℎ + 1 s i n 𝛼 c o s 𝛼 + 2 2 − 𝑣 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 ℎ s i n 𝛼 c o s 𝛼 + 2 − 𝑣 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 + 2 s i n 2 𝛼 ℎ − 2 2 − 𝑣 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 + 1 s i n 2 ℎ 𝛼 + 2 − 𝑣 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 s i n 2 𝛼 = ℎ − 𝑣 − ℎ Γ ( 1 − 𝑣 ) 1 − 𝑣 c o s 𝛼 + ℎ 1 − 𝑣 s i n 𝛼 + ℎ Γ ( 2 − 𝑣 ) 2 − 𝑣 c o s 2 𝛼 + 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 + ℎ 2 − 𝑣 s i n 2 𝛼 𝑥 Γ ( 3 − 𝑣 ) × 𝑓 0 , 𝑦 0 + ℎ 1 − 𝑣 c o s 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 c o s 2 𝛼 + 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 + 1 , 𝑦 0 + ℎ 2 − 𝑣 c o s 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 + 2 , 𝑦 0 + ℎ 1 − 𝑣 s i n 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 + 2 ℎ 2 − 𝑣 s i n 2 𝛼 𝑥 Γ ( 3 − 𝑣 ) × 𝑓 0 , 𝑦 0 + + 1 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 + 1 , 𝑦 0 + ℎ + 1 2 − 𝑣 s i n 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 . + 2 ( 3 . 5 ) Let 𝑎 1 0 = ℎ − 𝑣 − ℎ Γ ( 1 − 𝑣 ) 1 − 𝑣 c o s 𝛼 + ℎ 1 − 𝑣 s i n 𝛼 + ℎ Γ ( 2 − 𝑣 ) 2 − 𝑣 c o s 2 𝛼 + 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 + ℎ 2 − 𝑣 s i n 2 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 1 1 = ℎ 1 − 𝑣 c o s 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 c o s 2 𝛼 + 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 1 2 = ℎ 2 − 𝑣 c o s 2 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 1 3 = ℎ 1 − 𝑣 s i n 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 + 2 ℎ 2 − 𝑣 s i n 2 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 1 4 = 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 1 5 = ℎ 2 − 𝑣 s i n 2 𝛼 . Γ ( 3 − 𝑣 ) ( 3 . 6 ) Then, (3.5) becomes 𝑅 0 𝐷 𝑣 ℎ 𝑓 𝑥 0 , 𝑦 0 ≈ 𝑎 1 0 𝑓 𝑥 0 , 𝑦 0 + 𝑎 1 1 𝑓 𝑥 0 + 1 , 𝑦 0 + 𝑎 1 2 𝑓 𝑥 0 + 2 , 𝑦 0 + 𝑎 1 3 𝑓 𝑥 0 , 𝑦 0 + 1 + 𝑎 1 4 𝑓 𝑥 0 + 1 , 𝑦 0 + 1 + 𝑎 1 5 𝑓 𝑥 0 , 𝑦 0 . + 2 ( 3 . 7 ) Equation (3.7) indicates that it has a 3 × 3 mask when 𝑛 = 2 , write FDD-1, shown in Figure 1.

325785.fig.001
Figure 1: Mask FDD-1.

In the first quadrant, we choose three direction angles 𝛼 = 0 , 𝜋 / 4 , and 𝜋 / 2 to calculate the coefficients (3.6) of the mask FDD-1.(i) For 𝛼 = 0 , let ℎ change strictly along the positive direction of 𝑙 = ( 1 , 0 ) in the image plane, therefore ℎ > 0 and we can find the FDD at ℎ = 1 . By (3.3), we have ℎ c o s 𝛼 = 1 , ℎ s i n 𝛼 = 0 . Thus, the coefficients (3.6) of the mask FDD-1 becomes 𝑎 1 0 = 1 Γ − 1 ( 1 − 𝑣 ) Γ + 1 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 1 1 = 1 Γ − 2 ( 2 − 𝑣 ) Γ , 𝑎 ( 3 − 𝑣 ) 1 2 = 1 Γ ( 3 − 𝑣 ) , 𝑎 1 3 = 0 , 𝑎 1 4 = 0 , 𝑎 1 5 = 0 . ( 3 . 8 ) (ii) For 𝛼 = 𝜋 / 4 , let ℎ change always along the positive direction of √ 𝑙 = ( √ 2 / 2 , 2 / 2 ) in the image plane, therefore ℎ > 0 and FDD can be found at √ ℎ = 2 . By (3.3), we have ℎ c o s 𝛼 = 1 , ℎ s i n 𝛼 = 1 . Thus the coefficients (3.6) of the mask FDD-1 are as follows: 𝑎 1 0 = √ 2 − 𝑣 − 2 √ Γ ( 1 − 𝑣 ) 2 − 𝑣 + 4 √ Γ ( 2 − 𝑣 ) 2 − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 1 1 = √ 2 − 𝑣 − 4 √ Γ ( 2 − 𝑣 ) 2 − 𝑣 , 𝑎 Γ ( 3 − 𝑣 ) 1 2 = √ 2 − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 1 3 = √ 2 − 𝑣 − 4 √ Γ ( 2 − 𝑣 ) 2 − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 1 4 = 2 √ 2 − 𝑣 , 𝑎 Γ ( 3 − 𝑣 ) 1 5 = √ 2 − 𝑣 . Γ ( 3 − 𝑣 ) ( 3 . 9 ) (iii) For 𝛼 = 𝜋 / 2 , let ℎ change always along the positive direction of 𝑙 = ( 0 , 1 ) in the image plane, therefore ℎ > 0 and we can find the FDD at ℎ = 1 . By (3.3), we have ℎ c o s 𝛼 = 0 , ℎ s i n 𝛼 = 1 . Thus the coefficients (3.6) of the mask FDD-1 are equal to 𝑎 1 0 = 1 Γ − 1 ( 1 − 𝑣 ) Γ + 1 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 1 1 = 0 , 𝑎 1 2 𝑎 = 0 , 1 3 = 1 Γ − 2 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 1 4 = 0 , 𝑎 1 5 = 1 Γ . ( 3 − 𝑣 ) ( 3 . 1 0 )

Similarly, in the second quadrant, the backward difference on the negative 𝑥 -coordinate and forward difference on the positive 𝑦 -coordinate of 𝜕 𝑓 / 𝜕 𝑥 , 𝜕 𝑓 / 𝜕 𝑦 , 𝜕 2 𝑓 / 𝜕 𝑥 2 , 𝜕 2 𝑓 / 𝜕 𝑦 2 , and 𝜕 2 𝑓 / 𝜕 𝑥 𝜕 𝑦 are expressed as follows: 𝑥 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑥 ≈ 𝑓 0 , 𝑦 0 𝑥 − 𝑓 0 − 1 , 𝑦 0 , 𝑥 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑦 ≈ 𝑓 0 , 𝑦 0 𝑥 + 1 − 𝑓 0 , 𝑦 0 , 𝜕 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑥 2 𝑥 ≈ 𝑓 0 , 𝑦 0 𝑥 − 2 𝑓 0 − 1 , 𝑦 0 𝑥 + 𝑓 0 − 2 , 𝑦 0 , 𝜕 2 𝑓 𝑥 0 , 𝑦 0 𝑥 𝜕 𝑥 𝜕 𝑦 ≈ 𝑓 0 , 𝑦 0 𝑥 + 1 − 𝑓 0 − 1 , 𝑦 0 𝑥 + 1 − 𝑓 0 , 𝑦 0 𝑥 + 𝑓 0 − 1 , 𝑦 0 , 𝜕 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑦 2 𝑥 ≈ 𝑓 0 , 𝑦 0 𝑥 + 2 − 2 𝑓 0 , 𝑦 0 𝑥 + 1 + 𝑓 0 , 𝑦 0 . ( 3 . 1 1 ) Taking (3.11) into (3.2) and by (2.7), (3.3), where 𝑛 = 2 in (3.2), after simplification, we get 𝑅 0 𝐷 𝑣 ℎ 𝑓 𝑥 0 , 𝑦 0 ≈ ℎ − 𝑣 𝑓 𝑥 Γ ( 1 − 𝑣 ) 0 , 𝑦 0 + ℎ 1 − 𝑣 𝑥 Γ ( 2 − 𝑣 ) 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑥 c o s 𝛼 + 𝜕 𝑓 0 , 𝑦 0 + ℎ 𝜕 𝑦 s i n 𝛼 2 − 𝑣 𝜕 Γ ( 3 − 𝑣 ) 2 𝑓 𝜕 𝑥 2 c o s 2 𝜕 𝛼 + 2 2 𝑓 𝜕 𝜕 𝑥 𝜕 𝑦 s i n 𝛼 c o s 𝛼 + 2 𝑓 𝜕 𝑦 2 s i n 2 𝛼 = ℎ − 𝑣 + ℎ Γ ( 1 − 𝑣 ) 1 − 𝑣 c o s 𝛼 − ℎ 1 − 𝑣 s i n 𝛼 + ℎ Γ ( 2 − 𝑣 ) 2 − 𝑣 c o s 2 𝛼 − 2 s i n 𝛼 c o s 𝛼 + s i n 2 𝛼 𝑥 Γ ( 3 − 𝑣 ) × 𝑓 0 , 𝑦 0 + − ℎ 1 − 𝑣 c o s 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 c o s 2 𝛼 − 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 − 1 , 𝑦 0 + ℎ 2 − 𝑣 c o s 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 − 2 , 𝑦 0 + ℎ 1 − 𝑣 s i n 𝛼 + Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 − 2 ℎ 2 − 𝑣 s i n 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 − + 1 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 − 1 , 𝑦 0 + ℎ + 1 2 − 𝑣 s i n 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 . + 2 ( 3 . 1 2 ) Let 𝑎 2 0 = ℎ − 𝑣 + ℎ Γ ( 1 − 𝑣 ) 1 − 𝑣 ( c o s 𝛼 − s i n 𝛼 ) + ℎ Γ ( 2 − 𝑣 ) 2 − 𝑣 ( c o s 𝛼 − s i n 𝛼 ) 2 , 𝑎 Γ ( 3 − 𝑣 ) 2 1 ℎ = − 1 − 𝑣 c o s 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 c o s 2 𝛼 − s i n 𝛼 c o s 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 2 2 = ℎ 2 − 𝑣 c o s 2 𝛼 Γ , 𝑎 ( 3 − 𝑣 ) 2 3 = ℎ 1 − 𝑣 s i n 𝛼 + Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 − s i n 2 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 2 4 = − 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 2 5 = ℎ 2 − 𝑣 s i n 2 𝛼 . Γ ( 3 − 𝑣 ) ( 3 . 1 3 ) Then (3.12) can be expressed as 𝑅 0 𝐷 𝑣 ℎ 𝑓 𝑥 0 , 𝑦 0 ≈ 𝑎 2 0 𝑓 𝑥 0 , 𝑦 0 + 𝑎 2 1 𝑓 𝑥 0 − 1 , 𝑦 0 + 𝑎 2 2 𝑓 𝑥 0 − 2 , 𝑦 0 + 𝑎 2 3 𝑓 𝑥 0 , 𝑦 0 + 1 + 𝑎 2 4 𝑓 𝑥 0 − 1 , 𝑦 0 + 1 + 𝑎 2 5 𝑓 𝑥 0 , 𝑦 0 . + 2 ( 3 . 1 4 ) Equation (3.14) indicates that it has a 3 × 3 mask when 𝑛 = 2 , write FDD-2, shown in Figure 2.

325785.fig.002
Figure 2: Mask FDD-2.

Since the mask FDD-2 in Figure 2 denotes the algorithm of FDD along different directions in the second quadrant, we can also take three direction angles 𝛼 = 0 , 𝜋 / 4 , and 𝜋 / 2 to calculate the coefficients (3.13). In fact, the three direction angles in the second quadrant can show the direction angles 𝛼 = 𝜋 / 2 , 3 𝜋 / 4 , and 𝜋 in the image plane. Similar to the calculation of the mask FDD-1's coefficients, the calculation of (3.13) is as follows:(i) When 𝛼 = 0 , we have 𝑎 2 0 = 1 Γ + 1 ( 1 − 𝑣 ) Γ + 1 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 2 1 1 = − Γ − 2 ( 2 − 𝑣 ) Γ , 𝑎 ( 3 − 𝑣 ) 2 2 = 1 Γ ( 3 − 𝑣 ) , 𝑎 2 3 = 0 , 𝑎 2 4 = 0 , 𝑎 2 5 = 0 . ( 3 . 1 5 ) (ii) When 𝛼 = 𝜋 / 4 and by (3.3), we obtain 𝑎 2 0 = √ 2 − 𝑣 Γ ( 1 − 𝑣 ) , 𝑎 2 1 √ = − 2 − 𝑣 Γ ( 2 − 𝑣 ) , 𝑎 2 2 = √ 2 − 𝑣 , 𝑎 Γ ( 3 − 𝑣 ) 2 3 = √ 2 − 𝑣 Γ ( 2 − 𝑣 ) , 𝑎 2 4 2 √ = − 2 − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 2 5 = √ 2 − 𝑣 . Γ ( 3 − 𝑣 ) ( 3 . 1 6 ) (iii) When 𝛼 = 𝜋 / 2 and by (3.3), it has 𝑎 2 0 = 1 Γ − 1 ( 1 − 𝑣 ) Γ + 1 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 2 1 = 0 , 𝑎 2 2 𝑎 = 0 , 2 3 = 1 Γ − 2 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 2 4 = 0 , 𝑎 2 5 = 1 Γ . ( 3 − 𝑣 ) ( 3 . 1 7 )

In the same way, the backward differences of 𝜕 𝑓 / 𝜕 𝑥 , 𝜕 𝑓 / 𝜕 𝑦 , 𝜕 2 𝑓 / 𝜕 𝑥 2 , 𝜕 2 𝑓 / 𝜕 𝑦 2 , and 𝜕 2 𝑓 / 𝜕 𝑥 𝜕 𝑦 in the third quadrant can be expressed as follows: 𝑥 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑥 ≈ 𝑓 0 , 𝑦 0 𝑥 − 𝑓 0 − 1 , 𝑦 0 , 𝑥 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑦 ≈ 𝑓 0 , 𝑦 0 𝑥 − 𝑓 0 , 𝑦 0 , 𝜕 − 1 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑥 2 𝑥 ≈ 𝑓 0 , 𝑦 0 𝑥 − 2 𝑓 0 − 1 , 𝑦 0 𝑥 + 𝑓 0 − 2 , 𝑦 0 , 𝜕 2 𝑓 𝑥 0 , 𝑦 0 𝑥 𝜕 𝑥 𝜕 𝑦 ≈ 𝑓 0 , 𝑦 0 𝑥 − 𝑓 0 − 1 , 𝑦 0 𝑥 − 𝑓 0 , 𝑦 0 𝑥 − 1 + 𝑓 0 − 1 , 𝑦 0 , 𝜕 − 1 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑦 2 𝑥 ≈ 𝑓 0 , 𝑦 0 𝑥 − 2 𝑓 0 , 𝑦 0 𝑥 − 1 + 𝑓 0 , 𝑦 0 . − 2 ( 3 . 1 8 ) Taking (3.18) into (3.2) and by (2.7), (3.3), when 𝑛 = 2 in (3.2), after simplification, we get its approximation 𝑅 0 𝐷 𝑣 ℎ 𝑓 𝑥 0 , 𝑦 0 ≈ ℎ − 𝑣 𝑓 𝑥 Γ ( 1 − 𝑣 ) 0 , 𝑦 0 + ℎ 1 − 𝑣 𝑥 Γ ( 2 − 𝑣 ) 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑥 c o s 𝛼 + 𝜕 𝑓 0 , 𝑦 0 + ℎ 𝜕 𝑦 s i n 𝛼 2 − 𝑣 𝜕 Γ ( 3 − 𝑣 ) 2 𝑓 𝜕 𝑥 2 c o s 2 𝜕 𝛼 + 2 2 𝑓 𝜕 𝜕 𝑥 𝜕 𝑦 s i n 𝛼 c o s 𝛼 + 2 𝑓 𝜕 𝑦 2 s i n 2 𝛼 = ℎ − 𝑣 + ℎ Γ ( 1 − 𝑣 ) 1 − 𝑣 ( c o s 𝛼 + s i n 𝛼 ) + ℎ Γ ( 2 − 𝑣 ) 2 − 𝑣 ( c o s 𝛼 + s i n 𝛼 ) 2 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 + − ℎ 1 − 𝑣 c o s 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 c o s 2 𝛼 + s i n 𝛼 c o s 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 − 1 , 𝑦 0 + ℎ 2 − 𝑣 c o s 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 − 2 , 𝑦 0 + − ℎ 1 − 𝑣 s i n 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 + s i n 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 + − 1 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 − 1 , 𝑦 0 + ℎ − 1 2 − 𝑣 s i n 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 . − 2 ( 3 . 1 9 ) Let 𝑎 3 0 = ℎ − 𝑣 + ℎ Γ ( 1 − 𝑣 ) 1 − 𝑣 ( c o s 𝛼 + s i n 𝛼 ) + ℎ Γ ( 2 − 𝑣 ) 2 − 𝑣 ( c o s 𝛼 + s i n 𝛼 ) 2 , 𝑎 Γ ( 3 − 𝑣 ) 3 1 ℎ = − 1 − 𝑣 c o s 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 c o s 2 𝛼 + s i n 𝛼 c o s 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 3 2 = ℎ 2 − 𝑣 c o s 2 𝛼 Γ , 𝑎 ( 3 − 𝑣 ) 3 3 ℎ = − 1 − 𝑣 s i n 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 + s i n 2 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 3 4 = 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 3 5 = ℎ 2 − 𝑣 s i n 2 𝛼 . Γ ( 3 − 𝑣 ) ( 3 . 2 0 ) Thus, (3.19) can be rewritten as 𝑅 0 𝐷 𝑣 ℎ 𝑓 𝑥 0 , 𝑦 0 ≈ 𝑎 3 0 𝑓 𝑥 0 , 𝑦 0 + 𝑎 3 1 𝑓 𝑥 0 − 1 , 𝑦 0 + 𝑎 3 2 𝑓 𝑥 0 − 2 , 𝑦 0 + 𝑎 3 3 𝑓 𝑥 0 , 𝑦 0 − 1 + 𝑎 3 4 𝑓 𝑥 0 − 1 , 𝑦 0 − 1 + 𝑎 3 5 𝑓 𝑥 0 , 𝑦 0 . − 2 ( 3 . 2 1 ) Equation (3.21) indicates that it has a 3 × 3 mask when 𝑛 = 2 , write FDD-3, shown in Figure 3.

325785.fig.003
Figure 3: Mask FDD-3.

The same as the first and the second quadrants, because the mask in Figure 3 denotes the algorithm of FDD along different directions in the third quadrant, we can also take three-directions angles 𝛼 = 0 , 𝜋 / 4 , and 𝜋 / 2 into account for (3.20). Actually, the three-direction angles in the third quadrant can denote the 𝛼 = 𝜋 , 5 𝜋 / 4 , and 3 𝜋 / 2 in the image plane. (i) For 𝛼 = 0 , we have 𝑎 3 0 = 1 Γ + 1 ( 1 − 𝑣 ) Γ + 1 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 3 1 1 = − Γ − 2 ( 2 − 𝑣 ) Γ , 𝑎 ( 3 − 𝑣 ) 3 2 = 1 Γ ( 3 − 𝑣 ) , 𝑎 3 3 = 0 , 𝑎 3 4 = 0 , 𝑎 3 5 = 0 . ( 3 . 2 2 ) (ii) For 𝛼 = 𝜋 / 4 and by (3.3), we obtain 𝑎 3 0 = √ 2 − 𝑣 + 2 √ Γ ( 1 − 𝑣 ) 2 − 𝑣 + 4 √ Γ ( 2 − 𝑣 ) 2 2 − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 3 1 √ = − 2 − 𝑣 − 4 √ Γ ( 2 − 𝑣 ) 2 − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 3 2 = √ 2 − 𝑣 , 𝑎 Γ ( 3 − 𝑣 ) 3 3 √ = − 2 − 𝑣 − 4 √ Γ ( 2 − 𝑣 ) 2 − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 3 4 = 2 √ 2 − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 3 5 = √ 2 − 𝑣 . Γ ( 3 − 𝑣 ) ( 3 . 2 3 ) (iii) For 𝛼 = 𝜋 / 2 , one has 𝑎 3 0 = ℎ − 𝑣 + ℎ Γ ( 1 − 𝑣 ) − 𝑣 + ℎ Γ ( 2 − 𝑣 ) − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 3 1 𝑎 = 0 , 3 2 = 0 , 𝑎 3 3 ℎ = − − 𝑣 − Γ ( 2 − 𝑣 ) 2 ℎ − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 3 4 = 0 , 𝑎 3 5 = ℎ − 𝑣 . Γ ( 3 − 𝑣 ) ( 3 . 2 4 )

Finally, in the fourth quadrant, the forward difference on positive 𝑥 -coordinate and backward difference on negative 𝑦 -coordinate of 𝜕 𝑓 / 𝜕 𝑥 , 𝜕 𝑓 / 𝜕 𝑦 , 𝜕 2 𝑓 / 𝜕 𝑥 2 , 𝜕 2 𝑓 / 𝜕 𝑦 2 , and 𝜕 2 𝑓 / 𝜕 𝑥 𝜕 𝑦 are 𝑥 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑥 ≈ 𝑓 0 + 1 , 𝑦 0 𝑥 − 𝑓 0 , 𝑦 0 , 𝑥 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑦 ≈ 𝑓 0 , 𝑦 0 𝑥 − 𝑓 0 , 𝑦 0 , 𝜕 − 1 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑥 2 𝑥 ≈ 𝑓 0 + 2 , 𝑦 0 𝑥 − 2 𝑓 0 + 1 , 𝑦 0 𝑥 + 𝑓 0 , 𝑦 0 , 𝜕 2 𝑓 𝑥 0 , 𝑦 0 𝜕 𝑦 2 𝑥 ≈ 𝑓 0 , 𝑦 0 𝑥 − 2 𝑓 0 , 𝑦 0 𝑥 − 1 + 𝑓 0 , 𝑦 0 . 𝜕 − 2 2 𝑓 𝑥 0 , 𝑦 0 𝑥 𝜕 𝑥 𝜕 𝑦 ≈ 𝑓 0 + 1 , 𝑦 0 𝑥 − 𝑓 0 , 𝑦 0 𝑥 − 𝑓 0 + 1 , 𝑦 0 𝑥 − 1 + 𝑓 0 , 𝑦 0 . − 1 ( 3 . 2 5 ) Taking (3.25) into (3.2) and by (2.7), (3.3), when 𝑛 = 2 in (3.2), we obtain 𝑅 0 𝐷 𝑣 ℎ 𝑓 𝑥 0 , 𝑦 0 ≈ ℎ − 𝑣 𝑓 𝑥 Γ ( 1 − 𝑣 ) 0 , 𝑦 0 + ℎ 1 − 𝑣 𝑥 Γ ( 2 − 𝑣 ) 𝜕 𝑓 0 , 𝑦 0 𝑥 𝜕 𝑥 c o s 𝛼 + 𝜕 𝑓 0 , 𝑦 0 + ℎ 𝜕 𝑦 s i n 𝛼 2 − 𝑣 𝜕 Γ ( 3 − 𝑣 ) 2 𝑓 𝜕 𝑥 2 c o s 2 𝜕 𝛼 + 2 2 𝑓 𝜕 𝜕 𝑥 𝜕 𝑦 s i n 𝛼 c o s 𝛼 + 2 𝑓 𝜕 𝑦 2 s i n 2 𝛼 = ℎ − 𝑣 − ℎ Γ ( 1 − 𝑣 ) 1 − 𝑣 ( c o s 𝛼 − s i n 𝛼 ) + ℎ Γ ( 2 − 𝑣 ) 2 − 𝑣 ( c o s 𝛼 − s i n 𝛼 ) 2 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 + ℎ 1 − 𝑣 c o s 𝛼 + Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 − c o s 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 + 1 , 𝑦 0 + ℎ 2 − 𝑣 c o s 2 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 + 2 , 𝑦 0 + − ℎ 1 − 𝑣 s i n 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 2 𝛼 − s i n 𝛼 c o s 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 , 𝑦 0 + − − 1 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 𝑓 𝑥 Γ ( 3 − 𝑣 ) 0 + 1 , 𝑦 0 + ℎ − 1 2 − 𝑣 s i n 2 𝛼 Γ 𝑓 𝑥 ( 3 − 𝑣 ) 0 , 𝑦 0 . − 2 ( 3 . 2 6 ) Let 𝑎 4 0 = ℎ − 𝑣 − ℎ Γ ( 1 − 𝑣 ) 1 − 𝑣 ( c o s 𝛼 − s i n 𝛼 ) + ℎ Γ ( 2 − 𝑣 ) 2 − 𝑣 ( c o s 𝛼 − s i n 𝛼 ) 2 , 𝑎 Γ ( 3 − 𝑣 ) 4 1 = ℎ 1 − 𝑣 c o s 𝛼 + Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 − c o s 2 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 4 2 = ℎ 2 − 𝑣 c o s 2 𝛼 Γ , 𝑎 ( 3 − 𝑣 ) 4 3 ℎ = − 1 − 𝑣 s i n 𝛼 − Γ ( 2 − 𝑣 ) 2 ℎ 2 − 𝑣 s i n 2 𝛼 − s i n 𝛼 c o s 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 4 4 = − 2 ℎ 2 − 𝑣 s i n 𝛼 c o s 𝛼 , 𝑎 Γ ( 3 − 𝑣 ) 4 5 = ℎ 2 − 𝑣 s i n 2 𝛼 . Γ ( 3 − 𝑣 ) ( 3 . 2 7 ) Then (3.26) becomes 𝑅 0 𝐷 𝑣 ℎ 𝑓 𝑥 0 , 𝑦 0 ≈ 𝑎 4 0 𝑓 𝑥 0 , 𝑦 0 + 𝑎 4 1 𝑓 𝑥 0 + 1 , 𝑦 0 + 𝑎 4 2 𝑓 𝑥 0 , 𝑦 0 − 1 + 𝑎 4 3 𝑓 𝑥 0 + 2 , 𝑦 0 + 𝑎 4 4 𝑓 𝑥 0 + 1 , 𝑦 0 − 1 + 𝑎 4 5 𝑓 𝑥 0 , 𝑦 0 . − 2 ( 3 . 2 8 ) Equation (3.28) denotes that it has a 3 × 3 mask when 𝑛 = 2 , write FDD-4, shown in Figure 4.

325785.fig.004
Figure 4: Mask FDD-4.

Since the mask FDD-4 in Figure 4 denotes the algorithm of FDD along different directions in fourth quadrant, we can also take the three direction angles 𝛼 = 0 , 𝜋 / 4 , and 𝜋 / 2 into account for (3.27). Similarly, the three direction angles in the fourth quadrant can denote the 𝛼 = 3 𝜋 / 2 , 7 𝜋 / 4 , and 2 𝜋 in the image plane. (i) When 𝛼 = 0 , it has 𝑎 4 0 = 1 Γ − 1 ( 1 − 𝑣 ) Γ + 1 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 4 1 = 1 Γ − 2 ( 2 − 𝑣 ) Γ , 𝑎 ( 3 − 𝑣 ) 4 2 = 1 Γ ( 3 − 𝑣 ) , 𝑎 4 3 = 0 , 𝑎 4 4 = 0 , 𝑎 4 5 = 0 . ( 3 . 2 9 ) (ii) When 𝛼 = 𝜋 / 4 and by (3.3), we have 𝑎 4 0 = √ 2 − 𝑣 Γ ( 1 − 𝑣 ) , 𝑎 4 1 = √ 2 − 𝑣 Γ ( 2 − 𝑣 ) , 𝑎 4 2 = √ 2 − 𝑣 , 𝑎 Γ ( 3 − 𝑣 ) 4 3 √ = − 2 − 𝑣 Γ ( 2 − 𝑣 ) , 𝑎 4 4 2 √ = − 2 − 𝑣 Γ ( 3 − 𝑣 ) , 𝑎 4 5 = √ 2 − 𝑣 . Γ ( 3 − 𝑣 ) ( 3 . 3 0 ) (iii) When 𝛼 = 𝜋 / 2 and by (3.3), we get 𝑎 4 0 = 1 Γ + 1 ( 1 − 𝑣 ) Γ + 1 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 4 1 = 0 , 𝑎 4 2 𝑎 = 0 , 4 3 1 = − Γ − 2 ( 2 − 𝑣 ) Γ ( 3 − 𝑣 ) , 𝑎 4 4 = 0 , 𝑎 4 5 = 1 Γ . ( 3 − 𝑣 ) ( 3 . 3 1 )

From the mask F D D - 𝑖 ( 𝑖 = 1 , 2 , 3 , 4 ), we take three direction angles 𝛼 = 0 , 𝜋 / 4 , 𝜋 / 2 in every quadrant, respectively, thus the 𝑣 -order FDD at any point along twelve directions can implement in [ 0 , 2 𝜋 ] in an image 𝑆 ( 𝑥 , 𝑦 ) , which can enhance its anti-rotation capability. But note that the coefficients (3.8), (3.10), (3.15), and (3.24) are same as (3.29), (3.17), (3.22), and (3.31) respectively. Therefore, the mask F D D - 𝑖 ( 𝑖 = 1 , 2 , 3 , 4 ) can actually achieve FDD along the eight directions in four quadrants, where the coefficients of the masks are (3.8), (3.9), (3.16), (3.17), (3.22), (3.23), (3.30), and (3.31), respectively. These fractional differential coefficients of the eight directions are different. This is the biggest difference between FDD and general fractional differentiation. Generally, FDD-1, FDD-2, FDD-3, and FDD-4 are collectively called FDD operator.

Digital image processing is based on direct processing discrete pixels, while the numerical calculation of FDD is to implement fractional space filter by FDD operator convolution. The principle of space filter is to move the operator point by point. In digital image 𝑆 ( 𝑥 , 𝑦 ) , FDD operator is used to filter with the convolution algorithms of FDD-1, FDD-2, FDD-3, and FDD-4, respectively 𝑆 1 ( 𝑣 ) ( 𝑥 , 𝑦 ) = 2 2 𝑖 = 0 𝑗 = 0 𝑆 ( F D D - 1 ) ( 𝑖 , 𝑗 ) 𝑆 ( 𝑥 + 𝑖 , 𝑦 + 𝑗 ) , ( 3 . 3 2 ) 2 ( 𝑣 ) ( 𝑥 , 𝑦 ) = 2 0 𝑖 = 0 𝑗 = − 2 𝑆 ( F D D - 2 ) ( 𝑖 , 𝑗 ) 𝑆 ( 𝑥 + 𝑖 , 𝑦 + 𝑗 ) , ( 3 . 3 3 ) 3 ( 𝑣 ) ( 𝑥 , 𝑦 ) = 0 0 𝑖 = − 2 𝑗 = − 2 𝑆 ( F D D - 3 ) ( 𝑖 , 𝑗 ) 𝑆 ( 𝑥 + 𝑖 , 𝑦 + 𝑗 ) , ( 3 . 3 4 ) 4 ( 𝑣 ) ( 𝑥 , 𝑦 ) = 0 2 𝑖 = − 2 𝑗 = 0 ( F D D - 4 ) ( 𝑖 , 𝑗 ) 𝑆 ( 𝑥 + 𝑖 , 𝑦 + 𝑗 ) . ( 3 . 3 5 )

Since the coefficients of FDD along the eight directions are different and it can effectively enlarge the differences among image textures, FDD can enhance not only the contour features in the smooth area nonlinearly, but the high-frequency edge feature in those areas where gray changes remarkably as well. To simplify the operation, according to the outputs comparison of the eight directions in four quadrants, the biggest one is selected as FDD grayscale. FDD algorithm for digital color image is similar to that for gray image, while the difference lies in that R, G, B components should do FDD, respectively, as the algorithm for gray image before composing the RGB color image. In other words, the calculation of mask convolution for color image is three times of that for gray image. there are strong interrelation among the R G B components, and the gray range is [0, 255]. Thus, when the order 𝑣 ∈ [ − 1 , 1 ] is big or small, the interrelations can be broken especially in the case of nonlinearly enhancing the components, and the enhancement image may be distorted. For digital color image, it is better to take the format of YCrCb and HSV.

4. Experiments and Results Analysis

This section will demonstrate that FDD operator has better capability of texture enhancing for texture rich image. FDD is required in advance for an image by FDD-1, FDD-2, FDD-3, and FDD-4 masks, respectively, along eight directions. In four quadrants, the direction angles and coefficients of FDD operator are taken and found according to (3.8), (3.9), (3.16), (3.17), (3.22), (3.23), (3.30), and (3.31), respectively. And we can see that the differential coefficients along these eight directions in the image plane are not the same, which can reflect different fractional change rates along different directions and is benefiting to enlarge the differences among the image textures. The calculation rules of every mask F D D - 𝑖 refer to (3.32)–(3.35). Finally, we select the maximum output value of the eight directions in four quadrants as grayscale of the point. Note that FDD has a greater calculation range [ − 1 , 1 ] than the transition width of general fractional differential order ( 0 , 1 ) . Clearly, when − 1 ≤ 𝑣 < 0 , FDD is equivalent to the fractional directional integral operator. Some experimental results are shown in Figure 5.

fig5
Figure 5: Texture information enhancement by FDD operator. (a) original image, (b) 𝑣 = − 0 . 2 , (c) 𝑣 = − 0 . 1 , (d) 𝑣 = 0 . 1 , (e) 𝑣 = 0 . 3 , (f) 𝑣 = 0 . 5 , (g) 𝑣 = 0 . 6 , and (h) 𝑣 = 0 . 7 .

For quantity analysis, we calculate gray level cooccurrence matrix to describe the comprehensive information of the texture details like direction, neighboring distance, changing range, and the background. We pick up from gray level cooccurrence matrix five classical parameters of angle matrix, contrast, correlation, energy and homogeneity. The corresponding testing values of each parameter in the four angles can be obtained by taking 0 ∘ , 4 5 ∘ , 9 0 ∘ , and 1 3 5 ∘ , respectively. So, there are 1 6 testing values of parameters of gray level cooccurrence matrix. For the lunar surface in Figure 5, the parameters values of gray level cooccurrence matrix in 1-pixel distance are shown in Tables 1 and 2.

tab1
Table 1: Gray level cooccurrence matrix in 0° and 45° directions.
tab2
Table 2: Gray level cooccurrence matrix in 90° and 135° directions.

The visual analysis of the above data and discussion of the relationship between order 𝑣 and texture-enhancing details in the directions of 0 ∘ , 4 5 ∘ , 9 0 ∘ , and 1 3 5 ∘ are integrated as nonlinear curves by four parameters: contrast, correlation, energy, and homogeneity, shown in Figure 6.

fig6
Figure 6: Curves of parameters of gray level cooccurrence matrix. (a) Contrast, (b) correlation, (c) energy, and (d) homogeneity.

Tables 1 and 2 and Figure 6 show that, no matter what the angle is, the change of texture-enhancement has some relations with the order 𝑣 . From (a) in Figure 6, we see that four contrast curves of enhancement image are above that of the original image. Image contrast can be interpreted as image clarity, that is, the clarity of image texture. The deeper the texture channels become, the greater the contrast is, as a result, the image looks clearer. The (b) in Figure 6 shows that the correlation of gray level cooccurrence matrix is always below that of the original image and becomes weaker with the increasing of 𝑣 when − 1 ≤ 𝑣 ≤ 1 , that is to say, when the correlation decreases, the texture details become clearer. From (c) in Figure 6, we observe that the energy curve first decreases and then increases during − 1 ≤ 𝑣 ≤ 1 . Particularly, when 𝑣 ∈ [ − 1 , − 0 . 5 ] , the energy decreases and is above that of the original image; when 𝑣 ∈ ( − 0 . 5 , 0 . 5 ] , the energy continues to decrease and is less than that of the original image; when 𝑣 ∈ [ 0 . 5 , 1 ] , the energy increases with the increasing of 𝑣 and is still below that of the original image. Since the energy is the sum of square of gray level cooccurrence matrix element and reflects the uniformity of image gray level distribution and the texture coarseness, which means that the more concentrated on the distribution the gray level cooccurrence matrix elements are, the greater the energy is. On the contrary, when the energy is smaller, the texture changing becomes more inhomogeneous and irregular, and texture details are clearer. So, from the energy, texture details by FDD operator are better when 𝑣 ∈ ( − 0 . 5 , 1 ] in general. The Figure 6(d) shows that the homogeneity of gray level coccurrence matrix is almost always below that of the original image and the trend is down then up. When 𝑣 ∈ [ − 1 , 0 . 5 ] , the homogeneity decreases with the increasing of 𝑣 , which means that the texture in different sections changes more dramatic and the texture details are clearer. When 𝑣 ∈ [ 0 . 5 , 1 ] , the homogeneity correspondingly increases, that is, it changes little in different sections when 𝑣 ∈ [ 0 . 5 , 1 ] . In summary, once one takes all the four parameters of gray-level cooccurrence matrix into account, the strongest points of FDD for texture-enhancing should focus on the range of 𝑣 ∈ ( − 0 . 5 , 1 ) in general. Here note that it is different from general fractional differential when 𝑣 = 0 , the result by FDD operator does not denote the original image, but the image of series expression of directional derivative to original image by (2.11), and it does not do fractional differentiation with respect to direction variable ℎ .

To further observe the texture-enhancing capability of FDD, we did a set of comparisons with the two algorithms, the general fractional differentiation, and the nonlinearly enhancing high-frequency components by Butterworth filter, for different kinds of textures. The results are shown in Figure 7. In addition, for easy comparison of its enhancing results, the results of experiments are the iteration of corresponding pixels of original image and FDD image.

fig7
Figure 7: Texture-enhancement capability comparison. (a) original image, (b) the nonlinearly enhancing the high-frequency components by Butterworth filter, (c) general fractional differentiation of 0 . 6 order, (d) enhanced image by FDD operator of 0 . 8 order, (e) original image, (f) the nonlinearly enhancing the high-frequency components by Butterworth filter, (g) general fractional differentiation of 0 . 8 order, (h) enhanced image by FDD operator of 0 . 8 order, (i) original image, (j) the nonlinearly enhancing the high-frequency components by Butterworth filter, (k) general fractional differentiation of 0 . 7 order, (l) enhanced image by FDD operator of 0 . 3 order, (m) original image, (n) the nonlinearly enhancing the high-frequency components by Butterworth filter, (o) general fractional differentiation of 0 . 6 order, and (p) enhanced image by FDD operator of 0 . 9 order.

From Figure 7, we could find that the nonlinearly enhancing the high-frequency components by Butterworth filter suffers from one serious drawback when large structures are strongly enhanced. By contrast, the FDD allows the smooth enhancement of large structures. For the enhancement of small texture details, the FDD may have some advantages over Butterworth filter. And since the coefficients of general fractional differentiation are always the same along the eight directions in the image plane, which is not conducive to reflect the different change rates of the image along different directions. While the FDD coefficients along the eight directions in the image plane are not the same, which can reflect sufficiently different fractional change rates along different directions and is benefiting to enlarge the differences among the image textures. So the enhancement results by FDD are better than those by general fractional differential. FDD operator cannot only maintain the most energy of image on the low frequency, but also nonlinearly enhance its energy over intermediate and high frequencies, which leads to a richer texture details. For quantity analysis, we take information entropy [19] and average gradient [20, 21] as parameters that are shown in Table 3. The entropy denotes a measure of the amount of image information. Certainly, texture information is also one of image information. If an image has no texture, the gray level cooccurrence matrix is almost a zero matrix and its entropy is close to zero. Otherwise, if an image has a great number of comprehensive texture details, its entropy is also greater. The average gradient can be sensitive to reflect the ability of contrast expression of small details, which can be used to evaluate image clarity. The experiment data of Figure 7 are shown in Table 3.

tab3
Table 3: Information entropy and average gradient in Figure 7.

From Figure 7 and Table 3, we can see that, although the algorithm of the nonlinearly enhancing the high-frequency components by Butterworth filter can increase the average gradient, it only enhances the margin and losses a lot of texture details, thus it only has the minimum information entropy. Comparing with general fractional differential, the average gradient by FDD is slightly lower than it, however, the enhanced images by FDD have the biggest information entropy, which means FDD can enhance both the margins and the textures. Therefore, FDD could nonlinearly preserve the low-frequency contour feature in the smooth area to the furthest degree, nonlinearly enhance high-frequency marginal information in those areas where gray scale changes frequently, and nonlinearly enhance texture details in those areas where gray scale does not change evidently. Thus FDD could nonlinearly enhance the comprehensive texture details.

For an RGB color image, the algorithm is similar to that for gray image. We do FDD for R, G, B component, respectively, then compose the RGB color image. The results are shown in Figure 8.

fig8
Figure 8: Color texture information enhanced by FDD operator. (a) original image, (b) 𝑣 = − 0 . 1 , (c) 𝑣 = 0 . 1 , (d) 𝑣 = 0 . 2 .

Observing carefully Figure 8, we see that the texture channels become deeper and the texture details are clearer by FDD operator. FDD operator not only maintains the most energy of image on the low frequency, but also nonlinearly enhance its energy over intermediate and high frequencies, which leads to a richer texture details. For the purpose of directly observing the change of grayscale, without losing generality, we take vertical projection ( 𝑥 -coordinate) of gray level of (a) and (d) in Figure 8 as examples, to compare the change of gray-level values. The results are shown in Figure 9.

fig9
Figure 9: The vertical projections of gray scale of (a) and (d) in Figure 8. (a) the vertical projection of gray level of original image (a) in Figure 8, (b) part of (a), (c) the vertical projection of gray level of original image (d) in Figure 8, (d) part of (c).

From Figure 9, we know that, the same as general fractional differential, FDD operator also enhances the high-frequency edge information with obvious enhancement effect. Moreover, comparing to integer-order differentiation, FDD keeps the envelope of gray level histogram distribution to some degree, and reserves the low-frequency contour information of the original image. After FDD to the original image, the result shows that the change magnitude of each point in the original image along eight directions in the four quadrants. Therefore, FDD adds some burrs in the envelope curve of gray-level projection of the original image, which just denotes that the texture details are richer than the original image in these locations where there are many burrs and FDD can nonlinearly enhance texture details in those areas that gray levels have little changed, but integer-order differential is near to zero in those areas. In short, FDD not only nonlinearly preserves the contour feature in the smooth area, but also keeps high-frequency edge feature in those areas where gray changes remarkably and high-frequency texture detail feature in those areas where gray does not change evidently.

5. Conclusion

Fractional differentiation has played a very important role in digital image processing fields and more and more researchers begin to study it. This paper intends to propose a new mathematic approach (FDD) and deduce a new operator (FDD operator) obtained though the generalization of the Taylor formula for one-variable function to two-variable function and deduced though the power series expression of two-variable function. The particularity of FDD operator is that a directional derivative order between − 1 and 1 favours detection selectivity, which expands the transition width of fractional differential order 0 < 𝑣 < 1 . Since the FDD coefficients along the eight directions in the image plane are not the same, which can reflect sufficiently different fractional change rates along different directions and is benefiting to enlarge the differences among the image textures. So the enhancement results by FDD are better than those by general fractional differential. Experiments show that the FDD operator has excellent textural details enhancing capabilities for rich-grained digital images. For quantity analysis, from the different quantitative criteria, gray-level cooccurrence matrix, vertical projection (x-coordinate) of gray-level, information entropy and average gradient, all show that FDD can nonlinearly enhance comprehensive texture details. FDD is a new method and technology for image-texture enhancement.

Acknowledgments

This work is supported by the National Natural Science Foundation of China (no. 60773168), the project of Science and Technology Department of Sichuan Province (no. 2011JY0077), the Natural Science Foundation of Chengdu University of China (no. 2010XJZ28), and the project of Chengdu City Economic and Information Technology Commission (no. 201201014).

References

  1. D. Baleanu, K. Diethelm, E. Scalas, and J. J. Trujillo, Fractional Calculus, vol. 3 of Series on Complexity, Nonlinearity and Chaos, World Scientific, Hackensack, NJ, USA, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. A. Babakhani, D. Baleanu, and R. Khanbabaie, “Hopf bifurcation for a class of fractional differential equations with delay,” Nonlinear Dynamics, vol. 69, no. 3, pp. 721–729, 2012. View at Publisher · View at Google Scholar · View at Scopus
  3. S. Bhalekar, V. Daftardar-gejji, D. Baleanu, and R. Magin, “Generalized fractional order bloch equation with extended delay,” International Journal of Bifurcation and Chaos, vol. 22, no. 4, Article ID 1250071, 15 pages, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. K. B. Oldham and J. Spanier, The Fractional Calculus, Academic Press, New York, NY, USA, 1974. View at Zentralblatt MATH
  5. A. A. Kilbas, H. M. Srivastava, and J. J. Trujillo, Theory and Applications of Fractional Differential Equations, vol. 204 of North-Holland Mathematics Studies, Elsevier Science B.V., Amsterdam, The Netherlands, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. M. A. E. Herzallah and D. Baleanu, “Fractional Euler-Lagrange equations revisited,” Nonlinear Dynamics, vol. 69, no. 3, pp. 977–982, 2012. View at Publisher · View at Google Scholar · View at Scopus
  7. D. Baleanu, “New applications of fractional variational principles,” Reports on Mathematical Physics, vol. 61, no. 2, pp. 199–206, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. M.-P. Chen and H. M. Srivastava, “Fractional calculus operators and their applications involving power functions and summation of series,” Applied Mathematics and Computation, vol. 81, no. 2-3, pp. 287–304, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. N. Engheta, “On fractional calculus and fractional multipoles in electromagnetism,” IEEE Transactions on Antennas and Propagation, vol. 44, no. 4, pp. 554–566, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. J. Sabatier, O. P. Agrawal, and J. A. Tenreiro Machado, Advances in Fractional Calculus: Theoretical Developments and Applications in Physics and Engineering, Springer, Dordrecht, The Netherlands, 2007. View at Publisher · View at Google Scholar
  11. P. Janney and G. Geers, “Texture classification using invariant features of local textures,” IET Image Processing, vol. 4, no. 3, pp. 158–171, 2010. View at Publisher · View at Google Scholar · View at Scopus
  12. R. M. Haralick, K. Shanmugam, and I. Dinstein, “Textural features for image classification,” IEEE Transactions on Systems, Man and Cybernetics, vol. 3, no. 6, pp. 610–621, 1973. View at Scopus
  13. C. B. Gao, J. L. Zhou, J. R. Hu, and F. N. Lang, “Edge detection of colour image based on quaternion fractional differential,” IET Image Processing, vol. 5, no. 3, pp. 261–272, 2011. View at Publisher · View at Google Scholar
  14. C. B. Gao and J. L. Zhou, “Image enhancement based on quaternion fractional-order directional differentiation,” Acta Automatica Sinica, vol. 37, no. 2, pp. 150–159, 2011 (Chinese). View at Publisher · View at Google Scholar
  15. C. Gao, J. Zhou, X. Zheng, and F. Lang, “Image enhancement based on improved fractional differentiation,” Journal of Computational Information Systems, vol. 7, no. 1, pp. 257–264, 2011.
  16. Y.-F. Pu, J.-L. Zhou, and X. Yuan, “Fractional differential mask: a fractional differential-based approach for multiscale texture enhancement,” IEEE Transactions on Image Processing, vol. 19, no. 2, pp. 491–511, 2010. View at Publisher · View at Google Scholar
  17. C. Gao, “On power series of functions in several variables,” College Mathematics, no. 3, pp. 125–129, 2007 (Chinese).
  18. Y. T. Bai, Y. F. Luo, and Y. X. Hu :, “The fractional integration and differentiation and their series expansions,” Journal of Wuhan Technical University of Surveying and Mapping, vol. 18, no. 1, pp. 68–75, 1993 (Chinese).
  19. C. E. Shannon, “A mathematical theory of communication,” The Bell System Technical Journal, vol. 27, pp. 379–423, 1948. View at Zentralblatt MATH
  20. John S. Weszka and Azriel Rosenfeld, “Histogram modification for threshold selection,” IEEE Trans Syst Man Cybern, vol. 9, no. 1, pp. 38–52, 1979.
  21. A. M. Groenewald, E. Barnard, and E. C. Botha, “Related approaches to gradient-based thresholding,” Pattern Recognition Letters, vol. 14, no. 7, pp. 567–572, 1993. View at Scopus