Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

SVD compression, unitary transforms, and computational complexity

From MaRDI portal
Publication:2732870
Jump to:navigation, search

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



Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2732870&oldid=15593269"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki