Abstract
Compressive Sensing (CS) theory asserts that sparse signal reconstruction is possible from a small number of linear measurements. Although CS enables low-cost linear sampling, it requires non-linear and costly reconstruction. Recent literature works show that compressive image classification is possible in CS domain without reconstruction of the signal. In this work, we introduce a DCT base method that extracts binary discriminative features directly from CS measurements. These CS measurements can be obtained by using (i) a random or a pseudorandom measurement matrix, or (ii) a measurement matrix whose elements are learned from the training data to optimize the given classification task. We further introduce feature fusion by concatenating Bag of Words (BoW) representation of our binary features with one of the two state-of-the-art CNN-based feature vectors. We show that our fused feature outperforms the state-of-the-art in both cases.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2018 7th European Workshop on Visual Information Processing, EUVIP 2018 |
| Editors | I. Tabus, K. Egiazarian, F. Battisti, L. Oudre, C. Larabi, A. Beghdadi |
| Pages | 1-6 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781538668979 |
| DOIs | |
| Publication status | Published - 2 Jul 2018 |
| MoE publication type | A4 Article in a conference publication |
Keywords
- Compressive Classification
- Compressive Learning
- Compressive Sensing
- DCT-based Binary Descriptor
- Inference on Measurement Domain
- Learned Measurement Matrix
Fingerprint
Dive into the research topics of 'Compressively Sensed Image Recognition'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver