@conference {451501,
title = {Online Learning for Sparse PCA in High Dimensions: Exact Dynamics and Phase Transitions},
booktitle = {IEEE Information Theory Workshop (ITW)},
year = {2016},
month = {September},
abstract = {We study the dynamics of an online algorithm for learning a sparse leading eigenvector from samples generated from a spiked covariance model. This algorithm combines the classical Oja{\textquoteright}s method for online PCA with an element-wise nonlinearity at each iteration to promote sparsity. In the high-dimensional limit, the joint empirical measure of the underlying sparse eigenvector and its estimate provided by the algorithm is shown to converge weakly to a deterministic, measure-valued process. This scaling limit is characterized as the unique solution of a nonlinear PDE, and it provides exact information regarding the asymptotic performance of the algorithm. For example, performance metrics such as the cosine similarity and the misclassification rate in sparse support recovery can be obtained by examining the limiting dynamics. A steady-state analysis of the nonlinear PDE also reveals an interesting phase transition phenomenon. Although our analysis is asymptotic in nature, numerical simulations show that the theoretical predictions are accurate for moderate signal dimensions.},
author = {Chuang Wang and Yue M. Lu}
}
@conference {416416,
title = {ProSparse denoise: Prony{\textquoteright}s based sparsity pattern recovery in the presence of noise},
booktitle = {Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
year = {2016},
month = {March},
author = {J. Onativia and P. L. Dragotti and Yue M. Lu}
}
@article {415726,
title = {Kaczmarz Method for Solving Quadratic Equations},
journal = {IEEE Signal Processing Letters},
volume = {23},
number = {9},
year = {2016},
month = {2016},
pages = {1183-1187},
abstract = {Estimating low-rank positive-semidefinite (PSD) matrices from symmetric rank-one measurements is of great importance in many applications, such as high-dimensional data processing, quantum state tomography, and phase retrieval. When the rank is known a priori, this problem can be regarded as solving a system of quadratic equations of a low-dimensional subspace. The authors develop a fast iterative algorithm based on an adaptation of the Kaczmarz method, which is traditionally used for solving overdetermined linear systems. In particular, the authors characterize the dynamics of the algorithm when the measurement vectors are composed of standard Gaussian entries in the online setting. Numerical simulations demonstrate the compelling performance of the proposed algorithm.},
author = {Yuejie Chi and Yue M. Lu}
}
@article {360281,
title = {Decomposition space-variant blur in image deconvolution},
journal = {IEEE Signal Processing Letters},
volume = {23},
number = {3},
year = {2016},
month = {Mar 2016},
pages = {346-350},
abstract = {
Standard convolution as a model of radiometric degradation is in majority of cases inaccurate as the blur varies in space and we are thus required to work with a computationally demanding space-variant model. Space-variant degradation can be approximately decomposed to a set of standard convolutions. We explain in detail the properties of the space-variant degrada- tion operator and show two possible decomposition models and two approximation approaches. Our target application is space- variant image deconvolution, on which we illustrate theoretical differences between these models. We propose a computationally efficient restoration algorithm that belongs to a category of alternating direction methods of multipliers, which consists of four update steps with closed-form solutions. Depending on the used decomposition, two variations of the algorithm exist with distinct properties. We test the effectiveness of the decomposition models under different levels of approximation on synthetic and real examples, and conclude the letter by drawing several practical observations.\
},
author = {Filip Sroubek and Jan Kamenicky and Yue M. Lu}
}
@article {343426,
title = {Dynamics of Individual Perceptual Decisions},
journal = {Journal of Neurophysiology},
volume = {115},
number = {1},
year = {2016},
month = {2016},
abstract = {Perceptual decision-making is fundamental to a broad range of fields including neurophysiology, economics, medicine, advertising, law, etc. While recent findings have yielded major advances in our understanding of perceptual decision-making, decision-making as a function of time and frequency (i.e., decision-making dynamics) is not well understood. To limit the review length, we focus most of this review on human findings. Animal findings, which are extensively reviewed elsewhere, are included when beneficial or necessary. We attempt to put these various findings and datasets - which can appear to be unrelated in the absence of a formal dynamic analysis - into context using published models. Specifically, by adding appropriate dynamic mechanisms (e.g., high-pass filters) to existing models, it appears that a number of otherwise seemingly disparate findings from the literature might be explained. One hypothesis that arises through this dynamic analysis is that decision-making includes phasic (high-pass) neural mechanisms, an evidence accumulator and/or some sort of mid-trial decision-making mechanism (e.g., peak detector and/or decision boundary).},
url = {http://jn.physiology.org/content/early/2015/10/09/jn.00225.2015},
author = {Daniel M. Merfeld and Torin K. Clark and Yue M. Lu and Faisal Karmali}
}
@article {343431,
title = {Matched Signal Detection on Graphs: Theory and Application to Brain Imaging Data Classification},
journal = {NeuroImage},
volume = {125},
year = {2016},
month = {2015},
pages = {587-600},
abstract = {
Motivated by recent progresses in signal processing on graphs, we have developed a matched signal detection (MSD) theory for signals with intrinsic structures described by weighted graphs. First, we regard graph Laplacian eigenvalues as frequencies of graph-signals and assume that the signal is in a subspace spanned by the first few graph Laplacian eigenvectors associated with lower eigenvalues. The conventional matched subspace detector can be applied to this case. Furthermore, we study signals that may not merely live in a subspace. Namely, we consider signals with bounded variation on graphs and more general signals that are randomly drawn from a prior distribution. For bounded variation signals, the test is a weighted energy detector. For the random signals, the test statistic is the difference of signal variations on associated graphs, if a degenerate Gaussian distribution specified by the graph Laplacian is adopted. We evaluate the effectiveness of the MSD on graphs both on simulated and real data sets. Specifically, we apply MSD to the brain imaging data classification problem of Alzheimer{\textquoteright}s disease (AD) based on two independent data sets: 1) positron emission tomography data with Pittsburgh compound-B tracer of 30 AD and 40 normal control (NC) subjects, 2) resting-state functional magnetic resonance imaging (R-fMRI) data of 30 early mild cognitive impairment and 20 NC subjects. Our results demonstrate that the MSD approach is able to outperform the traditional methods and help detect AD at an early stage, probably due to the success of exploiting the manifold structure of the data.\
},
author = {Chenhui Hu and Jorge Sepulcre and Keith A. Johnson and George E. Fakhri and Yue M. Lu and Quangzheng Li}
}
@article {252486,
title = {A Distributed Gauss-Newton Method for Power System State Estimation},
journal = {IEEE Transactions on Power Systems},
volume = {31},
number = {5},
year = {2016},
month = {2016},
pages = {3804-3815},
abstract = {We propose a fully distributed Gauss-Newton algorithm for state estimation of electric power systems. At each Gauss-Newton iteration, matrix-splitting techniques are utilized to carry out the matrix inversion needed for calculating the Gauss-Newton step in a distributed fashion. In order to reduce the communication burden as well as increase robustness of state estimation, the proposed distributed scheme relies only on local information and a limited amount of information from neighboring areas. The matrix-splitting scheme is designed to calculate the Gauss-Newton step with exponential convergence speed. The effectiveness of the method is demonstrated in various numerical experiments.},
author = {Ariana Minot and Yue M. Lu and N. Li}
}
@article {237816,
title = {Sampling Sparse Signals on the Sphere: Algorithms and Applications},
journal = {IEEE Transactions on Signal Processing},
volume = {64},
number = {1},
year = {2016},
month = {2015},
pages = {189-202},
abstract = {We propose a sampling scheme that can perfectly reconstruct a collection ofspikes on the sphere from samples of their lowpass-filtered observations.Central to our algorithm is a generalization of the annihilating filtermethod, a tool widely used in array signal processing and finite-rate-of-innovation(FRI) sampling. The proposed algorithm can reconstruct $K$ spikesfrom $(K+\sqrt{K})^2$ spatial samples---a sampling requirement thatimproves over known sparse sampling schemes on the sphere by a factor of upto four.We showcase the versatility of the proposed algorithm by applying it tothree different problems: 1) sampling diffusion processes induced bylocalized sources on the sphere, 2) shot-noise removal, and 3) sound sourcelocalization (SSL) by a spherical microphone array. In particular, we showhow SSL can be reformulated as a spherical sparse sampling problem.},
url = {http://arxiv.org/abs/1502.07577},
author = {Ivan Dokmanic and Yue M. Lu}
}