Chi CVPR 2013 - Block and Group Regularized Sparse Modeling for Dictionary Learning.pdf

Chi CVPR 2013 - Block and Group Regularized Sparse Modeling for Dictionary Learning.pdf

  1. 1、本文档共6页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Chi CVPR 2013 - Block and Group Regularized Sparse Modeling for Dictionary Learning

Block and Group Regularized Sparse Modeling for Dictionary Learning Yu-Tseh Chi?, Mohsen Ali?, Ajit Rajwade?, Jeffrey Ho? ?University of Florida, Gainesville, FL, U. S. A. ?Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar, India ?{ychi, moali, jho}@cise.ufl.edu, ?ajit rajwade@daiict.ac.in Abstract This paper proposes a dictionary learning framework that combines the proposed block/group (BGSC) or recon- structed block/group (R-BGSC) sparse coding schemes with the novel Intra-block Coherence Suppression Dictionary Learning (ICS-DL) algorithm. An important and distin- guishing feature of the proposed framework is that all dic- tionary blocks are trained simultaneously with respect to each data group while the intra-block coherence being ex- plicitly minimized as an important objective. We provide both empirical evidence and heuristic support for this fea- ture that can be considered as a direct consequence of in- corporating both the group structure for the input data and the block structure for the dictionary in the learning pro- cess. The optimization problems for both the dictionary learning and sparse coding can be solved efficiently using block-gradient descent, and the details of the optimization algorithms are presented. We evaluate the proposed meth- ods using well-known datasets, and favorable comparisons with state-of-the-art dictionary learning methods demon- strate the viability and validity of the proposed framework. 1. Introduction Sparse modeling and dictionary learning have emerged re- cently as an effective and popular paradigm for solving many important learning problems in computer vision. Its appeal stems from its underlying simplicity: given a col- lection of data X = {x1, · · · ,xl} ∈ Rn, learning can be formulated using an objective function of the form: Q(D,C;X) = ∑ g ‖X(g) ?DC(g)‖2F + λD Ψ(D) + λC Ω(C (g)), (1) where the X(g) are vectors/matrices generated from the data X, and Ψ,Ω are regularizers on the lear

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档