Accurate Computation of Fractional-Order Exponential Moments

Xu, Shujiang; Hao, Qixian; Ma, Bin; Wang, Chunpeng; Li, Jian

doi:https://doi.org/10.1155/2020/8822126

Security and Communication Networks

On this page

Abstract Introduction Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Special Issue

Machine Learning for Wireless Multimedia Data Security 2020

View this Special Issue

Research Article | Open Access

Volume 2020 | Article ID 8822126 | https://doi.org/10.1155/2020/8822126

Accurate Computation of Fractional-Order Exponential Moments

Shujiang Xu,¹Qixian Hao,^1,2Bin Ma ,^1,2Chunpeng Wang ,^1,2,3and Jian Li^1,2

Academic Editor: Zhaoqing Pan

Received27 Mar 2020

Revised19 Jun 2020

Accepted04 Jul 2020

Published03 Aug 2020

Abstract

Exponential moments (EMs) are important radial orthogonal moments, which have good image description ability and have less information redundancy compared with other orthogonal moments. Therefore, it has been used in various fields of image processing in recent years. However, EMs can only take integer order, which limits their reconstruction and antinoising attack performances. The promotion of fractional-order exponential moments (FrEMs) effectively alleviates the numerical instability problem of EMs; however, the numerical integration errors generated by the traditional calculation methods of FrEMs still affect the accuracy of FrEMs. Therefore, the Gaussian numerical integration (GNI) is used in this paper to propose an accurate calculation method of FrEMs, which effectively alleviates the numerical integration error. Extensive experiments are carried out in this paper to prove that the GNI method can significantly improve the performance of FrEMs in many aspects.

1. Introduction

The research on image retrieval has been started since the middle and late last century. At that time, it was mainly text-based image retrieval technology, and the description of image features included text-related information. Later, the image retrieval technology was extended to cloud retrieval, i.e., content-based image retrieval technology, which analyzes the color, texture, and layout of images. Shape is the basic image feature used in content-based image retrieval systems. The image moments are robust and effective shape features. The image moments are excellent image descriptors, and they have strong geometric invariance and global feature description ability. Therefore, image moments have also been widely used in the field of image processing [1], including object recognition, image reconstruction, image encryption, and information hiding [2].

The existing image moments are mainly divided into nonorthogonal moments and orthogonal moments. Nonorthogonal moments such as Hu moments [3] and complex moments [4] project images to a set of the nonorthogonal functional polynomial. The translation and rotation of the image and the scale change invariant can be constructed based on nonorthogonal moments. While because their basis function does not have the orthogonal relationship and nonorthogonal moments have large redundancy, it is difficult to realize the image reconstruction, and they are more sensitive to the image noise. Orthogonal moments are projection coefficients which project the image to a set of orthogonal polynomials. An image can be reconstructed based on orthogonal moments. The research work shows that it has high robustness to the image noise, image blur, and other related operations [5]. Orthogonal moments are divided into discrete orthogonal moments and continuous orthogonal moments. The continuous orthogonal moments use the continuous function as the basis function, and it has the rotation, scaling, and the translation invariance, which have been greatly developed in recent years, including Legendre moments (LMs) [6], Zernike moments (ZMs) [7], pseudo-Zernike moments (PZMs) [7], orthogonal Fourier–Mellin moments (OFMMs) [8], Chebyshev–Fourier moments (CHFMs) [9], radial harmonic Fourier moments (RHFMs) [10], Bessel–Fourier moments (BFMs) [11], polar harmonic transforms (PHTs) [12], and exponential moments (EMs) [13], Among them, EMs have good antinoise performances and less information redundancy, and their basis functions have the simple form, low computational complexity, and good image description performance [14]. However, EMs have various errors and numerical instabilities at high orders, which affects the accuracy of EMs [15]. The ubiquitous errors have a very negative impact on the image analysis and reconstruction [16] so that when the order of EMs reaches a critical value, the reconstruction errors are too large to be imaged [17]. The promotion of fractional-order exponential moments (FrEMs) afterward compensated for the numerical instability of EMs effectively [18] and improved the reconstruction and antinoise performance of EMs. In the study of fractional moments, scholars first define the fractional parameter of and then use to replace in the radial basis function of the orthogonal moment. The radial basis function is further modified to maintain the orthogonality of the moment [19]. The orthogonal moment promoted to the fractional order can adjust the gradient of the radial basis function by assigning different values to the fractional variable of to further alleviate the problem of numerical instability [20]. The existing fractional moments include fractional-order Legendre–Fourier moments (FrOLFMs) [21], orthogonal fractional-order Fourier–Mellin moments (FrOFMMs) [22], fractional-order Zernike moments (FrZMs) [23], fractional-order polar harmonic transforms (FrPHTs) [24], fractional-order orthogonal Chebyshev–Fourier moments (FrCFMs) [25], and fractional-order radial harmonic Fourier moments (FrRHFMs) [26].

