Skip to Main content Skip to Navigation
Journal articles

Optimal Reference Selection for Random Access in Predictive Coding Schemes

Mai Quyen Pham 1 Aline Roumy 2 Thomas Maugey 2 Elsa Dupraz 3, 4 Michel Kieffer 5
2 Sirocco - Analysis representation, compression and communication of visual data
Inria Rennes – Bretagne Atlantique , IRISA-D5 - SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE
4 Lab-STICC_ENSTAB_CACS_COM
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : 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. Index Terms Mai Quyen Pham was with the team-project SIROCCO at INRIA/IRISA,). Aline Roumy and Thomas Maugey are with the team-project SIROCCO at INRIA/IRISA,
Document type :
Journal articles
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal-imt-atlantique.archives-ouvertes.fr/hal-02925113
Contributor : Elsa Dupraz <>
Submitted on : Friday, August 28, 2020 - 4:50:43 PM
Last modification on : Wednesday, October 14, 2020 - 4:21:47 AM

File

Pham20Com.pdf
Files produced by the author(s)

Identifiers

Citation

Mai Quyen Pham, Aline Roumy, Thomas Maugey, Elsa Dupraz, Michel Kieffer. Optimal Reference Selection for Random Access in Predictive Coding Schemes. IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, inPress, pp.1-20. ⟨10.1109/TCOMM.2020.3002937⟩. ⟨hal-02925113⟩

Share

Metrics

Record views

69

Files downloads

69