Entropy-based selection of cluster representatives for document image compression

DOI10.1137/19M1243312MaRDI QIDQ5109270zbMATH OpenWikidataFDO

Authors

Publication date 11 May 2020

Published in SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/19M1243312

zbMATH Keywords

bilevel imagecompression techniquedigitalized documenthierarchic clustering algorithmminimum entropy

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• An algorithm using Walsh transformation for compressing typeset documents
• Hierarchical clustering of text documents
• Two-stage lossy/lossless compression of grayscale document images
• ?-Entropy data compression
• \(LZ\)-based image compression

Cites work

• A proof of the triangle inequality for the Tanimoto distance
• Efficiency of chain codes to represent binary objects
• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• scientific article; zbMATH DE number 1149166 (Why is no real title available?)
• On the Hamming distance of linear codes over a finite chain ring
• Robust image registration by increment sign correlation
• The Likelihood Encoder for Lossy Compression
• Variational Decompression of Image Data From DjVu Encoded Files
• Wavelet based image watermarking: futuristic concepts in information security

This page was built for publication: Entropy-based selection of cluster representatives for document image compression

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