29 ms·
I thought about doing something like that for audio, but I think it gets really inefficient with higher sample rates because you end up with so little overlap.
by pit 13y ago
I thought about doing something like that for audio, but I think it gets really inefficient with higher sample rates because you end up with so little overlap.
Like this: imagine I've got an array of shorts representing audio data. If I've got two files with similar segments, I've saved one short:
[1, 2, 3, 2, 1, 2, 5]
[7, 2, 3, 6, 8, 9, 3]
So I can say that [2, 3] is represented by a new value (z), and can shave a short off of both streams. Then what happens if a new stream comes along with no similarities:
[8, 2, 7, 1, 7, 3, 7]
...you still have to send each value.
Maybe I've just demonstrated that I don't know anything about compression, but I would be interested in working with you on this.
- ilaksh 13y agoI think I would want to find an existing sparse autoencoder implementation, ideally a project already setup for encoding audio, and start from there. http://www.stanford.edu/class/cs294a/sparseAutoencoder.pdf http://www.stanford.edu/class/cs294a/sparseAutoencoder.pdf