DGDiogo Caetano Garcia

Diogo Caetano Garcia

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Diogo Caetano Garcia has a total of 47 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Lossless and lossy compression of water-column profile data from multibeam echosounders based on image predictions and multiple-context entropy-encoding

    by Diogo Caetano Garcia, Ricardo Lopes de Queiroz, Luciano Emídio Neves da Fonseca

    Multibeam Echosounders (MBES) are hydrographic tools used primarily to survey the seafloor bathymetry and backscatter. Modern MBES systems are not limited to the seafloor, as they can also map water column profiles, which holds important biological, thermal and chemical information of oceans and shores. Unfortunately, this feature is normally disregarded during routine surveys operations, as it generates a very large amount of data, requiring data compression for possible use in future analysis. For the compression, we propose to map the water column data into images and to compress each of them using image compressors. We devised two methods: a lossless coder based on linear predictors, and a lossy coder based on thresholding followed by lossless coding. Both methods seem to better suit the echosounder image data than traditional image coders. We tested our methods in sequences that capture different water column activities in the Bay of Brest, France. Results indicate our method outperforms other standard image compression methods, ranging from 4 to 70% average gains in compression ratio in lossless coding, and equivalent results in lossy coding. Compression-induced distortion was measured as traditional mean squared error and as analysis-parameter estimation errors.


  • Open Access

    Using Fractional Super-Resolution to Improve Lossy Compression of Point Cloud Geometry

    by Tomás M. Borges, University of Brasilia, Renan Utida Barbosa Ferreira, Diogo C. Garcia, Ricardo L. de Queiroz

    We present a method for post-processing point clouds’ geometric information by applying a previously proposed fractional super-resolution technique to clouds compressed and decoded with MPEG’s G-PCC codec. In some sense, this is a continuation of that previous work, which requires only a downscaled point cloud and a scaling factor, both of which are provided by the G-PCC codec. For non-solid point clouds, an a priori down-scaling is required for improved efficiency. The method is compared to the GPCC itself, as well as machine-learning-based techniques. Results show a great improvement in quality over GPCC and comparable performance to the latter techniques, with the advantage of not needing any kind of previous training.

  • Open Access

    Point Cloud Reconstruction From Truncated Geometry-Based Streams

    by Diogo Caetano Garcia, Andre L. Souto, Gustavo P. Sandri, Tomas M. Borges, Ricardo L. de Queiroz

    Geometry-based point cloud compression (G-PCC) has been rapidly evolving in the context of international standards. Despite the inherent scalability of octree-based geometry description, current G-PCC attribute compression techniques prevent full scalability for compressed point clouds. In this paper, we present a solution to add scalability to attributes compressed using the region-adaptive hierarchical transform (RAHT), enabling the reconstruction of the point cloud using only a portion of the original bitstream. Without the full geometry information, one cannot compute the weights in which the RAHT relies on to calculate its coefficients for further levels of detail. In order to overcome this problem, we propose a linear relationship approximation relating the downsampled point cloud to the truncated inverse RAHT coefficients at that same level. The linear relationship parameters are sent as side information. After truncating the bitstream at a point corresponding to a given octree level, we can, then, recreate the attributes at that level. Tests were carried out and results attest the good approximation quality of the proposed technique.


  • Differential Transform for Video-Based Plenoptic Point Cloud Coding

    by Diogo C. Garcia, Camilo Dorea, Renan U. B. Ferreira, Davi R. Freitas, Ricardo L. de Queiroz, Rogerio Higa, Ismael Seidel, Vanessa Testoni

    Point cloud compression has been studied in standard bodies and we are here concerned with the Moving Picture Experts Group video-based point cloud compression (V-PCC) solution. Plenoptic point clouds (PPC) is a novel volumetric data representation wherein points are associated with colors in all viewing directions to improve realism. It is sampled as a number ( $N_{c}$ ) of attribute colors per point. We propose a new method for the efficient video-based compression of PPC that is backwards compatible with the existing single-color V-PCC decoder. V-PCC generates three image atlases which are encoded using an image/video encoder. We assume there may be a reference color which is to be encoded as the main payload. We generate $N_{c}+3$ atlases and we produce $N_{c}$ differential images against the reference color image. Those difference images are pixel-wise transformed using an $N_{c}$ -point discrete cosine transform, generating $N_{c}$ transformed atlases which are encoded, forming the secondary payload. Such secondary information is the plenoptic enhancement to the point cloud. If there is no reference attribute, we skip the differences and use the lowest frequency of the transformed atlases as the main payload. Results are presented that show an unrivaled performance of the proposed method.


  • Fractional Super-Resolution of Voxelized Point Clouds

    by Tomas M. Borges, Diogo C. Garcia, Ricardo L. de Queiroz

    We present a method to super-resolve voxelized point clouds downsampled by a fractional factor, using lookup-tables (LUT) constructed from self-similarities from their own downsampled neighborhoods. The proposed method was developed to densify and to increase the precision of voxelized point clouds, and can be used, for example, as improve compression and rendering. We super-resolve the geometry, but we also interpolate texture by averaging colors from adjacent neighbors, for completeness. Our technique, as we understand, is the first specifically developed for intra-frame super-resolution of voxelized point clouds, for arbitrary resampling scale factors. We present extensive test results over different point clouds, showing the effectiveness of the proposed approach against baseline methods.


  • Open Access

    Point Cloud Reconstruction From Truncated Geometry-Based Streams

    by Diogo Garcia, Andre Souto, Gustavo Sandri, Tomas Borges, Ricardo Queiroz

    Geometry-based point cloud compression (G-PCC) has been rapidly evolving in the context of international standards. Despite the inherent scalability of octree-based geometry description, current G-PCC attribute compression techniques prevent full scalability for compressed point clouds. In this paper, we present a solution to add scalability to attributes compressed using the region-adaptive hierarchical transform (RAHT), enabling the reconstruction of the point cloud using only a portion of the original bitstream. Without the full geometry information, one cannot compute the weights in which the RAHT relies on to calculate its coefficients for further levels of detail. In order to overcome this problem, we propose a linear relationship approximation relating the downsampled point cloud to the truncated inverse RAHT coefficients at that same level. The linear relationship parameters are sent as side information. After truncating the bitstream at a point corresponding to a given octree level, we can, then, recreate the attributes at that level. Tests were carried out and results attest the good approximation quality of the proposed technique.

  • Geometry Coding for Dynamic Voxelized Point Clouds Using Octrees and Multiple Contexts

    by Diogo C. Garcia, Tiago A. Fonseca, Renan U. Ferreira, Ricardo L. de Queiroz

    We present a method to compress geometry information of point clouds that explores redundancies across consecutive frames of a sequence. It uses octrees and works by progressively increasing resolution of the octree. At each branch of the tree, we generate an approximation of the child nodes by a number of methods which are used as contexts to drive an arithmetic coder. The best approximation, i.e. the context that yields the least amount of encoding bits, is selected and the chosen method is indicated as side information for replication at the decoder. The core of our method is a context-based arithmetic coder in which a reference octree is used as reference to encode the current octree, thus providing 255 contexts for each output octet. The 255×255 frequency histogram is viewed as a discrete 3D surface and is conveyed to the decoder using another octree. We present two methods to generate the predictions (contexts) which use adjacent frames in the sequence (inter-frame) and one method that works purely intra-frame. The encoder continuously switches the best mode among the three and conveys such information to the decoder. Since an intra-frame prediction is present, our coder can also work in purely intra-frame mode, as well. Extensive results are presented to show the method’s potential against many compression alternatives for the geometry information in dynamic voxelized point clouds.