4.8 Article

Task-Driven Dictionary Learning

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TPAMI.2011.156

关键词

Basis pursuit; Lasso; dictionary learning; matrix factorization; semi-supervised learning; compressed sensing

资金

  1. ANR [MGA ANR-07-BLAN-0311]
  2. European Research Council (SIERRA)
  3. US National Science Foundation (NSF) [SES-0835531, CCF-0939370]

向作者/读者索取更多资源

Modeling data with linear combinations of a few elements from a learned dictionary has been the focus of much recent research in machine learning, neuroscience, and signal processing. For signals such as natural images that admit such sparse representations, it is now well established that these models are well suited to restoration tasks. In this context, learning the dictionary amounts to solving a large-scale matrix factorization problem, which can be done efficiently with classical optimization tools. The same approach has also been used for learning features from data for other purposes, e. g., image classification, but tuning the dictionary in a supervised way for these tasks has proven to be more difficult. In this paper, we present a general formulation for supervised dictionary learning adapted to a wide variety of tasks, and present an efficient algorithm for solving the corresponding optimization problem. Experiments on handwritten digit classification, digital art identification, nonlinear inverse image problems, and compressed sensing demonstrate that our approach is effective in large-scale settings, and is well suited to supervised and semi-supervised classification, as well as regression tasks for data that admit sparse representations.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据