Although FrEMs have the excellent image description ability, various errors generated by the traditional calculation method still affect the accuracy of FrEMs. And the calculation accuracy restricts the development and application of continuous orthogonal moments in the fields of pattern recognition and image processing. Among the various errors, the numerical integral error is especially prominent. Since the digital image is stored in the form of Cartesian coordinates in computers and other devices, in the Cartesian coordinate system, the direct calculation of the continuous orthogonal moments of the image cannot obtain the integral value of the polynomial correctly, and it can only be replaced with the estimated value. The numerical integration error occurs during this process [27]. The numerical integration error is more distinct when the high order moment is calculated. To solve the problem of the numerical integration error of the image moment, Liao and Pawlak propose a method based on the numerical integration to reduce the numerical integration error. Their method is to use a unit disk with the radius of [28]. The reduction of the radius is to ensure that the sampling points used in the numerical integration do not cross the boundary of the unit disk to avoid the radial basis function from becoming unbounded. Because the disk area with a reduced radius is further affected by the reduced radius, this method will cause the geometric error. Therefore, they conclude that the geometric error and the numerical integration error cannot be reduced at the same time. Later, Singh et al. proposed a technique that can simultaneously reduce the geometric error and the numerical integration error based on the Gaussian numerical integration (GNI) [29]. This paper uses GNI to propose an accurate calculation method of FrEMs based on this idea. This method provides very accurate FrEMs and reduces the reconstruction error.

From the above description of image moments, we have summarized two problems: (1) in the traditional algorithm, the calculation of image moments mainly uses zeroth order approximation method, which will produce numerical integration errors and affect the calculation accuracy of moments. (2) The numerical instability of continuous orthogonal moments is common at high order, which affects the accuracy of continuous orthogonal moments. The goal of this paper is to take EMs as an example to solve the above two problems of EMs. The experiments prove that the accuracy of EMs is improved after using the new method. The main innovations of this paper are as follows: (1) an accurate calculation method of FrEMs is proposed, and the nature and comparison of the GNI method and the traditional calculation method are analyzed in depth; (2) the experimental result shows that FrEMs using the GNI accurate calculation method have stronger image reconstruction performance and the antinoising attack performances than FrEMs using the traditional method.

The rest of this paper is described as follows: in Section 2, we introduce the construction process of FrEMs in detail; Section 3 mainly introduces the traditional calculation methods and GNI methods of FrEMs; Section 4 conducts detailed experiments and discussions on image reconstruction, antinoising attack, antirotation attack, antiscaling attack, antifiltering attack, and anti-JPEG compression attack performance; and Section 5 summarizes the full text.

2. Proposed FrEMs

2.1. Definition of EMs

EMs are the mapping of the image on the basis function. The basis function of EMs is mainly composed of the radial basis function and the angular Fourier factor. The definition of the radial basis function of EMs is as follows [30]:where is the order and the value range is . The range of is . The definition expression of EMs iswhere is the repetition and the value range is . is the conjugate of a complex number. is the image function in polar coordinates. is the angular Fourier factor, and is the polar angle with the value range of .

EMs have good reconstruction performance, and they can use a limited number of EMs to reconstruct the original image. The reconstruction formula is as follows:

2.2. Definition of FrEMs

In order to improve the performance of EMs, this section we extend EMs to fractional order and construct FrEMs. The radial basis function of FrEMs is defined as follows [31]:where the fractional parameter , and the basis function of FrEMs is defined as follows:

The definition of FrEMs is

It can be known from formulas (1) and (4) that when , the radial basis functions of FrEMs will be those of EMs; therefore, EMs can be deemed as a special form of FrEMs. The radial basis function of EMs is orthogonal within the range of :where is the Kronecker delta. From the properties of angular Fourier factor and radial basis function, it can be known that the basis function of EMs is orthogonal in the unit circle:

From the definition of radial basis function of FrEMs expressed in formula (4), it can be known thatand then,The basis function of FrEMs satisfies the following orthogonal relationship [32]:

FrEMs have very strong image reconstruction ability, and the reconstruction formula is as follows:

