Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 8, 2015 | Submitted + Published
Journal Article Open

On the Uniqueness of Sparse Time-Frequency Representation of Multiscale Data

Abstract

In this paper, we analyze the uniqueness of the sparse time-frequency decomposition and investigate the efficiency of the nonlinear matching pursuit method. Under the assumption of scale separation, we show that the sparse time-frequency decomposition is unique up to an error that is determined by the scale separation property of the signal. We further show that the unique decomposition can be obtained approximately by the sparse time-frequency decomposition using nonlinear matching pursuit.

Additional Information

© 2015 SIAM. Received by the editors December 30, 2014; accepted for publication (in revised form) May 6, 2015; published electronically July 8, 2015. This work was supported by NSF FRG grants DMS-1159138 and DMS-1318377, AFOSR MURI grant FA9550-09-1-0613, and DOE grant DE-FG02-06ER25727.

Attached Files

Published - 141002098.pdf

Submitted - 1501.04707v2.pdf

Files

1501.04707v2.pdf
Files (497.3 kB)
Name Size Download all
md5:7152a364dc36f0126fa753cad597b139
253.5 kB Preview Download
md5:d01c796812929f5f55d2af17dd0a06e7
243.9 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 25, 2023