Improve lossy compression ratio by implementing Kruskal’s algorithm for minimum spanning tree · Issue #5 · agl/jbig2enc · GitHub
More Web Proxy on the site http://driver.im/
You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Y. Ye and P. Cosman developed a method for improving lossy compression ratios using Kruskal’s algorithm for minimum spanning trees to reduce the size of the symbol dictionary.
"JBIG2 symbol dictionary design based on minimum spanning trees"
Proceedings of the First International Conference on Image and Graphics (ICIG), pp. 54-57, Tianjin, China, August 2000
The text was updated successfully, but these errors were encountered:
It's an interesting idea, but not on the list of things to do.
I just found out that djvu compression of 1 bpp images makes a very good symbol directory, but I don't have any details.
BTW, Kruskal's niece Karen is a very good harpsichord player!
Y. Ye and P. Cosman developed a method for improving lossy compression ratios using Kruskal’s algorithm for minimum spanning trees to reduce the size of the symbol dictionary.
"JBIG2 symbol dictionary design based on minimum spanning trees"
Proceedings of the First International Conference on Image and Graphics (ICIG), pp. 54-57, Tianjin, China, August 2000
The text was updated successfully, but these errors were encountered: