基于$k$-稀疏成分分析的欠定盲辨识:RANSAC驱动的正交子空间搜索
Underdetermined Blind Identification via $k$-Sparse Component Analysis: RANSAC-driven Orthogonal Subspace Search
AI总结:
本文针对欠定盲辨识中活跃源数为$k=m-1$的困难情形,提出基于Gram-Schmidt过程与RANSAC的正交子空间搜索两步算法,实验证明其优于现有方法。
摘要:
针对欠定盲辨识(UBI),基于源矩阵稀疏性的方法主要分为两个家族:稀疏成分分析(SCA)和$k$-SCA。SCA假设每个时刻只有一个活跃源,而$k$-SCA允许活跃源数量变化,用$k$表示。然而,现有的$k$-SCA方法虽然声称通过容纳$k$-稀疏源来解决UBI问题,但主要依赖$1$-稀疏源,这限制了它们在高噪声现实场景中的有效性。本文提出了一种有效且计算复杂度较低的UBI方法,特别关注活跃源数量等于传感器数量减一($k=m-1$)这一具有挑战性的情形。我们的方法通过两步方案克服了上述局限:(1)估计整体空间的正交补子空间;(2)辨识混合向量。我们提出了一种基于Gram-Schmidt过程和随机采样一致性(RANSAC)方法的集成算法来求解这两个步骤。使用模拟数据的实验结果表明,与现有算法相比,我们提出的方法具有更优越的有效性。
英文摘要:
Two primary families of methods exist for underdetermined blind identification (UBI) based on the sparsity of the source matrix: sparse component analysis (SCA) and $k$-SCA. SCA assumes one active source at each time instant, while $k$-SCA allows for varying numbers of active sources represented by $k$. However, existing $k$-SCA methods, which claim to solve UBI problems by accommodating $k$-sparse sources, predominantly rely on $1$-sparse sources, limiting their effectiveness in real-world scenarios with high noise levels. In this paper, we propose an effective and computationally less complex approach for UBI, specifically focusing on the challenging case when the number of active sources is equal to the number of sensors minus one ($k=m-1$). Our approach overcomes limitations by using a two-step scenario: (1) estimating the orthogonal complement subspaces of the overall space and (2) identifying the mixing vectors. We present an integrated algorithm based on the Gram-Schmidt process and random sample consensus (RANSAC) method to solve both steps. Experimental results using simulated data demonstrate the superior effectiveness of our proposed method compared to existing algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。