Large-scale hyperspectral image compression via sparse representations based on online learning
From MaRDI portal
Publication:1787085
DOI10.2478/amcs-2018-0015zbMath1396.68132OpenAlexW2795192973MaRDI QIDQ1787085
Publication date: 26 September 2018
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/amcs-2018-0015
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Ways to sparse representation: An overview
- Atomic Decomposition by Basis Pursuit
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Bayesian Compressive Sensing
- Generalized Orthogonal Matching Pursuit
- Matching pursuits with time-frequency dictionaries
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Compressive-Projection Principal Component Analysis
- Data-driven models for fault detection using kernel PCA: A water distribution system case study
This page was built for publication: Large-scale hyperspectral image compression via sparse representations based on online learning