Efficient regularization of functional map computations

In this talk, I will give a brief overview of the functional map framework and then describe some recent approaches that allow to incorporate both geometric and topological constraints into functional map computations. Namely, I will discuss a method to obtain functional maps that follow structural properties of pointwise correspondences, ways to encode embedding-dependent (second fundamental form) information and finally a technique to efficiently compute bi-directional correspondences using functional map adjoints.