z-logo
Premium
Signal quantization by variation
Author(s) -
Kämpke Thomas
Publication year - 2011
Publication title -
international journal of adaptive control and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.73
H-Index - 66
eISSN - 1099-1115
pISSN - 0890-6327
DOI - 10.1002/acs.1264
Subject(s) - dijkstra's algorithm , shortest path problem , quantization (signal processing) , computation , graph , algorithm , mathematics , computer science , k shortest path routing , mathematical optimization , theoretical computer science
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. Copyright © 2011 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom