Signal quantization by variation. (English) Zbl 1263.94012

Kämpke, Thomas

Int. J. Adapt. Control Signal Process. 25, No. 12, 1061-1073 (2011).

Summary: Real-valued data are quantized according to the magnitude of their fluctuations around regional mean values or around a given, real-valued signal. Quantization does not require any parameter or threshold value except the desired number of regions. By the introduction of suitable fluctuation measures and a so-called change point graph, the determination of a minimum quantization is transformed to the computation of the shortest path with a prescribed number of intermediate nodes. Such shortest paths are shown to be computable by dynamic programming and by a variation of the Dijkstra algorithm. Evaluations and extensions of the approach are included.

MSC:

94A12	Signal theory (characterization, reconstruction, filtering, etc.)
90C35	Programming involving graphs or networks
90C39	Dynamic programming

Keywords:

absolute distances; change points; Dijkstra algorithm; dynamic programming; robustness; shortest paths