8000 Improve lossy compression ratio by implementing Kruskal’s algorithm for minimum spanning tree · Issue #5 · agl/jbig2enc · GitHub
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

Improve lossy compression ratio by implementing Kruskal’s algorithm for minimum spanning tree #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
dwightkelly opened this issue Dec 1, 2009 · 2 comments
Assignees

Comments

@dwightkelly
Copy link

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

@zdenop
Copy link
Collaborator
zdenop commented Dec 19, 2024

@DanBloomberg : Any idea about this?

@DanBloomberg
Copy link
Collaborator

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!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

3 participants
0