A low latency coding scheme for compressing reference frame in video codec

Lin, Chun-Lung

doi:10.1109/icasi.2017.7988523

Cited by 2 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The EC schemes are mainly classified into transformbased and non-transform-based methods [12]- [14]. The nontransform-based schemes such as differential pulse code modulation-variable length coding and block truncation coding are implemented with a very simple structure, but have relatively low compression efficiency and variable bitstream length.…”

Section: Introductionmentioning

confidence: 99%

“…Although the 1-D DWT SPIHT structure shows a superior performance in terms of the trade-off between the compression efficiency and the computational complexity, the utilization of spatial correlation in the 1-D algorithm is difficult compared to that in the 2-D algorithm, resulting in significant compression loss. This drawback hinders the 1-D algorithm from utilizing an aggressive CR [14].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

RL-SPIHT: Reinforcement Learning-Based Adaptive Selection of Compression Ratios for 1-D SPIHT Algorithm

Shin

Kim

2021

IEEE Access

View full text Add to dashboard Cite

In recent years, deep learning technologies have been actively used in various applications. In particular, networks trained using reinforcement learning (RL) are widely exploited for auxiliary tasks in various multimedia frameworks, including image restoration, image compression, and computer vision. Discrete wavelet transform (DWT) and set partitioning in hierarchical trees (SPIHT) are the representative lightweight compression methods that are most widely used for the purposes of frame memory compression and LCD overdrive. In precedent research, in order to improve the compression efficiency of DWT-SPIHT algorithms, the relative complexity of DWT coefficients is quantified, and when compressing DWT coefficients with the SPIHT algorithm, the compression ratio (CR) is adaptively allocated to the compression block according to the numerically expressed complexity. However, the SPIHT algorithm has the characteristic of resource limitation, resulting in the occurrence of remaining blocks, which cannot take advantage of allocating the adaptive CR. Moreover, since the equation expressing the block complexity that determines the CR of each block is obtained through machine learning-based linear regression, it lacks the capability to deal with a wide range of real-world images. To compensate for these drawbacks, this paper optimizes the compression efficiency of the 1-D DWT-SPIHT algorithm using the RL-based episodic auxiliary task. In detail, the proposed method optimally adjusts the proportion of CRs, which are adaptively selected for each block according to the DWT coefficient, through the episodic model trained with the RL algorithm. Consequently, the proposed method achieves an average improvement in peak signal to noise ratio (PSNR) of 2.18dB compared to the baseline 1-D DWT-SPIHT with the fixed compression ratio and 0.68dB compared to the precedent research.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%