Next Article in Journal
Prediction of Shale Gas Well Productivity Based on a Cuckoo-Optimized Neural Network
Previous Article in Journal
A Unique Bifuzzy Manufacturing Service Composition Model Using an Extended Teaching-Learning-Based Optimization Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

AFSMWD: A Descriptor Flexibly Encoding Multiscale and Oriented Shape Features

1
School of Mathematics and Statistics, Hunan First Normal University, Changsha 410205, China
2
Institute of Engineering Modeling and Scientific Computing, Central South University, Changsha 410083, China
3
School of Mechanical and Electrical Engineering, Changsha Institute of Technology, Changsha 410004, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(18), 2946; https://doi.org/10.3390/math12182946
Submission received: 17 August 2024 / Revised: 12 September 2024 / Accepted: 18 September 2024 / Published: 22 September 2024

Abstract

:
Shape descriptors are extensively used in shape analysis tasks such as shape correspondence, segmentation and retrieval, just to name a few. Their performances significantly determine the efficiency and effectiveness of subsequent applications. For this problem, we propose a novel powerful descriptor called Anisotropic Fractional Spectral Manifold Wavelet Descriptor (AFSMWD), built upon an extended manifold signal processing tool named Anisotropic Fractional Spectral Manifold Wavelet (AFSMW), which is also presented for the first time in this paper. The novelty of AFSMW is integrating the fractional theory into the common anisotropic spectral manifold wavelet. Compared to the existing wavelets, it provides one more new parameter, namely, the fractional order, to balance or enhance the transform coefficients among different shape vertices, enabling more flexible local shape analysis and more hidden shape structural information explored. Due to the advantages of this added parameter and the capability of analyzing shape features from multiple scales and orientations, the AFSMW allows us to construct the powerful descriptor AFSMWD just using the AFSMW transform coefficients of a very simple function. The proposed descriptor appears to be especially localizable, discriminative, and robust to noises. Extensive experiments have demonstrated that our descriptor has outperformed the state-of-the-art descriptors, nearly achieving 22% improvements to the most related work ASMWD and 69% to the recent popular work WEDS on the FAUST dataset. Its superiorities are also announced in some challenging occasions such as shapes with large deformation or topological partiality.

1. Introduction

Building shape descriptors is a fundamental problem in the field of 3D computer vision and computer graphics. It aims to construct a vector for each shape point that can informatively describe the shape’s local geometric properties. This task has countless downstream applications such as shape correspondence, labeling, segmentation, and retrieval, among others, and the qualities would greatly affect the efficiency and effectiveness of those applications.
Over the past few years, many researchers have devoted themselves to providing efficient and robust point descriptors [1]. Among them, the spectral descriptors [2,3,4], namely, the descriptors built upon the eigenvalues (spectrum) and the eigenfunctions of the Laplace–Beltrami Operator (LBO), have achieved especially outstanding successes. They obtain many appealing properties such as invariance under shape isometric deformation, high efficiency, and noise robustness. If treated from another more in-depth viewpoint, as the eigenvalues and the eigenfunctions of the LBO, respectively, work as the frequencies and Fourier bases for signals defined on manifolds [5], the construction of major spectral descriptors can be uniformed to use harmonic analysis tools to perform certain signal processing. For instance, the famous spectral descriptors Heat Kernel Signature (HKS) [2] and Wave Kernel Signatur (WKS) [3] are based on signal filtering using either only low-frequency or band-frequency filters, while the approach [6] integrates the Windowed Fourier Transform for learning shape descriptors. Apparently, the choice of the manifold signal processing tools plays a significantly important role in their construction. Among plenty of such existing tools, the Spectral Graph Wavelet (SGW) and the Transform (SGWT) [7] show the most notable superiorities in analyzing shape information, allowing to extract multiscale shape features using both a variety of low-pass and band-pass frequency filters. Compared to the other tools, it permits to derive more desirable descriptors like the wavelet energy decomposition signature (WEDS) [4]. Moreover, by integrating oriented filters into the SGWT, ref. [8] improves the SGW’s ability to extract shape features further. They introduce direction-sensitive wavelets, i.e., the anisotropic spectral manifold wavelet (ASMW) and transform (ASMWT), enabling a comprehensive analysis of shape features from multiple local diffusion directions via several different oriented wavelets. Based on this improved wavelet tool, the Anisotropic Spectral Manifold Wavelet Descriptor (ASMWD) [8] and the Anisotropic Wavelet Energy Decomposition Descriptor (AWEDD) [9] were proposed, both showing outstanding discriminativity and the ability of intrinsic symmetry identification. Motivated by these developments in the literature, we believe that the descriptor performance could be improved further if more powerful manifold signal processing tools are introduced into the shape analysis field.
In this paper, we propose the Anisotropic Fractional Spectral Manifold Wavelet (AFSMW) and transform for shape analysis, and what is more, using this tool, we provide a novel discriminative and robust shape descriptor called Anisotropic Fractional Spectral Manifold Wavelet Descriptor (AFSMWD). The core idea is integrating the fractional order theory into the spectral manifold wavelets. As provided with one more hyperparameter, namely, the fractional order θ to control the rotation angle of the transform in the vertex-frequency plan, the wavelet is able to search for the optimal expression domain not only along the dimension of scale but also along the fractional order dimension. Therefore, it provides a larger expression space and is more likely to obtain a better expressive domain for the original problem. Meanwhile, to address the drawback of common wavelets being insensitive to the local diffusion direction of shapes, which generally is a vital factor in building informative and intrinsic-symmetry disambiguated descriptors, we build our fractional wavelets based on the eigensystem of the fractional anisotropic LBO, which is also an extension of the anisotropic LBO [10]. This means that various local diffusion directions in the underlying shape can be integrated into the wavelet transform just by tuning two added parameters, which respectively control the anisotropic degree and the orientations of the wavelets. Finally, based on the coefficients resulting from performing a series of AFSMW transforms with different shapes and orientations on a simple function, i.e., the Delta function, we propose our new descriptor named AFSMWD.
We summarize our main contributions as follows:
  • We propose the AFSMW and transform, which is an extended wavelet that allows us to perform multiscale wavelet transform from various directions around each shape point, even with different rotation angles in the vertex-frequency plan. The fractional order contributes to enhancing the transform coefficients among different shape vertices and revealing more hidden shape features, making the state-of-the-art manifold wavelet ASMW [8] just act our one special case.
  • We propose a powerful descriptor, AFSMWD, which is verified to be more discriminative and localized than existing descriptors while maintaining lots of desirable properties such as isometric deformation invariance and robustness to shape noises.
  • Extensive experiments to evaluate the proposed descriptor are conducted. The results demonstrate that the AFSMWD outperforms state-of-the-art descriptors in shape-matching tasks. It achieves significant improvements in benchmark performance.

2. Related Work