2.3. Analysis of Radial Basis Function

In this section, we analyze the influence of the selection of the fractional parameter on the radial basis function of the fractional exponential moment. Figure 1 shows that when is taken as 1, 1.3, 1.6, and 1.9, respectively, and the order is 30, the radial basis function changes from . From Section 2.2, we can see that when the fractional parameter , the fractional radial basis function is equivalent to the traditional radial basis function. As can be seen from Figure 1(a), when the fractional parameter , the traditional radial basis function has a larger variation range around ; thus, the variation rate of the radial basis function is larger around , which leads to numerical instability and large errors. From Figure 1, we can see that the rate of change in the radial basis function gradually becomes moderate with the continuous increase in the fractional parameter . Therefore, we can alleviate the numerical instability of the exponential moment by adjusting the fractional parameter . However, different fractional parameters also lead to different calculation emphasis areas. Therefore, the specific application of fractional exponential moments should also be considered when selecting fractional parameter .

(a)

(b)

(c)

(d)

3. Accurate Computation Method of FrEMs

3.1. Traditional Method

When the image moment of a digital image is calculated by using the computer simulation, the expression of the integral form should firstly be discretized and the integral should be converted to a sum [8]. The discrete integration first needs to discretize the integration area into small areas. In these small areas, the center point is served as the sample point of the function value of the integrand, and then, the area of each small area is multiplied by the integrand value on the sample point. The products for all the small areas are summed, and the result is the approximate integral value [33]. Since FrEMs are defined in the polar coordinate system, while the image is defined in the rectangular coordinate system, the traditional calculation method needs to first convert FrEMs to the rectangular coordinate system, and then, FrEMs are calculated in the rectangular coordinate system. The polar coordinates and the rectangular coordinates are converted first here, and the conversion formula is as follows:

The infinitesimal relationship between rectangular coordinates and polar coordinates is

The definition of FrEMs in the rectangular coordinate system is obtained as follows:

The range of the integral change is , so the image needs to be mapped in the unit circle when FrEMs are calculated in the rectangular coordinate system. Since FrEMs calculated by the circumcircle mapping method do not have rotation invariance, this paper uses a calculation method based on the inscribed circle, as shown in Figure 2.

(a)

(b)

The formula for mapping the inscribed circle portion of a grayscale image with the size of into the unit circle is as follows:

The above mapping relationship is shown in Figure 2(b). The image center is mapped to the center of the unit circle. represents the center of the small image region of , where . The discrete summation form of FrEMs can be obtained as follows:where .

3.2. GNI Method

The traditional calculation method has the numerical integration problem [34]. In view of this defect, an accurate calculation method of FrEMs is proposed in this section by using GNI.

For the one-dimensional function of , the integral over the interval can be expressed asdenotingand then,so , and it can be obtained thatwhere and are the weight and position of the image sampling point, respectively, is the order of GNI, and the above formula can be transformed into the following form:

Similarly, for the two-dimensional function of , its expression of the double GNI in the integration area can be expressed as

Now, we use the double GNI method to precisely calculate FrEMs. For formula (13), it can be obtained as follows:where

The constraint given in formula (21) is an improvement over the constraint used in the zeroth-order approximation for inscribing circular disk. This constraint also allows those grids to take part in computation whose centers fall outside the circle.

4. Experiment and Result Analysis

In this section, image reconstruction, antinoising attack, antirotation attack, antiscaling attack, antifiltering attack, and anti-JPEG compression attack performance of the accurate calculation method of FrEMs were tested via the experiment. Thirty grayscale images with size of were used as the image library. The images shown in Figure 3 are ten images selected randomly from the image library. For convenience, TFrEMs and GFrEMs were used in the following to refer to the traditional method and GNI method, respectively; GFrPHFMs, GFrRHFMs, GFrPCETs, GFrPCTs, and GFrPSTs, respectively, represent FrPHFMs, FrRHFMs, FrPCETs, FrPCTs, and FrPSTs calculated by the GNI method. Here, we chose the order of GNI as .

4.1. Rotation Angle Estimation

Let the rotation angle of the image be , assuming ,and then,where referred to the real part of and referred to the imaginary part of . According to the above formula, the rotation angle could be estimated by the inverse trigonometric function. GFrEMs of any order could be used to estimate the rotation angle [35]. From Section 2.3, we know that the selection of will lead to different focus areas. After a lot of experiments, we know that when , the angle estimation experiment result of GFrEMs is the best. Here, we chose the maximum moment order for each estimate as and the fractional parameter . And for each maximum moment order , we selected moments with all the repetition of , respectively, to estimate to get estimated angles. Finally, the average values of these estimated angles were taken as the corresponding final result of the maximum moment order . The experiment used a Lena grayscale image with a size of . Denote by the estimated angle and mean relative error (MRE) as the measurement standard, and the experimental result was as follows.

