The Experts below are selected from a list of 5133 Experts worldwide ranked by ideXlab platform
Sorina Dumitrescu - One of the best experts on this subject based on the ideXlab platform.
-
Optimal Design of a Two-Stage Wyner-Ziv Scalar Quantizer With Forwardly/Reversely Degraded Side Information
IEEE Transactions on Communications, 2019Co-Authors: Qixue Zheng, Sorina DumitrescuAbstract:This paper addresses the optimal design of a two-stage Wyner-Ziv Scalar Quantizer with forwardly or reversely degraded side information (SI) for finite-alphabet sources and SI. We assume that the binning is performed optimally and address the design of the Quantizer partitions. The optimization problem is formulated as the minimization of a weighted sum of distortions and rates. The proposed solution is globally optimal when the cells in each partition are contiguous. The solution algorithm is based on solving the single-source or the all-pairs minimum-weight path (MWP) problem in certain weighted directed acyclic graphs. When the conventional dynamic programming technique is used to solve the underlying MWP problems, the time complexity achieved is $O(N^{3})$ , where $N$ is the size of the source alphabet. A so-called partial Monge property is additionally introduced, and a faster solution algorithm exploiting this property is proposed. Experimental results assess the practical performance of the proposed scheme.
-
optimal design of a two stage wyner ziv Scalar Quantizer with forwardly reversely degraded side information
IEEE Transactions on Communications, 2019Co-Authors: Qixue Zheng, Sorina DumitrescuAbstract:This paper addresses the optimal design of a two-stage Wyner-Ziv Scalar Quantizer with forwardly or reversely degraded side information (SI) for finite-alphabet sources and SI. We assume that the binning is performed optimally and address the design of the Quantizer partitions. The optimization problem is formulated as the minimization of a weighted sum of distortions and rates. The proposed solution is globally optimal when the cells in each partition are contiguous. The solution algorithm is based on solving the single-source or the all-pairs minimum-weight path (MWP) problem in certain weighted directed acyclic graphs. When the conventional dynamic programming technique is used to solve the underlying MWP problems, the time complexity achieved is $O(N^{3})$ , where $N$ is the size of the source alphabet. A so-called partial Monge property is additionally introduced, and a faster solution algorithm exploiting this property is proposed. Experimental results assess the practical performance of the proposed scheme.
-
design of optimal Scalar Quantizer for sequential coding of correlated sources
IEEE Transactions on Communications, 2019Co-Authors: Sorina DumitrescuAbstract:This paper addresses the design of a sequential Scalar Quantizer (SSQ) for finite-alphabet correlated sources in the fixed-rate (FR) and entropy-constrained (EC) cases. The optimization problem is formulated as the minimization of a weighted sum of distortions and rates. The proposed solution is globally optimal for the class of SSQs with convex cells and is based on solving the minimum-weight path (MWP) problem in the EC case, respectively, a length-constrained MWP problem in the FR case, in a series of weighted directed acyclic graphs. The asymptotic time complexity is $O(K_{1}^{2}K_{2}^{2})$ , where $K_{1}$ and $K_{2}$ are the respective sizes of the alphabets of the two sources. Additionally, it is proved that, by applying the proposed algorithms to discretizations of correlated sources with continuous joint probability density function, the performance approaches that of the optimal EC-SSQ, respectively, FR-SSQ, with convex cells for the original sources as the accuracy of the discretization increases. Extensive experiments performed with correlated Gaussian sources validate the effectiveness in practice of the proposed approach in approximating the optimal SSQ for the case of continuous-alphabet sources.
-
Optimal Design of A Two-stage Wyner-Ziv Scalar Quantizer with Degraded Side Information
2018 29th Biennial Symposium on Communications (BSC), 2018Co-Authors: Qixue Zheng, Sorina DumitrescuAbstract:This work addresses the optimal design of a two-stage Wyner-Ziv Scalar Quantizer with degraded side information (SI). We assume that binning is performed optimally and address the design of the nested Quantizer partitions. The optimization problem is formulated as minimizing a weighted sum of distortions and rates. The proposed solution algorithm is globally optimal when the source and SI are discrete, while the partition cells are contiguous. The algorithm is based on solving the single source or the all-pairs minimum-weight path problem in certain weighted directed acyclic graphs. A so-called partial Monge property is additionally introduced and a faster solution algorithm exploiting this property is proposed. Experimental results assess the practical performance of the proposed scheme.
-
ITW - Design of optimal entropy-constrained Scalar Quantizer for sequential coding of correlated sources
2017 IEEE Information Theory Workshop (ITW), 2017Co-Authors: Huihui Wu, Sorina DumitrescuAbstract:This work addresses the design of a sequential code for correlated sources using entropy-constrained Scalar quantization at each encoder. We consider discrete sources and propose a globally optimal algorithm to minimize a weighted sum of distortions and rates. Our algorithm is based on solving the minimum weight path problem in a series of appropriately constructed weighted directed acyclic graphs. Its asymptotical time complexity is O(N2 1 N2 2 ), where N 1 and N 2 denote the alphabet sizes of the two sources, respectively.
Qixue Zheng - One of the best experts on this subject based on the ideXlab platform.
-
Optimal Design of a Two-Stage Wyner-Ziv Scalar Quantizer With Forwardly/Reversely Degraded Side Information
IEEE Transactions on Communications, 2019Co-Authors: Qixue Zheng, Sorina DumitrescuAbstract:This paper addresses the optimal design of a two-stage Wyner-Ziv Scalar Quantizer with forwardly or reversely degraded side information (SI) for finite-alphabet sources and SI. We assume that the binning is performed optimally and address the design of the Quantizer partitions. The optimization problem is formulated as the minimization of a weighted sum of distortions and rates. The proposed solution is globally optimal when the cells in each partition are contiguous. The solution algorithm is based on solving the single-source or the all-pairs minimum-weight path (MWP) problem in certain weighted directed acyclic graphs. When the conventional dynamic programming technique is used to solve the underlying MWP problems, the time complexity achieved is $O(N^{3})$ , where $N$ is the size of the source alphabet. A so-called partial Monge property is additionally introduced, and a faster solution algorithm exploiting this property is proposed. Experimental results assess the practical performance of the proposed scheme.
-
optimal design of a two stage wyner ziv Scalar Quantizer with forwardly reversely degraded side information
IEEE Transactions on Communications, 2019Co-Authors: Qixue Zheng, Sorina DumitrescuAbstract:This paper addresses the optimal design of a two-stage Wyner-Ziv Scalar Quantizer with forwardly or reversely degraded side information (SI) for finite-alphabet sources and SI. We assume that the binning is performed optimally and address the design of the Quantizer partitions. The optimization problem is formulated as the minimization of a weighted sum of distortions and rates. The proposed solution is globally optimal when the cells in each partition are contiguous. The solution algorithm is based on solving the single-source or the all-pairs minimum-weight path (MWP) problem in certain weighted directed acyclic graphs. When the conventional dynamic programming technique is used to solve the underlying MWP problems, the time complexity achieved is $O(N^{3})$ , where $N$ is the size of the source alphabet. A so-called partial Monge property is additionally introduced, and a faster solution algorithm exploiting this property is proposed. Experimental results assess the practical performance of the proposed scheme.
-
Optimal Design of A Two-stage Wyner-Ziv Scalar Quantizer with Degraded Side Information
2018 29th Biennial Symposium on Communications (BSC), 2018Co-Authors: Qixue Zheng, Sorina DumitrescuAbstract:This work addresses the optimal design of a two-stage Wyner-Ziv Scalar Quantizer with degraded side information (SI). We assume that binning is performed optimally and address the design of the nested Quantizer partitions. The optimization problem is formulated as minimizing a weighted sum of distortions and rates. The proposed solution algorithm is globally optimal when the source and SI are discrete, while the partition cells are contiguous. The algorithm is based on solving the single source or the all-pairs minimum-weight path problem in certain weighted directed acyclic graphs. A so-called partial Monge property is additionally introduced and a faster solution algorithm exploiting this property is proposed. Experimental results assess the practical performance of the proposed scheme.
Wen Gao - One of the best experts on this subject based on the ideXlab platform.
-
an optimal non uniform Scalar Quantizer for distributed video coding
International Conference on Multimedia and Expo, 2006Co-Authors: Xun Guo, Debin Zhao, Wen GaoAbstract:In this paper, we propose a novel algorithm to design an optimal non-uniform Scalar Quantizer for distributed video coding, which aims at achieving a coding rate close to joint conditional entropy of the quantized video frames given the side information. Wyner-Ziv theory on source coding is employed as the basic coding principle and the asymmetric scenario is considered. In this algorithm, a probability distribution model, which considers the influence of the joint distribution of input source and side information to the coding performance, is established and used as the optimality condition firstly. Then, a modified Lloyd Max algorithm is used to design the Scalar Quantizer to give an optimal quantization for input source before coding. Experimental results show that compared to uniform Scalar quantization, proposed algorithm can improve coding performance largely, especially at low bit rate.
-
ICME - An Optimal Non-Uniform Scalar Quantizer for Distributed Video Coding
2006 IEEE International Conference on Multimedia and Expo, 2006Co-Authors: Xun Guo, Debin Zhao, Wen GaoAbstract:In this paper, we propose a novel algorithm to design an optimal non-uniform Scalar Quantizer for distributed video coding, which aims at achieving a coding rate close to joint conditional entropy of the quantized video frames given the side information. Wyner-Ziv theory on source coding is employed as the basic coding principle and the asymmetric scenario is considered. In this algorithm, a probability distribution model, which considers the influence of the joint distribution of input source and side information to the coding performance, is established and used as the optimality condition firstly. Then, a modified Lloyd Max algorithm is used to design the Scalar Quantizer to give an optimal quantization for input source before coding. Experimental results show that compared to uniform Scalar quantization, proposed algorithm can improve coding performance largely, especially at low bit rate.
Michelle Effros - One of the best experts on this subject based on the ideXlab platform.
-
Optimal multiple description and multiresolution Scalar Quantizer design
2008 Information Theory and Applications Workshop, 2008Co-Authors: Michelle EffrosAbstract:The author presents new algorithms for fixed-rate multiple description and multiresolution Scalar Quantizer design. The algorithms both run in time polynomial in the size of the source alphabet and guarantee globally optimal solutions. To the authorpsilas knowledge, these are the first globally optimal design algorithms for multiple description and multiresolution Quantizers.
-
Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems
IEEE Transactions on Information Theory, 2008Co-Authors: D Muresan, Michelle EffrosAbstract:An algorithm for Scalar Quantizer design on discrete-alphabet sources is proposed. The proposed algorithm can be used to design fixed-rate and entropy-constrained conventional Scalar Quantizers, multiresolution Scalar Quantizers, multiple description Scalar Quantizers, and Wyner-Ziv Scalar Quantizers. The algorithm guarantees globally optimal solutions for conventional fixed-rate Scalar Quantizers and entropy-constrained Scalar Quantizers. For the other coding scenarios, the algorithm yields the best code among all codes that meet a given convexity constraint. In all cases, the algorithm run-time is polynomial in the size of the source alphabet. The algorithm derivation arises from a demonstration of the connection between Scalar quantization, histogram segmentation, and the shortest path problem in a certain directed acyclic graph.
-
codecell contiguity in optimal fixed rate and entropy constrained network Scalar Quantizers
Data Compression Conference, 2002Co-Authors: Michelle Effros, D MuresanAbstract:We consider the properties of optimal fixed-rate and entropy-constrained Scalar Quantizers for finite alphabet sources. In particular, we consider conditions under which the optimal Scalar Quantizer with contiguous codecells achieves performance no worse than the optimal Scalar Quantizer without the constraint of codecell contiguity. In addition to traditional Scalar Quantizers, we consider multi-resolution Scalar Quantizers and multiple description Scalar Quantizers and also look briefly at codes with decoder side information (Wyner-Ziv codes). While the conditions under which codecell contiguity is consistent with optimality in fixed-rate and entropy-constrained Scalar quantization are quite broad, even with the squared error distortion measure, codecell contiguity in fixed-rate and entropy-constrained multi-resolution, multiple description, and Wyner-Ziv Scalar quantization can preclude optimality for some sources.
-
quantization as histogram segmentation globally optimal Scalar Quantizer design in network systems
Data Compression Conference, 2002Co-Authors: D Muresan, Michelle EffrosAbstract:We propose a polynomial-time algorithm for optimal Scalar Quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained Scalar Quantizers, multi-resolution Scalar Quantizers, multiple description Scalar Quantizers, and Wyner-Ziv Scalar Quantizers. The algorithm guarantees globally optimal solutions for fixed-rate and entropy-constrained Scalar Quantizers and constrained optima for the other coding scenarios. We derive the algorithm by demonstrating the connection between Scalar quantization, histogram segmentation, and the shortest path problem in a certain directed acyclic graph.
-
DCC - Quantization as histogram segmentation: globally optimal Scalar Quantizer design in network systems
Proceedings DCC 2002. Data Compression Conference, 1Co-Authors: D Muresan, Michelle EffrosAbstract:We propose a polynomial-time algorithm for optimal Scalar Quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained Scalar Quantizers, multi-resolution Scalar Quantizers, multiple description Scalar Quantizers, and Wyner-Ziv Scalar Quantizers. The algorithm guarantees globally optimal solutions for fixed-rate and entropy-constrained Scalar Quantizers and constrained optima for the other coding scenarios. We derive the algorithm by demonstrating the connection between Scalar quantization, histogram segmentation, and the shortest path problem in a certain directed acyclic graph.
D Muresan - One of the best experts on this subject based on the ideXlab platform.
-
Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems
IEEE Transactions on Information Theory, 2008Co-Authors: D Muresan, Michelle EffrosAbstract:An algorithm for Scalar Quantizer design on discrete-alphabet sources is proposed. The proposed algorithm can be used to design fixed-rate and entropy-constrained conventional Scalar Quantizers, multiresolution Scalar Quantizers, multiple description Scalar Quantizers, and Wyner-Ziv Scalar Quantizers. The algorithm guarantees globally optimal solutions for conventional fixed-rate Scalar Quantizers and entropy-constrained Scalar Quantizers. For the other coding scenarios, the algorithm yields the best code among all codes that meet a given convexity constraint. In all cases, the algorithm run-time is polynomial in the size of the source alphabet. The algorithm derivation arises from a demonstration of the connection between Scalar quantization, histogram segmentation, and the shortest path problem in a certain directed acyclic graph.
-
codecell contiguity in optimal fixed rate and entropy constrained network Scalar Quantizers
Data Compression Conference, 2002Co-Authors: Michelle Effros, D MuresanAbstract:We consider the properties of optimal fixed-rate and entropy-constrained Scalar Quantizers for finite alphabet sources. In particular, we consider conditions under which the optimal Scalar Quantizer with contiguous codecells achieves performance no worse than the optimal Scalar Quantizer without the constraint of codecell contiguity. In addition to traditional Scalar Quantizers, we consider multi-resolution Scalar Quantizers and multiple description Scalar Quantizers and also look briefly at codes with decoder side information (Wyner-Ziv codes). While the conditions under which codecell contiguity is consistent with optimality in fixed-rate and entropy-constrained Scalar quantization are quite broad, even with the squared error distortion measure, codecell contiguity in fixed-rate and entropy-constrained multi-resolution, multiple description, and Wyner-Ziv Scalar quantization can preclude optimality for some sources.
-
quantization as histogram segmentation globally optimal Scalar Quantizer design in network systems
Data Compression Conference, 2002Co-Authors: D Muresan, Michelle EffrosAbstract:We propose a polynomial-time algorithm for optimal Scalar Quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained Scalar Quantizers, multi-resolution Scalar Quantizers, multiple description Scalar Quantizers, and Wyner-Ziv Scalar Quantizers. The algorithm guarantees globally optimal solutions for fixed-rate and entropy-constrained Scalar Quantizers and constrained optima for the other coding scenarios. We derive the algorithm by demonstrating the connection between Scalar quantization, histogram segmentation, and the shortest path problem in a certain directed acyclic graph.
-
DCC - Quantization as histogram segmentation: globally optimal Scalar Quantizer design in network systems
Proceedings DCC 2002. Data Compression Conference, 1Co-Authors: D Muresan, Michelle EffrosAbstract:We propose a polynomial-time algorithm for optimal Scalar Quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained Scalar Quantizers, multi-resolution Scalar Quantizers, multiple description Scalar Quantizers, and Wyner-Ziv Scalar Quantizers. The algorithm guarantees globally optimal solutions for fixed-rate and entropy-constrained Scalar Quantizers and constrained optima for the other coding scenarios. We derive the algorithm by demonstrating the connection between Scalar quantization, histogram segmentation, and the shortest path problem in a certain directed acyclic graph.
-
DCC - Codecell contiguity in optimal fixed-rate and entropy-constrained network Scalar Quantizers
Proceedings DCC 2002. Data Compression Conference, 1Co-Authors: Michelle Effros, D MuresanAbstract:We consider the properties of optimal fixed-rate and entropy-constrained Scalar Quantizers for finite alphabet sources. In particular, we consider conditions under which the optimal Scalar Quantizer with contiguous codecells achieves performance no worse than the optimal Scalar Quantizer without the constraint of codecell contiguity. In addition to traditional Scalar Quantizers, we consider multi-resolution Scalar Quantizers and multiple description Scalar Quantizers and also look briefly at codes with decoder side information (Wyner-Ziv codes). While the conditions under which codecell contiguity is consistent with optimality in fixed-rate and entropy-constrained Scalar quantization are quite broad, even with the squared error distortion measure, codecell contiguity in fixed-rate and entropy-constrained multi-resolution, multiple description, and Wyner-Ziv Scalar quantization can preclude optimality for some sources.
