作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2013, Vol. 39 ›› Issue (4): 199-202,209. doi: 10.3969/j.issn.1000-3428.2013.04.046

• 人工智能及识别技术 • 上一篇    下一篇

基于迹范数的L1-PCA算法

刘丽敏1a,樊晓平1a,2,廖志芳1b   

  1. (1. 中南大学 a. 信息科学与工程学院;b. 软件学院,长沙 410075;2. 湖南财政经济学院信息管理系,长沙 410205)
  • 收稿日期:2012-05-07 出版日期:2013-04-15 发布日期:2013-04-12
  • 作者简介:刘丽敏(1976-),女,讲师、博士研究生,主研方向:数据挖掘,机器视觉,智能信息处理;樊晓平,教授、博士、博士生导师;廖志芳,副教授、博士
  • 基金资助:
    国家“863”计划基金资助项目(2007AA022008);国家科技支撑计划基金资助项目(2012BAH08B00)

L1-PCA Algorithm Based on Trace Norm

LIU Li-min   1a, FAN Xiao-ping   1a,2, LIAO Zhi-fang   1b   

  1. 1a. School of Information Science and Engineering; 1b. School of Software, Central South University, Changsha 410075, China; 2. Department of Information Management, Hunan College of Finance and Economics, Changsha 410205, China)
  • Received:2012-05-07 Online:2013-04-15 Published:2013-04-12

摘要: L1-PCA相比传统的主成分分析(PCA)更具鲁棒性,但是L1-PCA算法存在很多局部最优解且秩约束计算较为复杂。为此,提出一种基于迹范数的L1-PCA算法。利用迹范数近似代替矩阵的秩,以解决秩约束存在很多局部最优解的问题,采用基于增强拉格朗日乘子的方法对算法求解,并将其应用于图像的降噪处理。实验结果表明,利用该算法降噪后的图像轮廓清晰、同类图像特征明显趋同。

关键词: 主成分分析, 迹范数, 增强拉格朗日乘子, 闭合形式解, 奇异值分解

Abstract: Compared with Principal Component Analysis(PCA), L1-PCA has better robustness. But, there are some problems in the L1-PCA such as locally optimal solutions, computational complexity of rank. In order to solve the problems, the paper proposes a new algorithm of L1-PCA based on trace norm, it uses trace norm approximate to instead of matrix rank, and solves the problem that rank constraint has many local optimal solution, and the solution algorithm is based on Augmented Lagrange Multiplier(ALM) and applies it in noise reduction of images. Experimental results show that the image outline of this algorithm after doing noise reduction is clear and objects within the same class become more similar.

Key words: Principal Component Analysis(PCA), trace norm, Augmented Lagrange Multiplier(ALM), closed form solution, Singular Value Decomposition(SVD)

中图分类号: