Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Daniele Baieri

dblp:322/8620 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0002-0704-5960ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
3D vision · 50% Efficient and distributed learning · 43% Representation and self-supervised learning · 6%
Computer graphics and multimedia
2 papers
Geometric modeling and processing · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 12 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
shape and motion recovery
1.012026
Model-based Metric 3D Shape and Motion Reconstruction of Wild Bottlenose Dolphins in Drone-Shot Videos · Int. J. Comput. Vis. 2026
Geometric modeling and processing › deformation
as-rigid-as-possible deformation
0.912025
Implicit-ARAP: Efficient Handle-Guided Neural Field Deformation via Local Patch Meshing · NeurIPS 2025
Geometric modeling and processing
implicit neural representation
0.912025
Implicit-ARAP: Efficient Handle-Guided Neural Field Deformation via Local Patch Meshing · NeurIPS 2025
Geometric modeling and processing
shape deformation
0.912025
Implicit-ARAP: Efficient Handle-Guided Neural Field Deformation via Local Patch Meshing · NeurIPS 2025
Machine learning › Efficient and distributed learning
model compression
0.812024
$C^2M^3$: Cycle-Consistent Multi-Model Merging · NeurIPS 2024
Machine learning › Efficient and distributed learning
model merging
0.812024
$C^2M^3$: Cycle-Consistent Multi-Model Merging · NeurIPS 2024
Computer vision › 3D vision
shape matching
0.812024
ReMatching: Low-Resolution Representations for Scalable Shape Correspondence · ECCV (37) 2024
Bioinformatics and computational biology › behavioral analysis
animal behavior analysis
0.312026
Model-based Metric 3D Shape and Motion Reconstruction of Wild Bottlenose Dolphins in Drone-Shot Videos · Int. J. Comput. Vis. 2026
Geometric modeling and processing › shape representation › implicit representation
signed distance function
0.312025
Implicit-ARAP: Efficient Handle-Guided Neural Field Deformation via Local Patch Meshing · NeurIPS 2025
Geometric modeling and processing
surface reconstruction
0.312025
Implicit-ARAP: Efficient Handle-Guided Neural Field Deformation via Local Patch Meshing · NeurIPS 2025
Machine learning › Representation and self-supervised learning › representation matching › feature alignment › embedding alignment
permutation alignment
0.212024
$C^2M^3$: Cycle-Consistent Multi-Model Merging · NeurIPS 2024
Geometric modeling and processing
mesh processing
0.212024
ReMatching: Low-Resolution Representations for Scalable Shape Correspondence · ECCV (37) 2024

Methods — techniques the papers use, named apart from their topics

model-based reconstruction · 2.0drone video analysis · 2.0low-resolution representations · 1.5local patch meshing · 0.9level set discretization · 0.9permutation optimization · 0.8activation renormalization · 0.8
YearPublicationVenuePosition
2026 Model-based Metric 3D Shape and Motion Reconstruction of Wild Bottlenose Dolphins in Drone-Shot Videos
Daniele Baieri, Riccardo Cicciarella, Michael Krützen, Emanuele Rodolà, Silvia Zuffi
Int. J. Comput. Vis.1
2025 Implicit-ARAP: Efficient Handle-Guided Neural Field Deformation via Local Patch Meshing
abstract
Neural fields have emerged as a powerful representation for 3D geometry, enabling compact and continuous modeling of complex shapes. Despite their expressive power, manipulating neural fields in a controlled and accurate manner -- particularly under spatial constraints -- remains an open challenge, as existing approaches struggle to balance surface quality, robustness, and efficiency. We address this by introducing a novel method for handle-guided neural field deformation, which leverages discrete local surface representations to optimize the As-Rigid-As-Possible deformation energy. To this end, we propose the local patch mesh representation, which discretizes level sets of a neural signed distance field by projecting and deforming flat mesh patches guided solely by the SDF and its gradient. We conduct a comprehensive evaluation showing that our method consistently outperforms baselines in deformation quality, robustness, and computational efficiency. We also present experiments that motivate our choice of discretization over marching cubes. By bridging classical geometry processing and neural representations through local patch meshing, our work enables scalable, high-quality deformation of neural fields and paves the way for extending other geometric tasks to neural domains.
Daniele Baieri, Filippo Maggioli, Emanuele Rodolà, Simone Melzi, Zorah Lähner
NeurIPS1
2024 ReMatching: Low-Resolution Representations for Scalable Shape Correspondence
Filippo Maggioli, Daniele Baieri, Emanuele Rodolà, Simone Melzi
ECCV (37)2
2024 $C^2M^3$: Cycle-Consistent Multi-Model Merging
abstract
In this paper, we present a novel data-free method for merging neural networks in weight space. Our method optimizes for the permutations of network neurons while ensuring global coherence across all layers, and it outperforms recent layer-local approaches in a set of challenging scenarios. We then generalize the formulation to the $N$-models scenario to enforce cycle consistency of the permutations with guarantees, allowing circular compositions of permutations to be computed without accumulating error along the path. We qualitatively and quantitatively motivate the need for such a constraint, showing its benefits when merging homogeneous sets of models in scenarios spanning varying architectures and datasets. We finally show that, when coupled with activation renormalization, the approach yields the best results in the task.
Donato Crisostomi, Marco Fumero, Daniele Baieri, Florian Bernard 0001, Emanuele Rodolà
NeurIPS3