有噪复杂度寻踪的新算法

复杂度寻踪是投影寻踪向时间序列数据,即具有时间结构信号的扩展。该方法是和具有时间依赖特性的源信号的盲分离和独立成分分析紧密联系的。在源信号是具有时间依赖特性和存在高斯噪声的情况下,现有的有噪复杂度寻踪算法没有给出自回归系数的估计方法,影响了算法的实际应用,提出了有噪复杂度寻踪的新算法,该算法给出了自回归系数的估计方法。对自然图像和人工信号的仿真表明了提出算法的有效性,和现有的盲源分离算法相比较,提出算法具有好的信号分离性能。      

一种自适应盲分离跳频信号的方法

在跳频扩频通信系统中,由于多个跳频信号在时域重叠,频域跳变,使得非合作接收条件下跳频信号的分离成为通信侦察和对抗中的一个难点问题.本文基于各源信号统计独立这一特性,采用独立分量分析的思想和技术,提出一种适合于跳频信号盲分离的自适应方法,并且针对不同频点上分离信号中出现的次序模糊问题,给出了一种跳频时刻估计算法和信号拼接的算法.理论分析和仿真实验表明,本文提出的方法能够有效地分离出多个跳频信号.     

Edge Effect Elimination in Single-Mixture Blind Source Separation

Blind source separation (BSS) of single-channel mixed recording is a challenging task that has applications in the fields of speech, audio and bio-signal processing. Ensemble empirical mode decomposition (EEMD)-based methods are commonly used for blind separation of single input multiple outputs. However, all of these EEMD-based methods appear in the edge effect problem when cubic spline interpolation is used to fit the upper and lower envelopes of the given signals. It is therefore imperative to have good methods to explore a more suitable design choice, which can avoid the problems mentioned above as much as possible. In this paper we present a novel single-mixture blind source separation method based on edge effect elimination of EEMD, principal component analysis (PCA) and independent component analysis (ICA). EEMD represents any time-domain signal as the sum of a finite set of oscillatory components called intrinsic mode functions (IMFs). In extreme point symmetry extension (EPSE), optimum values of endpoints are obtained by minimizing the deviation evaluation function of signal and signal envelope. Edge effect is turned away from signal by abandoning both ends’ extension parts of IMFs. PCA is applied to reduce dimensions of IMFs. ICA finds the independent components by maximizing the statistical independence of the dimensionality reduction of IMFs. The separated performance of edge EPSE-EEMD-PCA-ICA algorithm is compared with EEMD-ICA and EEMD-PCA-ICA algorithms through simulations, and experimental results show that the former algorithm outperforms the two latter algorithms with higher correlation coefficient and lower relative root mean square error (RRMSE).     

非线性盲源分离的原理及算法综述

本文主要阐述了非线性盲源分离(BSS)/独立成分分析(ICA)模型的基本数学原理、分离算法、算法性能及其应用。首先对线性和非线性BSS/ICA的数学模型作了介绍,重点介绍了非线性BSS/ICA解的不确定性,然后在此基础上对近十年来出现的各种非线性BSS/ICA算法进行简单综述,着重分析了一类可解且应用比较广泛的非线性BSS/ICA模型-后非线性BSS/ICA模型及其分离算法。最后对非线性BSS/ICA存在的问题和发展趋势进行了总结。     

Compound noise separation in digital circuits using blind source separation

Analysis of individual noise sources in pre-nanometer circuits cannot take into account the evolving reality of multiple noise sources interacting with each other. Noise measurement made at an evaluation node will reflect the cumulative effect of all the active noise sources, while individual and relative severity of various noise sources will determine what types of remedial steps can be taken, pressing the need for development of algorithms that can analyze the contributions of different noise sources when a noise measurement is available. This paper addresses the cocktail-party problem inside integrated circuits with multiple noise sources. It presents a method to extract the time characteristics of individual noise source from the measured compound voltage in order to study the contribution and properties of each source. This extraction is facilitated by application of blind source separation technique, which is based on the assumption of statistical independence of various noise sources over time. The estimated noise sources can aid in performing timing and spectral analysis, and yield better circuit design techniques.     

源信号数目大于观察信号数目情况下的盲源分离

