Discrete Cosine Transform (Lossy Compression Data Compression)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (Derived: store the DCT coefficient for each input term) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == https://doi-org.ezproxy.canberra.edu.au/10.1109%2FT-C.1974.223784")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n)$ words

(Derived: store the DCT coefficient for each input term)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1974

Reference

https://doi-org.ezproxy.canberra.edu.au/10.1109%2FT-C.1974.223784

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Discrete_Cosine_Transform_(Lossy_Compression_Data_Compression)&oldid=44892"