Abstract
In this paper, we introduce a novel framework for semi-parametric estimation of an unknown number of signals, each parametrized by a group of components. Via a reformulation of the covariance fitting criteria, we formulate a convex optimization problem over a grid of candidate representations, promoting solutions with only a few active groups. Utilizing the covariance fitting allows for a hyperparameter-free estimation procedure, highly robust against coherency between candidates, while still allowing for a computationally efficient implementation. Numerical simulations illustrate how the proposed method offers a performance similar to the group-LASSO for incoherent dictionaries, and superior performance for coherent dictionaries.
Original language | English |
---|---|
Title of host publication | Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016 |
Publisher | IEEE Computer Society |
Pages | 394-398 |
Number of pages | 5 |
ISBN (Electronic) | 9781538639542 |
DOIs | |
Publication status | Published - 2017 Mar 1 |
Event | 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016 - Pacific Grove, United States Duration: 2016 Nov 6 → 2016 Nov 9 |
Conference
Conference | 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016 |
---|---|
Country/Territory | United States |
City | Pacific Grove |
Period | 2016/11/06 → 2016/11/09 |
Subject classification (UKÄ)
- Probability Theory and Statistics
- Signal Processing
Keywords
- convex optimization
- covariance fitting
- group sparsity
- multi-pitch estimation