Figure 4 shows the estimated rotation angle after the original images were rotated and , respectively. As could be seen from Figure 4, the angle estimated by GFrEMs is relatively accurate at low maximum moment order, and some deviations occur as the maximum moment order increases, but the MRE can still be kept small. It could be seen from Table 1 that when was rotated, the MRE of the estimated rotation angles of the real and imaginary parts of used was 0.0688 and 0.0425, respectively. When was rotated, the MRE of the estimated rotation angles of the real and imaginary parts of used was 0.0247 and 0.0399, respectively, which verified that the rotation angle estimation using GFrEMs was relatively accurate.

(a)

(b)

4.2. Rotation Invariance

The rotation invariance of GFrEMs was tested in this section. The Lena grayscale image with size of was rotated by , , , , and , respectively. The GFrEMs amplitude of the original image and the GFrEMs amplitude of the rotated image were compared. MRE was used to represent the change rate of the GFrEMs amplitude of the rotated image relative to the original image. The selection of the fractional parameter will affect the zero distribution of the radial basis function and further affect the rate of change in the radial basis function. After lots of experiments, it was known that the MRE was the smallest when the fractional parameter , so the fractional parameter was selected here. Figure 5 shows the experimental image after rotating at different angles, and the experimental results obtained are shown in Table 2.

(a)

(b)

(c)

(d)

(e)

(f)

It could be seen from the results that the value of MRE was less than 0.02 under different rotation angles, which indicated that the FrQEMs amplitude after the image was rotated was approximately the same as that of the original image, which verified the rotation invariance of GFrEMs.

4.3. Scaling Invariance

GFrEMs were calculated for a set of scaled images below. In this experiment, the Lena grayscale images with a size of were scaled by 0.75, 1.25, 1.5, 1.75, and 2 times, and their GFrEMs amplitudes were calculated, respectively, to be compared with GFrEMs amplitudes values of the original images. The fractional parameter was selected here. Figure 6 is the experimental image after it was scaled different times. The experimental result obtained is shown in Table 3.

(a)

(b)

(c)

(d)

(e)

In the experiment, the original image was scaled different times, and the moment value of the scaled image was calculated. As could be seen from Figure 6, the original image was blurred to different degrees after being scaled to different degrees. From the above experimental data, it could be seen that the amplitude of the same GFrEMs of each scaled image was approximately equal, which verified the scaling invariance of GFrEMs.

4.4. Filtering Attack

The filtering attack blurred the edges of the image [36], including the median filtering, Gaussian filtering, and the average filtering. Here, we selected the fractional parameter and added the filtering attacks of (3 × 3) and (5 × 5) median filtering, Gaussian filtering, and average filtering to the original image, respectively. The Lena grayscale image with a size of was adopted in the experiment. The images after filtering attack are shown in Figure 7, and the experimental result obtained is shown in Table 4.

(a)

(b)

(c)

(d)

(e)

(f)

As could be seen from Figure 7, filtering attacks did blur the edges of images, and different filtering attacks had different effects. As could be seen from Table 4, as the filtering quality increased, the MRE of the GFrEMs amplitude of the filtered attack image also gradually increased, which showed that the filtering attack did affect the image quality. However, the MRE of the GFrEMs amplitude of the image after (3 × 3) and (5 × 5) Gaussian filtering attack still remained below 0.05, which indicated that GFrEMs could well resist the Gaussian filtering. For median filtering and average filtering, MRE could be kept below 0.1, indicating that GFrEMs had a certain degree of resistance to median filtering and average filtering.

4.5. JPEG Compression Attack

JPEG compression attack was a common image attack method [37]. The purpose of the compression was to compress the amount of data and improve the effectiveness. However, pixels of the image were lost in this process. Here, we selected the fractional parameter and performed the JPEG compression attack on the original image with a quality factor of 10, 20, …, 90 and then compared the amplitude of the GFrEMs of the attacked image with the amplitude of the GFrEMs of the original image. Figure 8 shows the Lena image after the JPEG compression attack with different quality factors, and the experiment result is shown in Table 5.

(a)

(b)

(c)

(d)

(e)

(f)

(g)

(h)

