Large-scale hyperspectral image compression via sparse representations based on online learning

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this study, proximity based optimization algorithms are used for lossy compression of hyperspectral images that are inherently large scale. This is the first time that such proximity based optimization algorithms are implemented with an online dictionary learning method. Compression performances are compared with the one obtained by various sparse representation algorithms. As a result, proximity based optimization algorithms are listed among the three best ones in terms of compression performance values for all hyperspectral images. Additionally, the applicability of anomaly detection is tested on the reconstructed images.

Cite

CITATION STYLE

APA

Ülkü, I., & Kizgut, E. (2018). Large-scale hyperspectral image compression via sparse representations based on online learning. International Journal of Applied Mathematics and Computer Science, 28(1), 197–207. https://doi.org/10.2478/amcs-2018-0015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free