独立分量分析(ICA)作为一种有效的盲源分离技术(BSS）是信号处理领域的热点。传统的独立分量分析都要求观察信号数目大于或者等于源信号数目，然而对于脑电图(EEG)等的一些信号处理中存在的源信号数目大于观察信号数目的情况，传统的独立分量分析算法不能有效分离。该文针对源信号数目大于观察信号数目的情况，在传统的独立分量分析技术的基础上，给出了一个新的学习算法，并将新算法与传统的独立分量算法进行了比较。实验仿真结果证明该算法在给定2个混合信号的情况下能够较好地分离3个未知语音信号源，成功实现了源信号数目大于观察信号数目情况下的盲源分离。     

Performance analysis of grammar-based codes revisited

The compression performance of grammar-based codes is revisited from a new perspective. Previously, the compression performance of grammar-based codes was evaluated against that of the best arithmetic coding algorithm with finite contexts. In this correspondence, we first define semifinite-state sources and finite-order semi-Markov sources. Based on the definitions of semifinite-state sources and finite-order semi-Markov sources, and the idea of run-length encoding (RLE), we then extend traditional RLE algorithms to context-based RLE algorithms: RLE algorithms with k contexts and RLE algorithms of order k, where k is a nonnegative integer. For each individual sequence x, let r/sup *//sub sr,k/(x) and r/sup *//sub sr|k/(x) be the best compression rate given by RLE algorithms with k contexts and by RLE algorithms of order k, respectively. It is proved that for any x, r/sup *//sub sr,k/ is no greater than the best compression rate among all arithmetic coding algorithms with k contexts. Furthermore, it is shown that there exist stationary, ergodic semi-Markov sources for which the best RLE algorithms without any context outperform the best arithmetic coding algorithms with any finite number of contexts. Finally, we show that the worst case redundancies of grammar-based codes against r/sup *//sub sr,k/(x) and r/sup *//sub sr|k/(x) among all length- n individual sequences x from a finite alphabet are upper-bounded by d/sub 1/loglogn/logn and d/sub 2/loglogn/logn, respectively, where d/sub 1/ and d/sub 2/ are constants. This redundancy result is stronger than all previous corresponding results.     

Temporal BYY learning for state space approach, hidden Markovmodel, and blind source separation

The temporal Bayesian Yang-Yang (TBYY) learning has been presented for signal modeling in a general state space approach, which provides not only a unified point of view on the Kalman filter, hidden Markov model (HMM), independent component analysis (ICA), and blind source separation (BSS) with extensions, but also further advances on these studies, including a higher order HMM, independent HMM for binary BSS, temporal ICA (TICA), and temporal factor analysis for real BSS without and with noise. Adaptive algorithms are developed for implementation and criteria are provided for selecting an appropriate number of states or sources. Moreover, theorems are given on the conditions for source separation by linear and nonlinear TICA. Particularly, it has been shown that not only non-Gaussian but also Gaussian sources can also be separated by TICA via exploring temporal dependence. Experiments are also demonstrated     

基于ICA的雷达信号欠定盲分离算法

该文针对源信号时域和频域不充分稀疏的情况,提出了欠定盲源分离中估计混合矩阵的一种新方法。该方法对等间隔分段的观测信号应用独立分量分析(ICA)的盲分离算法获得多个子混合矩阵,然后对其分选剔除了不属于原混合矩阵的元素,最后利用C均值聚类的学习算法获得对混合矩阵的精确估计,解决了源信号在时域和频域不充分稀疏的情况下准确估计混合矩阵的问题。在估计出混合矩阵的基础上,利用基于稀疏分解的统计量算法分离出源信号。由仿真结果,以及与传统的K均值聚类,时域检索平均算法对比的实验结果说明了该文算法的有效性和鲁棒性。     

基于非负矩阵分解算法进行盲信号分离

独立分量分析(ICA)已被广泛运用于线性混合模型的盲源分离问题,但却有两个重要的限制:信源统计独立和信源非高斯分布。然而更有意义的线性混合模型是:观测信号是非负信源的非负线性混合,信源之间可以统计相关且可以为高斯分布。本文针对盲源分离问题,提出了一种运用新近国际上提出的一种非负矩阵分解算法(NMF算法)进行统计相关信源的盲源分离方法,该方法没有信源统计独立和信源非高斯分布的限制,只要信源之间没有一阶原点统计相关,则可很好实现对信源的分离。大量仿真及与传统ICA进行盲源分离的比较,验证了运用NMF进行包括统计相关信源和高斯分布信源的盲源分离的可行性和有效性。     

应用萤火虫算法的混沌信号盲源分离

针对现有的独立成分分析法分离混合混沌信号精度不理想的问题,提出了一种新的混沌信号盲分离方法。该方法以求解最优解混矩阵为目标,利用峭度构造目标函数,将混沌信号的盲源分离转化为一个优化问题,并用萤火虫算法求解。同时,通过预白化和正交矩阵的参数化表示降低优化问题的维数,能有效提高分离精度。仿真结果表明,无论是处理混合的混沌映射信号还是混合的混沌流信号,该方法都能快速收敛,并且其分离精度在各项实验中都优于独立成分分析法等现有的盲源分离方法。     

Uncorrelated component analysis for blind source separation

The uncorrelated component analysis (UCA) of a stationary random vector process consists of searching for a linear transformation that minimizes the temporal correlation between its components. Through a general analysis we show that under practically reasonable and mild conditions UCA is a solution for blind source separation. The theorems proposed in this paper for UCA provide useful insights for developing practical algorithms. UCA explores the temporal information of the signals, whereas independent component analysis (ICA) explores the spatial information; thus UCA can be applied for source separation in some cases where ICA cannot. For blind source separation, combining ICA and UCA may give improved performance because more information can be utilized. The concept of single UCA (SUCA) is also proposed, which leads to sequential source separation.This work was supported in part by grants from the Research Grants Council of Hong Kong, grants HKU553/96M, HKU7036/97E, and HKUST776/96E.     

Multidimensional Blind Separation Using Higher-Order Statistics: Application to Non-Cooperative STBC Systems

Blindly separating the intercepted signals is a challenging problem in non-cooperative multiple input multiple output systems in association with space–time block code (STBC) where channel state information and coding matrix are unavailable. To our knowledge, there is no report on dealing with this problem in literature. In this paper, the STBC systems are represented with an independent component analysis (ICA) model by merging the channel and coding matrices as virtual channel matrix. Analysis shows that the source signals are of group-wise independence and the condition of mutual independence can not be satisfied for ordinary ICA algorithms when specific modulations are employed. A new multidimensional ICA algorithm is proposed to separate the intercepted signals in this case by jointly block-diagonalizing (JBD) the cumulant matrices. In this paper, JBD is achieved by a 2-step optimization algorithm and a contrast function is derived from the JBD criterion to remove the additional permutation ambiguity with explicit mathematical explanations. The convergence of the new method is guaranteed. Compared with the ICA-based channel estimation methods, simulations show that the new algorithm, which does not introduce additional ambiguities, achieves better performance with faster convergence in a non-cooperative scenario.     

Sequential diagnosis of processor array systems

We examine the diagnosis of processor array systems formed as two-dimensional arrays, with boundaries, and either four or eight neighbors for each interior processor. We employ a parallel test schedule. Neighboring processors test each other, and report the results. Our diagnostic objective is to find a fault-free processor or set of processors. The system may then be sequentially diagnosed by repairing those processors tested faulty according to the identified fault-free set, or a job may be run on the identified fault-free processors. We establish an upper bound on the maximum number of faults which can be sustained without invalidating the test results under worst case conditions. We give test schedules and diagnostic algorithms which meet the upper bound as far as the highest order term. We compare these near optimal diagnostic algorithms to alternative algorithms, both new and already in the literature, and against an upper bound ideal case algorithm, which is not necessarily practically realizable. For eight-way array systems with N processors, an ideal algorithm has diagnosability 3N/sup 2/3/-2N/sup 1/2/ plus lower-order terms. No algorithm exists which can exceed this. We give an algorithm which starts with tests on diagonally connected processors, and which achieves approximately this diagnosability. So the given algorithm is optimal to within the two most significant terms of the maximum diagnosability. Similarly, for four-way array systems with N processors, no algorithm can have diagnosability exceeding 3N/sup 2/3//2/sup 1/3/-2N/sup 1/2/ plus lower-order terms. And we give an algorithm which begins with tests arranged in a zigzag pattern, one consisting of pairing nodes for tests in two different directions in two consecutive test stages; this algorithm achieves diagnosability (3/2)(5/2)/sup 1/3/N/sup 2/3/-(5/4)N/sup 1/2/ plus lower-order terms, which is about 0.85 of the upper bound due to an ideal algorithm.     

A Markov model for blind image separation by a mean-field EM algorithm.

This paper deals with blind separation of images from noisy linear mixtures with unknown coefficients, formulated as a Bayesian estimation problem. This is a flexible framework, where any kind of prior knowledge about the source images and the mixing matrix can be accounted for. In particular, we describe local correlation within the individual images through the use of Markov random field (MRF) image models. These are naturally suited to express the joint pdf of the sources in a factorized form, so that the statistical independence requirements of most independent component analysis approaches to blind source separation are retained. Our model also includes edge variables to preserve intensity discontinuities. MRF models have been proved to be very efficient in many visual reconstruction problems, such as blind image restoration, and allow separation and edge detection to be performed simultaneously. We propose an expectation-maximization algorithm with the mean field approximation to derive a procedure for estimating the mixing matrix, the sources, and their edge maps. We tested this procedure on both synthetic and real images, in the fully blind case (i.e., no prior information on mixing is exploited) and found that a source model accounting for local autocorrelation is able to increase robustness against noise, even space variant. Furthermore, when the model closely fits the source characteristics, independence is no longer a strict requirement, and cross-correlated sources can be separated, as well.     

Does independent component analysis play a role in unmixing hyperspectral data?

Independent component analysis (ICA) has recently been proposed as a tool to unmix hyperspectral data. ICA is founded on two assumptions: 1) the observed spectrum vector is a linear mixture of the constituent spectra (endmember spectra) weighted by the correspondent abundance fractions (sources); 2)sources are statistically independent. Independent factor analysis (IFA) extends ICA to linear mixtures of independent sources immersed in noise. Concerning hyperspectral data, the first assumption is valid whenever the multiple scattering among the distinct constituent substances (endmembers) is negligible, and the surface is partitioned according to the fractional abundances. The second assumption, however, is violated, since the sum of abundance fractions associated to each pixel is constant due to physical constraints in the data acquisition process. Thus, sources cannot be statistically independent, this compromising the performance of ICA/IFA algorithms in hyperspectral unmixing. This paper studies the impact of hyperspectral source statistical dependence on ICA and IFA performances. We conclude that the accuracy of these methods tends to improve with the increase of the signature variability, of the number of endmembers, and of the signal-to-noise ratio. In any case, there are always endmembers incorrectly unmixed. We arrive to this conclusion by minimizing the mutual information of simulated and real hyperspectral mixtures. The computation of mutual information is based on fitting mixtures of Gaussians to the observed data. A method to sort ICA and IFA estimates in terms of the likelihood of being correctly unmixed is proposed.     

