Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0031-3203(98)00110-1 | Pattern Recognition |
Keywords | Field | DocType |
Dynamic programming,Heuristics,Segmentation | Dynamic programming,Heuristic,Finite set,Discrete-time signal,A priori and a posteriori,Image processing,Algorithm,Univariate,Quantization (signal processing),Mathematics | Journal |
Volume | Issue | ISSN |
32 | 4 | 0031-3203 |
Citations | PageRank | References |
3 | 0.45 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Kämpke | 1 | 86 | 20.62 |
| Rudolf Kober | 2 | 8 | 2.36 |