International audienceUsing the multiple reference frames compensation in the H264 coder improves the coding efficiency for sequences which contain uncovered backgrounds, repetitive motions and highly textured areas. Unfortunately this technique requires excessive memory and computation resources. In this article, we proposed and implemented a technique based on Markov Random Fields Algorithm relying on robust moving pixel segmentation. By the introduction of this technique, we were able to decrease the number of reference frames from five to three while keeping similar video coding performances. The coding time decreased by 35% and the sequence quality was preserved. After the validation of our idea, we evaluated the processing time of the Markov algorithm on architectures intended for embedded multimedia applications. Both DSP and FPGA implementations were explored. We were able to process 50 frames(128 × 128)/s on the EP1S10 FPGA paltform and 35 frames(128 × 128)/s on the ADSP BF533

Robust partitioning enforcement is a mandatory requirement in IMA 1 When this scenario is deployed on modern COTS systems. In this paper, we refine this requirement in the context of multicore processors and discuss a strategy to ensure it. We focus on a scenario in which several ARINC 653 partitions hosted on the same platform are executed at the same time on different cores. 2

No abstract

No abstract

No abstract