Probabilistic distance-based quantizer design for distributed estimation
نویسندگان
چکیده
منابع مشابه
Quantizer design for distributed estimation with communication constraints and unknown observation statistics
We consider the problem of quantizer design in a distributed estimation system with communication constraints in the case where only a training sequence is available. Our approach is based on a generalization of regression trees. The lookahead method that we also propose improves significantly the performance. The final system performs similarly to the one that assumes known statis-
متن کاملProbabilistic Distance Estimation in Wireless Sensor Networks
Since all anchor-based range-free localization algorithms require estimating the distance from an unknown node to an anchor node, such estimation is crucial for localizing nodes in environments as wireless sensor networks. We propose a new algorithm, named EDPM (Estimating Distance using a Probability Model), to estimate the distance from an unknown node to an anchor node. Simulation results sh...
متن کاملTerrain-Based Memetic Algorithms for Vector Quantizer Design
Recently, a Genetic Accelerated K-Means Algorithm (GAKM) was proposed as an approach for optimizing Vector Quantization (VQ) codebooks, relying on an accelerated version of K-Means algorithm as a new local learning module. This approach requires the determination of a scale factor parameter (η), which affects the local search performed by GAKM. The problem of auto-adapting the local search in G...
متن کاملProbabilistic Distance Measures for Prototype-based Rules
Probabilistic distance functions, including several variants of value difference metrics, minimum risk metric and ShortFukunaga metrics, are used with prototype-based rules (P-rules) to provide a very concise and comprehensible classification model. Application of probabilistic metrics to nominal or discrete features is straightforward. Heterogeneous metrics that handle continuous attributes wi...
متن کاملProbabilistic partial-distance fast matching algorithms for motion estimation
Motion search is by far the most complex operation to be performed in a video encoder. This complexity stems from the need to compute a matching metric for a potentially large number of candidate motion vectors, with the objective being to nd the candidate with the smallest metric. Most work on fast motion estimation algorithms has focused on reducing the number of candidate motion vectors that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2016
ISSN: 1687-6180
DOI: 10.1186/s13634-016-0389-0