Geometric Deep Learning for Shape Analysis

dc.contributor.authorBoscaini, Davide
dc.date.accessioned2017-12-15T17:55:08Z
dc.date.available2017-12-15T17:55:08Z
dc.date.issued2017-08-16
dc.description.abstractThe 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.en_US
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/2631996
dc.language.isoenen_US
dc.publisherUniversità della Svizzera italianaen_US
dc.subjectGeometric Deep Learningen_US
dc.subjectShape Analysisen_US
dc.subjectLocal shape descriptorsen_US
dc.subjectShape correspondenceen_US
dc.subjectShape retrievalen_US
dc.titleGeometric Deep Learning for Shape Analysisen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
thesis_Boscaini.pdf
Size:
90.66 MB
Format:
Adobe Portable Document Format
Description:
Collections