基于改进l 范数最小化组合算法欠定盲源分离.docVIP

  • 12
  • 0
  • 约9.75千字
  • 约 5页
  • 2017-08-31 发布于安徽
  • 举报

基于改进l 范数最小化组合算法欠定盲源分离.doc

基于改进哈尔滨工业大学自动化测试与控制系哈尔滨 150080欠定盲TN911   文献标识码: A   国家标准学科分类代码: 510.40 Underdetermined blind source separation based on improved combinatorial algorithm for l1-norm minimization Fu Ning Peng Xiyuan (Dept. of Automatic Test and Control, Harbin Institute of Technology, Harbin 150080, China) Abstract: Under the sparse assumption, the problem of underdetermined blind source separation can be solved by l1-norm minimization algorithms such as the linear programming, the shortest-path algorithm, the combinatorial algorithm and so on. But these conventional algorithms rely on the high sparseness of t

文档评论(0)

1亿VIP精品文档

相关文档