Spectral shape analysis


Spectral shape analysis relies on the spectrum of the Laplace–Beltrami operator to compare and analyze geometric shapes. Since the spectrum of the Laplace–Beltrami operator is invariant under isometries, it is well suited for the analysis or retrieval of non-rigid shapes, i.e. bendable objects such as humans, animals, plants, etc.

Laplace

The Laplace–Beltrami operator is involved in many important differential equations, such as the heat equation and the wave equation. It can be defined on a Riemannian manifold as the divergence of the gradient of a real-valued function f:
Its spectral components can be computed by solving the Helmholtz equation :
The solutions are the eigenfunctions and corresponding eigenvalues, representing a diverging sequence of positive real numbers. The first eigenvalue is zero for closed domains or when using the Neumann boundary condition. For some shapes, the spectrum can be computed analytically. For the sphere, for example, the eigenfunctions are the spherical harmonics.
The most important properties of the eigenvalues and eigenfunctions are that they are isometry invariants. In other words, if the shape is not stretched, the spectral values will not change. Bendable objects, like animals, plants and humans, can move into different body postures with only minimal stretching at the joints. The resulting shapes are called near-isometric and can be compared using spectral shape analysis.

Discretizations

Geometric shapes are often represented as 2D curved surfaces, 2D surface meshes or 3D solid objects. The Helmholtz equation can be solved for all these cases. If a boundary exists, e.g. a square, or the volume of any 3D geometric shape, boundary conditions need to be specified.
Several discretizations of the Laplace operator exist for the different types of geometry representations. Many of these operators do not approximate well the underlying continuous operator.

Spectral shape descriptors

ShapeDNA and its variants

The ShapeDNA is one of the first spectral shape descriptors. It is the normalized beginning sequence of the eigenvalues of the Laplace–Beltrami operator. Its main advantages are the simple representation and comparison, scale invariance, and in spite of its simplicity a very good performance for shape retrieval of non-rigid shapes.
Competitors of shapeDNA include singular values of Geodesic Distance Matrix and Reduced BiHarmonic Distance Matrix.
However, the eigenvalues are global descriptors, therefore the shapeDNA and other global spectral descriptors cannot be used for local or partial shape analysis.

Global point signature (GPS)

The global point signature at a point is a vector of scaled eigenfunctions of the Laplace–Beltrami operator computed at . The GPS is a global feature in the sense that it cannot be used for partial shape matching.

Heat kernel signature (HKS)

The heat kernel signature makes use of the eigen-decomposition of the heat kernel:
For each point on the surface the diagonal of the heat kernel is sampled at specific time values and yields a local signature that can also be used for partial matching or symmetry detection.

Wave kernel signature (WKS)

The WKS follows a similar idea to the HKS, replacing the heat equation with the Schrödinger wave equation.

Improved wave kernel signature (IWKS)

The IWKS improves the WKS for non-rigid shape retrieval by introducing a new scaling function to the eigenvalues and aggregating a new curvature term.

Spectral graph wavelet signature (SGWS)

SGWS is a local descriptor that is not only isometric invariant, but also compact, easy to compute and combines the advantages of both band-pass and low-pass filters. An important facet of SGWS is the ability to combine the advantages of WKS and HKS into a single signature, while allowing a multiresolution representation of shapes.

Spectral Matching

The spectral decomposition of the graph Laplacian associated with complex shapes provides eigenfunctions which are invariant to isometries. Each vertex on the shape could be uniquely represented with a combinations of the eigenmodal values at each point, sometimes called spectral coordinates:
Spectral matching consists of establishing the point correspondences by pairing vertices on different shapes that have the most similar spectral coordinates. Early work focused on sparse correspondences for stereoscopy. Computational efficiency now enables dense correspondences on full meshes, for instance between cortical surfaces. Spectral matching could also be used for complex non-rigid image registration, which is notably difficult when images have very large deformations. Such image registration methods based on spectral eigenmodal values indeed capture global shape characteristics, and contrast with conventional non-rigid image registration methods which are often based on local shape characteristics.