24小时热门版块排行榜    

查看: 318  |  回复: 2
本帖产生 1 个 LS-EPI ,点击这里进行查看

hopfliking

铁杆木虫 (小有名气)

[求助] 请帮忙查一下下面文章的检索信息,感谢

an efficient matrix factorization based low-rank representation for subspace clustering

[ 发自手机版 http://muchong.com/3g ]
回复此楼

» 猜你喜欢

已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

muse

捐助贵宾 (知名作家)

【答案】应助回帖

★ ★ ★ ★ ★
感谢参与,应助指数 +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
点击我回帖下面的“送TA红花”,送我一朵红花吧!
2楼2014-09-21 19:13:51
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

muse

捐助贵宾 (知名作家)

【答案】应助回帖

入藏号: WOS:000309785000024
点击我回帖下面的“送TA红花”,送我一朵红花吧!
3楼2014-09-21 19:14:07
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
相关版块跳转 我要订阅楼主 hopfliking 的主题更新
最具人气热帖推荐 [查看全部] 作者 回/看 最后发表
[考研] 环境学硕288求调剂 +8 皮皮皮123456 2026-03-22 8/400 2026-03-23 23:47 by 热情沙漠
[考研] 一志愿北京化工大学 070300 学硕 336分 求调剂 +7 vv迷 2026-03-22 7/350 2026-03-23 23:44 by Txy@872106
[考研] 一志愿华东理工大学081700,初试分数271 +4 kotoko_ik 2026-03-23 5/250 2026-03-23 23:23 by 呆呆师姐
[考研] 081700 调剂 267分 +7 迷人的哈哈 2026-03-23 7/350 2026-03-23 23:19 by 星空星月
[考研] 291求调剂 +8 hhhhxn.. 2026-03-23 8/400 2026-03-23 23:15 by peike
[考研] 一志愿中南大学化学学硕0703总分337求调剂 +5 niko- 2026-03-22 5/250 2026-03-23 22:01 by fuyu_
[考研] 材料专硕英一数二306 +8 z1z2z3879 2026-03-18 8/400 2026-03-23 20:49 by baobaoye
[考研] 333求调剂 +3 ALULU4408 2026-03-23 3/150 2026-03-23 19:04 by macy2011
[考研] 工科材料085601 279求调剂 +8 困于星晨 2026-03-17 10/500 2026-03-23 13:05 by 醉在风里
[考研] 263求调剂 +6 yqdszhdap- 2026-03-22 9/450 2026-03-23 12:57 by yqdszhdap-
[考研] 280分求调剂 一志愿085802 +4 PUMPT 2026-03-22 7/350 2026-03-22 22:13 by 星空星月
[考研] 0854电子信息求调剂 +3 α____ 2026-03-22 3/150 2026-03-22 21:28 by zhq0425
[考研] 285求调剂 +6 ytter 2026-03-22 6/300 2026-03-22 12:09 by 星空星月
[考研] 354求调剂 +7 Tyoumou 2026-03-18 10/500 2026-03-22 11:11 by 人来盛
[考研] 286分人工智能专业请求调剂愿意跨考! +4 lemonzzn 2026-03-17 8/400 2026-03-21 22:49 by lemonzzn
[考研] 280求调剂 +11 咕噜晓晓 2026-03-18 12/600 2026-03-21 22:40 by ACS Nano——
[考研] 南昌大学材料专硕311分求调剂 +6 77chaselx 2026-03-20 6/300 2026-03-21 07:24 by JourneyLucky
[考研] 304求调剂 +6 曼殊2266 2026-03-18 6/300 2026-03-21 00:32 by JourneyLucky
[考研] 22408 344分 求调剂 一志愿 华电计算机技术 +4 solanXXX 2026-03-20 4/200 2026-03-20 23:49 by alg094825
[考研] 085410人工智能专硕317求调剂(0854都可以) +4 xbxudjdn 2026-03-18 4/200 2026-03-20 09:07 by 不168
信息提示
请填处理意见