Approximation and Compression With Sparse Orthonormal Transforms

DOI10.1109/TIP.2015.2414879MaRDI QIDQ4612897zbMATH OpenOpenAlexDBLPWikidataFDO

Authors O. G. Sezer, Onur G. Guleryuz, Yucel Altunbasak

Publication date 31 January 2019

Published in IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tip.2015.2414879

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• scientific article; zbMATH DE number 1082093
• Orthonormal Expansion $\ell_{1}$-Minimization Algorithms for Compressed Sensing
• Sparse representations and approximation theory
• Nearly optimal sparse Fourier transform
• Sparsification of matrices and compressed sensing
• On the efficiency of the orthogonal matching pursuit in compressed sensing
• (Nearly) sample-optimal sparse Fourier transform
• Fast Orthonormal Sparsifying Transforms Based on Householder Reflectors
• Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions

Cited in

(5)

• A weighted block dictionary learning algorithm for classification
• scientific article; zbMATH DE number 1001409 (Why is no real title available?)
• Orthonormal Expansion $\ell_{1}$-Minimization Algorithms for Compressed Sensing
• Avoidance of Singular Point in Integer Orthonormal Transform for Lossless Coding
• Sparse Compression of Expected Solution Operators

This page was built for publication: Approximation and Compression With Sparse Orthonormal Transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612897)