3 ms·
I haven't looked into the theory of it much, but wouldn't the local minimum also be the global one? In your example, even if the first row is more poorly compr
by userbinator 5y ago
I haven't looked into the theory of it much, but wouldn't the local minimum also be the global one?
In your example, even if the first row is more poorly compressed with one filter, could future rows "catch up" the loss? Unless you have a specific counterexample, I don't think it can, because the filtration operates before compression and there's no feedback as such.
- tialaramex 5y ago> I don't think it can, because the filtration operates before compression and there's no feedback as such. The compressor consumes the entire filtered data. You may have been thinking it goes something like Compress(Filter(row1,method=2)).Compress(Filter(row2,method=4)).Compress(Filter(row3,method=1)) and so on. But that would be terribly wasteful. What they do is actually closer to Compress(Filter(row1,method=2).Filter(row2,method=4).Filter(row3,method=1) and so on Does that make it clearer that if the results of two Filter steps are more or less similar, even if those results compress badly on their own, it helps them compress better when they're both nearby ?