Share Email Print
cover

Proceedings Paper

Compressive parameter estimation with earth mover's distance via K-median clustering
Author(s): Dian Mo; Marco F. Duarte
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In recent years, sparsity and compressive sensing have attracted significant attention in parameter estimation tasks, including frequency estimation, delay estimation, and localization. Parametric dictionaries collect observations for a sampling of the parameter space and can yield sparse representations for the signals of interest when the sampling is sufficiently dense. While this dense sampling can lead to high coherence in the dictionary, it is possible to leverage structured sparsity models to prevent highly coherent dictionary elements from appearing simultaneously in a signal representation, alleviating these coherence issues. However, the resulting approaches depend heavily on a careful setting of the maximum allowable coherence; furthermore, their guarantees apply to the coefficient vector recovery and do not translate in general to the parameter estimation task. We propose a new algorithm based on optimal sparse approximation measured by earth mover's distance (EMD). We show that EMD provides a better-suited metric for the performance of parametric dictionary-based parameter estimation. We leverage K-median clustering algorithms to solve the EMD-optimal sparse approximation problem, and show that the resulting compressive parameter estimation algorithms provide satisfactory performance without requiring control of dictionary coherence.

Paper Details

Date Published: 26 September 2013
PDF: 10 pages
Proc. SPIE 8858, Wavelets and Sparsity XV, 88581P (26 September 2013); doi: 10.1117/12.2024247
Show Author Affiliations
Dian Mo, Univ. of Massachusetts Amherst (United States)
Marco F. Duarte, Univ. of Massachusetts Amherst (United States)


Published in SPIE Proceedings Vol. 8858:
Wavelets and Sparsity XV
Dimitri Van De Ville; Vivek K. Goyal; Manos Papadakis, Editor(s)

© SPIE. Terms of Use
Back to Top