arXiv subjects

Peter Balazs

Publications and source records attributed to Peter Balazs.

At least 55 records · Page 3Linked to original sources

arXiv2019

The invertibility of U-fusion cross Gram matrices of operators

For applications like the numerical solution of physical equations a discretization scheme for operators is necessary. Recently frames have been used for such an operator representation. In this paper, we apply fusion frames for this task. We interpret the operator representation using fusion frames as a generalization of fusion Gram matrices. We present the basic definition of $U$-fusion cross Gram matrices of operators for a bounded operator $U$. We give sufficient conditions for their (pseudo-)invertibility and present explicit formulas for the inverse. In particular, we characterize fusion Riesz bases and fusion orthonormal bases by such matrices. Finally, we look at which perturbations of fusion Bessel sequences preserve the invertibility of the fusion Gram matrix of operators.

math.FA↗

arXiv2019

Harmonic-aligned Frame Mask Based on Non-stationary Gabor Transform with Application to Content-dependent Speaker Comparison

We propose harmonic-aligned frame mask for speech signals using non-stationary Gabor transform (NSGT). A frame mask operates on the transfer coefficients of a signal and consequently converts the signal into a counterpart signal. It depicts the difference between the two signals. In preceding studies, frame masks based on regular Gabor transform were applied to single-note instrumental sound analysis. This study extends the frame mask approach to speech signals. For voiced speech, the fundamental frequency is usually changing consecutively over time. We employ NSGT with pitch-dependent and therefore time-varying frequency resolution to attain harmonic alignment in the transform domain and hence yield harmonic-aligned frame masks for speech signals. We propose to apply the harmonic-aligned frame mask to content-dependent speaker comparison. Frame masks, computed from voiced signals of a same vowel but from different speakers, were utilized as similarity measures to compare and distinguish the speaker identities (SID). Results obtained with deep neural networks demonstrate that the proposed frame mask is valid in representing speaker characteristics and shows a potential for SID applications in limited data scenarios.

cs.SD↗

arXiv2019

Frames, their relatives and reproducing kernel Hilbert spaces

This paper considers different facets of the interplay between reproducing kernel Hilbert spaces (RKHS) and stable analysis/synthesis processes: First, we analyze the structure of the reproducing kernel of a RKHS using frames and reproducing pairs. Second, we present a new approach to prove the result that finite redundancy of a continuous frame implies atomic structure of the underlying measure space. Our proof uses the RKHS structure of the range of the analysis operator. This in turn implies that all the attempts to extend the notion of Riesz basis to general measure spaces are fruitless since every such family can be identified with a discrete Riesz basis. Finally, we show how the range of the analysis operators of a reproducing pair can be equipped with a RKHS structure.

math.FA↗

arXiv2019

U-cross Gram matrices and their invertibility

The Gram matrix is defined for Bessel sequences by combining synthesis with subsequent analysis operators. If different sequences are used and an operator U is inserted we reach so called U-cross Gram matrices. This can be seen as reinterpretation of the matrix representation of operators using frames. In this paper we investigate some necessary or sufficient conditions for Schatten p-class properties and the invertibility of U-cross Gram matrices. In particular, we show that under mild conditions the pseudo-inverse of a U-cross Gram matrix can always be represented as a U-cross Gram matrix with dual frames of the given ones. We link some properties of U-cross Gram matrices to approximate duals. Finally, we state several stability results. More precisely, it is shown that the invertibility of U-cross Gram matrices is preserved under small perturbations.

math.FA↗

arXiv2019

Kernel Theorems in Coorbit Theory

We prove general kernel theorems for operators acting between coorbit spaces. These are Banach spaces associated to an integrable representation of a locally compact group and contain most of the usual function spaces (Besov spaces, modulation spaces, etc.). A kernel theorem describes the form of every bounded operator between a coorbit space of test functions and distributions by means of a kernel in a coorbit space associated to the tensor product representation. As special cases we recover Feichtinger's kernel theorem for modulation spaces and the recent generalizations by Cordero and Nicola. We also obtain a kernel theorem for operators between the Besov spaces $\dot{B}^0_{1,1}$ and $\dot{B}^{0}_{\infty, \infty }$.

math.FA↗

arXiv2018

Frames for the solution of operator equations in Hilbert spaces with fixed dual pairing

