SVD compression, unitary transforms, and computational complexity
From MaRDI portal
Publication:2732870
DOI10.1109/78.790654zbMath1075.94505OpenAlexW2119859695MaRDI QIDQ2732870
Bernard de Backer, Daniël De Zutter, Luc Knockaert
Publication date: 1999
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/79cb52427269e44163eaf2ecaae70f303a5dd05a
Analysis of algorithms and problem complexity (68Q25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (2)
On sparse representation of analytic signal in Hardy space ⋮ A Variational Inequality Model for the Construction of Signals from Inconsistent Nonlinear Equations
This page was built for publication: SVD compression, unitary transforms, and computational complexity