Geometric Deep Learning for Shape Analysis
View/ Open
Date
2017-08-16Author
Boscaini, Davide
Item/paper (currently) not available via TIB Hannover.
Metadata
Show full item recordAbstract
The past decade in computer vision research has witnessed the re-emergence of artificial neural networks (ANN), and in particular convolutional neural net- work (CNN) techniques, allowing to learn powerful feature representations from large collections of data. Nowadays these techniques are better known under the umbrella term deep learning and have achieved a breakthrough in perfor- mance in a wide range of image analysis applications such as image classification, segmentation, and annotation.
Nevertheless, when attempting to apply deep learning paradigms to 3D shapes one has to face fundamental differences between images and geometric objects. The main difference between images and 3D shapes is the non-Euclidean nature of the latter. This implies that basic operations, such as linear combination or convolution, that are taken for granted in the Euclidean case, are not even well defined on non-Euclidean domains. This happens to be the major obstacle that so far has precluded the successful application of deep learning methods on non-Euclidean geometric data.
The goal of this thesis is to overcome this obstacle by extending deep learning tecniques (including, but not limiting to CNNs) to non-Euclidean domains. We present different approaches providing such extension and test their effectiveness in the context of shape similarity and correspondence applications. The proposed approaches are evaluated on several challenging experiments, achieving state-of- the-art results significantly outperforming other methods.
To the best of our knowledge, this thesis presents different original contributions. First, this work pioneers the generalization of CNNs to discrete manifolds. Second, it provides an alternative formulation of the spectral convolution operation in terms of the windowed Fourier transform to overcome the drawbacks of the Fourier one. Third, it introduces a spatial domain formulation of convolution operation using patch operators and several ways of their construction (geodesic, anisotropic diffusion, mixture of Gaussians). Fourth, at the moment of publication the proposed approaches achieved state-of-the-art results in different computer graphics and vision applications such as shape descriptors and correspondence.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Efficient Interpolation of Articulated Shapes Using Mixed Shape Spaces
Marras, S.; Cashman, T. J.; Hormann, K. (The Eurographics Association and Blackwell Publishing Ltd., 2013)Interpolation between compatible triangle meshes that represent different poses of some object is a fundamental operation in geometry processing. A common approach is to consider the static input shapes as points in a ... -
Algorithms for 3D Isometric Shape Correspondence - Algorithms for 3D Isometric Shape Correspondence
Sahillioglu, Yusuf (Sahillioglu, 2012-08-01)There are many pairs of objects in the digital world that need to be related before performing any comparison, transfer, or analysis in between. The shape correspondence algorithms essentially address this problem by taking ... -
Bringing the Semantics into Digital Shapes: the AIM@SHAPE Approach
Falcidieno, Bianca (The Eurographics Association, 2007)This presentation describes the main objectives and achievements of the European Network of Excellence AIM@SHAPE. This NoE is aimed to advance research in the direction of semantic-based shape representations and tools ...