The Prague Stringology Conference 2009
Compressing Bi-Level Images by Block Matching on a Tree Architecture
| Abstract: |
| A work-optimal O(log M log n) time parallel implementation of lossless image compression by block matching of bi-level images is shown on a full binary tree architecture under some realistic assumptions, where n is the size of the image and M is the maximum size of the match. Decompression on this architecture is also possible with the same parallel computational complexity. Such implementations have no scalability issues. |
| Download paper: |  |
 |
 |
| PostScript | BibTeX reference |
| Download presentation: |  |