基于凸优化的抗旋转图像盲源分离算法研究

盲源分离是指在没有源信号任何先验知识的情况下,只根据多个观测信号实现对源信号的恢复。本文在CAMNS算法的基础上提出了一种抗旋转的图像盲源分离新算法,该算法首先对观测图像进行预处理,提取图像旋转不变因子,然后利用图像空间局部显著性的假设将旋转后的图像盲源分离转化为可解的凸优化问题,进而求出分离矩阵,最后反解混合方程组确定源图像。实验结果表明:新算法有效地消除了旋转对盲源分离的影响,算法性能指标较ICA算法、NMF算法和CAMNS算法提高了近80%以上。      

基于峰度的ICA算法

独立分量分析(ICA)是一种通过最大化多维观察向量元素的统计独立性寻找一个线性变换的统计方法，其作为有效的盲源分离技术是信号处理领域的热点。提出了一种基于峰度的快速ICA算法，此算法常用于盲信号分离和特征抽取。先从峰度的定义入手说明峰度作为代价函数的可行性，并详细介绍如何将神经网络学习规则转换成固定点准则，从而使得算法简单，且不依赖任何人为定义的参数。选取3个非高斯独立向量作为信号源进行Matlab仿真，分离效果良好。     

Markov types and minimax redundancy for Markov sources

