首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >A Novel Robust Principal Component Analysis Algorithm of Nonconvex Rank Approximation
【24h】

A Novel Robust Principal Component Analysis Algorithm of Nonconvex Rank Approximation

机译:A Novel Robust Principal Component Analysis Algorithm of Nonconvex Rank Approximation

获取原文
获取原文并翻译 | 示例
           

摘要

Noise exhibits low rank or no sparsity in the low-rank matrix recovery, and the nuclear norm is not an accurate rank approximation of low-rank matrix. In the present study, to solve the mentioned problem, a novel nonconvex approximation function of the low-rank matrix was proposed. Subsequently, based on the nonconvex rank approximation function, a novel model of robust principal component analysis was proposed. Such model was solved with the alternating direction method, and its convergence was verified theoretically. Subsequently, the background separation experiments were performed on the Wallflower and SBMnet datasets. Furthermore, the effectiveness of the novel model was verified by numerical experiments.

著录项

  • 来源
  • 作者

    Zhu E.; Xu M.; Pi D.;

  • 作者单位

    Jiangsu Vocat Coll Informat Technol, Coll Internet Things Engn, Wuxi 214153, Jiangsu, Peoples R China|Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing 211106, Peoples R China;

    Jiangsu Vocat Coll Informat Technol, Coll Elect & Informat Engn, Wuxi 214153, Jiangsu, Peoples R China;

    Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing 211106, Peoples R China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 英语
  • 中图分类
  • 关键词

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号