Efficient quantization algorithms for discrete functions
Thomas Kämpke · Journal of Interdisciplinary Mathematics · 2003
A function attaining a finite number of values only is approximated by another such function with fewer values. The approximation problem is solved to local as well as to global optimality. In this way, one-dimensional signal compression and segmentation problems with a-priori known number of regions can be solved in a threshold free manner.