Evaluation Framework for 360-Degree Visual Content Compression with User View-Dependent Transmission

Bidgoli, Navid Mahmoudian; Maugey, Thomas; Roumy, Aline

doi:10.1109/icip.2019.8803606

Cited by 4 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…8, we show the results obtained for the RitualDance sequence, for four different values of QP ∈ {22, 17, 32, 37} and for the requested length = 60. We compute the costs (Storage S, Transmission R, and the sum cost F = S +λR as proposed in [3]) for both strategies (optimal We conduct the experiments described above for different sequences from the MPEG common test conditions. We evaluate the rate-distortion performance for the two schemes (naive and proposed) and compare them by computing the Bjontegaard Delta (BD-rate) bit rate saving as classically done in video compression.…”

Section: B Real Dataset: Videomentioning

confidence: 99%

See 1 more Smart Citation

Optimal Reference Selection for Random Access in Predictive Coding Schemes

Pham

Roumy

Maugey

et al. 2020

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

Data acquired over long periods of time like High Definition (HD) videos or records from a sensor over long time intervals, have to be efficiently compressed, to reduce their size. The compression has also to allow efficient access to random parts of the data upon request from the users. Efficient compression is usually achieved with prediction between data points at successive time instants. However, this creates dependencies between the compressed representations, which is contrary to the idea of random access. Prediction methods rely in particular on reference data points, used to predict other data points, and the placement of these references balances compression efficiency and random access. Existing solutions to position the references use ad hoc methods. In this paper, we study this joint problem of compression efficiency and random access. We introduce the storage cost as a measure of the compression efficiency and the transmission cost for the random access ability. We show that the reference placement problem that trades off storage with transmission cost is an integer linear programming problem, that can be solved by standard optimizer. Moreover, we show that the classical periodic placement of the references is optimal, when the encoding costs of each data point are equal and when requests of successive data points are made. In this particular case, a closed form expression of the optimal period is derived. Finally, the optimal proposed placement strategy is compared with an ad hoc method, where the references correspond to sources where the prediction does not help reducing significantly the encoding cost. The optimal proposed algorithm shows a bit saving of-20% with respect to the ad hoc method.

show abstract

Section: B Real Dataset: Videomentioning

confidence: 99%

“…compares the costs (Storage S, Transmission R, and the sum cost F = S +R as proposed in[3]) for both strategies (optimal vs most popular selection). In this experiment, we choose to show two results of (2e) fixed = 0.7 with α ∈ {0.1, 0.2, .…”

mentioning

confidence: 99%

Optimal Reference Selection for Random Access in Predictive Coding Schemes

Pham

Roumy

Maugey

et al. 2020

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…We now discuss the performance of the different coders in terms of rate and storage performance. In a previous work [29], a weighted Bjontegaard metric is introduced, in which the weight λ balances the relative importance between the rate and the storage, as a function of the application:…”

Section: Analysis Of the Rate-storage Trade-offmentioning

confidence: 99%

Fine granularity access in interactive compression of 360-degree images based on rate-adaptive channel codes

Bidgoli,

Maugey,

Roumy

2020

Preprint

Self Cite

View full text Add to dashboard Cite

“…This comes however with a small storage size overhead. In order to evaluate its impact, we rely on a comparison methodology proposed in [17], where the Bjontegaard metric is computed on the curve (P SN R, R + λS), for different values of λ. Results are shown in Table I.…”

Section: R(t ) =mentioning

confidence: 99%

A geometry-aware compression of 3D mesh texture with random access

Bidgoli

Maugey

Roumy

et al. 2019

2019 Picture Coding Symposium (PCS)

Self Cite

View full text Add to dashboard Cite

A 3D mesh object is usually represented as a combination of several entities including geometrical information (i.e., the triangles and their position in space) and a texture atlas/map (i.e. a giant 2D image containing all the texture information that is mapped to the 3D object at the rendering stage). This atlas is usually compressed using a conventional 2D image coder, thus without taking into account the geometrical information. Moreover, the whole image is usually decoded even though only a subpart of the mesh is observed by a user. In this paper, we propose a novel approach to compress a texture atlas of a 3D model that enables random access during decoding, and nevertheless takes into account the correlation driven by the geometrical information. The experimental results demonstrate the benefits of the proposed coder.

show abstract

Evaluation Framework for 360-Degree Visual Content Compression with User View-Dependent Transmission

Cited by 4 publications

References 12 publications

Optimal Reference Selection for Random Access in Predictive Coding Schemes

Optimal Reference Selection for Random Access in Predictive Coding Schemes

Fine granularity access in interactive compression of 360-degree images based on rate-adaptive channel codes

A geometry-aware compression of 3D mesh texture with random access

Contact Info

Product

Resources

About