For the solution of operator equations, Stevenson introduced a definition of frames, where a Hilbert space and its dual are {\em not} identified. This means that the Riesz isomorphism is not used as an identification, which, for example, does not make sense for the Sobolev spaces $H_0^1(Ω)$ and $H^{-1}(Ω)$. In this article, we are going to revisit the concept of Stevenson frames and introduce it for Banach spaces. This is equivalent to $\ell^2$-Banach frames. It is known that, if such a system exists, by defining a new inner product and using the Riesz isomorphism, the Banach space is isomorphic to a Hilbert space. In this article, we deal with the contrasting setting, where $\mathcal H$ and $\mathcal H'$ are not identified, and equivalent norms are distinguished, and show that in this setting the investigation of $\ell^2$-Banach frames make sense.

math.FA↗

arXiv2018

Designing Gabor windows using convex optimization

Redundant Gabor frames admit an infinite number of dual frames, yet only the canonical dual Gabor system, constructed from the minimal l2-norm dual window, is widely used. This window function however, might lack desirable properties, e.g. good time-frequency concentration, small support or smoothness. We employ convex optimization methods to design dual windows satisfying the Wexler-Raz equations and optimizing various constraints. Numerical experiments suggest that alternate dual windows with considerably improved features can be found.

math.NA↗

arXiv2018

A survey on the unconditional convergence and the invertibility of multipliers with implementation

The paper presents a survey over frame multipliers and related concepts. In particular, it includes a short motivation of why multipliers are of interest to consider, a review as well as extension of recent results, devoted to the unconditional convergence of multipliers, sufficient and/or necessary conditions for the invertibility of multipliers, and representation of the inverse via Neumann-like series and via multipliers with particular parameters. Multipliers for frames with specific structure, namely, Gabor and wavelet multipliers, are also considered. Some of the results for the representation of the inverse multiplier are implemented in Matlab codes and the algorithms are described.

math.FA↗

arXiv2018

Inpainting of long audio segments with similarity graphs

We present a novel method for the compensation of long duration data loss in audio signals, in particular music. The concealment of such signal defects is based on a graph that encodes signal structure in terms of time-persistent spectral similarity. A suitable candidate segment for the substitution of the lost content is proposed by an intuitive optimization scheme and smoothly inserted into the gap, i.e. the lost or distorted signal region. Extensive listening tests show that the proposed algorithm provides highly promising results when applied to a variety of real-world music signals.

cs.SD↗

arXiv2017

Discretization in generalized coorbit spaces: extensions, annotations and errata for "Continuous Frames, Function Spaces and the Discretization Problem" by M. Fornasier and H. Rauhut

During the process of writing the manuscript ["Continuous warped time-frequency representations - Coorbit spaces and discretization", N. Holighaus, C. Wiesmeyr and P. Balazs], the work ["Continuous Frames, Function Spaces and the Discretization Problem" by M. Fornasier and H. Rauhut - (1)] was one of the major foundations of our results and, naturally, we found ourselves going back to reading that contribution once and again. In particular in Section 5, which is concerned with the discretization problem, we have found some typographical errors, small inaccuracies and some parts that we just would have wished to be slightly more accessible. Finally, for our own theory, a generalization of a central definition required us to verify that all the derivations in Section 5 of (1) still hold after the necessary modifications. Considering the importance of the results in (1) for the community, this was reason enough to start this side project of re-writing that least accessible portion of Fornasier and Rauhut's manuscript, eliminating the errors we found, adding annotations where we consider them useful and modifying the results to take into account the generalization we require for our own work. What you see is the result of our endeavor, a one-to-one substitute for Section 5 in (1).

math.FA↗

arXiv2017

Reproducing pairs and Gabor systems at critical density

We use the concept of reproducing pairs to study Gabor systems at critical density. First, we present a generalization of the Balian-Low theorem to the reproducing pairs setting. Then, we prove our main result that there exists a reproducing partner for the Gabor system of integer time-frequency shifts of the Gaussian. In other words, the coefficients for this Gabor expansion of a square integrable function can be calculated using inner products with an unstructured family of vectors in $ L^2(\R)$. This solves the possibly last open question for this system.

math.FA↗

arXiv2016

Redundant Representation of Operators