Extensive efforts have been devoted to designing descriptors for several different shape analysis tasks. Readers can refer to a recent survey [1] for a more comprehensive understanding. Meanwhile, harmonic analysis tools, especially wavelets on graphs or manifolds, have also developed rapidly. In the following, we will review the most related works.
Shape descriptors. Spatial approaches. Early spatial domain-based descriptors are typically developed using histograms, such as integral volume descriptors [11], shape distributions [12], and multiscale local features [13]. The Signature of Histograms of Orientations (SHOT) [14] is designed by aggregating the normal angles from key points and their neighboring points. Subsequent efforts focused on constructing descriptors that are invariant to non-rigid deformations. For instance, ref. [15] proposed a new method for constructing a local reference frame (LRF) by calculating the intrinsic gradient of a scalar field on the input shape. Geodesic distance descriptors (GDDs) [16] relied on the geodesic distance basis to derive features. Nevertheless, they are highly dependent on local information and particularly sensitive to surface discretization.
Spectral approaches. Spectral descriptors have gained considerable attention recently due to their invariance to non-rigid deformations. The HKS [2] and WKS [3] were introduced, drawing inspiration from well-known physical phenomena such as heat diffusion and quantum particle evolution on surfaces. To better capture local shape characteristics, a descriptor based on the Windowed Fourier Transform (WFT) [6] was later developed. Following this, researchers introduced the Spectral Graph Wavelet Descriptor (SGWD) [17], leveraging Spectral Graph Wavelets [7] known for their multiscale and localized support, which significantly enhanced the descriptor’s discriminative power. More recently, Wang et al. [18] employed Spectral Graph Wavelets to decompose the Dirichlet energy of vertex coordinate functions, resulting in the local descriptor WEDS. The Average Mixing Kernel Signature (AMKS) [19] was derived from a quantum exploration process over the shape’s surface. A similar approach to WKS was applied to shape difference operators instead of the LBO, yielding the innovative DWKS [20]. Additionally, the Improved Biharmonic Kernel Signature (IBKS) [21] builds on the biharmonic kernel signature, maintaining beneficial properties like robustness to isometries and stability in joint regions of the shape. Lastly, the Average Increment Scale-Invariant Heat Kernel Signature (AISIHKS) [22] was designed to extract both geometric and topological features by calculating the average increment of the heat kernel across all time parameters.
While the aforementioned spectral descriptors have achieved notable success, they are based on the isotropic LBO, making them insensitive to directional information and incapable of capturing intrinsic shape symmetries. To address these limitations, researchers have focused on developing anisotropic spectral descriptors. Mathieu et al. [10] introduced the Anisotropic Laplace–Beltrami Operator (ALBO), which adjusts diffusion rates along the principal curvature directions. This innovation paved the way for a range of related works, including the Anisotropic Heat Kernel Signature (AHKS) and a descriptor built on anisotropic windowed Fourier transformation (AWFT) [23]. More recently, Li et al. [8] extended the spectral manifold wavelet framework [7] to an anisotropic setting, resulting in the creation of the ASMWD descriptor. Following this, ref. [9] applied the anisotropic spectral manifold wavelet to analyze Dirichlet energy in point coordinate functions, introducing the AWEDD descriptor. In contrast to these methods, our work expands on the more robust fractional spectral manifold wavelets by incorporating anisotropy, yielding the new AFSMWD descriptor, which demonstrates superior performance.
Deep learning approaches. With the rapid development of machine learning, lots of efforts have been made to optimize descriptors through deep learning techniques. A comprehensive understanding can be found in the survey [24]. Representative works include Optimal Spectral Descriptors (OSDs) [25] and the Anisotropic Diffusion Descriptor (ADD) [26], just to name a few. Some researchers tried to construct Convolutional Neural Networks to improve the performances of handcrafted descriptors, like Anisotropic Chebyshev Spectral CNN (ACSCNN) [27], the learned WEDS [4], the hybrid fusion network (HFN) [28], the AWEDD [9], etc. Despite the significant success of learning-based methods, they require a substantial amount of labeled data for training, which is both challenging and time intensive to obtain. Moreover, the outcomes are highly dependent on the quality of the input handcrafted descriptors. In this paper, we focus on developing a high-quality handcrafted descriptor designed to enhance the performance of both traditional handcrafted techniques and learning-based models.
Spectral harmonic analysis on manifolds. Since the eigenvalues and the eigenfunctions of the LBO, respectively, act as the frequencies and Fourier bases for signals defined on graphs or manifolds, plenty of classical signal processing tools were allowed to be extended on graphs or manifolds in recent years, such as Fourier transform [29], windowed Fourier transform [30], and Spectral Graph Wavelet Transform [7], just to name a few. On the other hand, some researchers have also devoted themselves to introducing the fractional theory into graph signal processing. Wang et al. [31,32] proposed a definition of fractional Fourier transform on graphs named graph fractional Fourier transform (GFRFT), which was based on algebraic signal processing theory. Moreover, the windowed fractional Fourier transforms on graphs were proposed in [33] to improve the GFRFT’s locality of the vertex frequency. However, GFRFT is a global transform and does not provide useful localization properties in the fractional graph domain, preventing multiresolution analysis for graph signals. Therefore, based on the spectral theory [34], Wu et al. [35] proposed the Fractional Spectral Graph Wavelets (FSGWs) to cover the shortage of GFRFT. The formerly mentioned tools can be easily generalized to analyze the signals defined on shapes (manifolds) by just replacing the graph Laplacian operator with LBO. However, only using this simple generation is still not able to produce suitable tools with sufficient geometric meaning to analyze the signals on shapes, as they are all isometric and insensitive to oriented shape features. In order to capture the shape structural information with several different diffusion directions, researchers further introduce the anisotropic FT, windowed FT [23] and wavelets [8] based on the ALBO [10]. In this work, we integrate the fractional order theory into the anisotropic manifold wavelets, which improves the abilities of the wavelets to extract shape features further.

3. Aisotropic Fractional Spectral Manifold Wavelet

In this section, we first introduce the Anisotropic Fractional Laplace–Beltrami Operator, then utilizing the eigensystems of this novel operator, we propose the Aisotropic Fractional Spectral Manifold wavelet and corresponding wavelet transforms. They are the foundation of constructing our descriptor AFSMWD.

3.1. Aisotropic Fractional Laplace–Beltrami Operator

