.png){kind=icon}
返回
Improved piecewise approximation algorithm for image compression
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(97)00130-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
One-dimensional lossy compression schemes, such as piecewise approximation with triggers (PAT) (Walach and Karnin, IEEE Int. Conf: on Acoustics, Speech and Signal Processing, Vol. 1, pp. 529-532, Tokyo, Japan, April 1986) have the advantage of being computationally simple. Several previous papers have examined this algorithm and a variety of changes have been proposed. This paper adds new features and also incorporates some ideas from previous papers to arrive at a modified version: MPAT. The modifications vary parameters for the trigger function and the thresholds. Furthermore, they also introduce new features such as context modelling, different interpolations, and early triggers. These changes add flexibility decrease the compressed image size, and improve the reconstruction quality, while maintaining a complexity advantage over other algorithms. A complexity count is also performed to quantitatively demonstrate the benefits of this algorithm over alternatives. (C) 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keyword:
one dimensional
lossy image compression
fractal
PAT
MPAT
complexity
piecewise linear approximation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
MicroRNA-100 suppresses human osteosarcoma cell proliferation and chemo-resistance via ZNRF2.png)
Oncotarget
OAAI
OncotargetIF0
OAAI分享收藏 没有更多内容
没有更多内容