351 research outputs found
Nonlinear approximation with nonstationary Gabor frames
We consider sparseness properties of adaptive time-frequency representations
obtained using nonstationary Gabor frames (NSGFs). NSGFs generalize classical
Gabor frames by allowing for adaptivity in either time or frequency. It is
known that the concept of painless nonorthogonal expansions generalizes to the
nonstationary case, providing perfect reconstruction and an FFT based
implementation for compactly supported window functions sampled at a certain
density. It is also known that for some signal classes, NSGFs with flexible
time resolution tend to provide sparser expansions than can be obtained with
classical Gabor frames. In this article we show, for the continuous case, that
sparseness of a nonstationary Gabor expansion is equivalent to smoothness in an
associated decomposition space. In this way we characterize signals with sparse
expansions relative to NSGFs with flexible time resolution. Based on this
characterization we prove an upper bound on the approximation error occurring
when thresholding the coefficients of the corresponding frame expansions. We
complement the theoretical results with numerical experiments, estimating the
rate of approximation obtained from thresholding the coefficients of both
stationary and nonstationary Gabor expansions.Comment: 19 pages, 2 figure
Frame Theory for Signal Processing in Psychoacoustics
This review chapter aims to strengthen the link between frame theory and
signal processing tasks in psychoacoustics. On the one side, the basic concepts
of frame theory are presented and some proofs are provided to explain those
concepts in some detail. The goal is to reveal to hearing scientists how this
mathematical theory could be relevant for their research. In particular, we
focus on frame theory in a filter bank approach, which is probably the most
relevant view-point for audio signal processing. On the other side, basic
psychoacoustic concepts are presented to stimulate mathematicians to apply
their knowledge in this field
Recommended from our members
Time-frequency representation of earthquake accelerograms and inelastic structural response records using the adaptive chirplet decomposition and empirical mode decomposition
In this paper, the adaptive chirplet decomposition combined with the Wigner-Ville transform and the empirical mode decomposition combined with the Hilbert transform are employed to process various non-stationary signals (strong ground motions and structural responses). The efficacy of these two adaptive techniques for capturing the temporal evolution of the frequency content of specific seismic signals is assessed. In this respect, two near-field and two far-field seismic accelerograms are analyzed. Further, a similar analysis is performed for records pertaining to the response of a 20-story steel frame benchmark building excited by one of the four accelerograms scaled by appropriate factors to simulate undamaged and severely damaged conditions for the structure. It is shown that the derived joint time–frequency representations of the response time histories capture quite effectively the influence of non-linearity on the variation of the effective natural frequencies of a structural system during the evolution of a seismic event; in this context, tracing the mean instantaneous frequency of records of critical structural responses is adopted.
The study suggests, overall, that the aforementioned techniques are quite viable tools for detecting and monitoring damage to constructed facilities exposed to seismic excitations
Weighted Thresholding and Nonlinear Approximation
We present a new method for performing nonlinear approximation with redundant
dictionaries. The method constructs an term approximation of the signal by
thresholding with respect to a weighted version of its canonical expansion
coefficients, thereby accounting for dependency between the coefficients. The
main result is an associated strong Jackson embedding, which provides an upper
bound on the corresponding reconstruction error. To complement the theoretical
results, we compare the proposed method to the pure greedy method and the
Windowed-Group Lasso by denoising music signals with elements from a Gabor
dictionary.Comment: 22 pages, 3 figure
The Affine Uncertainty Principle, Associated Frames and Applications in Signal Processing
Uncertainty relations play a prominent role in signal processing, stating that a signal can not be simultaneously concentrated in the two related domains of the corresponding phase space. In particular, a new uncertainty principle for the affine group, which is directly related to the wavelet transform has lead to a new minimizing waveform. In this thesis, a frame construction is proposed which leads to approximately tight frames based on this minimizing waveform. Frame properties such as the diagonality of the frame operator as well as lower and upper frame bounds are analyzed. Additionally, three applications of such frame constructions are introduced: inpainting of missing audio data, detection of neuronal spikes in extracellular recorded data and peak detection in MALDI imaging data
Basic Filters for Convolutional Neural Networks Applied to Music: Training or Design?
When convolutional neural networks are used to tackle learning problems based
on music or, more generally, time series data, raw one-dimensional data are
commonly pre-processed to obtain spectrogram or mel-spectrogram coefficients,
which are then used as input to the actual neural network. In this
contribution, we investigate, both theoretically and experimentally, the
influence of this pre-processing step on the network's performance and pose the
question, whether replacing it by applying adaptive or learned filters directly
to the raw data, can improve learning success. The theoretical results show
that approximately reproducing mel-spectrogram coefficients by applying
adaptive filters and subsequent time-averaging is in principle possible. We
also conducted extensive experimental work on the task of singing voice
detection in music. The results of these experiments show that for
classification based on Convolutional Neural Networks the features obtained
from adaptive filter banks followed by time-averaging perform better than the
canonical Fourier-transform-based mel-spectrogram coefficients. Alternative
adaptive approaches with center frequencies or time-averaging lengths learned
from training data perform equally well.Comment: Completely revised version; 21 pages, 4 figure
- …