(i)

(j)

As could be seen from Figure 8, after JPEG compression attacks with different quality factors are added to the original image, the image quality deteriorates to different degrees. As could be seen from the above Table 5, as the quality factor became larger, the MRE also became smaller and smaller. When the quality factor reached 30, the MRE of the GFrEMs amplitude of the image after the JPEG compression attack was kept below 0.02 compared with the original image, which indicated that GFrEMs had strong resistance to JPEG compression attacks.

4.6. Image Reconstruction

The image reconstruction performance was an important feature of the image orthogonal moment, which reflected the accuracy of the image moment. For the image with a size of and its reconstructed image , the mean square error was used in this paper to measure the reconstruction error [38]:

4.6.1. Experiment 1

GFrEMs have good image reconstruction ability. GFrEMs, TFrEMs, GFrPHFMs, GFrRHFMs, GFrPCETs, GFrPCTs, and GFrPSTs were compared in this section. The Lena grayscale image with a size of was used in the experiment. The maximum moment order , and the fractional parameter . The experiment result is shown in Table 6.

As can be seen from Table 6, the images reconstructed by TFrEMs and GFrEMs kept small errors at low orders, but when the maximum moment order reached to a certain value, the images reconstructed by TFrEMs had a large error; both the edge region and the center region of the image reconstructed by TFrEMs are deteriorated. And the image errors reconstructed by GFrEMs were smaller and smaller. There was no deterioration in the edge area and center area of the image reconstructed by GFrEMs, and the image quality got better and better with the increase in the maximum moment order. For a more intuitive explanation, the line chart of the reconstruction error is shown in Figure 9. It can be seen from the line chart that the image reconstructed by GFrEMs always maintained a small error, which indicated that the GNI method further improved the accuracy of FrEMs. From Figure 9, we can see that when , the mean square error of the reconstructed images of GFrEMs and GFrRHFMs was similar, and both GFrEMs and GFrRHFMs could maintain great reconstruction effect. GFrPCETs and GFrPCTs had similar reconstruction effects and could keep the mean square error small, but the overall reconstruction effect was worse than GFrEMs. However, GFrPHFMs and GFrPSTs had the worst reconstruction effect compared with other fractional moments calculated by the GNI method. On the whole, the reconstruction error of GFrEMs is always smaller than other fractional-order moments calculated by the GNI method, which once again verifies the reconstruction performance of GFrEMs.

4.6.2. Experiment 2

Since the noise would seriously affect the reconstruction performance of images [39], this experiment tested the comparison of the image reconstruction errors between GFrEMs, TFrEMs, GFrPHFMs, GFrRHFMs, GFrPCETs, GFrPCTs, and GFrPSTs after adding the salt and pepper noise. This experiment used the average value of thirty images. Maximum moment order , and fractional parameter was selected. The salt and pepper noise was added separately. After the salt and pepper noise was added, the image reconstruction result is shown in Table 7, and the error line chart is shown in Figure 10.

It can be seen from Table 7 that the overall effect of the image reconstruction became worse with the addition of noise, which indicated that the noise did affect the image reconstruction. However, from Figure 10, the image reconstruction effect of GFrEMs was always better than TFrEMs and other fractional-order moments, which indicated that GFrEMs had further improved the antinoise performance of FrEMs. This verified again that the GNI method was superior to the traditional method in the image reconstruction performance.

4.7. Application of GFrEMs in Medical Images

In this section, the image reconstruction, antinoising attack, antirotation attack, antiscaling attack, antifiltering attack, and anti-JPEG compression attack performance of GFrEMs applied to medical images were tested via the experiment [40]. Seventy grayscale images with a size of were used as the image library. The images shown in Figure 11 are ten images selected randomly from the image library.

4.7.1. Experiment 1

In this section, GFrEMs is applied to the reconstruction of grayscale medical images, and the salt and pepper noise were added separately to test its antinoising attack performance. The maximum moment order , and the fractional parameter . The experiment result is shown in Table 8.

After adding salt and pepper noise, the reconstruction effect of the image becomes worse and the relative error also increases, which proves once again that salt and pepper noise can seriously affect the reconstruction performance of the image moments. From Table 8, it can be seen that the GFrEMs applied to the reconstruction of medical images can still maintain a small error, which once again verifies the reconstruction performance and antinoising attack performance of GFrEMs.

4.7.2. Experiment 2

