Study on the reduction of computational complexity and sound analysis of the modified Gabor wavelet

被引：0

作者：

Shirasuna, Miyori ^{[1
]}

Nakade, Yuya ^{[1
]}

Nakagawa, Masaru ^{[1
]}

机构：

[1] Toyohashi Univ Technol, Dept Mech Engn, Toyohashi, Aichi, Japan

来源：

2019 IEEE CPMT SYMPOSIUM JAPAN (ICSJ) | 2019年

关键词：

wavelet transform; sound analysis; high speed computation;

D O I：

10.1109/icsj47124.2019.8998658

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We have reported that the computational complexity of Continuous wavelet transform can be theoretically reduced by using wavelet functions that are well designed and support a compact frequency domain. In this study, we apply this theory to Gabor wavelet, which has the highest analysis accuracy among many mother wavelets, and we try to apply it to actual signals.

引用

页码：127 / 128

页数：2

共 50 条

[1] A Low Computational Complexity Modified Complex Harmonic Wavelet Transform
Pritiranjan Khatua
Kailash Chandra Ray
Circuits, Systems, and Signal Processing, 2022, 41 : 6462 - 6483
[2] A Low Computational Complexity Modified Complex Harmonic Wavelet Transform
Khatua, Pritiranjan
Ray, Kailash Chandra
CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2022, 41 (11) : 6462 - 6483
[3] COMPLEXITY REDUCTION OF WAVELET CODECS THROUGH MODIFIED QUALITY CONTROL
Loomans, Marijn J. H.
de With, Peter H. N.
2013 20TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP 2013), 2013, : 1670 - 1674
[4] From Gabor Transform to Wavelet Analysis
Zheng Zhizhen
EarthquakeResearchinChina, 1996, (04) : 30 - 36
[5] Computational complexity reduction of GreenOFDM
Monsalve, Jorge L. Gulfo
Mestdagh, Denis J. G.
Brossier, Jean-Marc
ANNALS OF TELECOMMUNICATIONS, 2020, 75 (5-6) : 185 - 191
[6] Computational complexity reduction of GreenOFDM
Jorge L. Gulfo Monsalve
Denis J. G. Mestdagh
Jean-Marc Brossier
Annals of Telecommunications, 2020, 75 : 185 - 191
[7] Computational frameworks for discrete Gabor analysis
Strohmer, T
ADVANCED SIGNAL PROCESSING: ALGORITHMS, ARCHITECTURES, AND IMPLEMENTATIONS VII, 1997, 3162 : 376 - 387
[8] On the computational complexity of cut-reduction
Aehlig, Klaus
Beckmann, Arnold
TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 284 - 293
[9] On the computational complexity of cut-reduction
Aehlig, Klaus
Beckmann, Arnold
ANNALS OF PURE AND APPLIED LOGIC, 2010, 161 (06) : 711 - 736
[10] Reduction of computational complexity in the IA algorithm
Nakanishi, I
Itoh, Y
Fukui, Y
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1996, E79A (11) : 1918 - 1921

← 1 2 3 4 5 →