Page 1 of 2 12 LastLast
Results 1 to 30 of 43

Thread: Data Compression Diamond Algorithm

  1. #1
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts

    Thumbs up Data Compression Diamond Algorithm

    Don't worry, I'm in the process of developing a new algorithm. Something like 40% Theory wins and the rest can be completed quickly.An MP4 file can be minimized from 40% to 95% and can be resized ,The advantage is that Similarly, you can compress the file again and again.

  2. #2
    Member
    Join Date
    Jan 2020
    Location
    Canada
    Posts
    142
    Thanks
    12
    Thanked 2 Times in 2 Posts
    No.
    Last edited by Self_Recursive_Data; 1st March 2020 at 10:01.

  3. #3
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts

    Thumbs up Data Compression Diamond Algorithm

    Data can be compressed again and again which is depending on the data algorithm. used Diamond Data Compression Algorithm Can Be Compress Any (compressed or not)Data up to 40% to 99% .
    Everyone is welcome to comment on this

  4. #4
    Member
    Join Date
    Jan 2020
    Location
    Canada
    Posts
    142
    Thanks
    12
    Thanked 2 Times in 2 Posts
    No.

  5. Thanks:

    snowcat (31st March 2020)

  6. #5
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    Do you mean by no, you can't do that?
    Do you mean by no, you can't do that?Do you mean by no, you can't do that?

  7. #6
    Member
    Join Date
    Jan 2020
    Location
    Canada
    Posts
    142
    Thanks
    12
    Thanked 2 Times in 2 Posts
    Yes.

  8. #7
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts

    Talking

    Of course it can, since the string TL can be found from TL, type T = type, L = length N = TL I think I can , the proof after in a few months.

  9. #8
    Member
    Join Date
    Sep 2007
    Location
    Denmark
    Posts
    919
    Thanks
    57
    Thanked 113 Times in 90 Posts
    Quote Originally Posted by uhost View Post
    Of course it can, since the string TL can be found from TL, type T = type, L = length N = TL I think I can , the proof after in a few months.
    You are not he first one to come here and not understanding simple math and/or compression theory and think you have the holy grail.
    But hey let us see the wonder when you have a working compression and decompressor

  10. Thanks:

    schnaader (3rd March 2020)

  11. #9
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    Thanks I appreciate your valuable comment ,But just because everyone is not on the same path does not mean I can or will not .I hope I can, though, at the end of this year.To say a thing success or not is a matter of intellectual thought

    And what I said in Diamond Algorithm is actually the shape of the numbers when the string is close. The maximum length of a word is half the card.
    Last edited by uhost; 3rd March 2020 at 05:44.

  12. #10
    Member
    Join Date
    Apr 2009
    Location
    The Netherlands
    Posts
    80
    Thanks
    6
    Thanked 18 Times in 11 Posts
    Kolmogorov complexity is a proven fact about the compressability of a piece of information. There is a minimum amount of information necessary in order to be able to restore the compressed information. Sometimes the lower bound of the complexity is a short formula or definition about the data. For example the description "the first million digits of pi" is much shorter than the actual first million digits. In case of real random data the Kolmogorov complexity is equal to the size of the random data.

    Therefor your statement that every piece of information can be compressed by half the length and that it can be repeated, must be false. It contradicts the known facts surrounding Kolmogorov complexity.

  13. #11
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    The system I'm developing has completely eliminated decimals.
    Each word has a hash-number it is repeated and different position taken.
    This position is less than string length.that is maximum length from input as 10% to 95% .it can compressed again and again

    i have tested ,is that 32 bit can made as 24 bit .when input bit can increase more compression is taken 64 bit change to 34 bit ....

  14. #12
    Member CompressMaster's Avatar
    Join Date
    Jun 2018
    Location
    Lovinobana, Slovakia
    Posts
    189
    Thanks
    52
    Thanked 13 Times in 13 Posts
    Quote Originally Posted by uhost View Post
    it can compressed again and again
    only with recompression...

  15. #13
    Member
    Join Date
    Apr 2009
    Location
    The Netherlands
    Posts
    80
    Thanks
    6
    Thanked 18 Times in 11 Posts
    Quote Originally Posted by uhost View Post
    The system I'm developing has completely eliminated decimals.
    Each word has a hash-number it is repeated and different position taken.
    This position is less than string length.that is maximum length from input as 10% to 95% .it can compressed again and again

    i have tested ,is that 32 bit can made as 24 bit .when input bit can increase more compression is taken 64 bit change to 34 bit ....
    If you use a 64 bit or 32 bit hash function as the base of your compression algorithm... Oh boy... How do I explain this...

    Lets take a simple example: the well known CRC-32. It takes any N-byte input and hashes it to 32 bits. If you hash 64 bit to 32 bit using CRC you go from 2^64 inputs to 2^32 outputs. After 'compression' for every 32 bit output you have 2^32 options of 64 bit input that leads to the same hash. If I read you correctly you accounted for hash collisions, using a diamond shaped collections of hash values that should ensure the correctness of reverting to 64 bits again. But for every N discarded bits you generate 2^N of hash revert options you don't account for. And that's if we are sure that CRC-32 is a 'perfect' hash function. CRC-32 is not perfect and because of that the loss of N discarded bits is even a bit higher than 2^N.

  16. Thanks:

    uhost (4th March 2020)

  17. #14
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts

    Smile

    :
    Last edited by uhost; 4th March 2020 at 16:36.

  18. #15
    Member
    Join Date
    Aug 2019
    Location
    Finglas
    Posts
    73
    Thanks
    2
    Thanked 2 Times in 1 Post
    Can you explain your algorithm is it like this:
    A=b-c
    Y=A/thebigest

  19. #16
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    yes sure but not this time .... i am build up my dream. i know 1% fail make 99% fail .so i cannot reveal that When i finished..

  20. #17
    Member
    Join Date
    Apr 2009
    Location
    The Netherlands
    Posts
    80
    Thanks
    6
    Thanked 18 Times in 11 Posts
    Quote Originally Posted by uhost View Post
    i am build up my dream.
    Dreaming is often high on entropy and very very lossy.
    Good luck!

  21. Thanks (2):

    snowcat (31st March 2020),uhost (6th March 2020)

  22. #18
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    Thanks

  23. #19
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts

  24. #20
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    Quote Originally Posted by pacalovasjurijus View Post
    Can you explain your algorithm is it like this:
    A=b-c
    Y=A/thebigest
    position value profit
    ===== ==== =============
    1) [1] 100000 5bit
    2) [10] 100001 4bt
    3) [11] 100010 4bit
    4) [100] 100011 3bit
    5) [101] 100100 3bit
    6) [110] 100101 3bit
    7) [111] 100110 3bit
    [1000] 100111 2bit
    9) [1001] 101000 2bit

    this is example but not same. i think this idea can make compress data

  25. #21
    Programmer schnaader's Avatar
    Join Date
    May 2008
    Location
    Hessen, Germany
    Posts
    613
    Thanks
    251
    Thanked 241 Times in 120 Posts
    Quote Originally Posted by uhost View Post
    position value profit
    ===== ==== =============
    1) [1] 100000 5bit
    2) [10] 100001 4bt
    3) [11] 100010 4bit
    4) [100] 100011 3bit
    5) [101] 100100 3bit
    6) [110] 100101 3bit
    7) [111] 100110 3bit
    [1000] 100111 2bit
    9) [1001] 101000 2bit
    Won't work. Try to read and understand https://en.wikipedia.org/wiki/Prefix_code

    Using prefix codes, a message can be transmitted as a sequence of concatenated code words, without any out-of-band markers or (alternatively) special markers between words to frame the words in the message. The recipient can decode the message unambiguously, by repeatedly finding and removing sequences that form valid code words. This is not generally possible with codes that lack the prefix property, for example {0, 1, 10, 11}: a receiver reading a "1" at the start of a code word would not know whether that was the complete code word "1", or merely the prefix of the code word "10" or "11"; so the string "10" could be interpreted either as a single codeword or as the concatenation of the words "1" then "0".
    Last edited by schnaader; 12th March 2020 at 22:45.
    http://schnaader.info
    Damn kids. They're all alike.

  26. Thanks:

    uhost (13th March 2020)

  27. #22
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    yes i know that but i had overcome that problem
    Click image for larger version. 