In order to improve the shortage of the common LBO that is isometric and thus insensitive to oriented shape structural information, the researchers proposed the ALBO, which could flexibly control the local diffusion directions [10,26]. We first briefly describe this method, and then based on it, build our Aisotropic Fractional Laplace–Beltrami Operator (AFLBO).
Given a function f ( x ) defined on the manifold M , the tangent vectors at each point x are expressed with respect to the orthogonal basis formed by the principal curvature directions. Suppose the matrix R θ denotes a rotation around the normal by an angle θ relative to the principal curvature direction, where the origin is fixed by using the principal curvature direction in the tangent plane at point x (e.g., the direction of maximum principal curvature) as a reference. The ALBO is then defined as follows:
Δ α θ f ( x ) = div ( R θ D α ( x ) R θ T X f ( x ) ) ,
where the thermal conductivity tensor is defined as D α ( x ) = diag 1 1 + α , 1 , which governs diffusion along the direction of maximum principal curvature. The parameter α controls the level of anisotropy in the process. The ALBO not only preserves the advantageous properties of the standard LBO but also introduces variations across multiple orientations, leading to a diffusion process that is both more intuitive and semantically meaningful.
In the discrete setting, we mainly concentrate on triangular meshes here, while the issues on other shape representations can be deduced similarly. Given a triangular mesh M containing N vertices, a function f defined on it is now represented as a vector f R N . If provided with values of the anisotropic level α and the rotation angle θ , the discrete ALBO of the mesh M can be represented as a sparse matrix L α θ = A 1 B α θ R N × N , where A = diag ( a 1 , , a N ) is the mass matrix, with a i denoting the local area element of the vertex i. Due to limited space here, detailed computation about the stiffness matrix B α θ R N × N is referred to the work [26]. We now compute the eigendecomposition of matrix L α θ by solving the following generalized eigenproblem
B α θ ϕ α θ , k = λ α θ , k A ϕ α θ , k , ϕ α θ , k R N .
As the eigenvectors { ϕ α θ , k } k = 0 N 1 are A-orthogonal, the inner product of two functions f and g is computed as f , g A = f T Ag . Note that the ALBO matrix L α θ is semi-definite positive. Therefore, it has non-negative and ordered eigenvalues { λ α θ , k } k 0 and a cluster of A -orthogonal eigenvectors { ϕ α θ , k } k 0 . Store the eigenvectors { ϕ α θ , k } k = 0 N 1 as columns of the matrix
U α θ = [ ϕ α θ , 0 , ϕ α θ , 1 , , ϕ α θ , N 1 ] R N × N ,
and the eigenvalues { λ α θ , k } k = 0 N 1 as a diagonal maxtrix
Λ α θ = diag ( λ α θ , 0 , λ α θ , 1 , , λ α θ , N 1 ) .
With these notations, the anisotropic Laplacian matrix could be represented as L α θ = U α θ Λ α θ U α θ T A . Accordingly, the anisotropic Fourier coefficient vector of the signal f is computed as f ^ = U α θ T A f .
Now, we extend this operator to be more flexible and powerful. Given a fractional order 0 < s 1 , we define the Anisotropic Fractional Laplace–Beltrami Operator (AFLBO). For this purpose, we first compute the fractional order of the eigenvector matrix, namely,
U α θ s = ( U α θ ) s = [ u α θ , 0 s , u α θ , 1 s , , u α θ , N 1 s ] .
Meanwhile, we also compute the fractional order of the eigenvalue matrix, which is obtained by
Λ α θ s = ( Λ α θ ) s = diag ( λ α θ , 0 s , λ α θ , 1 s , , λ α θ , N 1 s ) , where λ α θ , k s = ( λ α θ , k ) s .
Finally, the AFLBO is defined as
L α θ s = U α θ s Λ α θ s ( U α θ s ) T A .
Obviously, when s = 1 , the AFLBO becomes the common ALBO. For other values of s, we can compute U α θ s by using the Schur–Pad’ algorithm [36]. Note that, however, in practice, we generally truncate the first K N eigenvalues, especially in the shape analysis domain where shapes usually have thousands of vertices. Under such circumstances, the Schur–Pad’ algorithm will fail, as it only could process square matrices. Therefore, we can instead compute the SVD decomposition of U α θ , having U α θ = P Σ V , where P and V are both unitary matrices. Then, compute the fractional order of the eigenvector matrix as U α θ s = P Σ s V .

3.2. Anisotropic Fractional Spectral Manifold Wavelet and Transform

Based on the proposed AFLBO, we extend the wavelet and introduce the Anisotropic Fractional Spectral Manifold Wavelet and Transform, which have notable advantages for shape analysis.
Before that, we should first extend the corresponding Fourier transform as it generally acts as the basis for other more sophisticated signal processing tools. Due to the eigenvalues and the eigenvectors of the AFLBO obtaining harmonic properties, the inner product of f and each eigenvector u α θ , k s can be treated as an anisotropic fractional spectral manifold Fourier coefficient (transform) and play the role of frequency for signals (functions), i.e.,
f ^ α θ , k s = f , u α θ , k s A = ( u α θ , k s ) T A f .
Let f ^ = ( f ^ α θ , k s ) denote the Fourier coefficient vector, and we can similarly define the inverse anisotropic fractional spectral manifold Fourier transform
f = U α θ s f ^ .
In the next section, we will propose our anisotropic fractional spectral manifold wavelets, which have lots of attractive geometrical properties.
Wavelets functions. Given a fractional order s, an anisotropic degree α , and a rotational angle θ , we let a real-valued kernel function g ( · ) act as a band-pass filter. Then, we give the definition of the anisotropic fractional wavelet function with scale t and located at vertex v on the mesh M as
ψ α θ , t v s ( · ) = k = 0 K 1 a ( v ) g ( t λ α θ , k s ) u α θ , k s ( v ) u α θ , k s ( · ) .
In addition, in order to capture the low-frequency signal information, a scaling function at the point v is obtained by given a low-pass filter h ( · ) in the spectral domain, namely,
ξ α θ , v s ( · ) = k = 0 K 1 a ( v ) h ( λ α θ , k s ) u α θ , k s ( v ) u α θ , k s ( · ) ,
where a ( v ) is the Voronoi area of the vertex v.
As shown in Figure 1, we give the visualization of various anisotropic wavelets centered at the same point on the shape with different parameters, including the fractional order s, the anisotropic degree α , the rotational angle θ , and the scale t.
Wavelet transform. Similar to a classical spectral graph wavelet, our Anisotropic Fractional Spectral Manifold Wavelet Transform (ASMWT) is also obtained by the inner product of signal f R N × 1 and the wavelet function ψ α , θ , t , v s with regard to the mass matrix A , i.e., the wavelet coefficient is given as
W f s ( α , θ , t , v ) = < f , ψ α θ , t v s > A = k = 0 K 1 a ( v ) g ( t λ α θ , k s ) f ^ α θ , k s u α θ , k s ( v ) ,
Likewise, the corresponding scale function coefficient can be computed by
S f s ( α , θ , v ) = < f , ξ α θ , v s > A = k = 0 K 1 a ( v ) h ( λ α θ , k s ) f ^ α θ , k s u α θ , k s ( v ) .
Note that in practical application, the parameters t and θ need to be discretized to a finite number of values. For briefness, we denote all wavelet kernel functions with discretized scales together by
g t j λ α θ , k s = h ( λ α θ , k s ) j = 0 , g t j λ α θ , k s j > 0 .
This wavelet transform allows capturing multiscale and multidirectional signal information in the neighborhood of the wavelet’s located point.