In this section, we test the antigeometric attack capability of GFrEMs applied to medical images. The GFrEMs amplitude of the original image and the GFrEMs amplitude of the image being attacked were compared [41]. The fractional parameter was selected here. Details of the attack are as follows: median filtering with window size 3 × 3; Gaussian filtering with window size 3 × 3; average filtering with window size 3 × 3; JPEG compression quality factor 90, 70, 50, 30, 20, and 10; image rotation by , , , , and ; and image scaling with factor 0.5, 0.75, 1.5, and 2. The experiment result is shown in Table 9.

As can be seen from Table 9, as the rotation angle of the original image increased, the value of MRE also increased, but the MRE could always be kept within 0.01. And as the quality factor became larger, the MRE also became smaller and smaller, and the MRE could always be kept within 0.04. However, when scaling the original image, we found that too large or too small scaling will lead to larger errors. When the original image was scaled by 0.05 times, the MRE reached 0.0405, which showed that scaling attacks do affect the image quality. As can be seen from Table 9, GFrEMs had strong resistance to Gaussian filtering attacks and certain resistance to average filtering attacks. However, GFrEMs had relatively weak resistance to median attacks, but it could still keep small errors. On the whole, GFrEMs could still keep small errors after various geometric attacks, which proved that GFrEMs applied to medical images have strong robustness.

5. Conclusion

EMs have good image description abilities, but they have numerical instability problems, which seriously affects the accuracy of EMs. And the traditional calculation method of EMs will generate the numerical integration errors, which restricts the development and application of EMs in the field of pattern recognition and image processing. The main advantages of this paper are manifested as follows: (1) the promotion of FrEMs effectively solves the numerical instability problem and improves the antinoising attack performance and reconstruction performance of EMs to a certain degree. (2) The accurate calculation method based on GNI proposed in this paper effectively reduces the numerical integration error. The experiments show that FrEMs which use this calculation method have a very strong performance in the image reconstruction, rotation angle estimation, geometric invariance, and resistance to filtering attacks and JPEG compression attacks. Although the proposed method has the above advantages, it takes a long time to calculate. Because the core of the proposed scheme is GFrEMs, for a sized image, we know from (24) that the number of multiplications in the computation of one GFrEMs is . Since the GFrEMs with maximum moment order contains moments, the number of multiplications of the GFrEMs with maximum moment order is . Hence, the computational complexity of the proposed scheme is , which is very high. Thus, our future work is to propose a fast calculation method for this method.

Data Availability

The data used to support the findings of this study are available at https://download.csdn.net/download/weixin_40394701/10228207.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this article.

Acknowledgments

This work was supported by the National Key Research and Development Program of China (2018YFB0804104), National Natural Science Foundation of China (61802212, 61872203, 61806105, 61701212, 61701070, and 61672124), Shandong Provincial Natural Science Foundation (ZR2019BF017), Project of Shandong Province Higher Educational Science and Technology Program (J18KA331), Shandong Provincial Key Research and Development Program (Major Scientific and Technological Innovation Projects of Shandong Province) (2019JZZY010127, 2019JZZY010132, and 2019JZZY010201), Jinan City “20 Universities” Funding Projects Introducing Innovation Team Program (2019GXRC031), Password Theory Project of the 13th Five-Year Plan National Cryptography Development Fund (MMJJ20170203), and Key Research and Development Program of Shandong Academy of Science.

References

