Abstract
Data compression schemes seek to remove or minimize the inherent redundancy within a data string. In general, efforts at compressing any data invariably comes at a price. As depicted in Figure 4.1, the cost pertains to three interrelated factors:
-
1.
Compression ratio. The data storage space and/or data transmission time vary inversely with the compression.
-
2.
Computational time. How many mathematical operations are involved? Adaptive codes, for example, will generally provide better compression ratios and/or improved fidelity. The cost is the time (or computational effort) required to attain the improvement.
-
3.
Encoding/Decoding fidelity. Is there any loss of information during the encoding/decoding phases?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lafe, O. (2000). Multimedia Compression. In: Cellular Automata Transforms. Multimedia Systems and Applications Series, vol 16. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4365-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4365-7_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6962-2
Online ISBN: 978-1-4615-4365-7
eBook Packages: Springer Book Archive