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

Source: [Masked Face Image Classification with Sparse Representation based on Majority Voting Mechanism](<https://www.sota2.com/research/paper/68fa68bd1e209131cea1df48>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T22:44:52.991Z

Authors: Han Wang

Published: 2020-11-09T16:55:14.000Z

## Abstract

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%.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2011.04556>)

[PDF](<https://arxiv.org/pdf/2011.04556.pdf>)
