Compressing Bi-Level Images by Block Matching on a Tree Architecture.
Sergio De Agostino · 2009
A work-optimal O(logM 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. © 2009 Czech Technical University in Prague, Czech Republic.