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

Guiyan Cao

dblp:227/7189 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorComputer networks · 1Databases, data management, data science and information retrieval · 1

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.

Computer networks
1 paper
Network optimization and economics · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › spectrum auction
combinatorial spectrum auction
0.312018
Stable Combinatorial Spectrum Matching · INFOCOM 2018
Network optimization and economics › resource allocation
spectrum allocation
0.312018
Stable Combinatorial Spectrum Matching · INFOCOM 2018
Network optimization and economics
stable matching
0.312018
Stable Combinatorial Spectrum Matching · INFOCOM 2018
Algorithmic game theory and mechanism design
matching
0.112018
Stable Combinatorial Spectrum Matching · INFOCOM 2018

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

stable matching algorithm · 0.7payment determination · 0.7
YearPublicationVenuePosition
2019 An LSTM based Rate and Distortion Prediction Method for Low-delay Video Coding
abstract
In this paper, an LSTM based rate-distortion (R-D) prediction method for low-delay video coding has been proposed. Unlike the traditional rate control algorithms, LSTM is introduced to learn the latent pattern of the R-D relationship in the progress of video coding. Temporal information, hierarchical coding structure information and the content of the frame which is to be encoded have been used to achieve more accurate prediction. Based on the proposed network, a new R-D model parameters prediction method is proposed and tested on test model of Versatile Video Coding (VVC). According to the experimental results, compared with the state-of-the-art method used in VVC, the proposed method can achieve better performance.
Guiyan Cao, Daiqin Yang, Yiyong Zha
MMAsia2
2018 Stable Combinatorial Spectrum Matching
abstract
The use of a combinatorial auction is believed to be an effective way to distribute spectrum to buyers who have diversified valuations for different spectrum combinations. However, the allocation of spectrum with combinatorial auctions mainly aims at optimizing over certain utility functions, e.g., social welfare, but ignores individual preferences of buyers and sellers, who have incentives to deviate from globally optimal allocation results to improve their own utility. In this paper, we explore the possibility of designing a new stable matching algorithm for combinatorial spectrum allocations. Starkly different from existing efforts on spectrum matching mechanism design, our proposed combinatorial spectrum matching framework not only allows buyers to express preferences towards spectrum combinations (rather than individual channels), but also computes the payment that should be transferred from buyers to sellers. Payment determination, while essential in spectrum exchange, has never been addressed in existing spectrum matching frameworks. We design a novel algorithm to achieve a stable combinatorial spectrum matching and to compute the corresponding payment profiles. We conducted an extensive array of experiments to compare the performance of stable combinatorial spectrum matching with spectrum auctions. It is shown that the combinatorial spectrum matching sacrifices little allocation efficiency in terms of social welfare and spectrum utilization, but achieves a much higher individual buyer utility, which will incentivize buyers to participate and comply with the allocation results.
Yanjiao Chen, Long Lin, Guiyan Cao, Baochun Li
INFOCOM3
2018 Two-Pass Rate Control for Constant Quality in High Efficiency Video Coding
abstract
Achieving constant video quality is an essential optimization task for video coding applications. In this paper, we propose a two-pass rate control algorithm for High Efficiency Video Coding (HEVC) to reduce the fluctuation of video quality. First, we present a GOP-level rate allocation scheme which aims at minimizing distortion variance among GOPs. To derive an appropriate quantization parameter (QP) for each frame, we establish the distortion-quantizer (D-Q) and the rate-quantizer (R-Q) model based on ν-support vector regression. Further, an R-D tradeoff is designed to adjust the frame QP considering the constant quality control and rate contraints. Extensive experimental results show that the proposed algorithm achieves more constant video quality.
Guiyan Cao, Yiming Li 0001, Zhenzhong Chen 0001
VCIP1