| 查看: 413 | 回复: 2 | ||
| 本帖产生 1 个 LS-EPI ，点击这里进行查看 | ||
| 当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖 | ||
hopfliking铁杆木虫 (小有名气)
|
[求助]
请帮忙查一下下面文章的检索信息，感谢
|
|
|
an efficient matrix factorization based low-rank representation for subspace clustering [ 发自手机版 http://muchong.com/3g ] |
回复此楼» 猜你喜欢
售SCI一区T0P文章，我:8.O.55.1.O54,科目全,可伽急
已经有5人回复
-
售SCI一区T0P文章，我:8.O55.1.O.54,科目全,可十急
已经有5人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.54,科目齐全,可+急
已经有5人回复
-
售SCI文章，我:8O.5.5.1O.54,科目全,可十急
已经有4人回复
-
售SCI一区T0P文章，我:8O.55.1.O.54,科目全,可伽急
已经有4人回复
-
售SCI一区文章，我:8.O.55.1.O.54,科目齐全,可伽急
已经有5人回复
-
售SCI文章，我:8O.5.5.1O.54,科目全,可十急
已经有5人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有6人回复
-
延安大学回应“副教授留绝笔信”：确已离世，正核实举报内容
已经有5人回复
-
售SCI文章，我:8O5.5.1.O.54,科目齐全,可+急
已经有23人回复
muse
捐助贵宾 (知名作家)
- LS-EPI: 147
- 应助: 314 (大学生)
- 贵宾: 0.549
- 金币: 20674
- 散金: 2783
- 红花: 81
- 沙发: 156
- 帖子: 6098
- 在线: 1468.2小时
- 虫号: 1207111
- 注册: 2011-02-19
- 专业: 保险学
3楼2014-09-21 19:14:07
muse
捐助贵宾 (知名作家)
- LS-EPI: 147
- 应助: 314 (大学生)
- 贵宾: 0.549
- 金币: 20674
- 散金: 2783
- 红花: 81
- 沙发: 156
- 帖子: 6098
- 在线: 1468.2小时
- 虫号: 1207111
- 注册: 2011-02-19
- 专业: 保险学
【答案】应助回帖
★ ★ ★ ★ ★
感谢参与，应助指数 +1
hopfliking: 金币+5, ★★★★★最佳答案 2014-09-21 19:17:37
sunshan4379: LS-EPI+1, 感谢应助！ 2014-09-21 19:37:04
感谢参与，应助指数 +1
hopfliking: 金币+5, ★★★★★最佳答案 2014-09-21 19:17:37
sunshan4379: LS-EPI+1, 感谢应助！ 2014-09-21 19:37:04
|
An efficient matrix factorization based low-rank representation for subspace clustering 作者:Liu, YY (Liu, Yuanyuan)[ 1 ] ; Jiao, LC (Jiao, L. C.)[ 1 ] ; Shang, FH (Shang, Fanhua)[ 1 ] PATTERN RECOGNITION 卷: 46 期: 1 页: 284-292 DOI: 10.1016/j.patcog.2012.06.011 出版年: JAN 2013 查看期刊信息 摘要 In recent years, robust subspace clustering is an important unsupervised clustering problem in machine learning and computer vision communities. The recently proposed spectral clustering based approach, called low-rank representation (LRR), yields an optimal solution for the case of independent subspaces and partially corrupted data. However, it has to be solved iteratively and involves singular value decomposition (SVD) at each iteration, and then suffers from high computation cost of multiple SVDs. In this paper, we propose an efficient matrix tri-factorization (MTF) approach with a positive semidefinite (PSD) constraint to approximate the original nuclear norm minimization (NNM) problem and mitigate the computation cost of performing SVDs. Specially, we introduce a matrix tri-factorization idea into the original low-rank representation framework, and then convert it into a small scale matrix nuclear norm minimization problem. Finally, we establish an alternating direction method (ADM) based algorithm to efficiently solve the proposed problem. Experimental results on a variety of synthetic and real-world data sets validate the efficiency, robustness and effectiveness of the proposed MTF approach comparing with the state-of-the-art algorithms. (C) 2012 Elsevier Ltd. All rights reserved. 关键词 作者关键词:Nuclear norm minimization (NNM); Low rank representation; Alternating direction method (ADM); Matrix tri-factorization; Positive semidefinite (PSD) KeyWords Plus:MOTION SEGMENTATION; FACE RECOGNITION; ALGORITHM 作者信息 通讯作者地址: Liu, YY (通讯作者) [显示增强组织信息的名称] Xidian Univ, Minist Educ China, Key Lab Intelligent Percept & Image Understanding, Mailbox 224,2 S TaiBai Rd, Xian 710071, Peoples R China. 地址: [显示增强组织信息的名称] [ 1 ] Xidian Univ, Minist Educ China, Key Lab Intelligent Percept & Image Understanding, Xian 710071, Peoples R China 电子邮件地址:yuanyuanliu0917@yahoo.com.cn; jlcxidian@163.com; shangfanhua@hotmail.com 基金资助致谢 基金资助机构 授权号 National Natural Science Foundation of China 60971112 60971128 60970067 61072108 Fund for Foreign Scholars in University Research and Teaching Programs (111 Project) B07048 Fundamental Research Funds for the Central Universities JY10000902001 JY10000902041 JY10000902043 查看基金资助信息 出版商 ELSEVIER SCI LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, OXON, ENGLAND 类别 / 分类 研究方向:Computer Science; Engineering Web of Science 类别:Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic 文献信息 文献类型:Article 语种:English 入藏号: WOS:000309785000024 ISSN: 0031-3203 期刊信息 目录： Current Contents Connect® Impact Factor (影响因子): Journal Citation Reports® 其他信息 IDS 号: 020CA Web of Science 核心合集中的 "引用的参考文献": 42 Web of Science 核心合集中的 "被引频次": 2 |
2楼2014-09-21 19:13:51