4. Anisotropic Fractional Spectral Manifold Wavelet Descriptor

As discussed above, the AFSMWT can analyze signals from various diffusion directions on the shape and encode different sizes of neighborhood features. Therefore, we are permitted to build a powerful shape descriptor just utilizing the wavelet coefficients of a special signal. We choose the delta function, a very simple function, to generate our AFSMW descriptor (AFSMWD) instead of using a series of complex geometry vectors in [23,26].
For each point v on the shape M , the Delta function centered at that point is denoted as δ v . To describe the multiscale local shape context around this point, we first set an appropriate value for the anisotropy degree α . Next, we use L equally spaced rotation angles, denoted as θ = θ 1 , θ 2 , , θ L , where θ l = 2 ( l 1 ) π / L for l = 1 , 2 , , L . To capture information from different neighboring vertices around point v, we employ a series of fractional orders { s i } i = 1 I , where each s i is uniformly distributed within the interval [ 0 , 1 ] . Additionally, the scale parameter t is sampled into J different scales, represented as t 1 , t 2 , , t J , to encode multiscale geometric features along each local orientation defined by θ l . With this setup, we compute the AFSMWT coefficients across J scales along with the corresponding scaling function coefficients. Finally, by combining all these coefficients, we define a ( J + 1 ) -dimensional vector as
d α θ l , v s i = S δ v s i ( α θ l , v ) , W δ v s i ( α θ l , t 1 v ) , , W δ v s i ( α θ l , t J v ) .
This vector effectively encodes the local shape characteristics around point v along the diffusion direction θ l , utilizing the AFSMW with fractional order s i .
Considering the overall information from all fractional orders along this direction θ l , we further combine each d α θ l , v s i and obtain a I ( J + 1 ) dimensional row vector
d α θ l , v = d α θ l , v s 1 , d α θ l , v s 2 , , d α θ l , v s I .
Note that in some specific applications, we can also use multiple anisotropic degrees. However, in our current work, we find using a single α is sufficient to construct a discriminative descriptor, as demonstrated in Section 5. Finally, we build our AFSMW for point v as follows
d v = d α θ 1 , v , d α θ 2 , v , , d α θ L , v .
Let us now explain how to practically compute the AFSMWD. The kth fractional anisotropic Fourier coefficient of the delta function δ v is given by δ ^ α θ s ( k ) = δ v , u α θ , k s M = u α θ , k s ( v ) . Using Equations (9) and (10), we can deduce that each component of the descriptor can be expressed as
W δ v s ( α θ , t v ) = δ v , ψ α θ , t v s A = k 0 g ( t λ α θ , k s ) ( ϕ α θ , k s ( v ) ) 2 ,
S δ v s ( α θ , v ) = δ v , ξ α θ , v s A = k 0 h ( λ α θ , k s ) ( ϕ α θ , k s ( v ) ) 2 .
The choice of the kernels significantly impacts the performance of the descriptor. GSP toolbox [37] provides several commonly used wavelet generating kernels such as cubic spline and Mexican hat kernel [38]. However, we still prefer to use the Meyer kernel, as it obtains many attractive characteristics. It can form a Parseval frame thus allowing the generated wavelets to hold energy conservation between the original and transformed domain, leading to easier and more accurate signal reconstruction [39]. In addition, it has a self-adaptive bandwidth, which is more suitable for analyzing signals. All of these advantages make its generated wavelet coefficients contain more useful information and thus contribute to formulating a more discriminative descriptor than other kernels. The overall computation of our AFSMWD can be found in Algorithm 1.
Algorithm 1: AFSMWD Computation
Input: The mesh M with N vertices, the parameters α , I , L , K , J
Output: AFSMWD
for  l = 1 : L  do
      According to [26], calculate the ALBO:  L α θ l = A 1 B α θ l ;
      Solve the generalized eigenproblem:
                              B α θ l ϕ α θ l , k = λ α θ l , k A ϕ α θ l , k
      to obtain the first K eigenvectors { ϕ α θ l , k } k = 1 K and eigenvalues { λ α θ l , k } k = 1 K ;
      for  i = 1 : I  do
      Compute { u α θ l , k s i } k = 1 K and { λ α θ l , k s i } k = 1 K using Equations (2) and (3);
      Select the Meyer wavelet generating kernel functions h ( λ α θ l s i ) and g ( λ α θ l s i ) by utilizing the GSP-toolbox [37];
      Compute S δ v s i ( α θ l , v ) using Equation (15);
            for  j = 1 : J  do
            According to Equation (14), compute W δ v s i ( α θ l , t j v ) ;
            end
             d α θ l , v s i = ( S δ v s i ( α θ l , v ) , W δ v s i ( α θ l , t 1 v ) , , W δ v s i ( α θ l , t J v ) ) ;
      end
       d α θ l , v = d α θ l , v s 1 , d α θ l , v s 2 , , d α θ l , v s I ;
end
AFSMWD of point v, i.e., d v = ( d α θ 1 , v , d α θ 2 , v , , d α θ L , v ) .

5. Experimental Results

We adopt the generally used strategy to evaluate the descriptor performances including the discriminative and localized abilities and the robustness, which is measured by the quality of shape dense pointwise correspondence established via just using nearest neighbor searching in the descriptor space.

5.1. Implementation Details

