Arthur Scarpatto Rodrigues
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Arthur Scarpatto Rodrigues has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- André Filipe da Silva Fernandes
Department of Computer Science and Statistics, Embedded Computing Laboratory, Federal University of Santa Catarina, Florianpolis, Brazil
1 shared publication - Ismael Seidel
Department of Computer Science and Statistics, Embedded Computing Laboratory, Federal University of Santa Catarina, Florianpolis, Brazil
1 shared publication - José Luís Güntzel
UFSC - Universidade Federal de Santa Catarina
1 shared publication - Leonardo de Sousa Marques
Department of Computer Science and Statistics, Embedded Computing Laboratory, Federal University of Santa Catarina, Florianpolis, Brazil
1 shared publication
Latest Publications
- Open Access
- 24 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (3) , 1565-1578
A Parallel JPEG Pleno Baseline Block-Based Profile Light Field Codec Using OpenMP
Light Fields (LFs) are an image modality derived from the plenoptic function, capable of representing scenes with a richer amount of visual information, making them well-suitable for immersive applications. To efficiently compress this data-intensive modality, the Joint Photographic Experts Group (JPEG) committee created the JPEG Pleno Part 2 standard with two profiles. This work focuses on the reference encoder and decoder implementations for the Baseline Block-Based Profile (BBBP), i.e., the JPEG PLeno Model (JPLM). Our main contribution lies in the proposal and analysis of a parallel implementation of JPLM codec using OpenMP, including the coding efficiency overhead of three solutions to support parallel decoding: two based on a marker defined in Part 2, called PNT; and another non-compliant version of the entropy codec. We show that it is possible to accelerate encoding up to $12\times $ when using 24threads, and decoding up to $4\times $ with 10 threads. In both cases, the memory overhead remained below 20% for the tested LFs. Although the parallel encoder produces bit-exact matches when compared to the sequential version, a PNT marker is required to ensure parallel decoding, which causes an increase of about 4% in terms of BD-Rate. On the other hand, we show that by updating the arithmetic codec to avoid the PNT, this overhead reduces to at most 0.22%.
- 24 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (3) , 1565-1578
Open AccessA Parallel JPEG Pleno Baseline Block-Based Profile Light Field Codec Using OpenMP
Light Fields (LFs) are an image modality derived from the plenoptic function, capable of representing scenes with a richer amount of visual information, making them well-suitable for immersive applications. To efficiently compress this data-intensive modality, the Joint Photographic Experts Group (JPEG) committee created the JPEG Pleno Part 2 standard with two profiles. This work focuses on the reference encoder and decoder implementations for the Baseline Block-Based Profile (BBBP), i.e., the JPEG PLeno Model (JPLM). Our main contribution lies in the proposal and analysis of a parallel implementation of JPLM codec using OpenMP, including the coding efficiency overhead of three solutions to support parallel decoding: two based on a marker defined in Part 2, called PNT; and another non-compliant version of the entropy codec. We show that it is possible to accelerate encoding up to $12\times $ when using 24threads, and decoding up to $4\times $ with 10 threads. In both cases, the memory overhead remained below 20% for the tested LFs. Although the parallel encoder produces bit-exact matches when compared to the sequential version, a PNT marker is required to ensure parallel decoding, which causes an increase of about 4% in terms of BD-Rate. On the other hand, we show that by updating the arithmetic codec to avoid the PNT, this overhead reduces to at most 0.22%.