scispace - formally typeset
Journal ArticleDOI

Dynamic Dictionary Algorithms for Model Order and Parameter Estimation

Reads0
Chats0
TLDR
It is demonstrated that dictionary-based estimation methods are capable of parameter estimation performance comparable to the Cramér-Rao lower bound and to traditional ML-based model estimation over a wide range of signal-to-noise ratios.
Abstract
In this paper, we present and evaluate dynamic dictionary-based estimation methods for joint model order and parameter estimation. In dictionary-based estimation, a continuous parameter space is discretized, and vector-valued dictionary elements are formed for specific parameter values. A linear combination of a subset of dictionary elements is used to represent the model, where the number of elements used is the estimated model order, and the parameters corresponding to the selected elements are the parameter estimates. In static-based methods, the dictionary is fixed; while in the dynamic methods proposed here, the parameter sampling, and hence the dictionary, adapt to the data. We propose two dynamic dictionary-based estimation algorithms in which the dictionary elements are dynamically adjusted to improve parameter estimation performance. We examine the performance of both static and dynamic algorithms in terms of probability of correct model order selection and the root mean-squared error of parameter estimates. We show that dynamic dictionary methods overcome the problem of estimation bias induced by quantization effects in static dictionary-based estimation, and we demonstrate that dictionary-based estimation methods are capable of parameter estimation performance comparable to the Cramer-Rao lower bound and to traditional ML-based model estimation over a wide range of signal-to-noise ratios.

read more

Citations
More filters
Journal ArticleDOI

On Gridless Sparse Methods for Line Spectral Estimation From Complete and Incomplete Data

TL;DR: This paper presents a gridless version of SPICE (gridless SPICE, or GLS), which is applicable to both complete and incomplete data without the knowledge of noise level, and proves the equivalence between GLS and atomic norm-based techniques under different assumptions of noise.
Journal ArticleDOI

Exact Joint Sparse Frequency Recovery via Optimization Methods

TL;DR: This paper investigates the frequency recovery problem in the presence of multiple measurement vectors which share the same frequency components, termed as joint sparse frequency recovery and arising naturally from array processing applications and proposes an MMV atomic norm approach that is a convex relaxation and can be viewed as a continuous counterpart of the ℓ2,1 norm method.
Posted Content

On Gridless Sparse Methods for Line Spectral Estimation From Complete and Incomplete Data

TL;DR: In this paper, a gridless version of SPICE (gridless SPICE, or GLS) is presented, which is applicable to both complete and incomplete data without the knowledge of noise level.
Journal ArticleDOI

Enhancing Sparsity and Resolution via Reweighted Atomic Norm Minimization

TL;DR: The mathematical theory of super resolution developed recently by Candes and Fernandes-Granda states that a continuous, sparse frequency spectrum can be recovered with infinite precision via super-resolution as discussed by the authors.
Book ChapterDOI

Sparse methods for direction-of-arrival estimation

TL;DR: An overview of these sparse methods for DOA estimation is provided, with a particular highlight on the recently developed gridless sparse methods, e.g., those based on covariance fitting and the atomic norm.
References
More filters
Journal ArticleDOI

Regression Shrinkage and Selection via the Lasso

TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Book

Compressed sensing

TL;DR: It is possible to design n=O(Nlog(m)) nonadaptive measurements allowing reconstruction with accuracy comparable to that attainable with direct knowledge of the N most important coefficients, and a good approximation to those N important coefficients is extracted from the n measurements by solving a linear program-Basis Pursuit in signal processing.
Journal ArticleDOI

Atomic Decomposition by Basis Pursuit

TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
Journal ArticleDOI

$rm K$ -SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

TL;DR: A novel algorithm for adapting dictionaries in order to achieve sparse signal representations, the K-SVD algorithm, an iterative method that alternates between sparse coding of the examples based on the current dictionary and a process of updating the dictionary atoms to better fit the data.
Journal ArticleDOI

Stable signal recovery from incomplete and inaccurate measurements

TL;DR: In this paper, the authors considered the problem of recovering a vector x ∈ R^m from incomplete and contaminated observations y = Ax ∈ e + e, where e is an error term.
Related Papers (5)
Trending Questions (1)
How to Convert list to dictionary in Robot Framework?

We propose two dynamic dictionary-based estimation algorithms in which the dictionary elements are dynamically adjusted to improve parameter estimation performance.