Alexandre Mercat
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alexandre Mercat has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Jarno Vanne
Tampere University, Tampere, Finland
16 shared publications - Marko Viitanen
Tampere University, Tampere, Finland
8 shared publications - Guillaume Gautier
Tampere University, Tampere, Finland
7 shared publications - Joose Sainio
Ultra Video Group, Tampere University, Tampere, Finland
7 shared publications - Louis Fréneau
Tampere University, Tampere, Finland
4 shared publications - Daniel Menard
INSA Rennes, Rennes, France
3 shared publications
Latest Publications
- Open Access
- 11 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 22 (11) , 1-23
Beyond the V-PCC Reference Model: A Holistic Approach to Low-Complexity Attribute Map Generation
Video-based Point Cloud Compression (V-PCC) efficiently compresses dynamic point clouds by projecting 3D patches into 2D occupancy, geometry, and attribute maps before video encoding. The reference attribute map generation pipeline relies on assumptions inherited from the standardization process, notably that global image smoothing and tighter patch packing improve coding performance. This work systematically reassesses these assumptions under practical encoding constraints using uvgVPCCenc, an open source V-PCC framework designed for real-time encoding. Rather than optimizing individual map generation stages independently, we adopt a holistic approach that analyzes the interactions between attribute background filling, attribute map conversion, and patch packing. To this end, we examine three straightforward methods: a local block-based background filling algorithm, a local RGB444-to-YUV420 attribute map conversion, and patch spacing. Their impact is evaluated on both uvgVPCCenc and the V-PCC reference encoder TMC2 using coding efficiency, computational complexity, and subjective visual quality. The results show that these low-complexity methods can substantially reduce map generation complexity. The proposed background filling accelerates the overall encoding by up to 1.41 \(\times\) , while the proposed attribute map conversion increases this speedup to 1.50 \(\times\) and eliminates visual artifacts caused by the interaction between background filling and the reference conversion. Furthermore, moderate patch spacing improves reconstructed quality by mitigating inter-patch color bleeding with only a marginal bitrate increase. Overall, our findings demonstrate that several assumptions underlying the reference V-PCC map generation pipeline no longer hold under practical encoding constraints. More importantly, it demonstrates that evaluating map generation stages in isolation can lead to misleading conclusions, advocating a holistic methodology for the design of future practical V-PCC encoders.- 11 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 22 (11) , 1-23
Open AccessBeyond the V-PCC Reference Model: A Holistic Approach to Low-Complexity Attribute Map Generation
Video-based Point Cloud Compression (V-PCC) efficiently compresses dynamic point clouds by projecting 3D patches into 2D occupancy, geometry, and attribute maps before video encoding. The reference attribute map generation pipeline relies on assumptions inherited from the standardization process, notably that global image smoothing and tighter patch packing improve coding performance. This work systematically reassesses these assumptions under practical encoding constraints using uvgVPCCenc, an open source V-PCC framework designed for real-time encoding. Rather than optimizing individual map generation stages independently, we adopt a holistic approach that analyzes the interactions between attribute background filling, attribute map conversion, and patch packing. To this end, we examine three straightforward methods: a local block-based background filling algorithm, a local RGB444-to-YUV420 attribute map conversion, and patch spacing. Their impact is evaluated on both uvgVPCCenc and the V-PCC reference encoder TMC2 using coding efficiency, computational complexity, and subjective visual quality. The results show that these low-complexity methods can substantially reduce map generation complexity. The proposed background filling accelerates the overall encoding by up to 1.41 \(\times\) , while the proposed attribute map conversion increases this speedup to 1.50 \(\times\) and eliminates visual artifacts caused by the interaction between background filling and the reference conversion. Furthermore, moderate patch spacing improves reconstructed quality by mitigating inter-patch color bleeding with only a marginal bitrate increase. Overall, our findings demonstrate that several assumptions underlying the reference V-PCC map generation pipeline no longer hold under practical encoding constraints. More importantly, it demonstrates that evaluating map generation stages in isolation can lead to misleading conclusions, advocating a holistic methodology for the design of future practical V-PCC encoders. - Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 17380-17384
Enhancing Dynamic Point Clouds in the Wild: A Grand Challenge on Real-World 4D Volumetric Data (UVG-CWI-DQPC)
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 17380-17384
Open AccessEnhancing Dynamic Point Clouds in the Wild: A Grand Challenge on Real-World 4D Volumetric Data (UVG-CWI-DQPC)
- Open Access
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 10-13
Analysis of the Relationship Between Carbon Footprint and Mineral Resource Depletion in the Life Cycle Assessment of Digital Systems
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 10-13
Open AccessAnalysis of the Relationship Between Carbon Footprint and Mineral Resource Depletion in the Life Cycle Assessment of Digital Systems
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 13112-13118
UVG-CWI-DQPC: Dual-Quality Point Cloud Dataset for Volumetric Video Applications
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 13112-13118
Open AccessUVG-CWI-DQPC: Dual-Quality Point Cloud Dataset for Volumetric Video Applications
- Open Access
- 28 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 34-37
uvgKvazaarHW: Open-Source Hardware HEVC Intra Encoder
- 28 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 34-37
Open AccessuvgKvazaarHW: Open-Source Hardware HEVC Intra Encoder
- Open Access
- 31 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 235-241
uvgVPCCenc: Practical Open-Source Encoder for Fast V-PCC Compression
- 31 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 235-241
Open AccessuvgVPCCenc: Practical Open-Source Encoder for Fast V-PCC Compression
- Open Access
- 23 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 15 (1) , 31-43
Do We Need 10 bits? Assessing HEVC Encoders for Energy-Efficient HDR Video Streaming
High-dynamic range (HDR) video content has gained popularity due to its enhanced color depth and luminance range, but it also presents new challenges in terms of compression efficiency and energy consumption. In this paper, we present an in-depth study of the compression performance and energy efficiency of HDR video encoding using High-Efficiency Video Coding (HEVC). In addition to using a native 10-bit HDR encoding configuration as a reference, we explore whether applying tone mapping to an 8-bit representation before encoding can result in additional bitrate and energy savings without compromising visual quality. The main contributions of this work are as follows: 1) a detailed evaluation of four HDR video encoding configurations, three of which leverage tone mapping techniques, 2) a comprehensive experimental setup involving over 15,000 individual encodings across three open-source HEVC encoders (Kvazaar, x265, and SVT-HEVC) and multiple presets, 3) the use of two advanced perception-based metrics for BD-rate calculations, one of which is specifically tailored to capture colour distortions and 4) an open-source dataset consisting of all experimental results for further research. Among the three tone-mapping configurations tested, our findings show that a simple bit-shifting approach can achieves significant reductions in both bitrate and energy consumption compared to the native 10-bit HDR encoding configuration. This research aims to lay an initial foundation for understanding the balance between coding efficiency and energy consumption in HDR video encoding, offering valuable insights to guide future advancements in the field.
- 23 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 15 (1) , 31-43
Open AccessDo We Need 10 bits? Assessing HEVC Encoders for Energy-Efficient HDR Video Streaming
High-dynamic range (HDR) video content has gained popularity due to its enhanced color depth and luminance range, but it also presents new challenges in terms of compression efficiency and energy consumption. In this paper, we present an in-depth study of the compression performance and energy efficiency of HDR video encoding using High-Efficiency Video Coding (HEVC). In addition to using a native 10-bit HDR encoding configuration as a reference, we explore whether applying tone mapping to an 8-bit representation before encoding can result in additional bitrate and energy savings without compromising visual quality. The main contributions of this work are as follows: 1) a detailed evaluation of four HDR video encoding configurations, three of which leverage tone mapping techniques, 2) a comprehensive experimental setup involving over 15,000 individual encodings across three open-source HEVC encoders (Kvazaar, x265, and SVT-HEVC) and multiple presets, 3) the use of two advanced perception-based metrics for BD-rate calculations, one of which is specifically tailored to capture colour distortions and 4) an open-source dataset consisting of all experimental results for further research. Among the three tone-mapping configurations tested, our findings show that a simple bit-shifting approach can achieves significant reductions in both bitrate and energy consumption compared to the native 10-bit HDR encoding configuration. This research aims to lay an initial foundation for understanding the balance between coding efficiency and energy consumption in HDR video encoding, offering valuable insights to guide future advancements in the field.
- Open Access
- 2 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 15 (1) , 44-57
Energy-Efficient Saliency-Guided Video Coding Framework for Real-Time Applications
The significant growth in global video data traffic can be mitigated by saliency-based video coding schemes that seek to increase coding efficiency without any loss of objective visual quality by compressing salient video regions less heavily than non-salient regions. However, conducting salient object detection (SOD) on every video frame before encoding tends to lead to substantial complexity and energy consumption overhead, especially if state-of-the-art deep learning techniques are used in saliency detection. This work introduces a saliency-guided video encoding framework that reduces the energy consumption over frame-by-frame SOD by increasing the detection interval and applying the proposed region-of-interest (ROI) tracking between successive detections. The computational complexity of our ROI tracking technique is kept low by predicting object movements from motion vectors, which are inherently calculated during encoding. Our experimental results demonstrate that the proposed ROI tracking solution saves energy by 86-95% and attains 84-94% accuracy over frame-by-frame SOD. Correspondingly, integrating our proposal into the complete saliency-guided video coding scheme reduces energy consumption on CPU by 79-82% at a cost of weighted PSNR of less than 5%. These findings indicate that our solution has significant potential for low-cost and low-power streaming media applications.
- 2 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 15 (1) , 44-57
Open AccessEnergy-Efficient Saliency-Guided Video Coding Framework for Real-Time Applications
The significant growth in global video data traffic can be mitigated by saliency-based video coding schemes that seek to increase coding efficiency without any loss of objective visual quality by compressing salient video regions less heavily than non-salient regions. However, conducting salient object detection (SOD) on every video frame before encoding tends to lead to substantial complexity and energy consumption overhead, especially if state-of-the-art deep learning techniques are used in saliency detection. This work introduces a saliency-guided video encoding framework that reduces the energy consumption over frame-by-frame SOD by increasing the detection interval and applying the proposed region-of-interest (ROI) tracking between successive detections. The computational complexity of our ROI tracking technique is kept low by predicting object movements from motion vectors, which are inherently calculated during encoding. Our experimental results demonstrate that the proposed ROI tracking solution saves energy by 86-95% and attains 84-94% accuracy over frame-by-frame SOD. Correspondingly, integrating our proposal into the complete saliency-guided video coding scheme reduces energy consumption on CPU by 79-82% at a cost of weighted PSNR of less than 5%. These findings indicate that our solution has significant potential for low-cost and low-power streaming media applications.
- Open Access
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 11214-11217
uvgComm: Open Software for Low-Latency Multi-party Video Communication
Effective and smooth video communication has become an integral tool for interaction in our modern society. The well-known WebRTC project is optimized for server-based communication architectures with less stringent latency requirements. This paper introduces an open-source, peer-to-peer (P2P) mesh-based application called uvgComm 1.0 for low-latency multi-party video communication. Our experimental results show that uvgComm attains 25% lower latency than server-based solutions at 219 ms. In addition, it offers advanced privacy protection mechanisms with end-to-end encryption and P2P mesh topology that delivers media without any media servers. The ambitious goal of uvgComm is to take P2P mesh-based conferencing architecture to the next level and make this architecture a serious competitor to server-based communication architectures.
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 11214-11217
Open AccessuvgComm: Open Software for Low-Latency Multi-party Video Communication
Effective and smooth video communication has become an integral tool for interaction in our modern society. The well-known WebRTC project is optimized for server-based communication architectures with less stringent latency requirements. This paper introduces an open-source, peer-to-peer (P2P) mesh-based application called uvgComm 1.0 for low-latency multi-party video communication. Our experimental results show that uvgComm attains 25% lower latency than server-based solutions at 219 ms. In addition, it offers advanced privacy protection mechanisms with end-to-end encryption and P2P mesh topology that delivers media without any media servers. The ambitious goal of uvgComm is to take P2P mesh-based conferencing architecture to the next level and make this architecture a serious competitor to server-based communication architectures.
- Open Access
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 11230-11233
uvg266: Open-Source VVC Intra Encoder
Versatile Video Coding (VVC/H.266) standard is the emerging successor to the widespread High Efficiency Video Coding (HEVC/H.265). This work introduces the latest version of our academic open-source VVC intra encoder called uvg266. It has been developed from our well-known Kvazaar HEVC encoder by introducing new VVC coding tools into carefully optimized and parallelized coding flow of Kvazaar. This paper outlines the design methodology and implementation aspects of all intra (AI) configuration of uvg266. The experimental results show that single-threaded uvg266 is more than twice as fast as the state-of-the-art VVenC encoder in all our test cases. In speed-optimized coding, the coding overhead of uvg266 is 21.7% but the gap narrows down to 2.6% in the rate distortion optimized coding case. uvg266 has almost linear speedup with core count up to 32 threads. The better scalability of uvg266 quadruples the speed over VVenC. Furthermore, single-threaded uvg266 is up to 380× as fast as VVC reference software VTM and the gap raises to over 11,000× with 32 threads. To the best of our knowledge, uvg266 is currently the fastest available open-source VVC intra software encoder.
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 11230-11233
Open Accessuvg266: Open-Source VVC Intra Encoder
Versatile Video Coding (VVC/H.266) standard is the emerging successor to the widespread High Efficiency Video Coding (HEVC/H.265). This work introduces the latest version of our academic open-source VVC intra encoder called uvg266. It has been developed from our well-known Kvazaar HEVC encoder by introducing new VVC coding tools into carefully optimized and parallelized coding flow of Kvazaar. This paper outlines the design methodology and implementation aspects of all intra (AI) configuration of uvg266. The experimental results show that single-threaded uvg266 is more than twice as fast as the state-of-the-art VVenC encoder in all our test cases. In speed-optimized coding, the coding overhead of uvg266 is 21.7% but the gap narrows down to 2.6% in the rate distortion optimized coding case. uvg266 has almost linear speedup with core count up to 32 threads. The better scalability of uvg266 quadruples the speed over VVenC. Furthermore, single-threaded uvg266 is up to 380× as fast as VVC reference software VTM and the gap raises to over 11,000× with 32 threads. To the best of our knowledge, uvg266 is currently the fastest available open-source VVC intra software encoder.