Bruce W. Suter

Haiyan Cai, Qingtang Jiang, Lin Li et al.

Recently the study of modeling a non-stationary signal as a superposition of amplitude and frequency-modulated Fourier-like oscillatory modes has been a very active research area. The synchrosqueezing transform (SST) is a powerful method for instantaneous frequency estimation and component separation of non-stationary multicomponent signals. The short-time Fourier transform-based SST (FSST for short) reassigns the frequency variable to sharpen the time-frequency representation and to separate the components of a multicomponent non-stationary signal. Very recently the FSST with a time-varying parameter, called the adaptive FSST, was introduced. The simulation experiments show that the adaptive FSST is very promising in instantaneous frequency estimation of the component of a multicomponent signal, and in accurate component recovery. However the theoretical analysis of the adaptive FSST has not been carried out. In this paper, we study the theoretical analysis of the adaptive FSST and obtain the error bounds for the instantaneous frequency estimation and component recovery with the adaptive FSST and the 2nd-order adaptive FSST.

Lixin Shen, Bruce W. Suter

The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least l0-norm among all signals satisfying consistency constraints stemming from the 1-bit measurements. An algorithm for solving the model is developed. Convergence analysis of the algorithm is presented. Our approach is to obtain a sequence of optimization problems by successively approximating the l0-norm and to solve resulting problems by exploiting the proximity operator. We examine the performance of our proposed algorithm and compare it with the binary iterative hard thresholding (BIHT) [10] a state-of-the-art algorithm for 1-bit compressive sampling reconstruction. Unlike the BIHT, our model and algorithm does not require a prior knowledge on the sparsity of the signal. This makes our proposed work a promising practical approach for signal acquisition.

Stephen D. Farnham, Lixin Shen, Bruce W. Suter

In this paper, we consider approximations of principal component projection (PCP) without explicitly computing principal components. This problem has been studied in several recent works. The main feature of existing approaches is viewing the PCP matrix as a matrix function. This underlying function is the composition of a step function with a rational function. To find an approximate PCP, the step function is approximated by a polynomial while the rational function is evaluated by a fast ridge regression solver. In this work, we further improve this process by replacing the rational function with carefully constructed polynomials of low degree. We characterize the properties of polynomials that are suitable for approximating PCP, and establish an optimization problem to select the optimal one from those polynomials. We show theoretically and confirm numerically that the resulting approximate PCP approach with optimal polynomials is indeed effective for approximations of principal component projection.

Ashley Prater, Lixin Shen, Bruce W. Suter

In this paper, we study a simple iterative method for finding the Dantzig selector, which was designed for linear regression problems. The method consists of two main stages. The first stage is to approximate the Dantzig selector through a fixed-point formulation of solutions to the Dantzig selector problem. The second stage is to construct a new estimator by regressing data onto the support of the approximated Dantzig selector. We compare our method to an alternating direction method, and present the results of numerical simulations using both the proposed method and the alternating direction method on synthetic and real data sets. The numerical simulations demonstrate that the two methods produce results of similar quality, however the proposed method tends to be significantly faster.