Datasets. To assess the performance of the proposed descriptor, we intend to evaluate its matching results on several publicly available datasets, ranging from standard to more challenging ones. These datasets encompass a wide range of categories, including 3D human shapes as well as animal models. Some datasets introduce additional complexities, such as topological noise, which pose significant challenges for descriptors. We roughly classify them into the following benchmarks.
Near-isometric matching benchmark. This benchmark includes five datasets: FAUST [40], its remeshed version [41], SCAPE [42], its remeshed version [41], and the remeshed TOSCA [43]. The remeshed versions are more realistic but present greater challenges due to incompatible mesh structures. Both FAUST and its remeshed version feature 10 distinct human subjects, each in 10 different poses, totaling 100 models. SCAPE and its remeshed version consist of 72 poses of a single human subject, resulting in 72 models. The remeshed TOSCA dataset includes 76 models, comprising 11 cats, 9 dogs, 3 wolves, 8 horses, 6 centaurs, 4 gorillas, 1 female mannequin with 12 poses, and 2 male figures with 7 and 20 poses, respectively.
Non-isometric matching benchmark. This benchmark includes the SHREC’19 [44] and SMAL [45] datasets. SHREC’19 is composed of multiple datasets, such as FAUST, SCAPE, CAESAR [46], and SHREC14 [47], among others. Since the shapes in SHREC’19 are created using different modeling techniques and for various purposes, they exhibit diverse connectivity and poses. The presence of incomplete shapes and a large number of matching pairs further adds to the dataset’s complexity. The SMAL dataset consists of 49 four-legged animal shapes from eight species, representing families like Felidae, Canidae, Equidae, and Bovidae. The significant non-isometric deformations across species make this dataset particularly challenging for existing methods.
SHREC’16 Partiality benchmark [48]. This dataset contains nearly isometrically deformed shapes across eight classes, featuring two types of partiality: clean cuts and holes. Partial shapes often arise in real-world scenarios, where data acquisition from 3D sensors frequently leads to missing parts due to occlusions or limited views. This benchmark is crucial for evaluating the robustness of descriptors to partial missing settings.
Evaluation methodology. Further, we use correspondence quality characteristics (CQC) curves [49] and average geodesic error (AGE) to evaluate matching performance. To be specific, assuming the point x on shape X is matched with the point y on shape Y , while its ground-truth correspondence point is actually y * on Y , then the matching error is computed as the geodesic error e ( x ) = d Y ( y , y * ) / diam ( Y ) , where the geodesic distance between points y and y * is normalized by the diameter of shape Y . CQC curves exhibit the percentage of matches that are at most r in geodesic error. Moreover, the AGE is obtained by e = ( i = 1 N e ( x i ) ) / N ; here, N is the number of vertices of shape X . Obviously, higher CQC curves and smaller AGE express more accurate matching results.
Parameter setting. We empirically set the values of five parameters in our Algorithm 1, partly referring to previous similar approaches like ASMWD [8]. In the following experiments, unless otherwise stated, we let the number of the fractional order I = 6 , the number of the first AFLBO’s eigenvalues K = 300 , the number of the discrete scales of wavelets J = 9 , the number of rotation angles L = 9 and the anisotropy degree α = 10 .

5.2. Descriptor Evaluation and Comparisons

In this section, we will comprehensively analyze our descriptor’s performance such as discriminative ability, robustness to noises, etc., and compare our AFSMWD with several state-of-the-art spectral descriptors, including HKS [2], WKS [3], AMKS [19], AWFT [23], LPS [50], ASMWD [8], and WEDS [18].
For an overview comparison, we first summarize all the matching AGEs of all the above-mentioned datasets in Table 1. The results clearly show our superiority to other spectral descriptors even in challenging cases. In addition, for a more comprehensive and in-depth understanding, we successively and detailedly discuss the result of each dataset in the following with more quantitative and qualitative measures.
Evaluation of Near-Isometric Shapes. First of all, we assess the performance of descriptors on the original FAUST and SCAPE datasets. The quantitative and qualitative results are presented in Figure 2. The results consistently demonstrate that AFSMWD is more discriminative compared to other state-of-the-art descriptors. Since the shapes in the original FAUST dataset possess identical numbers of vertices and connections, which is not practical for real-world applications, we next evaluate the descriptors on the remeshed datasets, which present much greater variability in terms of shape structures and connectivity. We randomly select 100 isometric shape pairs from the remeshed FAUST, 72 from the remeshed SCAPE, and 284 from the remeshed TOSCA. All methods in the comparison utilize the publicly available codes and settings provided by the respective authors. Figure 3 illustrates the CQC curves and AGEs for each descriptor. Clearly, AFSMWD produces the most accurate matching results across all three datasets, underscoring its superior discriminative power compared to other descriptors. It is worth mentioning that as a spectral descriptor, AFSMWD naturally retains invariance to isometric deformations.
Evaluation of Non-Isometric Shapes. The task of non-isometric shape matching is much more challenging than near-isometric shape matching due to the presence of larger deformations, thus putting higher requirements on descriptor performance. We use all 430 pairs provided by the SHREC’19 to evaluate the descriptor’s discrimination ability. The AGEs can be found in the corresponding column in Table 1, and the CQC curves are demonstrated in Figure 4. Despite the challenge posed by non-isometric shapes with substantial deformations or defects, AFSMWD still delivers exceptional performance.
In addition, we use 272 shape pairs of the SMAL dataset to evaluate the performance further. Particularly, to compare the performances of our AFSMWD and the most related work ASMWD [8], we only show their two CQC curves of the SMAL dataset in the left part of Figure 5, where the superior announces again the improvement of our extended fractional wavelets to common wavelets. Note that in the right part of Figure 5, we also show the visualized Euclidean distances of the descriptors between the reference points and the left points of the shapes from the SMAL dataset as well as all points on several other shapes from the same dataset. We can observe that the bluest colors representing the shortest distances appear in the most semantically similar shape areas and are highly centralized. These characteristics verify our descriptor’s outstanding discriminative and localizable abilities.
Evaluation on Partiality Shapes. To assess how well the proposed descriptor handles shapes with missing parts, we conduct tests on the SHREC’16 Partiality dataset [48], which includes shapes with significant cuts and holes. Generally speaking, spectral descriptors struggle with partial matching because (A)LBOs and their eigensystems are highly sensitive to missing geometry [51]. However, as shown in the final column of Table 1 and the partial matching outcomes in Figure 6, our AFSMWD achieves better performance than ASMWD, highlighting the strength of AFSMWD and the improvement of the existing wavelets.

6. Conclusions

In this work, we proposed a powerful local spectral descriptor AFSMWD for shape analysis tasks. For this goal, we extended the common Anisotropic Spectral Manifold Wavelet to be more flexible to extract local shape features, which was achieved by integrating the fractional theory into the manifold wavelets. As equipped with one more parameter to control the wavelet transform involving different shape vertices, the AFSMW could reveal more hidden features than all existing signal processing tools on manifolds. By resorting to this novel tool, we construct our descriptor AFSMWD just using this novel transform coefficient of a very simple function. The proposed descriptor is verified to be localizable, discriminative, and robust, and it has achieved state-of-the-art results even in some challenging occasions. We believe that our method will be a valuable contribution to the field of computer graphics and beyond.
Limitations. Our work recently can not work very well on the SHREC’16 Topology benchmark [52]. This dataset is also challenging since the topology of each shape in several regions has been changed to create a non-intersecting manifold surface. Under this circumstance, conflicts may be generated if the wavelets have unsuitable scales and shapes to extract each point’s neighborhood features, as the incorrect structural information is encoded also. More parameters involved conversely make the problem more complicated. We believe the performance can be promoted if more in-depth research is conducted on the relations of the parameters and their settings.

Author Contributions

Conceptualization, Methodology, Writing—original draft, L.H.; Methodology, Software, Visualization, H.W.; Investigation, Writing—review and editing, X.Y.; Software, H.X.; Conceptualization, Resources, Writing—review and editing, Supervision, Y.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the Key Project of Education Department of Hunan Province (No. 23A0641), the Changsha Natural Science Foundation (No. kq2402092), and the Excellent Youth Foundation of Changsha Scientific Committee (No. kq2306023).

Data Availability Statement

