• Title/Summary/Keyword: Generalized Lloyd algorithm

Search Result 8, Processing Time 0.022 seconds

A novel approach to design of local quantizers for distributed estimation

  • Kim, Yoon Hak
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.558-564
    • /
    • 2018
  • In distributed estimation where each node can collect only partial information on the parameter of interest without communication between nodes and quantize it before transmission to a fusion node which conducts estimation of the parameter, we consider a novel quantization technique employed at local nodes. It should be noted that the performance can be greatly improved if each node can transmit its measurement to one designated node (namely, head node) which can quantize its estimate using the total rate available in the system. For this case, the best strategy at the head node would be simply to partition the parameter space using the generalized Lloyd algorithm, producing the global codewords, one of which is closest to the estimate is transmitted to a fusion node. In this paper, we propose an iterative design algorithm that seeks to efficiently assign the codewords into each of quantization partitions at nodes so as to achieve the performance close to that of the system with the head node. We show through extensive experiments that the proposed algorithm offers a performance improvement in rate-distortion perspective as compared with previous novel techniques.

Soft-Decision Based Quantization of the Multimedia Signal Considering the Outliers in Rate-Allocation and Distortion (이상 비트율 할당과 신호왜곡 문제점을 고려한 멀티미디어 신호의 연판정 양자화 방법)

  • Lim, Jong-Wook;Noh, Myung-Hoon;Kim, Moo-Young
    • The Journal of the Acoustical Society of Korea
    • /
    • v.29 no.4
    • /
    • pp.286-293
    • /
    • 2010
  • There are two major conventional quantization algorithms: resolution-constrained quantization (RCQ) and entropy-constrained quantization (ECQ). Although RCQ works well for fixed transmission-rate, it produces the distortion outliers since the cell sizes are different. Compared with RCQ, ECQ has the constraints on the cell size but it produces the rate outliers. We propose the cell-size constrained vector quantization (CCVQ) that improves the generalized Lloyd algorithm (GLA). The CCVQ algorithm is able to make a soft-decision between RCQ and ECQ by using the flexible penalty measure according to the cell size. Although the proposed method increases the small amount of overall mean-distortion, it can reduce the distortion outliers.

A Robust Vector Quantization Method against Distortion Outlier and Source Mismatch (이상 신호왜곡과 소스 불일치에 강인한 벡터 양자화 방법)

  • Noh, Myung-Hoon;Kim, Moo-Young
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.3
    • /
    • pp.74-80
    • /
    • 2012
  • In resolution-constrained quantization, the size of Voronoi cell varies depending on probability density function of the input data, which causes large amount of distortion outliers. We propose a vector quantization method that reduces distortion outliers by combining the generalized Lloyd algorithm (GLA) and the cell-size constrained vector quantization (CCVQ) scheme. The training data are divided into the inside and outside regions according to the size of Voronoi cell, and consequently CCVQ and GLA are applied to each region, respectively. As CCVQ is applied to the densely populated region of the source instead of GLA, the number of centroids for the outside region can be increased such that distortion outliers can be decreased. In real-world environment, source mismatch between training and test data is inevitable. For the source mismatch case, the proposed algorithm improves performance in terms of average distortion and distortion outliers.

Weighted Distance-Based Quantization for Distributed Estimation

  • Kim, Yoon Hak
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.4
    • /
    • pp.215-220
    • /
    • 2014
  • We consider quantization optimized for distributed estimation, where a set of sensors at different sites collect measurements on the parameter of interest, quantize them, and transmit the quantized data to a fusion node, which then estimates the parameter. Here, we propose an iterative quantizer design algorithm with a weighted distance rule that allows us to reduce a system-wide metric such as the estimation error by constructing quantization partitions with their optimal weights. We show that the search for the weights, the most expensive computational step in the algorithm, can be conducted in a sequential manner without deviating from convergence, leading to a significant reduction in design complexity. Our experments demonstrate that the proposed algorithm achieves improved performance over traditional quantizer designs. The benefit of the proposed technique is further illustrated by the experiments providing similar estimation performance with much lower complexity as compared to the recently published novel algorithms.

Fast Algorithms to Generate the Codebook for Vector Quantization in Image Coding (화상 벡터 양자화의 코드북 구성을 위한 고속 알고리즘)

  • 이주희;정해묵;이충웅
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.1
    • /
    • pp.105-111
    • /
    • 1990
  • In this paper, fast algorithms to generate the codebook of vector quantization in image coding, are proposed. And an efficient algorithm to guess a initial codebook, namely, binary splitting method, is proposed. We generated the initial codebook by binary splitting method and then reduced the searching time using Iterative Optimization algorithm as an alternate to the generalized Lloyd algorithm and several information from binary splitting method. And the searching time and performance can be traded off by varying the searching range. With this proposed algorithm, the computation time can be reduced by a factor of 60 Without any degradation of image quality.

  • PDF

Maximum Likelihood (ML)-Based Quantizer Design for Distributed Systems

  • Kim, Yoon Hak
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.3
    • /
    • pp.152-158
    • /
    • 2015
  • We consider the problem of designing independently operating local quantizers at nodes in distributed estimation systems, where many spatially distributed sensor nodes measure a parameter of interest, quantize these measurements, and send the quantized data to a fusion node, which conducts the parameter estimation. Motivated by the discussion that the estimation accuracy can be improved by using the quantized data with a high probability of occurrence, we propose an iterative algorithm with a simple design rule that produces quantizers by searching boundary values with an increased likelihood. We prove that this design rule generates a considerably reduced interval for finding the next boundary values, yielding a low design complexity. We demonstrate through extensive simulations that the proposed algorithm achieves a significant performance gain with respect to traditional quantizer designs. A comparison with the recently published novel algorithms further illustrates the benefit of the proposed technique in terms of performance and design complexity.

Low-Complexity Design of Quantizers for Distributed Systems

  • Kim, Yoon Hak
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.3
    • /
    • pp.142-147
    • /
    • 2018
  • We present a practical design algorithm for quantizers at nodes in distributed systems in which each local measurement is quantized without communication between nodes and transmitted to a fusion node that conducts estimation of the parameter of interest. The benefits of vector quantization (VQ) motivate us to incorporate the VQ strategy into our design and we propose a low-complexity design technique that seeks to assign vector codewords into sets such that each codeword in the sets should be closest to its associated local codeword. In doing so, we introduce new distance metrics to measure the distance between vector codewords and local ones and construct the sets of vector codewords at each node to minimize the average distance, resulting in an efficient and independent encoding of the vector codewords. Through extensive experiments, we show that the proposed algorithm can maintain comparable performance with a substantially reduced design complexity.

Efficient distributed estimation based on non-regular quantized data

  • Kim, Yoon Hak
    • Journal of IKEEE
    • /
    • v.23 no.2
    • /
    • pp.710-715
    • /
    • 2019
  • We consider parameter estimation in distributed systems in which measurements at local nodes are quantized in a non-regular manner, where multiple codewords are mapped into a single local measurement. For the system with non-regular quantization, to ensure a perfect independent encoding at local nodes, a local measurement can be encoded into a set of a great number of codewords which are transmitted to a fusion node where estimation is conducted with enormous computational cost due to the large cardinality of the sets. In this paper, we propose an efficient estimation technique that can handle the non-regular quantized data by efficiently finding the feasible combination of codewords without searching all of the possible combinations. We conduct experiments to show that the proposed estimation performs well with respect to previous novel techniques with a reasonable complexity.