Name:	Capture.PNG 
Views:	96 
Size:	307.0 KB 
ID:	7481
    i can completely retrieve origin binary code from compressed code but i have some problem faces in compressed algorithm that is some position have exceeded max bit 3 from origin code
    Last edited by uhost; 13th March 2020 at 10:44.

  28. #23
    Member
    Join Date
    Jul 2014
    Location
    Mars
    Posts
    195
    Thanks
    133
    Thanked 13 Times in 12 Posts
    OK genius where is binary to test?

  29. #24
    Member
    Join Date
    Sep 2007
    Location
    Denmark
    Posts
    919
    Thanks
    57
    Thanked 113 Times in 90 Posts
    Quote Originally Posted by uhost View Post
    yes i know that but i had overcome that problem
    Click image for larger version. 

Name:	Capture.PNG 
Views:	96 
Size:	307.0 KB 
ID:	7481
    i can completely retrieve origin binary code from compressed code but i have some problem faces in compressed algorithm that is some position have exceeded max bit 3 from origin code
    So it doesn't work?

  30. #25
    Member
    Join Date
    Jan 2017
    Location
    Russia
    Posts
    5
    Thanks
    0
    Thanked 0 Times in 0 Posts
    Quote Originally Posted by uhost View Post
    Of course it can, since the string TL can be found from TL, type T = type, L = length N = TL I think I can , the proof after in a few months.
    Is your algorithm somehow related to the golden ratio?
    I have an algorithm that can theoretically compress any input stream. And this algorithm has some relation with the so-called god number (1,618...).
    https://en.wikipedia.org/wiki/Golden_ratio

    But, this requires verification. So far, everything is only in the form of equations.
    I got these equations about five years ago, and tried to better understand their properties.

    PS.
    I write through an online translator, so my text may not look very correct.

  31. #26
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts

    Thumbs up

    hi, i am followed mixed mod [Dictionary & Math] with My own calculation i had Complete 50% but now still some problem. i am trying to fix it [some compressed data exceeded 3 bit]

    and i can found all positive values equivalent to another positive value like as -2 +2
    [23=50 in 3Bit calculation ]<= when i finished[100%] my theorem i will explain
    Last edited by uhost; 29th March 2020 at 19:28.

  32. #27
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    when i would complete The theory part, i will send sample program for your advice and testing

  33. #28
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    you are Brilliant ! So i say you Fibonacci numbers related to my trick

  34. #29
    Member
    Join Date
    Jan 2017
    Location
    Russia
    Posts
    5
    Thanks
    0
    Thanked 0 Times in 0 Posts
    Quote Originally Posted by uhost View Post
    you are Brilliant ! So i say you Fibonacci numbers related to my trick
    Although the ratio F[n+1]/F[n] and tends to the golden ratio, with n->. (Where F[n] is the fibonacci numbers).
    But, my algorithm has some relationship with the golden ratio, not with the Fibonacci numbers.
    I will also try to implement my algorithm.
    So, the competition?

    Where are you from ? Besides that Earth is the third planet from the sun? ))


    PS: I write through an online translator, so my text may not look very correct.
    Last edited by Romul; 29th March 2020 at 20:51. Reason: add more

  35. #30
    Member
    Join Date
    Mar 2020
    Location
    earth
    Posts
    27
    Thanks
    7
    Thanked 0 Times in 0 Posts
    Quote Originally Posted by Romul View Post
    Although the ratio F[n+1]/F[n] and tends to the golden ratio, with n->. (Where F[n] is the fibonacci numbers).
    But, my algorithm has some relationship with the golden ratio, not with the Fibonacci numbers.
    I will also try to implement my algorithm.
    So, the competition?

    Where are you from ? Besides that Earth is the third planet from the sun? ))


    PS: I write through an online translator, so my text may not look very correct.
    is your algorithm implemented practical level ?[in compression]

Page 1 of 2 12 LastLast

Similar Threads

  1. loseless data compression method for all digital data type
    By rarkyan in forum Random Compression
    Replies: 244
    Last Post: 23rd March 2020, 16:33
  2. My new compression algorithm
    By tefara in forum Random Compression
    Replies: 55
    Last Post: 12th June 2019, 20:45
  3. The Recursive Data Compression Algorithm
    By greatalazar in forum Data Compression
    Replies: 5
    Last Post: 29th September 2018, 12:28
  4. Anyone know which compression algorithm does this?
    By hjazz in forum Data Compression
    Replies: 8
    Last Post: 24th March 2014, 05:49
  5. New layer 0 - compression algorithm
    By abocut in forum Data Compression
    Replies: 5
    Last Post: 28th May 2010, 01:32

Tags for this Thread

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •