4 ms·
This is a Huffman table, right? I'm pretty sure this is how MP3s work.
by pit 13y ago
This is a Huffman table, right? I'm pretty sure this is how MP3s work.
- _delirium 13y agoI read it as just being a suggestion (which is not that uncommon) to use inter-file common characteristics to optimize for the common case, at least within a certain context. JPEG is designed to compress any image. But imagine a new algorithm, gJPEG, which is only designed to compress photographs of grass. And furthermore, you get 100MB of raw buffer space in the executable to store some precomputed data that would be useful to gJPEG doing its work. It's quite possible you could significantly improve on the general performance by factoring out some data that's common to typical grass photographs, so that data could be stored once-and-for-all in the decoder and then omitted from each of your (presumably) billions of individual grass photographs. On the other hand, it's pretty tricky to make it work, so you might not be able to do such a thing effectively.
- ilaksh 13y agoWhy do you suggest that this would only work for photographs in one narrow domain?
- _delirium 13y agoI read the proposal as intending to take advantage of similarities among photographs in a particular domain. Lacking such similarity, you're back to the general photo-compression problem.