hello

yes/no ?
Let me see if I understood right: you have a window for your sequence

http://remyaumeunier.chez-alice.fr/compression_En.php


I speak very little English

thank you remy

Bonjour Remy:

remy wrote:
hello

yes/no ?
Let me see if I understood right: you have a window for your sequence
and you look if the symbols in this window can be expressed with less
then 8 bits. If this is the case you encode it with the minimal amount,
and you move the window.

Is this correct?

Have some results over standard benchmark?

Bonjour Remy:

remy wrote:
hello

yes/no ?
Let me see if I understood right: you have a window for your sequence
and you look if the symbols in this window can be expressed with less
then 8 bits. If this is the case you encode it with the minimal amount,
and you move the window.

Is this correct?

Have some results over standard benchmark?


http://remyaumeunier.chez-alice.fr/codeSourceGene/Compression.zip

Matthias Gallé schrieb:
Bonjour Remy:

remy wrote:
hello

yes/no ?
Let me see if I understood right: you have a window for your sequence
and you look if the symbols in this window can be expressed with less
then 8 bits. If this is the case you encode it with the minimal amount,
and you move the window.

Is this correct?

Have some results over standard benchmark?

For a related work: Look at the "tagtree" encoding in JPEG 2000.

Thomas Richter a écrit :
Matthias Gallé schrieb:
Bonjour Remy:

remy wrote:
hello

yes/no ?
Let me see if I understood right: you have a window for your sequence
and you look if the symbols in this window can be expressed with less
then 8 bits. If this is the case you encode it with the minimal amount,
and you move the window.

Is this correct?

Have some results over standard benchmark?
For a related work: Look at the "tagtree" encoding in JPEG 2000.


I made the lossless compression

remy schrieb:
Thomas Richter a écrit :
Matthias Gallé schrieb:
Bonjour Remy:

remy wrote:
hello

yes/no ?
Let me see if I understood right: you have a window for your sequence
and you look if the symbols in this window can be expressed with less
then 8 bits. If this is the case you encode it with the minimal amount,
and you move the window.

Is this correct?

Have some results over standard benchmark?
For a related work: Look at the "tagtree" encoding in JPEG 2000.

I made the lossless compression

The tag tree compression in JPEG 2000 *is* lossless. First read, then
think. (-;

je ne suis pas assez bon en anglais, tu ne m'en voudras pas hein

effectivement le jpg 2000 peut éventuellement faire du codage sans
perte, mais je ne fais pas le lien entre le jpg2000 et" mon algo
"sauf si vous me l'expliquez bien sur


google translation
actually jpg 2000 may possibly be the lossless coding, but I do not
link the jpg2000 and "my algo" unless you explain to me of course

remy schrieb:

je ne suis pas assez bon en anglais, tu ne m'en voudras pas hein

I could offer German, but unfortunately, I do not speak French.

effectivement le jpg 2000 peut éventuellement faire du codage sans
perte, mais je ne fais pas le lien entre le jpg2000 et" mon algo
"sauf si vous me l'expliquez bien sur


google translation
actually jpg 2000 may possibly be the lossless coding, but I do not
link the jpg2000 and "my algo" unless you explain to me of course

No - things are different. I'm not saying that you should use JPEG 2000,
I only want to draw your attention to a minor part of the standard which
is a compression scheme of its own.

The tagtree coding is only a minor part of the complete algorithm: It is
used to encode which bit planes of which code blocks appear in the final
bit stream, and it looks close to what you are doing. Again, it does not
compress images. It is used in JPEG 2000 to compress side information.

See Annex B.10 of the standard for details.

See Annex B.10 of the standard for details.

Thomas Richter a écrit :

See Annex B.10 of the standard for details.



Are you referring to coding huffman tree?

the trick is
that only the minimal information required to reconstruct the next
requested entry in the matrix is transmitted.