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.
Compressing Bi-Level Images by Block Matching on a Tree Architecture / DE AGOSTINO, Sergio. - (2009), pp. 137-145. (Intervento presentato al convegno Prague stringology Conference tenutosi a Prague; Czech Republic nel 31/08/2009 - 02/09/2009).
Compressing Bi-Level Images by Block Matching on a Tree Architecture
DE AGOSTINO, Sergio
2009
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
