|
|
|
|
|
by magicalhippo
29 days ago
|
|
Yes of course. A compression algorithm which just stores the number of bits and decodes all bits as zeros is also lossy. A floating-point compression algorithm which reconstructs the elements so they differ by at most one ULP[1] compared to the original value is, no surprise, also lossy. Being able to communicate that an algorithm is closer to the latter than the former is useful, hence terms like "near-lossless". [1]: https://en.wikipedia.org/wiki/Unit_in_the_last_place |
|