SPARSE SUBSPACE CLUSTERING WITH SEQUENTIALLY ORDERED AND WEIGHTED L1-MINIMIZATION

檔案

本條目沒有附加檔案。

日期

2019-01-01

期刊名稱

2019 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP)

卷期與頁次

頁 3387–3391

ISSN

1522-4880

ISBN

978-1-5386-6249-6

語言

英文

摘要

Built on the sparse representation framework, sparse subspace clustering (SSC) received considerable attention in the recent years. Conventional SSC employs. l(1)-minimization based sparse regression for neighbor identification on a sample-by-sample basis, and is unaware of the neighbor information revealed by those already computed sparse representation vectors. To rid this drawback, this paper proposes a weighted. l(1)-minimization based sparse regression method, and an associated data ordering rule able to reflect the reliability of neighbor information for further enhancing the clustering accuracy. The selection of weighting coefficients for SSC is also discussed. Computer simulations using both the synthesis and real data are provided to evidence the effectiveness of the proposed method.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Wu, J.-Y., Huang, L.-C., Yang, M.-H., Chang, L.-H., & Liu, C.-H. (2019). SPARSE SUBSPACE CLUSTERING WITH SEQUENTIALLY ORDERED AND WEIGHTED L1-MINIMIZATION. 2019 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 3387–3391. https://ir.lib.nycu.edu.tw/handle/11536/154050

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/154050