C. Wang, X. Wang, Z. Xia, B. Ma, and Y.-Q. Shi, “Image description with polar harmonic fourier moments,” IEEE Transactions on Circuits and Systems for Video Technology, p. 1, 2020, In press.
View at: Publisher Site | Google Scholar
B. Ma and Y. Q. Shi, “A reversible data hiding scheme based on code division multiplexing,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 9, pp. 1914–1927, 2016.
View at: Publisher Site | Google Scholar
M.-K. Hu, “Visual pattern recognition by moment invariants,” IRE Transactions on Information Theory, vol. 8, no. 2, pp. 179–187, 1962.
View at: Publisher Site | Google Scholar
Y. S. Abu-Mostafa and D. Psaltis, “Recognitive aspects of moment invariants,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-6, no. 6, pp. 698–706, 1984.
View at: Publisher Site | Google Scholar
C. Wang, X. Wang, Y. Li, Z. Xia, and C. Zhang, “Quaternion polar harmonic fourier moments for color images,” Information Sciences, vol. 450, pp. 141–156, 2018.
View at: Publisher Site | Google Scholar
M. R. Teague, “Image analysis via the general theory of moments∗,” Journal of the Optical Society of America, vol. 70, no. 8, pp. 920–930, 1980.
View at: Publisher Site | Google Scholar
C.-H. Teh and R. T. Chin, “On image analysis by the methods of moments,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 4, pp. 496–513, 1988.
View at: Publisher Site | Google Scholar
Y. Sheng and L. Shen, “Orthogonal fourier-mellin moments for invariant pattern recognition,” Journal of the Optical Society of America A, vol. 11, no. 6, pp. 1748–1757, 1994.
View at: Publisher Site | Google Scholar
Z. Ping, R. Wu, and Y. Sheng, “Image description with chebyshev-fourier moments,” Journal of the Optical Society of America A, vol. 19, no. 9, pp. 1748–1754, 2002.
View at: Publisher Site | Google Scholar
C. Wang, X. Wang, Z. Xia, and C. Zhang, “Ternary radial harmonic fourier moments based robust stereo image zero-watermarking algorithm,” Information Sciences, vol. 470, pp. 109–120, 2019.
View at: Publisher Site | Google Scholar
B. Xiao, J.-F. Ma, and X. Wang, “Image analysis by bessel-fourier moments,” Pattern Recognition, vol. 43, no. 8, pp. 2620–2629, 2010.
View at: Publisher Site | Google Scholar
P.-T. Yap, X. Jiang, and A. C. Kot, “Two-dimensional polar harmonic transforms for invariant image representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 7, pp. 1259–1270, 2009.
View at: Publisher Site | Google Scholar
H.-T. Hu, Y.-D. Zhang, C. Shao, and Q. Ju, “Orthogonal moments based on exponent functions: exponent-Fourier moments,” Pattern Recognition, vol. 47, no. 8, pp. 2596–2606, 2014.
View at: Publisher Site | Google Scholar
H.-Y. Yang, S.-R. Qi, C. Wang, S.-B. Yang, and X.-Y. Wang, “Image analysis by log-polar Exponent-Fourier moments,” Pattern Recognition, vol. 101, Article ID 107177, 2020.
View at: Publisher Site | Google Scholar
T. Wang and S. Liao, “Computational aspects of exponent-Fourier moments,” Pattern Recognition Letters, vol. 84, pp. 35–42, 2016.
View at: Publisher Site | Google Scholar
H.-Y. Yang, S.-R. Qi, P.-P. Niu, and X.-Y. Wang, “Color image zero-watermarking based on fast quaternion generic polar complex exponential transform,” Signal Processing: Image Communication, vol. 82, Article ID 115747, 2020.
View at: Publisher Site | Google Scholar
C. Singh and R. Upneja, “Error analysis in the computation of orthogonal rotation invariant moments,” Journal of Mathematical Imaging and Vision, vol. 49, no. 1, pp. 251–271, 2014.
View at: Publisher Site | Google Scholar
H. Zhang, Z. Li, and Y. Liu, “Fractional orthogonal fourier-mellin moments for pattern recognition,” in Communications in Computer and Information Science, pp. 766–778, Springer, Singapore, 2016.
View at: Publisher Site | Google Scholar
P. Kaur, H. S. Pannu, and A. K. Malhi, “Plant disease recognition using fractional-order Zernike moments and SVM classifier,” Neural Computing and Applications, vol. 31, no. 12, pp. 8749–8768, 2019.
View at: Publisher Site | Google Scholar
M. Yamni, A. Daoui, O. El ogri et al., “Fractional charlier moments for image reconstruction and image watermarking,” Signal Processing, vol. 171, Article ID 107509, 2020.
View at: Publisher Site | Google Scholar
K. M. Hosny, M. M. Darwish, and T. Aboelenen, “New fractional-order legendre-fourier moments for pattern recognition applications,” Pattern Recognition, vol. 103, Article ID 107324, 2020.
View at: Publisher Site | Google Scholar
H. Zhang, Z. Li, and Y. Liu, “Fractional orthogonal fourier-mellin moments for pattern recognition,” in Proceedings of the Chinese Conference on Pattern Recognition, pp. 766–778, Springer, Chengdu, China, November 2016.
View at: Publisher Site | Google Scholar
J. Yang, D. Jin, and Z. Lu, “Fractional-order zernike moments,” Journal of Computer Aided Design & Computer Graphics, vol. 29, pp. 479–484, 2017.
View at: Publisher Site | Google Scholar
K. M. Hosny, M. M. Darwish, and T. Aboelenen, “Novel fractional-order polar harmonic transforms for gray-scale and color image analysis,” Journal of the Franklin Institute, vol. 357, no. 4, pp. 2533–2560, 2020.
View at: Publisher Site | Google Scholar
R. Benouini, I. Batioua, K. Zenkouar, A. Zahi, S. Najah, and H. Qjidaa, “Fractional-order orthogonal chebyshev moments and moment invariants for image representation and pattern recognition,” Pattern Recognition, vol. 86, pp. 332–343, 2019.
View at: Publisher Site | Google Scholar
K. M. Hosny, M. M. Darwish, and M. M. Eltoukhy, “Novel multi-channel fractional-order radial harmonic fourier moments for color image analysis,” IEEE Access, vol. 8, pp. 40732–40743, 2020.
View at: Publisher Site | Google Scholar
R. Upneja, M. Pawlak, and A. M. Sahan, “An accurate approach for the computation of polar harmonic transforms,” Optik, vol. 158, pp. 623–633, 2018.
View at: Publisher Site | Google Scholar
S. X. Liao and M. Pawlak, “On the accuracy of zernike moments for image analysis,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 12, pp. 1358–1364, 1998.
View at: Publisher Site | Google Scholar
C. Singh, E. Walia, and R. Upneja, “Accurate calculation of zernike moments,” Information Sciences, vol. 233, pp. 255–275, 2013.
View at: Publisher Site | Google Scholar
Y. J. Jiang, Exponent Moments and its Application in Pattern Recognition, Beijing University of Posts and Telecommunications, Beijing, China, 2011.
B. Chen, M. Yu, Q. Su, H. J. Shim, and Y.-Q. Shi, “Fractional quaternion zernike moments for robust color image copy-move forgery detection,” IEEE Access, vol. 6, pp. 56637–56646, 2018.
View at: Publisher Site | Google Scholar
B. He, J. Cui, B. Xiao, and Y. Peng, “Image analysis using modified exponent-Fourier moments,” EURASIP Journal on Image and Video Processing, vol. 2019, no. 1, Article ID 72, pp. 1–27, 2019.
View at: Publisher Site | Google Scholar
K. M. Hosny and M. M. Darwish, “Accurate computation of quaternion polar complex exponential transform for color images in different coordinate systems,” Journal of Electronic Imaging, vol. 26, Article ID 023021, 2017.
View at: Publisher Site | Google Scholar
C. Singh and R. Upneja, “A computational model for enhanced accuracy of radial harmonic fourier moments,” in Proceedings of the World Congress of Engineering, pp. 1189–1194, London, UK, July 2012.
View at: Google Scholar
B. Yang, J. Kostková, J. Flusser, T. Suk, and R. Bujack, “Rotation invariants of vector fields from orthogonal moments,” Pattern Recognition, vol. 74, pp. 110–121, 2018.
View at: Publisher Site | Google Scholar
B. Ham, M. Cho, and J. Ponce, “Robust guided image filtering using nonconvex potentials,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 1, pp. 192–207, 2018.
View at: Publisher Site | Google Scholar
B. Ma, L. Chang, C. Wang, J. Li, X. Wang, and Y.-Q. Shi, “Robust image watermarking using invariant accurate polar harmonic fourier moments and chaotic mapping,” Signal Processing, vol. 172, Article ID 107544, 2020.
View at: Publisher Site | Google Scholar
C. Singh, E. Walia, R. Pooja, and R. Upneja, “Analysis of algorithms for fast computation of pseudo zernike moments and their numerical stability,” Digital Signal Processing, vol. 22, no. 6, pp. 1031–1043, 2012.
View at: Publisher Site | Google Scholar
A. Daoui, M. Yamni, O. El ogri, H. Karmouni, M. Sayyouri, and H. Qjidaa, “Stable computation of higher order charlier moments for signal and image reconstruction,” Information Sciences, vol. 521, pp. 251–276, 2020.
View at: Publisher Site | Google Scholar
Y.-Q. Shi, X. Li, X. Zhang, H.-T. Wu, and B. Ma, “Reversible data hiding: advances in the past two decades,” IEEE Access, vol. 4, pp. 3210–3237, 2016.
View at: Publisher Site | Google Scholar
Z. Xia, X. Wang, W. Zhou, R. Li, C. Wang, and C. Zhang, “Color medical image lossless watermarking using chaotic system and accurate quaternion polar harmonic transforms,” Signal Processing, vol. 157, pp. 108–118, 2019.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2020 Shujiang Xu 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.

PDF Download Citation

Download other formats

Order printed copies

Views

530

Downloads

689

Citations