Masked Face Image Classification with Sparse Representation based on Majority Voting Mechanism

11/09/2020
by   Han Wang, et al.
0

Sparse approximation is the problem to find the sparsest linear combination for a signal from a redundant dictionary, which is widely applied in signal processing and compressed sensing. In this project, I manage to implement the Orthogonal Matching Pursuit (OMP) algorithm and Sparse Representation-based Classification (SRC) algorithm, then use them to finish the task of masked image classification with majority voting. Here the experiment was token on the AR data-set, and the result shows the superiority of OMP algorithm combined with SRC algorithm over masked face image classification with an accuracy of 98.4

READ FULL TEXT

page 5

page 10

research
10/29/2016

Sparse Signal Recovery for Binary Compressed Sensing by Majority Voting Neural Networks

In this paper, we propose majority voting neural networks for sparse sig...
research
10/31/2013

Robust Compressed Sensing and Sparse Coding with the Difference Map

In compressed sensing, we wish to reconstruct a sparse signal x from obs...
research
02/20/2019

Orthogonal Matching Pursuit with Tikhonov and Landweber Regularization

The Orthogonal Matching Pursuit (OMP) for compressed sensing iterates ov...
research
10/27/2019

Compressed Sensing with Probability-based Prior Information

This paper deals with the design of a sensing matrix along with a sparse...
research
10/03/2012

Blurred Image Classification based on Adaptive Dictionary

Two types of framework for blurred image classification based on adaptiv...
research
12/08/2017

Basic Thresholding Classification

In this thesis, we propose a light-weight sparsity-based algorithm, basi...
research
06/18/2022

Bioinspired random projections for robust, sparse classification

Inspired by the use of random projections in biological sensing systems,...

Please sign up or login with your details

Forgot password? Click here to reset