Entropy-Based Selection of Cluster Representatives for Document Image Compression
From MaRDI portal
Publication:5109270
DOI10.1137/19M1243312zbMath1434.68154WikidataQ127026060 ScholiaQ127026060MaRDI QIDQ5109270
No author found.
Publication date: 11 May 2020
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
compression techniqueminimum entropybilevel imagedigitalized documenthierarchic clustering algorithm
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficiency of chain codes to represent binary objects
- Robust image registration by increment sign correlation
- A proof of the triangle inequality for the Tanimoto distance
- Wavelet based image watermarking: futuristic concepts in information security
- The Likelihood Encoder for Lossy Compression
- On the Hamming distance of linear codes over a finite chain ring
- Variational Decompression of Image Data From DjVu Encoded Files
This page was built for publication: Entropy-Based Selection of Cluster Representatives for Document Image Compression