3 ms·
Do you know of any image compression technique that would drop information that we expect to be redeemable in a reasonable time using a solver of this sort?
by rixed 10y ago
Do you know of any image compression technique that would drop information that we expect to be redeemable in a reasonable time using a solver of this sort?
- inimino 10y agoSince the shuffling adds information, it seems unlikely.
- rixed 10y agoDon't you think that for any image there exist a shuffled version that compress better?
- inimino 10y agoI don't see any reason why there necessarily would be. Generally speaking, compression algorithms do better when adjacent pixels have similar colors, which is the unshuffled state. In cases where there is a version that compresses better, unshuffling might not work. If you had an "pinstripe" image consisting of alternating black and white columns of pixels, obviously it could compress better after being "shuffled" with all the similarly colored columns together. But then this algorithm would be unable to get the original image back.