Adaptive time-frequency transform
暂无分享,去创建一个
A matching pursuit decomposes any signal into a linear expansion of waveforms that belong to a dictionary of functions. These waveforms are selected in order to best match the signal structures. For dictionaries of functions that have a wide range of different time-frequency localizations, a matching pursuit yields an adaptive time-frequency transform. The authors derive a signal energy distribution in the time-frequency plane which does not include interference terms, unlike Wigner and Cohen class distributions. Signal components that are coherent with respect to the dictionary can be extracted. It is shown that time-frequency dictionaries yield adaptive decompositions where signal structures are represented by Gabor functions that match their time-frequency signature. The properties of the signal components are explicitly given by the scale, frequency, time, and phase indexes of the selected Gabor functions.<<ETX>>
[1] Shie Qian,et al. Signal representation using adaptive normalized Gaussian functions , 1994, Signal Process..
[2] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[3] L. Jones. On a conjecture of Huber concerning the convergence of projection pursuit regression , 1987 .
[4] L. Cohen,et al. Time-frequency distributions-a review , 1989, Proc. IEEE.