The computed data can be provided from the corresponding author on request.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Liu, S.; Wang, H.; Yan, D.M.; Li, Q.; Luo, F.; Teng, Z.; Liu, X. Spectral Descriptors for 3D Deformable Shape Matching: A Comparative Survey. IEEE Trans. Vis. Comput. Graph. 2024, 1–20. [Google Scholar] [CrossRef] [PubMed]
  2. Sun, J.; Ovsjanikov, M.; Guibas, L. A concise and provably informative multi-scale signature based on heat diffusion. Comput. Graph. Forum 2009, 28, 1383–1392. [Google Scholar] [CrossRef]
  3. Aubry, M.; Schlickewei, U.; Cremers, D. The wave kernel signature: A quantum mechanical approach to shape analysis. In Proceedings of the International Conference on Computer Vision, Barcelona, Spain, 6–13 November 2011; pp. 1626–1633. [Google Scholar]
  4. Wang, Y.; Ren, J.; Yan, D.M.; Guo, J.; Zhang, X.; Wonka, P. MGCN: Descriptor learning using multiscale GCNs. ACM Trans. Graph. 2020, 39, 122:1–122:15. [Google Scholar] [CrossRef]
  5. Levy, B. Laplace-beltrami eigenfunctions towards an algorithm that “understands” geometry. In Proceedings of the IEEE International Conference on Shape Modeling and Applications, Washington, DC, USA, 14–16 June 2006. [Google Scholar]
  6. Boscaini, D.; Masci, J.; Melzi, S.; Bronstein, M.M.; Castellani, U.; Vandergheynst, P. Learning class-specific descriptors for deformable shapes using localized spectral convolutional networks. Comput. Graph. Forum 2015, 34, 13–23. [Google Scholar] [CrossRef]
  7. Hammond, D.K.; Vandergheynst, P.; Gribonval, R. Wavelets on graphs via spectral graph theory. Appl. Comput. Harmon. Anal. 2011, 30, 129–150. [Google Scholar] [CrossRef]
  8. Li, Q.; Hu, L.; Liu, S.; Yang, D.; Liu, X. Anisotropic Spectral Manifold Wavelet Descriptor. Comput. Graph. Forum 2021, 40, 81–96. [Google Scholar] [CrossRef]
  9. Liu, S.; Luo, F.; Li, Q.; Liu, X.; Hu, L. AWEDD: A descriptor simultaneously encoding multiscale extrinsic and intrinsic shape features. Vis. Comput. 2024, 40, 2537–2554. [Google Scholar] [CrossRef]
  10. Andreux, M.; Rodola, E.; Aubry, M.; Cremers, D. Anisotropic Laplace-Beltrami operators for shape analysis. In Proceedings of the European Conference on Computer Vision, Zurich, Switzerland, 6–12 September 2014; Springer: Berlin, Germany, 2014; pp. 299–312. [Google Scholar]
  11. Manay, S.; Hong, B.W.; Yezzi, A.J.; Soatto, S. Integral invariant signatures. In Proceedings of the European Conference on Computer Vision, Prague, Czech Republic, 11–14 May 2004; Springer: Berlin, Germany, 2004; pp. 87–99. [Google Scholar]
  12. Osada, R.; Funkhouser, T.; Chazelle, B.; Dobkin, D. Shape distributions. Acm Trans. Graph. 2002, 21, 807–832. [Google Scholar] [CrossRef]
  13. Pauly, M.; Keiser, R.; Gross, M. Multi-scale feature extraction on point-sampled surfaces. Comput. Graph. Forum 2003, 22, 281–289. [Google Scholar] [CrossRef]
  14. Salti, S.; Tombari, F.; Di Stefano, L. SHOT: Unique signatures of histograms for surface and texture description. Comput. Vis. Image Underst. 2014, 125, 251–264. [Google Scholar] [CrossRef]
  15. Melzi, S.; Spezialetti, R.; Tombari, F.; Bronstein, M.M.; Stefano, L.D.; Rodola, E. Gframes: Gradient-based local reference frame for 3D shape matching. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Long Beach, CA, USA, 15–20 June 2019; pp. 4629–4638. [Google Scholar]
  16. Shamai, G.; Kimmel, R. Geodesic distance descriptors. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Honolulu, HI, USA, 21–26 July 2017; pp. 6410–6418. [Google Scholar]
  17. HU, L.; LI, Q.s.; LIU, S.j.; LIU, X.r. Spectral graph wavelet descriptor for three-dimensional shape matching. J. Zhejiang Univ. (Eng. Sci.) 2019, 53, 761–769. [Google Scholar]
  18. Wang, Y.; Guo, J.; Xiao, J.; Yan, D.M. A Wavelet Energy Decomposition Signature for Robust Non-Rigid Shape Matching. In SIGGRAPH Asia 2019 Posters; ACM: New York, NY, USA, 2019; pp. 1–2. [Google Scholar]
  19. Cosmo, L.; Minello, G.; Bronstein, M.; Rodolà, E.; Rossi, L.; Torsello, A. 3D Shape Analysis Through a Quantum Lens: The Average Mixing Kernel Signature. Int. J. Comput. Vis. 2022, 130, 1474–1493. [Google Scholar] [CrossRef]
  20. Magnet, R.; Ovsjanikov, M. Dwks: A local descriptor of deformations between meshes and point clouds. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Montreal, BC, Canada, 11–17 October 2021; pp. 3793–3802. [Google Scholar]
  21. Yan, Y.; Zhou, M.; Zhang, D.; Geng, S. Improved biharmonic kernel signature for 3D non-rigid shape matching and retrieval. Vis. Comput. 2024, 1–27. [Google Scholar] [CrossRef]
  22. Yan, Y.; Zhou, M.; Zhang, D.; Geng, S. Average increment scale-invariant heat kernel signature for 3D non-rigid shape analysis. Multimed. Tools Appl. 2024, 83, 8077–8115. [Google Scholar] [CrossRef]
  23. Melzi, S.; Rodola, E.; Castellani, U.; Bronstein, M.M. Shape analysis with anisotropic windowed fourier transform. In Proceedings of the International Conference on 3D Vision, Stanford, CA, USA, 26–28 October 2016; pp. 470–478. [Google Scholar]
  24. Rostami, R.; Bashiri, F.S.; Rostami, B.; Yu, Z. A survey on data-driven 3D shape descriptors. Comput. Graph. Forum 2019, 38, 356–393. [Google Scholar] [CrossRef]
  25. Litman, R.; Bronstein, A.M. Learning spectral descriptors for deformable shape correspondence. IEEE Trans. Pattern Anal. Mach. Intell. 2013, 36, 171–180. [Google Scholar] [CrossRef]
  26. Boscaini, D.; Masci, J.; Rodolà, E.; Bronstein, M.M.; Cremers, D. Anisotropic diffusion descriptors. Comput. Graph. Forum 2016, 35, 431–441. [Google Scholar] [CrossRef]
  27. Li, Q.; Liu, S.; Hu, L.; Liu, X. Shape correspondence using anisotropic Chebyshev spectral CNNs. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Nashville, TN, USA, 20–25 June 2020; pp. 14658–14667. [Google Scholar]
  28. Huang, X.; Li, N.; Xia, Q.; Li, S.; Hao, A.; Qin, H. Multi-scale and multi-level shape descriptor learning via a hybrid fusion network. Graph. Model. 2022, 119, 101121. [Google Scholar] [CrossRef]
  29. Sandryhaila, A.; Moura, J.M. Discrete signal processing on graphs. IEEE Trans. Signal Process. 2013, 61, 1644–1656. [Google Scholar] [CrossRef]
  30. Shuman, D.I.; Ricaud, B.; Vandergheynst, P. Vertex-frequency analysis on graphs. Appl. Comput. Harmon. Anal. 2016, 40, 260–291. [Google Scholar] [CrossRef]
  31. Wang, Y.Q.; Li, B.Z.; Cheng, Q.Y. The fractional Fourier transform on graphs. In Proceedings of the 2017 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), Kuala Lumpur, Malaysia, 12–15 December 2017; pp. 105–110. [Google Scholar]
  32. Wang, Y.; Li, B. The fractional Fourier transform on graphs: Sampling and recovery. In Proceedings of the 2018 14th IEEE International Conference on Signal Processing (ICSP), Beijing, China, 12–16 August 2018; pp. 1103–1108. [Google Scholar]
  33. Yan, F.J.; Li, B.Z. Windowed fractional Fourier transform on graphs: Properties and fast algorithm. Digit. Signal Process. 2021, 118, 103210. [Google Scholar] [CrossRef]
  34. Chung, F.R. Spectral Graph Theory; American Mathematical Soc.: Providence, RI, USA, 1997; Volume 92. [Google Scholar]
  35. Wu, J.; Wu, F.; Yang, Q.; Zhang, Y.; Liu, X.; Kong, Y.; Senhadji, L.; Shu, H. Fractional spectral graph wavelets and their applications. Math. Probl. Eng. 2020, 2020, 2568179. [Google Scholar] [CrossRef]
  36. Higham, N.J.; Lin, L. A Schur–Padé algorithm for fractional powers of a matrix. Siam J. Matrix Anal. Appl. 2011, 32, 1056–1078. [Google Scholar] [CrossRef]
  37. Perraudin, N.; Paratte, J.; Shuman, D.; Martin, L.; Kalofolias, V.; Vandergheynst, P.; Hammond, D.K. GSPBOX: A toolbox for signal processing on graphs. arXiv 2014, arXiv:1408.5781. [Google Scholar]
  38. Hou, T.; Qin, H. Continuous and discrete Mexican hat wavelet transforms on manifolds. Graph. Model. 2012, 74, 221–232. [Google Scholar] [CrossRef]
  39. Benedetto, J.J.; Fickus, M. Finite normalized tight frames. Adv. Comput. Math. 2003, 18, 357–385. [Google Scholar] [CrossRef]
  40. Bogo, F.; Romero, J.; Loper, M.; Black, M.J. FAUST: Dataset and evaluation for 3D mesh registration. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA, 23–28 June 2014; pp. 3794–3801. [Google Scholar]
  41. Ren, J.; Poulenard, A.; Wonka, P.; Ovsjanikov, M. Continuous and orientation-preserving correspondences via functional maps. Acm Trans. Graph. 2018, 37, 1–16. [Google Scholar] [CrossRef]
  42. Anguelov, D.; Srinivasan, P.; Koller, D.; Thrun, S.; Rodgers, J.; Davis, J. Scape: Shape completion and animation of people. In ACM SIGGRAPH 2005 Papers; ACM: New York, NY, USA, 2005; pp. 408–416. [Google Scholar]
  43. Bronstein, A.M.; Bronstein, M.M.; Kimmel, R. Numerical Geometry of Non-Rigid Shapes; Springer Science & Business Media: Berlin, Germany, 2008. [Google Scholar]
  44. Melzi, S.; Marin, R.; Rodolà, E.; Castellani, U.; Ren, J.; Poulenard, A.; Wonka, P.; Ovsjanikov, M. SHREC 2019: Matching Humans with Different Connectivity. In Proceedings of the Eurographics Workshop on 3D Object Retrieval, Genova, Italy, 5–6 May 2019; Volume 7. [Google Scholar]
  45. Zuffi, S.; Kanazawa, A.; Jacobs, D.W.; Black, M.J. 3D menagerie: Modeling the 3D shape and pose of animals. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Honolulu, HI, USA, 21–26 July 2017; pp. 6365–6373. [Google Scholar]
  46. Robinette, K.M.; Daanen, H.; Paquet, E. The CAESAR project: A 3-D surface anthropometry survey. In Proceedings of the Second International Conference on 3-D Digital Imaging and Modeling (Cat. No. PR00062), Ottawa, ON, Canada, 8 October 1999; pp. 380–386. [Google Scholar]
  47. Pickup, D.; Sun, X.; Rosin, P.L.; Martin, R.R.; Cheng, Z.; Lian, Z.; Aono, M.; Hamza, A.B.; Bronstein, A.; Bronstein, M.; et al. Shape retrieval of non-rigid 3d human models. Int. J. Comput. Vis. 2016, 120, 169–193. [Google Scholar] [CrossRef]
  48. Cosmo, L.; Rodola, E.; Bronstein, M.M.; Torsello, A.; Cremers, D.; Sahillioglu, Y. SHREC’16: Partial matching of deformable shapes. Proc. 3DOR 2016, 2, 12. [Google Scholar]
  49. Kim, V.G.; Lipman, Y.; Funkhouser, T. Blended intrinsic maps. Acm Trans. Graph. 2011, 30, 1–12. [Google Scholar]
  50. Wang, Z.; Lin, H.; Yu, X.; Hamza, Y.F. A dimensional reduction guiding deep learning architecture for 3D shape retrieval. Comput. Graph. 2019, 81, 82–91. [Google Scholar] [CrossRef]
  51. Rodolà, E.; Cosmo, L.; Bronstein, M.M.; Torsello, A.; Cremers, D. Partial functional correspondence. Comput. Graph. Forum 2017, 36, 222–236. [Google Scholar] [CrossRef]
  52. Lähner, Z.; Rodola, E.; Bronstein, M.M.; Cremers, D.; Burghard, O.; Cosmo, L.; Dieckmann, A.; Klein, R.; Sahillioglu, Y. SHREC’16: Matching of deformable shapes with topological noise. Proc. 3DOR 2016, 2, 55–60. [Google Scholar]
