Multi-Objective Optimization and Characterization of Pareto Points for Scalable Coding

In this paper, we formulated the optimal bit-allocation problem for a scalable codec for images/videos as a graph-based constrained vector-valued optimization problem with many optimal solutions, which are referred to as Pareto points. Pareto points are generally derived using weighted sum scalariza...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on circuits and systems for video technology Jg. 29; H. 7; S. 2096 - 2111
Hauptverfasser: Hwang, Wen-Liang, Lee, Chia-Chen, Peng, Guan-Ju
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.07.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Codec
Codecs
Coding
Distortion
Encoding
multi-criterion optimization
Multiple objective analysis
Optimization
Pareto optimization
Rate-distortion
Resource management
Scalability
Scalable coding
Theorems
Video compression
ISSN:1051-8215, 1558-2205
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we formulated the optimal bit-allocation problem for a scalable codec for images/videos as a graph-based constrained vector-valued optimization problem with many optimal solutions, which are referred to as Pareto points. Pareto points are generally derived using weighted sum scalarization; however, it has yet to be determined whether all Pareto points can be derived using this approach. This paper addresses this issue. When presented as a theorem, our results indicate that as long as the rate-distortion function of each resolution is strictly decreasing and convex and the Pareto points form a continuous curve, then all Pareto points can be derived using scalarization. The theorem is verified using the state-of-the-art scalable coding method H.264/SVC and a scalability extension of High Efficiency Video Coding (HEVC). We highlight a number of easily interpretable Pareto points that represent a good trade-off between candidate resolutions. The proximity point is defined as the Pareto point closest to the ideal performance for each resolution. We also model the Pareto points as a function of total bit rate and demonstrate that the Pareto points at other target bit rates can be predicted.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1051-8215
1558-2205
DOI:10.1109/TCSVT.2018.2851999