hosted by
publicationslist.org
    

Zhilin Zhang


Journal articles

2008
Zhi-Lin Zhang (2008)  Morphologically Constrained ICA for Extracting Weak Temporally Correlated Signals   Neurocomputing 71: 7-9. 1669-1679  
Abstract: Recently the constrained ICA (cICA) algorithm has been widely applied to many applications. But a crucial problem to the algorithm is how to design a reference signal in advance, which should be closely related to the desired source signal. If the desired source signal is very weak in mixed signals and there is no enough a priori information about it, the reference signal is difficult to design. With some detailed discussions on the cICA algorithm, the paper proposes a second-order statistics based approach to reliably find suitable reference signals for weak temporally correlated source signals. Simulations on synthetic data and real-world data have shown its validity and usefulness.
Notes: Analyzed the constrained ICA in detail, and provided a solution for extracting weak sources with temporal structures, which are not visible from observations. It combines the original constrained ICA and my proposed algorithm in the paper: Robust Extraction of Specific Signals with Temporal Structure (Neurocomputing, 2006)

Conference papers

2010
Zhilin Zhang, Bhaskar D Rao (2010)  Sparse Signal Recovery in the Presence of Correlated Multiple Measurement Vectors   In: Proceeding of the 35th International Conference on Acoustics, Speech, and Signal Processing  
Abstract: Sparse signal recovery algorithms utilizing multiple measurement vectors (MMVs) are known to have better performance compared to the single measurement vector case. However, current work rarely consider the case when sources have temporal correlation, a likely situation in practice. In this work we examine methods to account for temporal correlation and its impact on performance. We model sources as AR processes, and then incorporate such information into the framework of sparse Bayesian learning for sparse signal recovery. Experiments demonstrate the superiority of the proposed algorithms. They also show that the performance of existing algorithms are limited by temporal correlation, and that if such correlation can be fully exploited, as in our proposed algorithms, the limitation can be overcome.
Notes: Explicitly model sources as AR processes, transform the MMV model into a block-sparsity model, and then derive the AR-SBL algorithms in the sparse Bayesian learning framework. Super recovery performance than existing MMV algorithms is observed when sources have high temporal correlation.
Powered by PublicationsList.org.