Conference Proceeding

Generalized Complexity Pursuit

Sch. of Astronaut., Beijing Univ. of Aeronaut. & Astronaut., Beijing
11/2008; DOI:10.1109/ICNC.2008.650 pp.199 - 203 In proceeding of: Natural Computation, 2008. ICNC '08. Fourth International Conference on, Volume: 3
Source: IEEE Xplore

ABSTRACT In this paper, we study the blind source separation (BSS) problem of temporally correlated signals via exploring the nonlinear temporal structure and high-order statistics of source signals. A BSS method based on the nonlinear predictability of original sources is proposed, which extends linear coding complexity used by the original complexity pursuit to nonlinear coding complexity. Simulations by nonstationarity sources verify the efficient implementation of the proposed method, especially its robustness to the outliers.

0 0
 · 
0 Bookmarks
 · 
23 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

blind source separation
 
BSS
 
BSS method
 
efficient implementation
 
extends linear coding complexity
 
nonlinear coding complexity
 
nonlinear predictability
 
nonlinear temporal structure
 
proposed method
 
Simulations
 
source signals
 
temporally correlated signals
 

Zhenwei Shi