Data Discovery Using Lossless Compression-Based Sparse Representation

03/15/2021
by   Elyas Sabeti, et al.
0

Sparse representation has been widely used in data compression, signal and image denoising, dimensionality reduction and computer vision. While overcomplete dictionaries are required for sparse representation of multidimensional data, orthogonal bases represent one-dimensional data well. In this paper, we propose a data-driven sparse representation using orthonormal bases under the lossless compression constraint. We show that imposing such constraint under the Minimum Description Length (MDL) principle leads to a unique and optimal sparse representation for one-dimensional data, which results in discriminative features useful for data discovery.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/08/2017

3D seismic data denoising using two-dimensional sparse coding scheme

Seismic data denoising is vital to geophysical applications and the tran...
research
02/09/2022

Reducing Redundancy in the Bottleneck Representation of the Autoencoders

Autoencoders are a type of unsupervised neural networks, which can be us...
research
02/11/2015

Image denoising based on improved data-driven sparse representation

Sparse representation of images under certain transform domain has been ...
research
06/12/2012

Image Similarity Using Sparse Representation and Compression Distance

A new line of research uses compression methods to measure the similarit...
research
06/06/2020

Chromatic Learning for Sparse Datasets

Learning over sparse, high-dimensional data frequently necessitates the ...
research
06/23/2020

On Compression Principle and Bayesian Optimization for Neural Networks

Finding methods for making generalizable predictions is a fundamental pr...

Please sign up or login with your details

Forgot password? Click here to reset