Name
Title | ||
|---|---|---|
Lossless Image Compression By Block Matching On Practical Massively Parallel Architectures |
Abstract | ||
|---|---|---|
Work-optimal O(logM log n) time implementations of lossless image compression by block matching are shown on the PRAM EREW, where n is the size of the image and M is the maximum size of the match, which can be implemented on practical architectures such as meshes of trees, pyramids and multigrids. The work-optimal implementations on pyramids and multigrids are possible under some realistic assumptions. Decompression on these architectures is also possible with the same parallel computational complexity. |
Year | Venue | Keywords |
|---|---|---|
2008 | PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2008 | lossless compression, sliding dictionary, bi-level image, parallel architecture |
Field | DocType | Citations |
Lossless JPEG,Polygon mesh,Lossy compression,Massively parallel,Computer science,Parallel computing,Data compression,Image compression,Lossless compression,Computational complexity theory | Conference | 2 |
PageRank | References | Authors |
0.39 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luigi Cinque | 1 | 222 | 40.97 |
| Sergio De Agostino | 2 | 102 | 16.51 |