An Interpretable Compression and Classification System: Theory and Applications

07/21/2019
by   Tzu-Wei Tseng, et al.
11

This study proposes a low-complexity interpretable classification system. The proposed system contains three main modules including feature extraction, feature reduction, and classification. All of them are linear. Thanks to the linear property, the extracted and reduced features can be inversed to original data, like a linear transform such as Fourier transform, so that one can quantify and visualize the contribution of individual features towards the original data. Also, the reduced features and reversibility naturally endure the proposed system ability of data compression. This system can significantly compress data with a small percent deviation between the compressed and the original data. At the same time, when the compressed data is used for classification, it still achieves high testing accuracy. Furthermore, we observe that the extracted features of the proposed system can be approximated to uncorrelated Gaussian random variables. Hence, classical theory in estimation and detection can be applied for classification. This motivates us to propose using a MAP (maximum a posteriori) based classification method. As a result, the extracted features and the corresponding performance have statistical meaning and mathematically interpretable. Simulation results show that the proposed classification system not only enjoys significant reduced training and testing time but also high testing accuracy compared to the conventional schemes.

READ FULL TEXT

page 1

page 6

page 7

page 8

page 10

page 11

research
09/02/2019

Low-Complexity Linear Equalizers for OTFS Exploiting Two-Dimensional Fast Fourier Transform

Orthogonal time frequency space (OTFS) modulation can effectively conver...
research
11/04/2009

Generalized Discriminant Analysis algorithm for feature reduction in Cyber Attack Detection System

This Generalized Discriminant Analysis (GDA) has provided an extremely p...
research
02/25/2019

Visualization, Discriminability and Applications of Interpretable Saak Features

In this work, we study the power of Saak features as an effort towards i...
research
05/13/2023

DNN-Compressed Domain Visual Recognition with Feature Adaptation

Learning-based image compression was shown to achieve a competitive perf...
research
04/24/2018

Genesis of Basic and Multi-Layer Echo State Network Recurrent Autoencoders for Efficient Data Representations

It is a widely accepted fact that data representations intervene noticea...
research
10/04/2016

Feature Learning from Spectrograms for Assessment of Personality Traits

Several methods have recently been proposed to analyze speech and automa...
research
08/10/2019

A theory of incremental compression

The ability to find short representations, i.e. to compress data, is cru...

Please sign up or login with your details

Forgot password? Click here to reset