Redundancy of universal codes for a class of sources determines by how much the actual code length exceeds the optimal code length. In the minimax scenario, one designs the best code for the worst source within the class. Such minimax redundancy comes in two flavors: average minimax or worst case minimax. We study the worst case minimax redundancy of universal block codes for Markovian sources of any order. We prove that the maximal minimax redundancy for Markov sources of order r is asymptotically equal to 1/2m/sup r/(m-1)log/sub 2/n+log/sub 2/A/sub m//sup r/-(lnlnm/sup 1/(m-1)/)/lnm+o(1), where n is the length of a source sequence, m is the size of the alphabet, and A/sub m//sup r/ is an explicit constant (e.g., we find that for a binary alphabet m=2 and Markov of order r=1 the constant A/sub 2//sup 1/=16/spl middot/G/spl ap/14.655449504 where G is the Catalan number). Unlike previous attempts, we view the redundancy problem as an asymptotic evaluation of certain sums over a set of matrices representing Markov types. The enumeration of Markov types is accomplished by reducing it to counting Eulerian paths in a multigraph. In particular, we propose exact and asymptotic formulas for the number of strings of a given Markov type. All of these findings are obtained by analytic and combinatorial tools of analysis of algorithms.     

Fast ICA 盲分离算法在雷达抗主瓣干扰中的应用研究

压制干扰信号从主瓣进入雷达天线,会严重影响雷达的性能,通常的副瓣抗干扰技术难以奏效。文中首先给出了Fast ICA 应用于雷达抗主瓣干扰的信号模型;在高信噪比的均匀噪声环境中,利用基于寻找峭度的局部极值点的Fast ICA盲分离算法分离接收到的主瓣干扰混合信号,通过脉压找出目标信号。仿真验证了算法用于抗主瓣干扰的有效性,该算法具有良好的抗干扰性能,在分离效率上具有较明显的优势。