Locality-constrained max-margin sparse coding

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2017-05-01

類型

期刊名稱

PATTERN RECOGNITION

卷期與頁次

第 65 卷,頁 285–295

ISSN

0031-3203

語言

英文

摘要

This work devises a locality-constrained max-margin sparse coding (LC-MMSC) framework, which jointly considers reconstruction loss and hinge loss simultaneously. Traditional sparse coding algorithms use l(1) constraint to force the representation to be sparse, leading to computational expensive process to optimize the objective function. This work uses locality constraint in the framework to preserve information of data locality and avoid the optimization of l(1). The obtained representation can achieve the goal of data locality and sparsity. Additionally, this work optimizes coefficients, dictionaries and classification parameters simultaneously, and uses block coordinate descent to learn all the components of the proposed model. This work uses semi supervised learning approach in the proposed framework, and the goal is to use both labeled data and unlabeled data to achieve accurate classification performance and improve the generalization of the model. We provide theoretical analysis on the convergence of the proposed LC-MMSC algorithm based on Zangwill's global convergence theorem. This work conducts experiments on three real datasets, including Extended YaleB dataset, AR face dataset and Caltech101 dataset. The experimental results indicate that the proposed algorithm outperforms other comparison algorithms.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Hsaio, W.-H., Liu, C.-L., & Wu, W.-L. (2017). Locality-constrained max-margin sparse coding. PATTERN RECOGNITION, 65, 285–295. https://doi.org/10.1016/j.patcog.2016.12.015

BibTeX RIS

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

分享

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