DMCA
Submodular Dictionary Learning for Sparse Coding
Cached
Download Links
| Citations: | 12 - 0 self |
BibTeX
@MISC{Jiang_submodulardictionary,
author = {Zhuolin Jiang and Guangxiao Zhang and Larry S. Davis},
title = {Submodular Dictionary Learning for Sparse Coding},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: entropy rate of a random walk on a graph and a discriminative term. Dictionary learning is achieved by finding a graph topology which maximizes the objective function. By exploiting the monotonicity and submodularity properties of the objective function and the matroid constraint, we present a highly efficient greedy-based optimization algorithm. It is more than an order of magnitude faster than several recently proposed dictionary learning approaches. Moreover, the greedy algorithm gives a near-optimal solution with a (1/2)-approximation bound. Our approach yields dictionaries having the property that feature points from the same class have very similar sparse codes. Experimental results demonstrate that our approach outperforms several recently proposed dictionary learning
Keyphrases
objective function sparse coding submodular dictionary learning dictionary learning dictionary learning approach discriminative term approximation bound greedy algorithm approach yield dictionary matroid constraint discriminative dictionary similar sparse code greedy-based approach near-optimal solution random walk entropy rate feature point efficient greedy-based optimization algorithm graph topology submodularity property sparse representation experimental result
