Previous | Next --- Slide 12 of 47
Back to Lecture Thumbnails

is it possible for you to explain some details about how lossless can preserve all the information while reducing the storage? Like is it a transformation merely between storage type, like from polygon soup/adjaceny list/indices matrix->sparse matrix?


Does lossless compression hurt things like human-readability or time to convert from the compressed representation into other representations?


Does lossless compression try to change the structure of the data, or does it try to use a shorter bitwise representation?


How is this similar to downsampling?