Skip to main content
Log in

Algorithm for Finding the Best Linear Combination Window Under the Sparse Solution Constraint of Discrete Gabor Transform Coefficients

  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

Single-window discrete Gabor transform with an adaptive window width selection algorithm (AWWS-DGT) and multi-window discrete Gabor transform (M-DGT) are the current mainstream analysis and processing methods for multi-component signals. However, the time–frequency accuracy in the time–frequency plane obtained by the two algorithms is not very high, and not all components of the signals that contain complex and very different time–frequency components can be displayed accurately. The linear combination window algorithm based on the \(\ell_{1}\) and \(\ell_{2}\) norm constraints of the transform coefficients can accurately display all the components of the signal, but the algorithm has poor anti-noise performance. In this paper, an algorithm for finding the best linear combination window under the sparse solution constraint of discrete Gabor transform coefficients is proposed. First, the optimal window number adaptive selection method proposed in this paper is used to select a set of window functions with different window widths, and the goal is to obtain the sparse solution of the transform coefficient. Through the gradient descent method, the best linear combination coefficient is obtained. Second, according to the best linear combination coefficient obtained, the selected window is combined into an analysis window function. Finally, the influence of the parameters on the combined window is further studied, and the results show that the number of windows has a great influence on the result and that the influence of the regularization parameter is negligible. Experiments on two simulated non-stationary signals and real electrocardiogram signals show that the proposed algorithm can display all components of the signals, the time–frequency accuracy is improved by 3% to 10%, and the anti-noise performance is more than 20% higher than that of the existing linear combination window algorithm. These advantages are very important for the analysis and processing of practical signals.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32
Fig. 33
Fig. 34
Fig. 35

Similar content being viewed by others

References

  1. L. Cohen, Wavelet moments and time-frequency analysis. Proc. SPIE 3807, 434–445 (1999)

    Article  Google Scholar 

  2. E. Candes, Compressive sampling. Proceed. Int. Congr. Mathmat. 3, 1433–1452 (2006)

    MathSciNet  MATH  Google Scholar 

  3. D. Donoho, Compressive sensing. IEEE Trans. Inf. Theory 52(4), 1289–1306 (2006)

    Article  MathSciNet  Google Scholar 

  4. D. Xiu-li, Y. Shen, Y. Wang, Adaptive window width selection algorithm for Gabor transform based on entropy. J. Electron. Inf. Technol. 30(10), 2291–2294 (2008)

    Google Scholar 

  5. D. Gabor, Theory of communication. J. Inst. Electr. Eng. 93(3), 429–457 (1946)

    Google Scholar 

  6. X.-h Gao, L. Tao, Gabor time-frequency representation for transient signals using multiwindow discrete Gabor transform. Int. J. Wavelets Multiresolut. Inf. Process. 15(4), 1750036 (2017). https://doi.org/10.1142/S0219691317500369

    Article  MathSciNet  MATH  Google Scholar 

  7. F. Jaillet, B. Torrésani, Time–frequency jigsaw puzzle: adaptive multiwindow and multilayered gabor expansions. IJWMIP. 5(2), 293–315 (2007)

    MathSciNet  MATH  Google Scholar 

  8. R. Li, L. Tao, Fast algorithm for computing analysis windows in real-valued discrete Gabor transform. IEICE Trans. Inform. Syst. E99D(6), 1682–1685 (2016)

    Article  Google Scholar 

  9. RLHon. LiTaoKeung Kwan, Efficient discrete Gabor transform with weighted linear combination of analysis windows. Electron. Lett. 52(9), 772–774 (2016)

    Article  Google Scholar 

  10. R. Li, J.-B. Liu, Fast approach for analysis windows computation of multiwindow discrete Gabor transform. IEEE Access. 6, 45681–45689 (2018)

    Article  Google Scholar 

  11. R. Li, Y. Huang, J.-B. Liu, Effective approach to calculate analysis window in infinite discrete Gabor transform. Complexity 2018, 9039240 (2018). https://doi.org/10.1155/2018/9039240

    Article  MATH  Google Scholar 

  12. R. Li, J. Zhou, Sparse Gabor time-frequency representation based on l(1/2)-l(2) regularization. Circuits Syst. Signal Process. 38(10), 4700–4722 (2019)

    Article  Google Scholar 

  13. R. Li, Kwan Hon Keung, Parallel Lattice Structure for Dual Windows Computation in Multiwindow Gabor Transform. IEEE Access. 7, 152722–152728 (2019)

    Article  Google Scholar 

  14. F.-P. Nie, H. Huang et al., Efficient and Robust feature selection via Joint ℓ2,1-norms minimization. NIPS 2010, 1813–1821 (2010)

    Google Scholar 

  15. T. Penzel, G.B. Moody et al., The apnea-ECG database. Comput. Cardiol. 2000(27), 255–258 (2000)

    Google Scholar 

  16. S.-C. Pei, S.-G. Huang, STFT with adaptive window width based on the chirp rate. IEEE Trans. Signal Process. 60(8), 4065–4080 (2012)

    Article  MathSciNet  Google Scholar 

  17. S. Qian, D. Chen, Discrete Gabor transforms. IEEE Trans. Signal Process. 41(7), 2429–2438 (1993)

    Article  Google Scholar 

  18. S. Qian, D. Chen, Joint time-frequency analysis. IEEE Signal Process. Mag. 6(2), 52–67 (1999)

    Article  Google Scholar 

  19. B. Ricaud, G. Stempful et al., An optimally concentrated Gabor transform for localized time-frequency components. Adv. Comput. Math. 40(3), 683–702 (2014)

    Article  MathSciNet  Google Scholar 

  20. L. Stanković, A measure of some time–frequency distributions concentration. Signal Process. 81(3), 621–631 (2001)

    Article  Google Scholar 

  21. P.L. Sondergaard, Efficient algorithms for the discrete Gabor transform with a long fir window. J. Fourier Anal. Appl. 18(3), 456–470 (2012)

    Article  MathSciNet  Google Scholar 

  22. L. Tao, G.H. Hu, H.K. Kwan, Multiwindow Real-valued discrete Gabor transform and its fast algorithms. IEEE Trans. Signal Process. 63(20), 5513–5524 (2015)

    Article  MathSciNet  Google Scholar 

  23. L. Tao, Gu. Juan-juan, Real-Valued Gabor Transforms: Theory Algorithms and Applications (Anhui Sci. Technol. Press, Anhui, 2017)

    Google Scholar 

  24. X.-d Zhang, Z. Bao, Non-Stationary Signal Analysis and Processing (National Defence Industry Press, Beijing, 1998)

    Google Scholar 

  25. H. Zou, T. Hastie, Regularization and variable selection via the elastic net. J. Royal Statistical Soc.: Series B (Statistical Methodology). 67(2), 301–320 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant 61372137, in part by the Natural Science Foundation of Anhui Province under Grant 1908085MF209, 1708085MF151 and in part by the Natural Science Foundation for the Higher Education Institutions of Anhui Province under Grant KJ2019A0036.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dai-lei Zhang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, Dl., Wang, Hb., Zhou, J. et al. Algorithm for Finding the Best Linear Combination Window Under the Sparse Solution Constraint of Discrete Gabor Transform Coefficients. Circuits Syst Signal Process 41, 425–460 (2022). https://doi.org/10.1007/s00034-021-01788-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-021-01788-5

Keywords

Navigation