Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhouyang Gao

dblp:146/6619 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding › quantization › vector quantization
index assignment
0.212014
Flexible Symmetric Multiple Description Lattice Vector Quantizer With $L\geq 3$ Descriptions · IEEE Trans. Commun. 2014
Coding theory › source coding › quantization › structured vector quantization
lattice vector quantization
0.212014
Flexible Symmetric Multiple Description Lattice Vector Quantizer With $L\geq 3$ Descriptions · IEEE Trans. Commun. 2014
Coding theory › source coding › multiterminal source coding
multiple description coding
0.212014
Flexible Symmetric Multiple Description Lattice Vector Quantizer With $L\geq 3$ Descriptions · IEEE Trans. Commun. 2014
Coding theory › source coding
rate-distortion theory
0.112014
Flexible Symmetric Multiple Description Lattice Vector Quantizer With $L\geq 3$ Descriptions · IEEE Trans. Commun. 2014

Methods — techniques the papers use, named apart from their topics

high-resolution distortion analysis · 0.2heuristic index assignment · 0.2
YearPublicationVenuePosition
2014 Flexible Multiple Description Lattice Vector Quantizer with L ≥ 3 Descriptions
abstract
In previous work on multiple description lattice vector quantizers (MDLVQ) with L ≥ 3 descriptions, once the central and side lattice codebooks are fixed, the decoding quality is determined for all numbers k of received descriptions. Therefore, it is not possible to achieve tradeoffs between the quality of reconstruction for different values of k, 1 ≤ k ≤ L - 1. This work proposes a flexible MDLVQ capable of overcoming the above drawback. For this, a different reconstruction method is employed and a heuristic index assignment algorithm, which uses L - 2 parameters to control the distortions for 2 ≤ k ≤ L - 1, is developed. The second contribution of this work is a structured index assignment for the case L = 3 and the derivation of asymptotical expressions of the distortions at high resolution. The proposed index assignment has a simple mechanism for controlling the tradeoff between the reconstruction quality when k = 1 and when k = 2, and is able to achieve a wide range of distortion values.
Zhouyang Gao, Sorina Dumitrescu
DCC1
2014 Flexible Symmetric Multiple Description Lattice Vector Quantizer With $L\geq 3$ Descriptions
abstract
In the previous work on multiple description lattice vector quantizers (MDLVQs) with L ≥ 3 descriptions, once the central and side lattice codebooks are fixed, the decoding quality is determined for all numbers k of received descriptions. Therefore, it is not possible to achieve tradeoffs between the quality of reconstruction for different values of k, 1 k ≤ L - 1. This paper proposes a flexible MDLVQ capable of overcoming the above drawback. For this, a different reconstruction method is employed and a heuristic index assignment (IA) algorithm, which uses L - 2 parameters to control the distortions for 2 k ≤ L - 1, is developed. Experimental results show that the proposed MDLVQ, in addition to achieving the desired tradeoffs, significantly outperforms the classic MD scheme based on unequal erasure protection. The second contribution of this paper is a structured IA for the case of L = 3 and the derivation of the corresponding expressions of the distortions at high resolution. The proposed IA has a simple mechanism for controlling the tradeoff between the reconstruction quality for k = 1, 2. The IA is able to achieve a wide range of distortion values, while keeping the product of the distortions for k = 1, 2 the same as in the prior work.
Zhouyang Gao, Sorina Dumitrescu
IEEE Trans. Commun.1