To be able to solve operator equations numerically a discretization of those operators is necessary. In the Galerkin approach bases are used to achieve discretized versions of operators. In a more general set-up, frames can be used to sample the involved signal spaces and therefore those operators. Here we look at the redundant representation of operators resulting from a matrix representation using frames. We focus on injectivity, surjectivity and, in particular, invertibility of the involved operators and matrices. Furthermore we show sufficient conditions that the composition of matrices correspond to the composition of operators.

math.FA↗

arXiv2016

A Guide to Localized Frames and Applications to Galerkin-like Representations of Operators

This chapter offers a detailed survey on intrinsically localized frames and the corresponding matrix representation of operators. We re-investigate the properties of localized frames and the associated Banach spaces in full detail. We investigate the representation of operators using localized frames in a Galerkin-type scheme. We show how the boundedness and the invertibility of matrices and operators are linked and give some sufficient and necessary conditions for the boundedness of operators between the associated Banach spaces.

math.FA↗

arXiv2016

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.

cs.SD↗

arXiv2016

A Non-iterative Method for (Re)Construction of Phase from STFT Magnitude

A non-iterative method for the construction of the Short-Time Fourier Transform (STFT) phase from the magnitude is presented. The method is based on the direct relationship between the partial derivatives of the phase and the logarithm of the magnitude of the un-sampled STFT with respect to the Gaussian window. Although the theory holds in the continuous setting only, the experiments show that the algorithm performs well even in the discretized setting (Discrete Gabor transform) with low redundancy using the sampled Gaussian window, the truncated Gaussian window and even other compactly supported windows like the Hann window. Due to the non-iterative nature, the algorithm is very fast and it is suitable for long audio signals. Moreover, solutions of iterative phase reconstruction algorithms can be improved considerably by initializing them with the phase estimate provided by the present algorithm. We present an extensive comparison with the state-of-the-art algorithms in a reproducible manner.

cs.SD↗

arXiv2016

On the dual frame induced by an invertible frame multiplier

Recently it has been established that given an invertible frame multiplier with semi-normalized symbol, a specific dual of any of the two involved frames can be determined for the inversion purpose. The inverse can be represented as a multiplier with the reciprocal symbol, this particular dual of one of the given frames, and any dual of the other frame. The specific dual is the only one having this property among all Bessel sequences. In this manuscript we extend the results showing that the specific dual with the above mentioned property is unique among all possible sequences. Furthermore, we allow the symbol to be not necessarily semi-normalized. Finally we characterize cases when the canonical dual frame and the new specific dual frame coincide.

math.FA↗

arXiv2016

The $α$-Modulation Transform: Admissibility, Coorbit Theory and Frames of Compactly Supported Functions

The $α$-modulation transform is a time-frequency transform generated by square-integrable representations of the affine Weyl-Heisenberg group modulo suitable subgroups. In this paper we prove new conditions that guarantee the admissibility of a given window function. We also show that the generalized coorbit theory can be applied to this setting, assuming specific regularity of the windows. This then yields canonical constructions of Banach frames and atomic decompositions in $α$-modulation spaces. In particular, we prove the existence of compactly supported (in time domain) vectors that are admissible and satisfy all conditions within the coorbit machinery, which considerably go beyond known results.

math.FA↗

arXiv2016

A Perceptually Motivated Filter Bank with Perfect Reconstruction for Audio Signal Processing

Many audio applications rely on filter banks (FBs) to analyze, process, and re-synthesize sounds. To approximate the auditory frequency resolution in the signal chain, some applications rely on perceptually motivated FBs, the gammatone FB being a popular example. However, most perceptually motivated FBs only allow partial signal reconstruction at high redundancies and/or do not have good resistance to sub-channel processing. This paper introduces an oversampled perceptually motivated FB enabling perfect reconstruction, efficient FB design, and adaptable redundancy. The filters are directly constructed in the frequency domain and linearly distributed on a perceptual frequency scale (e.g. ERB, Bark, or Mel scale). The proposed design allows for various filter shapes, uniform or non-uniform FB setting, and large down-sampling factors. For redundancies $\geq$ 3 perfect reconstruction is achieved by computing the canonical dual FB analytically. For lower redundancies perfect reconstruction is achieved using an iterative method. Experiments show performance improvements of the proposed approach when compared to the gammatone FB in terms of reconstruction error and resistance to sub-channel processing, especially at low redundancies.

cs.SD↗