一种用于文档图像压缩的码书生成算法
A Codebook Generation Algorithm for Document Image Compression
摘要:
基于模式匹配的文档压缩系统(例如,用于传真)依赖于找到一小组模式,这些模式可用于表示文档中的所有墨水。找到一组最优的模式是NP难的,以前的压缩方案采取了启发式。本文介绍了一种扩展的交叉熵的方法,以前用于测量模式的相似性,这个问题。这种方法减少了问题的k-中位数的问题,本文给出了一个新的算法,具有可证明的良好的性能保证。与以前的算法(First Fit,有和没有广义Lloyd's/k-means后处理步骤)相比,新算法生成了更好的码本,从而使压缩性能整体提高了近17%。
英文摘要:
Pattern-matching-based document-compression systems (e.g. for faxing) rely on finding a small set of patterns that can be used to represent all of the ink in the document. Finding an optimal set of patterns is NP-hard; previous compression schemes have resorted to heuristics. This paper describes an extension of the cross-entropy approach, used previously for measuring pattern similarity, to this problem. This approach reduces the problem to a k-medians problem, for which the paper gives a new algorithm with a provably good performance guarantee. In comparison to previous heuristics (First Fit, with and without generalized Lloyd's/k-means postprocessing steps), the new algorithm generates a better codebook, resulting in an overall improvement in compression performance of almost 17%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。