Figure 1. The demonstration of various Anisotropic Fractional Spectral Manifold Wavelets centered at the same point on the shape while with varied parameter values. In each group (three shapes in total), only one parameter changes, while the others remain the same. From left to right in each subfigure, the anisotropic degree α = 0   ( isotropic ) , 5 , 30 , the rotational angle θ = π / 4 , π / 2 , 3 π / 4 , the fractional order s = 0.5 , 0.67 , 0.83 , and the scales t 6 , t 7 , t 8 . Obviously, we can flexibly control the size and shape of the wavelet’s compact support domain by tuning the relevant parameters. This is particularly beneficial to reveal more hidden shape structural information when applied in shape analysis.
Figure 1. The demonstration of various Anisotropic Fractional Spectral Manifold Wavelets centered at the same point on the shape while with varied parameter values. In each group (three shapes in total), only one parameter changes, while the others remain the same. From left to right in each subfigure, the anisotropic degree α = 0   ( isotropic ) , 5 , 30 , the rotational angle θ = π / 4 , π / 2 , 3 π / 4 , the fractional order s = 0.5 , 0.67 , 0.83 , and the scales t 6 , t 7 , t 8 . Obviously, we can flexibly control the size and shape of the wavelet’s compact support domain by tuning the relevant parameters. This is particularly beneficial to reveal more hidden shape structural information when applied in shape analysis.
Mathematics 12 02946 g001
Figure 2. The shape-matching results on the near-isometric shape benchmark using different descriptors. From left to right, the subfigures, respectively, show the CQC curves and the AGEs on the FAUST and the SCAPE datasets.
Figure 2. The shape-matching results on the near-isometric shape benchmark using different descriptors. From left to right, the subfigures, respectively, show the CQC curves and the AGEs on the FAUST and the SCAPE datasets.
Mathematics 12 02946 g002
Figure 3. The shape-matching results on the remeshed near-isometric shape benchmark using different descriptors. From left to right, the subfigures, respectively, show the CQC curves and the AGEs on the remeshed FAUST, SCAPE, and TOSCA datasets.
Figure 3. The shape-matching results on the remeshed near-isometric shape benchmark using different descriptors. From left to right, the subfigures, respectively, show the CQC curves and the AGEs on the remeshed FAUST, SCAPE, and TOSCA datasets.
Mathematics 12 02946 g003
Figure 4. The shape-matching results on the SHREC’19 dataset, a non-isometric shape benchmark, using different descriptors. The CQC curves and the AGEs are shown in the figure.
Figure 4. The shape-matching results on the SHREC’19 dataset, a non-isometric shape benchmark, using different descriptors. The CQC curves and the AGEs are shown in the figure.
Mathematics 12 02946 g004
Figure 5. The test results on the SMAL dataset, a non-isometric shape benchmark. The left subfigure shows the CQC curves and the AGEs of our AFSMWD and the most related work ASMWD [8] for shape matching, where ours achieves better performance. The right subfigure demonstrates the visualized Euclidean distances of the AFSMWDs between the reference points (marked with white balls and arrows on the leftmost shapes) and the left points of the shape as well as all points on several other shapes from the same dataset. Bluer colors represent smaller distances, while more warmer colors represent longer distances.
Figure 5. The test results on the SMAL dataset, a non-isometric shape benchmark. The left subfigure shows the CQC curves and the AGEs of our AFSMWD and the most related work ASMWD [8] for shape matching, where ours achieves better performance. The right subfigure demonstrates the visualized Euclidean distances of the AFSMWDs between the reference points (marked with white balls and arrows on the leftmost shapes) and the left points of the shape as well as all points on several other shapes from the same dataset. Bluer colors represent smaller distances, while more warmer colors represent longer distances.
Mathematics 12 02946 g005
Figure 6. The test results on the SHREC’16 Partiality benchmark [48]. The left subfigure shows the CQC curves and the AGEs of our AFSMWD and the most related work ASMWD [8] for shape matching. The subfigure on the right illustrates the visualized Euclidean distances produced by our AFSMWD between the reference points (marked with white balls and arrows on each shape) and the corresponding points on the same shapes. In the visualization, blue areas indicate smaller distances, while warmer colors correspond to larger distances. Even in this scenario, where the shapes contain numerous large holes, the bluest regions remain highly concentrated and near the reference point. This confirms that our descriptor is both discriminative and localizable, and it also demonstrates robustness against structural noise.
Figure 6. The test results on the SHREC’16 Partiality benchmark [48]. The left subfigure shows the CQC curves and the AGEs of our AFSMWD and the most related work ASMWD [8] for shape matching. The subfigure on the right illustrates the visualized Euclidean distances produced by our AFSMWD between the reference points (marked with white balls and arrows on each shape) and the corresponding points on the same shapes. In the visualization, blue areas indicate smaller distances, while warmer colors correspond to larger distances. Even in this scenario, where the shapes contain numerous large holes, the bluest regions remain highly concentrated and near the reference point. This confirms that our descriptor is both discriminative and localizable, and it also demonstrates robustness against structural noise.
Mathematics 12 02946 g006
Table 1. The results of all compared descriptors on all test datasets. The numbers are the matching AGEs, and the best results are in bold. Our descriptor AFSMWD achieves the best performances in nearly all datasets, including challenging cases.
Table 1. The results of all compared descriptors on all test datasets. The numbers are the matching AGEs, and the best results are in bold. Our descriptor AFSMWD achieves the best performances in nearly all datasets, including challenging cases.
DescriptorsFAUSTSCAPETOSCASHREC’19SMALSHREC’16
HOLES
Original Remesh Original Remesh Remesh
HKS17.7117.6118.8619.2421.0126.4934.4031.89
WKS15.1415.1416.0416.4416.8321.6529.7933.69
AMKS15.7215.2217.0816.4815.2721.8835.7932.55
AWFT9.8413.7414.2014.8713.6327.3524.4824.45
LPS16.9617.7618.2018.9118.5027.1734.6227.38
ASMWD4.998.648.1811.6511.7719.0029.2924.42
WEDS12.5212.1216.5216.2316.6025.4031.9825.16
AFSMWD3.898.428.0311.5511.1718.7127.8822.31
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Hu, L.; Wang, H.; Yang, X.; Xu, H.; Liao, Y. AFSMWD: A Descriptor Flexibly Encoding Multiscale and Oriented Shape Features. Mathematics 2024, 12, 2946. https://doi.org/10.3390/math12182946

AMA Style

Hu L, Wang H, Yang X, Xu H, Liao Y. AFSMWD: A Descriptor Flexibly Encoding Multiscale and Oriented Shape Features. Mathematics. 2024; 12(18):2946. https://doi.org/10.3390/math12182946

Chicago/Turabian Style

Hu, Ling, Haibo Wang, Xuguang Yang, Haojun Xu, and Yongzhong Liao. 2024. "AFSMWD: A Descriptor Flexibly Encoding Multiscale and Oriented Shape Features" Mathematics 12, no. 18: 2946. https://doi.org/10.3390/math12182946

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop