Scalability and communication in parallel low-complexity lossless compression

DOI10.1007/S11786-010-0034-5MaRDI QIDQ626896zbMATH OpenOpenAlexFDO

Authors L. Cinque, Sergio De Agostino, L. Lombardi

Publication date 19 February 2011

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-010-0034-5

zbMATH Keywords

image compressionarchitecturetext compressiondictionary

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Approximation algorithms (68W25) Distributed algorithms (68W15) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 2052915
• Parallelism and dictionary based data compression
• Parallel lossless image compression using Huffman and arithmetic coding
• A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES
• Context-based compression of binary images in parallel

Cites work

• scientific article; zbMATH DE number 3919857 (Why is no real title available?)
• scientific article; zbMATH DE number 4045113 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES
• A Space-Economical Suffix Tree Construction Algorithm
• A universal algorithm for sequential data compression
• A worst-case analysis of the LZ2 compression algorithm
• An Efficient Parallel Biconnectivity Algorithm
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
• Compression of individual sequences via variable-rate coding
• Fast gapped variants for Lempel-Ziv-Welch compression
• Generalized Kraft Inequality and Arithmetic Coding
• Jewels of Stringology
• Linear Algorithm for Data Compression via String Matching
• On-line versus off-line computation in dynamic text compression
• P-complete problems in data compression
• Parallelism and dictionary based data compression
• Run-length encodings (Corresp.)
• The Parallel Evaluation of General Arithmetic Expressions
• Universal modeling and coding

Cited in

(9)

• The greedy approach to dictionary-based static text compression on a distributed system
• Parallelism and dictionary based data compression
• Context-based compression of binary images in parallel
• Binary image compression via monochromatic pattern substitution: sequential and parallel implementations
• Lempel-Ziv data compression on parallel and distributed systems
• Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression
• Adaptive vector quantization for lossy compression of image sequences
• scientific article; zbMATH DE number 2052915 (Why is no real title available?)
• scientific article; zbMATH DE number 1844683 (Why is no real title available?)

This page was built for publication: Scalability and communication in parallel low-complexity lossless compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626896)