Search papers, labs, and topics across Lattice.
This paper introduces a novel adaptation of the attention mechanism specifically designed for triangle meshes, focusing on intrinsic and triangulation-agnostic properties. By redefining the attention components鈥攓ueries, keys, and values鈥攁s discretizations of continuous functions, the authors leverage standard finite element method (FEM) discretization to create an effective attention mechanism tailored for geometry-processing tasks. The proposed method achieves state-of-the-art performance across multiple benchmarks, outperforming existing mesh-based architectures and point cloud transformers in tasks such as high-frequency signal prediction and shape deformation analysis.
A simple yet powerful adaptation of attention for triangle meshes outperforms existing methods, achieving state-of-the-art results in geometry-processing tasks.
This work proposes an adaptation of the attention mechanism for triangle meshes. The core observation is that endowing the attention mechanism with critical properties for learning over meshes -- intrinsicality and triangulation-agnosticism -- enables it to attain state-of-the-art results over several learning-based tasks in geometry-processing. The above is achieved by modifying the attention mechanism from the bottom up based on simple principles from geometry-processing. Namely, the quantities used within attention -- queries, keys and values -- are created by an intrinsic, triangulation-agnostic network, and treated as discretizations of continuous functions. From that, we devise an appropriate attention mechanism that operates over triangle meshes through standard FEM discretization of the resulting integrals of the above functions. Surprisingly, as far as we know, this straightforward approach has not been utilized for learning over meshes. Experiments show our method exceeds current state of the art, including both mesh-based architectures as well as point cloud transformers. Namely, we show significant improvements on several common benchmarks and tasks -- predicting canonical high-frequency signals; predicting deformations; computing dense correspondences, both between full shapes and partial ones; and predicting feature descriptors.