Supervised Sparse Coding With Decision Forest

doi:10.1109/LSP.2018.2890765

Supervised Sparse Coding With Decision Forest

2019-02-01

10

PRE

AI

DOI：10.1109/LSP.2018.2890765

Original

Original request for help

Save

Abstract

En 中文

By jointly conducting sparse coding and classifier training, supervised sparse coding has shown its effectiveness in a variety of recognition tasks. However, the existing supervised sparse coding methods often consider linear classification, which limits their discrimination in handling highly nonlinear data. In this letter, we propose a new supervised sparse coding model by incorporating decision tree classifiers. Since decision trees can well deal with the non-linear properties of data, the introduction of decision trees to sparse coding can noticeably improve the discrimination of coding. Meanwhile, sparse coding is able to produce sparse de-correlated features that decision tree is in favor of. For further improvement, we close the loop of sparse coding and decision tree learning with an ensemble framework, which alternatively learns a dictionary for sparse coding and a decision tree for classification. The resulting series of decision trees as well as series of dictionaries are used to construct a decision forest for classification. The proposed method was applied to face recognition and scene classification, and the experimental results have demonstrated its power in comparison with recent supervised sparse coding methods.

Keywords:

Sparse coding

dictionary learning

decision tree

decision forest

classification

Supervised Sparse Coding With Decision Forest

Abstract

AI Summary

Journal

Organization