Tobias Lindstrom Jensen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tobias Lindstrom Jensen has a total of 111 co-authors. Here are the top co-authors by number of shared publications:
- Mads Græsbøll Christensen
Audio Analysis Lab, Department of Electronic Systems, Aalborg University, Aalborg, Denmark
12 shared publications Soren Holdt Jensen
Signal and Information Processing Group, Department of Electronic Systems, Aalborg University, Aalborg, Denmark
9 shared publications- Jesper Kjaer Nielsen
Audio Analysis Lab, CREATE, Aalborg University, Aalborg, Denmark
8 shared publications - Jan Ostergaard
Department of Electronic Systems, Aalborg University, Aalborg, Denmark
6 shared publications - Jesper Rindom Jensen
Aalborg University
6 shared publications Daniele Giacobello
Sonos Inc., Santa Barbara, CA
5 shared publications
Latest Publications
- Top Cited Papers
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5000-5004
An Optimal Channel Estimation Scheme for Intelligent Reflecting Surfaces Based on a Minimum Variance Unbiased Estimator
In a wireless system with Intelligent Reflective Surfaces (IRS) containing many passive elements, we consider the problem of channel estimation. All the links from the transmitter to the receiver via each IRS elements (or groups) are estimated. We show that the estimation performance are dependent on the setting of the IRS, and design an optimal channel estimation scheme where the IRS elements follow an optimal series of activation patterns. The optimal design is guided by results for the minimum variance unbiased estimation. The IRS setting during the channel estimation period mimics the discrete Fourier transforms. We show theoretically and with simulations that the estimation variance is one order smaller compared to existing methods with on/off IRS activation patterns as proposed in the literature.
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5000-5004
Top Cited PapersAn Optimal Channel Estimation Scheme for Intelligent Reflecting Surfaces Based on a Minimum Variance Unbiased Estimator
In a wireless system with Intelligent Reflective Surfaces (IRS) containing many passive elements, we consider the problem of channel estimation. All the links from the transmitter to the receiver via each IRS elements (or groups) are estimated. We show that the estimation performance are dependent on the setting of the IRS, and design an optimal channel estimation scheme where the IRS elements follow an optimal series of activation patterns. The optimal design is guided by results for the minimum variance unbiased estimation. The IRS setting during the channel estimation period mimics the discrete Fourier transforms. We show theoretically and with simulations that the estimation variance is one order smaller compared to existing methods with on/off IRS activation patterns as proposed in the literature.
- 1 December 2019
- Published by Elsevier in Signal Processing
- Vol. 165, 7-19
A fast interior-point method for atomic norm soft thresholding
- 1 December 2019
- Published by Elsevier in Signal Processing
- Vol. 165, 7-19
A fast interior-point method for atomic norm soft thresholding
- Open Access
A Fast Interior Point Method for Atomic Norm Soft Thresholding
The atomic norm provides a generalization of the $\ell_1$-norm to continuous parameter spaces. When applied as a sparse regularizer for line spectral estimation the solution can be obtained by solving a convex optimization problem. This problem is known as atomic norm soft thresholding (AST). It can be cast as a semidefinite program and solved by standard methods. In the semidefinite formulation there are $O(N^2)$ dual variables which complicates the implementation of a standard primal-dual interior-point method based on symmetric cones. That has lead researcher to consider alternating direction method of multipliers (ADMM) for the solution of AST, but this method is still somewhat slow for large problem sizes. To obtain a faster algorithm we reformulate AST as a non-symmetric conic program. That has two properties of key importance to its numerical solution: the conic formulation has only $O(N)$ dual variables and the Toeplitz structure inherent to AST is preserved. Based on it we derive FastAST which is a primal-dual interior point method for solving AST. Two variants are considered with the fastest one requiring only $O(N^2)$ flops per iteration. Extensive numerical experiments demonstrate that FastAST solves AST significantly faster than a state-of-the-art solver based on ADMM.Open AccessA Fast Interior Point Method for Atomic Norm Soft Thresholding
The atomic norm provides a generalization of the $\ell_1$-norm to continuous parameter spaces. When applied as a sparse regularizer for line spectral estimation the solution can be obtained by solving a convex optimization problem. This problem is known as atomic norm soft thresholding (AST). It can be cast as a semidefinite program and solved by standard methods. In the semidefinite formulation there are $O(N^2)$ dual variables which complicates the implementation of a standard primal-dual interior-point method based on symmetric cones. That has lead researcher to consider alternating direction method of multipliers (ADMM) for the solution of AST, but this method is still somewhat slow for large problem sizes. To obtain a faster algorithm we reformulate AST as a non-symmetric conic program. That has two properties of key importance to its numerical solution: the conic formulation has only $O(N)$ dual variables and the Toeplitz structure inherent to AST is preserved. Based on it we derive FastAST which is a primal-dual interior point method for solving AST. Two variants are considered with the fastest one requiring only $O(N^2)$ flops per iteration. Extensive numerical experiments demonstrate that FastAST solves AST significantly faster than a state-of-the-art solver based on ADMM. - 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1947-1952
Revisiting the Linear Prediction Analysis-by-Synthesis Speech Coding Paradigm Using Real-Time Convex Optimization
In this work, we propose a novel approach to speech coding by rewriting the nonlinear analysis-by-synthesis linear prediction scheme as a convex problem. This allows for determining trade-offs between, on one hand, the reconstruction error and, on the other, the sparsity of the predictor and the residual used to parametrize the speech signal. Differently from traditional coding schemes where the parameters are chosen throughout multiple optimization stages, our scheme produces a one-shot parametrization of a speech segment that intrinsically takes into consideration the voiced or unvoiced nature of a speech segment providing a better balance between residual and predictor and, consequently, a more appropriate bit allocation.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1947-1952
Revisiting the Linear Prediction Analysis-by-Synthesis Speech Coding Paradigm Using Real-Time Convex Optimization
In this work, we propose a novel approach to speech coding by rewriting the nonlinear analysis-by-synthesis linear prediction scheme as a convex problem. This allows for determining trade-offs between, on one hand, the reconstruction error and, on the other, the sparsity of the predictor and the residual used to parametrize the speech signal. Differently from traditional coding schemes where the parameters are chosen throughout multiple optimization stages, our scheme produces a one-shot parametrization of a speech segment that intrinsically takes into consideration the voiced or unvoiced nature of a speech segment providing a better balance between residual and predictor and, consequently, a more appropriate bit allocation.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 446-450
Speech Dereverberation Based on Convex Optimization Algorithms for Group Sparse Linear Prediction
In this paper, we consider methods for improving far-field speech recognition using dereverberation based on sparse multi-channel linear prediction. In particular, we extend successful methods based on nonconvex iteratively reweighted least squares, that look for a sparse desired speech signal in the short-term Fourier transform domain, by proposing sparsity promoting convex functions. Furthermore, we show how to improve performance by applying regularization into both the reweighted least squares and convex methods. We evaluate the methods using large scale simulations by mimicking the application scenarios of interest. The experiments show that the proposed convex formulations and regularization offer improvements over existing methods with added robustness and flexibility in fairly different acoustic scenarios.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 446-450
Speech Dereverberation Based on Convex Optimization Algorithms for Group Sparse Linear Prediction
In this paper, we consider methods for improving far-field speech recognition using dereverberation based on sparse multi-channel linear prediction. In particular, we extend successful methods based on nonconvex iteratively reweighted least squares, that look for a sparse desired speech signal in the short-term Fourier transform domain, by proposing sparsity promoting convex functions. Furthermore, we show how to improve performance by applying regularization into both the reweighted least squares and convex methods. We evaluate the methods using large scale simulations by mimicking the application scenarios of interest. The experiments show that the proposed convex formulations and regularization offer improvements over existing methods with added robustness and flexibility in fairly different acoustic scenarios.
- 4 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 65 (19) , 5137-5152
A Fast Algorithm for Maximum-Likelihood Estimation of Harmonic Chirp Parameters
The analysis of (approximately) periodic signals is an important element in numerous applications. One generalization of standard periodic signals often occurring in practice is harmonic chirp signals where the instantaneous frequency increases/decreases linearly as a function of time. A statistically efficient estimator for extracting the parameters of the harmonic chirp model in additive white Gaussian noise is the maximum-likelihood (ML) estimator, which recently has been demonstrated to be robust to noise and accurate-even when the model order is unknown. The main drawback of the ML estimator is that only very computationally demanding algorithms for computing an estimate are known. In this paper, we give an algorithm for computing an estimate to the ML estimator for a number of candidate model orders with a much lower computational complexity than previously reported in the literature. The lower computational complexity is achieved by exploiting recursive matrix structures, including a block Toeplitz-plus-Hankel structure, the fast Fourier transform, and using a two-step approach composed of a grid and refinement step to reduce the number of required function evaluations. The proposed algorithms are assessed via Monte Carlo and timing studies. The timing studies show that the proposed algorithm is orders of magnitude faster than a recently proposed algorithm for practical sizes of the number of harmonics and the length of the signal.
- 4 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 65 (19) , 5137-5152
A Fast Algorithm for Maximum-Likelihood Estimation of Harmonic Chirp Parameters
The analysis of (approximately) periodic signals is an important element in numerous applications. One generalization of standard periodic signals often occurring in practice is harmonic chirp signals where the instantaneous frequency increases/decreases linearly as a function of time. A statistically efficient estimator for extracting the parameters of the harmonic chirp model in additive white Gaussian noise is the maximum-likelihood (ML) estimator, which recently has been demonstrated to be robust to noise and accurate-even when the model order is unknown. The main drawback of the ML estimator is that only very computationally demanding algorithms for computing an estimate are known. In this paper, we give an algorithm for computing an estimate to the ML estimator for a number of candidate model orders with a much lower computational complexity than previously reported in the literature. The lower computational complexity is achieved by exploiting recursive matrix structures, including a block Toeplitz-plus-Hankel structure, the fast Fourier transform, and using a two-step approach composed of a grid and refinement step to reduce the number of required function evaluations. The proposed algorithms are assessed via Monte Carlo and timing studies. The timing studies show that the proposed algorithm is orders of magnitude faster than a recently proposed algorithm for practical sizes of the number of harmonics and the length of the signal.
- 1 June 2017
- Published by Elsevier in Signal Processing
- Vol. 135, 188-197
Fast fundamental frequency estimation: Making a statistically efficient estimator computationally efficient
- 1 June 2017
- Published by Elsevier in Signal Processing
- Vol. 135, 188-197
Fast fundamental frequency estimation: Making a statistically efficient estimator computationally efficient
- 1 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4192-4196
Multi-pitch estimation using semidefinite programming
Multi-pitch estimation concerns the problem of estimating the fundamental frequencies (pitches) and amplitudes/phases of multiple superimposed harmonic signals with application in music, speech, vibration analysis, and other fields. In this paper we formulate a complex-valued multi-pitch estimator via a semidefinite programming method for continuous sparse optimization over an infinite dictionary of vectors of complex exponentials and extend this to real-valued data via a real semidefinite program with the same dimensions (i.e. half the size). We further impose a continuous frequency constraint naturally occurring from assuming a Nyquist sampled signal by adding an additional semidefinite constraint. In our numerical experiments, the proposed estimator shows superior performance compared to state-of-the-art methods for separating two closely spaced fundamentals and approximately achieves the asymptotic Cramér-Rao lower bound.
- 1 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4192-4196
Multi-pitch estimation using semidefinite programming
Multi-pitch estimation concerns the problem of estimating the fundamental frequencies (pitches) and amplitudes/phases of multiple superimposed harmonic signals with application in music, speech, vibration analysis, and other fields. In this paper we formulate a complex-valued multi-pitch estimator via a semidefinite programming method for continuous sparse optimization over an infinite dictionary of vectors of complex exponentials and extend this to real-valued data via a real semidefinite program with the same dimensions (i.e. half the size). We further impose a continuous frequency constraint naturally occurring from assuming a Nyquist sampled signal by adding an additional semidefinite constraint. In our numerical experiments, the proposed estimator shows superior performance compared to state-of-the-art methods for separating two closely spaced fundamentals and approximately achieves the asymptotic Cramér-Rao lower bound.
- 1 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 416-420
Fast harmonic chirp summation
The harmonic chirp signal model has only very recently been introduced for modelling approximately periodic signals with a time-varying fundamental frequency. A number of estimators for the parameters of this model have already been proposed, but they are either inaccurate, non-robust to noise, or very computationally intensive. In this paper, we propose a fast algorithm for the harmonic chirp summation method which has been demonstrated in the literature to be accurate and robust to noise. The proposed algorithm is orders of magnitudes faster than previous algorithms which is also demonstrated via timing studies.
- 1 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 416-420
Fast harmonic chirp summation
The harmonic chirp signal model has only very recently been introduced for modelling approximately periodic signals with a time-varying fundamental frequency. A number of estimators for the parameters of this model have already been proposed, but they are either inaccurate, non-robust to noise, or very computationally intensive. In this paper, we propose a fast algorithm for the harmonic chirp summation method which has been demonstrated in the literature to be accurate and robust to noise. The proposed algorithm is orders of magnitudes faster than previous algorithms which is also demonstrated via timing studies.
- 1 February 2017
- Published by Elsevier in Signal Processing
- Vol. 131, 492-501
Computational complexity reduction in nonuniform compressed sensing by multi-coset emulation
- 1 February 2017
- Published by Elsevier in Signal Processing
- Vol. 131, 492-501
Computational complexity reduction in nonuniform compressed sensing by multi-coset emulation