Reassignment Method - Efficient Computation of Reassigned Times and Frequencies | Efficient Computation Reassigned Times Frequencies

Efficient Computation of Reassigned Times and Frequencies

In digital signal processing, it is most common to sample the time and frequency domains. The discrete Fourier transform is used to compute samples of the Fourier transform from samples of a time domain signal. The reassignment operations proposed by Kodera et al. cannot be applied directly to the discrete short-time Fourier transform data, because partial derivatives cannot be computed directly on data that is discrete in time and frequency, and it has been suggested that this difficulty has been the primary barrier to wider use of the method of reassignment.

It is possible to approximate the partial derivatives using finite differences. For example, the phase spectrum can be evaluated at two nearby times, and the partial derivative with respect to time be approximated as the difference between the two values divided by the time difference, as in

$\begin{matrix} \frac{\partial \phi(t, \omega)}{\partial t} & \approx \frac{1}{\Delta t} \left \\ \frac{\partial \phi(t, \omega)}{\partial \omega} & \approx \frac{1}{\Delta \omega} \left \end{matrix}$

For sufficiently small values of and, and provided that the phase difference is appropriately "unwrapped", this finite-difference method yields good approximations to the partial derivatives of phase, because in regions of the spectrum in which the evolution of the phase is dominated by rotation due to sinusoidal oscillation of a single, nearby component, the phase is a linear function.

Independently of Kodera et al., Nelson arrived at a similar method for improving the time-frequency precision of short-time spectral data from partial derivatives of the short-time phase spectrum. It is easily shown that Nelson's cross spectral surfaces compute an approximation of the derivatives that is equivalent to the finite differences method.

Auger and Flandrin showed that the method of reassignment, proposed in the context of the spectrogram by Kodera et al., could be extended to any member of Cohen's class of time-frequency representations by generalizing the reassignment operations to

$\begin{matrix} \hat{t} (t,\omega) & = t - \frac{\iint \tau \cdot W_{x}(t-\tau,\omega -\nu) \cdot \Phi(\tau,\nu) d\tau d\nu} {\iint W_{x}(t-\tau,\omega -\nu) \cdot \Phi(\tau,\nu) d\tau d\nu } \\ \hat{\omega} (t,\omega) & = \omega - \frac{\iint \nu \cdot W_{x}(t-\tau,\omega -\nu) \cdot \Phi(\tau,\nu) d\tau d\nu} {\iint W_{x}(t-\tau,\omega -\nu) \cdot \Phi(\tau,\nu) d\tau d\nu} \end{matrix}$

where is the Wigner–Ville distribution of, and is the kernel function that defines the distribution. They further described an efficient method for computing the times and frequencies for the reassigned spectrogram efficiently and accurately without explicitly computing the partial derivatives of phase.

In the case of the spectrogram, the reassignment operations can be computed by

$\begin{matrix} \hat{t} (t,\omega) & = t - \Re \Bigg\{ \frac{ X_{\mathcal{T}h}(t,\omega) \cdot X^*(t,\omega) } { | X(t,\omega) |^2 } \Bigg\} \\ \hat{\omega}(t,\omega) & = \omega + \Im \Bigg\{ \frac{ X_{\mathcal{D}h}(t,\omega) \cdot X^*(t,\omega) } { | X(t,\omega) |^2 } \Bigg\} \end{matrix}$

where is the short-time Fourier transform computed using an analysis window, is the short-time Fourier transform computed using a time-weighted anlaysis window $h_{\mathcal{T}}(t) = t \cdot h(t)$ and is the short-time Fourier transform computed using a time-derivative analysis window .

Using the auxiliary window functions and, the reassignment operations can be computed at any time-frequency coordinate from an algebraic combination of three Fourier transforms evaluated at . Since these algorithms operate only on short-time spectral data evaluated at a single time and frequency, and do not explicitly compute any derivatives, this gives an efficient method of computing the reassigned discrete short-time Fourier transform.

One constraint in this method of computation is that the must be non-zero. This is not much of a restriction, since the reassignment operation itself implies that there is some energy to reassign, and has no meaning when the distribution is zero-valued.

Read more about this topic: Reassignment Method

Famous quotes containing the words efficient, computation and/or times:

“As machines become more and more efficient and perfect, so it will become clear that imperfection is the greatness of man.”
—Ernst Fischer (1899–1972)

“I suppose that Paderewski can play superbly, if not quite at his best, while his thoughts wander to the other end of the world, or possibly busy themselves with a computation of the receipts as he gazes out across the auditorium. I know a great actor, a master technician, can let his thoughts play truant from the scene ...”
—Minnie Maddern Fiske (1865–1932)

“When General Motors has to go to the bathroom ten times a day, the whole country’s ready to let go. You heard of that market crash in ‘29? I predicted that.... I was nursing a director of General Motors. Kidney ailment, they said; nerves, I said. Then I asked myself, “What’s General Motors got to be nervous about?” “Overproduction,” I says. “Collapse.””
—John Michael Hayes (b. 1919)