Fast depth map intra-mode selection for 3D-HEVC intra-coding

Hamout, Hamza; Elyousfi, Abderrahmane

doi:10.1007/s11760-020-01669-5

Cited by 7 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we use features different from those used in our previous contribution [16]. Hence, we select the amplitude of simplified mass center (ASMCV) and the variance [32] as the proposed homogeneous features. Let L(i, j) be the luminance value of the pixel at (i, j) and the CTU, the ASMCV, and the variance are, respectively, defined by equations (1) and (2).…”

Section: Clustering Algorithm and Feature Extractionmentioning

confidence: 99%

A Computation Complexity Reduction of the Size Decision Algorithm in 3D-HEVC Depth Map Intracoding

Hamout

Elyousfi

2022

Advances in Multimedia

Self Cite

View full text Add to dashboard Cite

A new video format called a multiview video plus depth map is recently designed as the most efficient 3D video representation. 3D-high efficiency video coding (3D-HEVC) is the international standard for 3D video coding finalized in 2016. In 3D-HEVC intracoding, the depth map is an essential component, in which the depth map intraprediction occupies more than 85% of the overall intraencoding time. In 3D-HEVC design, a highly flexible quadtree coding unit partitioning is adopted, in which one coding tree unit is partitioned recursively into a prediction unit (PU) from 64 × 64 down to 4 × 4. This highly flexible partitioning provides more accurate prediction signals and thereby achieves better intradepth map compression efficiency. However, performing all depth map intraprediction modes for each PU level achieves high depth map intracoding efficiency, but it results in a substantial computational complexity increase. This paper proposes an amelioration of the previously proposed depth map PU size decision using an efficient homogeneity determination. The resulting experiences show that the proposed method can significantly save the computational complexity with a negligible loss of intracoding efficiency.

show abstract

Section: Clustering Algorithm and Feature Extractionmentioning

confidence: 99%

A Computation Complexity Reduction of the Size Decision Algorithm in 3D-HEVC Depth Map Intracoding

Hamout

Elyousfi

2022

Advances in Multimedia

Self Cite

View full text Add to dashboard Cite

show abstract

“…This improves the coding efficiency, but at the expense of high computational complexity. This issue cannot be solved even adopting complex HEVC quadtree coding structure in 3D-HEVC [27].…”

Section: Introductionmentioning

confidence: 99%

A Flexible Lossy Depth Video Coding Scheme Based on Low-rank Tensor Modelling and HEVC Intra Prediction for Free Viewpoint Video

Sharma¹,

Kumar²

2021

Preprint

View full text Add to dashboard Cite

The compression quality losses of depth sequences determine quality of view synthesis in free-viewpoint video. The depth map intra prediction in 3D extensions of the HEVC applies intra modes with auxiliary depth modeling modes (DMMs) to better preserve depth edges and handle motion discontinuities. Although such modes enable high efficiency compression, but at the cost of very high encoding complexity. Skipping conventional intra coding modes and DMMs in depth coding limits practical applicability of the HEVC for 3D display applications. In this paper, we introduce a novel low-complexity scheme for depth video compression based on low-rank tensor decomposition and HEVC intra coding. The proposed scheme leverages spatial and temporal redundancy by compactly representing the depth sequence as a high-order tensor. Tensor factorization into a set of factor matrices following CANDECOMP/PARAFAC (CP) decomposition via alternating least squares give a low-rank approximation of the scene geometry. Further, compression of factor matrices with HEVC intra prediction support arbitrary target accuracy by flexible adjustment of bitrate, varying tensor decomposition ranks and quantization parameters. The results demonstrate proposed approach achieves significant rate gains by efficiently compressing depth planes in low-rank approximated representation. The proposed algorithm is applied to encode depth maps of benchmark "Ballet" and "Breakdancing" sequences. The decoded depth sequences are used for view synthesis in a multi-view video system, maintaining appropriate rendering quality.

show abstract

Low 3D-HEVC Depth Map Intra Modes Selection Complexity Based on Clustering Algorithm and an Efficient Edge Detection

Hamout,

Elyousfi

2023

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

Fast depth map intra-mode selection for 3D-HEVC intra-coding

Cited by 7 publications

References 27 publications

A Computation Complexity Reduction of the Size Decision Algorithm in 3D-HEVC Depth Map Intracoding

A Computation Complexity Reduction of the Size Decision Algorithm in 3D-HEVC Depth Map Intracoding

A Flexible Lossy Depth Video Coding Scheme Based on Low-rank Tensor Modelling and HEVC Intra Prediction for Free Viewpoint Video

Low 3D-HEVC Depth Map Intra Modes Selection Complexity Based on Clustering Algorithm and an Efficient Edge Detection

Contact Info

Product

Resources

About