TY - JOUR

T1 - Quasi Monte Carlo time-frequency analysis

AU - Levie, Ron

AU - Avron, Haim

AU - Kutyniok, Gitta

N1 - Publisher Copyright:
© 2022 Elsevier Inc.

PY - 2023/2/15

Y1 - 2023/2/15

N2 - We study signal processing tasks in which the signal is mapped via some generalized time-frequency transform to a higher dimensional time-frequency space, processed there, and synthesized to an output signal. We show how to approximate such methods using a quasi-Monte Carlo (QMC) approach. We consider cases where the time-frequency representation is redundant, having feature axes in addition to the time and frequency axes. The proposed QMC method allows sampling both efficiently and evenly such redundant time-frequency representations. Indeed, 1) the number of samples required for a certain accuracy is log-linear in the resolution of the signal space, and depends only weakly on the dimension of the redundant time-frequency space, and 2) the quasi-random samples have low discrepancy, so they are spread evenly in the redundant time-frequency space. One example of such redundant representation is the localizing time-frequency transform (LTFT), where the time-frequency plane is enhanced by a third axis. This higher dimensional time-frequency space improves the quality of some time-frequency signal processing tasks, like the phase vocoder (an audio signal processing effect). Since the computational complexity of the QMC is log-linear in the resolution of the signal space, this higher dimensional time-frequency space does not degrade the computation complexity of the proposed QMC method. The proposed QMC method is more efficient than standard Monte Carlo methods, since the deterministic QMC sample points are optimally spread in the time-frequency space, while random samples are not.

AB - We study signal processing tasks in which the signal is mapped via some generalized time-frequency transform to a higher dimensional time-frequency space, processed there, and synthesized to an output signal. We show how to approximate such methods using a quasi-Monte Carlo (QMC) approach. We consider cases where the time-frequency representation is redundant, having feature axes in addition to the time and frequency axes. The proposed QMC method allows sampling both efficiently and evenly such redundant time-frequency representations. Indeed, 1) the number of samples required for a certain accuracy is log-linear in the resolution of the signal space, and depends only weakly on the dimension of the redundant time-frequency space, and 2) the quasi-random samples have low discrepancy, so they are spread evenly in the redundant time-frequency space. One example of such redundant representation is the localizing time-frequency transform (LTFT), where the time-frequency plane is enhanced by a third axis. This higher dimensional time-frequency space improves the quality of some time-frequency signal processing tasks, like the phase vocoder (an audio signal processing effect). Since the computational complexity of the QMC is log-linear in the resolution of the signal space, this higher dimensional time-frequency space does not degrade the computation complexity of the proposed QMC method. The proposed QMC method is more efficient than standard Monte Carlo methods, since the deterministic QMC sample points are optimally spread in the time-frequency space, while random samples are not.

KW - Phase vocoder

KW - Quasi-Monte Carlo

KW - Signal processing

KW - Time-frequency analysis

KW - Wavelet

UR - http://www.scopus.com/inward/record.url?scp=85139309554&partnerID=8YFLogxK

U2 - 10.1016/j.jmaa.2022.126732

DO - 10.1016/j.jmaa.2022.126732

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85139309554

SN - 0022-247X

VL - 518

JO - Journal of Mathematical Analysis and Applications

JF - Journal of Mathematical Analysis and Applications

IS - 2

M1 - 126732

ER -