Semi-supervised dual graph regularized dictionary learning

12/11/2018
by   Khanh-Hung Tran, et al.
0

In this paper, we propose a semi-supervised dictionary learning method that uses both the information in labelled and unlabelled data and jointly trains a linear classifier embedded on the sparse codes. The manifold structure of the data in the sparse code space is preserved using the same approach as the Locally Linear Embedding method (LLE). This enables one to enforce the predictive power of the unlabelled data sparse codes. We show that our approach provides significant improvements over other methods. The results can be further improved by training a simple nonlinear classifier as SVM on the sparse codes.

READ FULL TEXT

page 1

page 2

page 3

research
09/13/2020

Semi-supervised dictionary learning with graph regularization and active points

Supervised Dictionary Learning has gained much interest in the recent de...
research
08/24/2021

Online Dictionary Learning Based Fault and Cyber Attack Detection for Power Systems

The emerging wide area monitoring systems (WAMS) have brought significan...
research
02/03/2015

Task-Driven Dictionary Learning for Hyperspectral Image Classification with Structured Sparsity Constraints

Sparse representation models a signal as a linear combination of a small...
research
04/15/2022

Sensitivity of sparse codes to image distortions

Sparse coding has been proposed as a theory of visual cortex and as an u...
research
01/15/2017

Boosting Dictionary Learning with Error Codes

In conventional sparse representations based dictionary learning algorit...
research
10/03/2012

Smooth Sparse Coding via Marginal Regression for Learning Sparse Representations

We propose and analyze a novel framework for learning sparse representat...
research
03/13/2016

A comprehensive study of sparse codes on abnormality detection

Sparse representation has been applied successfully in abnormal event de...

Please sign up or login with your details

Forgot password? Click here to reset