Discrete signal quantization

作者:

Highlights:

摘要

A discrete signal attaining only a finite number of values is coarsened by approximations with discrete signals of fewer values. The approximation problems are solved exactly as well as heuristically. Most of the algorithms are robust in the sense of neither requiring thresholds nor demanding initial values. This allows to compress and segment a univariate signal, where only the number of regions must a priori be known.

论文关键词:Dynamic programming,Heuristics,Segmentation

论文评审过程:Received 28 July 1997, Revised 17 July 1998, Available online 7 June 2001.

论文官网地址:https://doi.org/10.1016/S0031-3203(98)00110-1