Annalisa Gallina | Ph.D. student

@inproceedings{gallina:hal-05371594,

title = {Improved RAHT-based Compression of 3D Gaussian Splats},

author = {Annalisa Gallina and Giuseppe Valenzise and Sara Baldoni and Federica Battisti},

url = {https://centralesupelec.hal.science/hal-05371594},

year  = {2025},

date = {2025-11-01},

urldate = {2025-11-01},

booktitle = {Proceedings of the Picture Coding Symposium 2025},

address = {Aachen (Aix la Chapelle), Germany},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{10849794,

title = {Characterizing the Geometric Complexity of G-PCC Compressed Point Clouds},

author = {Annalisa Gallina and Hadi Amirpour and Sara Baldoni and Giuseppe Valenzise and Federica Battisti},

doi = {10.1109/VCIP63160.2024.10849794},

year  = {2024},

date = {2024-01-01},

urldate = {2024-01-01},

booktitle = {2024 IEEE International Conference on Visual Communications and Image Processing (VCIP)},

pages = {1-5},

abstract = {Measuring the complexity of visual content is crucial in various applications, such as selecting sources to test processing algorithms, designing subjective studies, and efficiently determining the appropriate encoding parameters and bandwidth allocation for streaming. While spatial and temporal complexity measures exist for 2D videos, a geometric complexity measure for 3D content is still lacking. In this paper, we present the first study to characterize the geometric complexity of 3D point clouds. Inspired by existing complexity measures, we propose several compression-based definitions of geometric complexity derived from the rate-distortion curves obtained by compressing a dataset of point clouds using G-PCC. Additionally, we introduce density-based and geometry-based descriptors to predict complexity. Our initial results show that even simple density measures can accurately predict the geometric complexity of point clouds.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}