Journal of Guangdong University of Technology ›› 2021, Vol. 38 ›› Issue (05): 48-51.doi: 10.12052/gdutxb.200107

Previous Articles     Next Articles

A Complex Sparse Bayesian Method to Compute Hilbert Transform

Xie Wei-xiang, Mo Yan   

  1. School of Applied Mathematics, Guangdong University of Technology, Guangzhou 510520, China
  • Received:2020-08-24 Online:2021-09-10 Published:2021-07-13

Abstract: Hilbert transform is an important tool for signal analysis and processing. Due to the singularity of the Cauchy kernel at the origin, the calculation of the Hilbert transform becomes very difficult. Recently, researchers firstly propose the AFD (Adaptive Fourier Decomposition) method which uses complex analysis to calculate the Hilbert transform. The AFD method adaptively approximates the analytical signal through the linear combination of the parameterized Szegö kernel to obtain original signals' Hilbert transform. Compared with the traditional method, the AFD method can give approximate analytical expressions and thus has a wider application. However, when using the principle of maximum selection to select parameters, the AFD method needs to exhaust all points of the unit disk which is time-consuming. Sparse Bayesian learning has been a hot spot in machine learning research in recent years. The Szegö kernel-based complex sparse Bayesian learning algorithm can provide a sparse rational approximation. A complex sparse Bayesian learning algorithm will be proposed based on the Szegö kernel to calculate the Hilbert transform. This method has the same advantages as the AFD method, and an iterative optimization can be performed without parameter control. The calculation speed of the proposed method is fast. Experimental results show that the proposed method is effective.

Key words: complex sparse Bayesian learning, Szeg? kernel, Hilbert transform, analytic function

CLC Number: 

  • O242.2
[1] ZHOU C, YANG L, LIU Y, et al. A novel method for computing the Hilbert transform with Haar multiresolution approximation [J]. Journal of Computational and Applied Mathematics, 2009, 223: 585-579.
[2] MICCHELLI C A, XU Y S, YU B. On computing with the Hilbert spline transform [J]. Advances in Computational Mathematics, 2013, 38(3): 623-646.
[3] MO Y, QIAN T, MAI W X, et al. The AFD methods to compute Hilbert transform [J]. Applied Mathematics Letters, 2015, 45: 18-24.
[4] 杨婷, 滕少华. 改进的贝叶斯分类方法在电信客户流失中的研究与应用[J]. 广东工业大学学报, 2015, 32(3): 67-72.
YANG T, TENG S H. Research and application of improved Bayes algorithm for the telecommunication customer churn [J]. Journal of Guangdong University of Technology, 2015, 32(3): 67-72.
[5] TIPPING M E. The relevance vector machine[C]//Advances in Neural Information Processing Systems. MIT: DBLP, 2000: 652-658.
[6] WU Q S, ZHANG Y D, AMIN M G, et al. Complex multitask Bayesian compressive sensing[C]//IEEE International Conference on Acoustics. Florence: SSP, 2014: 3375-3379.
[7] GARNETT J B. Bounded analytic functions[M]. New York: Academic Press, 1981: 27-45.
[1] YOU Xiu-ying. The Growth of Lower Side Bitangent Laplace-Stieltjes Integral in Bilinear Strip [J]. Journal of Guangdong University of Technology, 2004, 21(1): 92-96.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!