Search Results for author: Andrea Torsello

Found 13 papers, 6 papers with code

The Average Mixing Kernel Signature

1 code implementation ECCV 2020 Luca Cosmo, Giorgia Minello, Michael Bronstein, Luca Rossi, Andrea Torsello

We introduce the Average Mixing Kernel Signature (AMKS), a novel signature for points on non-rigid three-dimensional shapes based on the average mixing kernel and continuous-time quantum walks.

Descriptive

Graph Generation via Spectral Diffusion

no code implementations29 Feb 2024 Giorgia Minello, Alessandro Bicciato, Luca Rossi, Andrea Torsello, Luca Cosmo

In this paper, we present GRASP, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process.

Denoising Graph Generation

Deep Demosaicing for Polarimetric Filter Array Cameras

1 code implementation24 Nov 2022 Mara Pistellato, Filippo Bergamasco, Tehreem Fatima, Andrea Torsello

Polarisation Filter Array (PFA) cameras allow the analysis of light polarisation state in a simple and cost-effective manner.

Demosaicking

Towards Exemplar-Free Continual Learning in Vision Transformers: an Account of Attention, Functional and Weight Regularization

1 code implementation24 Mar 2022 Francesco Pelosin, Saurav Jha, Andrea Torsello, Bogdan Raducanu, Joost Van de Weijer

In this paper, we investigate the continual learning of Vision Transformers (ViT) for the challenging exemplar-free scenario, with special focus on how to efficiently distill the knowledge of its crucial self-attention mechanism (SAM).

Continual Learning

Graph Kernel Neural Networks

no code implementations14 Dec 2021 Luca Cosmo, Giorgia Minello, Michael Bronstein, Emanuele Rodolà, Luca Rossi, Andrea Torsello

The convolution operator at the core of many modern neural architectures can effectively be seen as performing a dot product between an input matrix and a filter.

Graph Classification

Smaller Is Better: An Analysis of Instance Quantity/Quality Trade-off in Rehearsal-based Continual Learning

no code implementations28 May 2021 Francesco Pelosin, Andrea Torsello

The design of machines and algorithms capable of learning in a dynamically changing environment has become an increasingly topical problem with the increase of the size and heterogeneity of data available to learning systems.

Continual Learning Dimensionality Reduction

Parameter-Free Lens Distortion Calibration of Central Cameras

no code implementations ICCV 2017 Filippo Bergamasco, Luca Cosmo, Andrea Gasparetto, Andrea Albarelli, Andrea Torsello

At the core of many Computer Vision applications stands the need to define a mathematical model describing the imaging process.

Partial Functional Correspondence

1 code implementation17 Jun 2015 Emanuele Rodolà, Luca Cosmo, Michael M. Bronstein, Andrea Torsello, Daniel Cremers

In this paper, we propose a method for computing partial functional correspondence between non-rigid shapes.

A Statistical Model of Riemannian Metric Variation for Deformable Shape Analysis

no code implementations CVPR 2015 Andrea Gasparetto, Andrea Torsello

The analysis of deformable 3D shape is often cast in terms of the shape's intrinsic geometry due to its invariance to a wide range of non-rigid deformations.

Retrieval

Adopting an Unconstrained Ray Model in Light-Field Cameras for 3D Shape Reconstruction

no code implementations CVPR 2015 Filippo Bergamasco, Andrea Albarelli, Luca Cosmo, Andrea Torsello, Emanuele Rodola, Daniel Cremers

This results in several drawbacks, ranging from the difficulties in feature detection, due to the reduced size of each microlens, to the need to adopt a model with a relatively small number of parameters.

3D Reconstruction 3D Shape Reconstruction

Can a Fully Unconstrained Imaging Model Be Applied Effectively to Central Cameras?

no code implementations CVPR 2013 Filippo Bergamasco, Andrea Albarelli, Emanuele Rodola, Andrea Torsello

Traditional camera models are often the result of a compromise between the ability to account for non-linearities in the image formation model and the need for a feasible number of degrees of freedom in the estimation process.

Cannot find the paper you are looking for? You can Submit a new open access paper.