.png){kind=icon}
返回
Context quantization by kernel Fisher discriminant
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2005.860357.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Optimal context quantizers for minimum conditional entropy can be constructed by dynamic programming in the probability simplex space. The main difficulty, operationally, is the resulting complex quantizer mapping function in the context space, in which the conditional entropy coding is conducted. To overcome this difficulty, we propose new algorithms for designing context quantizers in the context space based on the multiclass Fisher discriminant and the kernel Fisher discriminant (KFD). In particular, the KFD can describe linearly nonseparable quantizer cells by projecting input context vectors onto a high-dimensional curve, in which these cells become better separable. The new algorithms outperform the previous linear Fisher discriminant method for context quantization. They approach the minimum empirical conditional entropy context quantizer designed in the probability simplex space, but with a practical implementation that employs a simple scalar quantizer mapping function rather than a large lookup table.
Keyword:
context quantization
entropy coding
Fisher discriminants
image compression
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
暂无机构信息
引用论文
Effwct of temperature on the circular dichroism spectra of polypeptides in the extended state.png)
Biopolymers
OAAI
BiopolymersIF0
OAAI分享收藏
分享收藏Evaluation of charge transfer resistance by geometrical extrapolation of the centre of semicircular impedance diagrams通过半圆阻抗图中心的几何外推法评估电荷转移电阻
PREAI
分享收藏分享收藏分享收藏
查看更多内容