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 September 2014 | public
Journal Article Open

Convergence of a data-driven time–frequency analysis method


In a recent paper [11], Hou and Shi introduced a new adaptive data analysis method to analyze nonlinear and non-stationary data. The main idea is to look for the sparsest representation of multiscale data within the largest possible dictionary consisting of intrinsic mode functions of the form {a(t)cos(θ(t))}, where a∈V(θ),V(θ) consists of the functions that are less oscillatory than cos(θ(t)) and θ′⩾0. This problem was formulated as a nonlinear L^0 optimization problem and an iterative nonlinear matching pursuit method was proposed to solve this nonlinear optimization problem. In this paper, we prove the convergence of this nonlinear matching pursuit method under some scale separation assumptions on the signal. We consider both well-resolved and poorly sampled signals, as well as signals with noise. In the case without noise, we prove that our method gives exact recovery of the original signal.

Additional Information

© 2014 Elsevier Inc. Received 28 March 2013, Revised 1 August 2013, Accepted 29 December 2013, Available online 2 January 2014. Communicated by Stephane G. Mallat. This work was in part supported by the AFOSR MURI grant FA9550-09-1-0613, a DOE grant DE-FG02-06ER25727, and NSF Grants DMS-1159138 and DMS-1318377. The research of Dr. Z. Shi was in part supported by a NSFC Grant 11201257.

Attached Files

Submitted - 1303.7048v1.pdf


Files (546.1 kB)
Name Size Download all
546.1 kB Preview Download

Additional details

August 22, 2023
August 22, 2023