Conference PaperPDF Available

SHREC'20: Non-rigid Shape Correspondence of Physically-Based Deformations

Authors:
Eurographics Workshop on 3D Object Retrieval (2020)
T. Schreck and T. Theoharis (Editors)
SHREC’20: Non-rigid Shape Correspondence of Physically-Based
Deformations
R. M. Dyke1F. Zhou2Y-K. Lai1P. L. Rosin1D. Guo3K. Li3R. Marin4J. Yang3
1School of Computer Science & Informatics, Cardiff University, Wales
2Beihang University, Bejing, China
3Tianjin University, Tianjin, China
4Department of Computer Science, University of Verona, Italy
Abstract
Commonly, novel non-rigid shape correspondence techniques focus on particular matching challenges. This can lead to the
potential trade-off of poorer performance in other scenarios. An ideal dataset would provide a granular means for degrees
of evaluation. In this paper, we propose a novel dataset of real scans that contain challenging non-isometric deformations to
evaluate non-rigid point-to-point correspondence and registration algorithms. The deformations included in our dataset cover
extreme types of physically-based contortions of a toy rabbit. Furthermore, shape pairs contain incrementally different types
and amounts of deformation, this enables performance to be systematically evaluated with respect to the nature of the defor-
mation. A brief investigation into different methods for initialising correspondence was undertaken, and a series of experiments
were subsequently conducted to investigate the performance of state-of-the-art methods on the proposed dataset. We find that
methods that rely on initial correspondences and local descriptors that are sensitive to local surface changes perform poorly in
comparison to other strategies, and that a template-based approach performs the best.
CCS Concepts
Computing methodologies Shape analysis; Mesh models;
1. Introduction
Shape correspondence is a fundamental problem in geometry pro-
cessing with numerous applications, e.g., texture transfer, shape
morphing, and statistical shape analysis. However, accurately iden-
tifying correspondences between two or more surfaces continues
to be a challenging problem, and scenarios in which contemporary
approaches fail persist.
Many potential challenges occur when estimating a correspon-
dence between surfaces: deformations such as non-isometry (i.e.,
stretching between shapes); ambiguities (e.g., mapping features
with little geometric detail); shape incompatibility [MMR19]
(e.g., varying connectivity and vertex density); partial corre-
spondence (e.g., registering two incomplete scans); and semi-
compatible shapes (e.g., matching a human and a centaur).
State-of-the-art techniques aim to address challenges such as
missing data and non-isometry. However, evaluative datasets fail
to provide an appropriate means of identifying precisely where a
method’s performance degrades. Therefore it may be difficult to
determine what degree of robustness a method has for a particular
Track organisers
correspondence challenge. This is crucial for understanding what
scenarios a method may be useful in.
We seek to address this problem by designing a structured, incre-
mentally challenging dataset. We focus on inducing non-rigid de-
formations on a real-world object and use texture markers to estab-
lish ground-truths. Various internal properties and drastic poses of
the shape were selected, causing complex deformations, and vary-
ing degrees of local protrusions and indentations on the surface.
A subset of deformations were selected—twist, indent, inflate &
stretch—from those identified by [SPF19], whose work focuses on
how humans interpret deformation of an unknown object.
The organisers briefly investigate the problem of correspondence
initialisation in Section 3.1, the results of which are discussed in
Section 6.1. Participants were asked to estimate the correspondence
between each partial scan in the dataset and one watertight scan of
the rabbit. Section 4details the correspondence methods evaluated
using this dataset. Participant results are presented in Section 6.2.
2. Related work
There are many different possible approaches to estimating cor-
respondences between non-rigid shapes. These may be classified
as extrinsic approaches (e.g., iterative closest point), intrinsic or
c
2020 The Author(s)
Eurographics Proceedings c
2020 The Eurographics Association.
R. M. Dyke et al. / SHREC’20: Non-rigid Shape Correspondence of Physically-Based Deformations
spectral techniques (e.g., Gaussian kernels [VLR17], heat ker-
nels [VLB17] and functional maps [EBC17]), and methods that
use a combination of both [DLRT19]. Data-driven methods can
perform well in benchmarks [DSL19], but may fail in scenarios
where training data is insufficient or no comparable model is avail-
able. Many other methods have been proposed for computing shape
correspondence, which are further discussed in the following sur-
veys [vKZHCO11,TCL13,BCBB16,BBL17,Sah19].
Many recent works have focused on addressing the problem of
non-isometric deformations [VLR17,VLB17,EBC17,DLRT19,
JYZ19,EHA19,EEBC20]— [Sah19] provides a comprehensive
overview of many methods. However, the resources available to
evaluate the performance of such methods are insufficient.
Previous SHape REtrieval Contests (SHREC) have produced in-
sightful benchmark datasets. Many use synthetic objects [BBC10,
LRB16,RCB17,RCL17]. While these synthetic datasets may
have certain advantages, such as easily established ground-truths,
they also produce deformations that are not necessarily realistic.
Human body scan datasets [RDP99,ASK05,BRLB14] capture
real-world scans of humans undergoing realistic deformations. This
is useful for understanding how well a method may perform on hu-
man subjects. However, the range of motion of a human is naturally
constrained, thus the degree of non-rigid deformation is relatively
limited. Whilst significant non-isometric deformation does occur
between persons, features like the head, hands and feet, are particu-
larly distinct, enabling correspondences between distinctive surface
regions to be established through smooth interpolations.
3. Dataset
For this paper, 3D scans of a real-world object were captured using
a high-precision 3D scanner (Artec3D Space Spider). The scanner
is accurate up to 0.05mm. Each scan exhibits one or more types
of deformation. Scans were classified into four distinct groups by
the type of deformation primarily exhibited by a given pose: twist,
indent, inflate, &stretch. The challenge of the dataset was fur-
ther increased by varying the internal properties of the object by
filling it with different materials: couscous, risotto, &chickpea.
Using different internal materials changed the local appearance of
the shape’s surface, as well as its deformation properties. For each
pose, the object was filled, and then scanned, with three different
internal materials. This caused incremental changes to the surface
and overall deformation exhibited, as illustrated in Fig. 1.
(a) Couscous (b) Risotto (c) Chickpea
Figure 1: Illustrations of the surfaces of meshes with different in-
ternal materials coloured by the surface normals.
The dataset consists of a stuffed soft toy rabbit made out of
a stretchy jersey material with no type of internal skeleton that
could otherwise restrict its movement, see Fig. 2. The rabbit had
590 coloured markers drawn on the surface, which allowed numer-
ous accurate ground-truth correspondences to be established, see
Fig. 3. Note that our purpose is to investigate how different types
of physically-based deformations affect non-rigid shape correspon-
dence, so a carefully chosen object with different material fillings
is sufficient and makes data capture and analysis more manageable.
(a) (b) (c) (d) (e)
Figure 3: Examples of texture transfer using the ground-truth cor-
respondences. (a) Target shape. (b-e) Source shapes. Correspon-
dences were transferred and interpolated using a landmark-based
correspondence method [EBC17]. The original texture was pro-
jected onto the coronal (frontal) plane of the rabbit in (a).
Figure 2: A photo of
the model used for the
dataset with markers.
The poses and materials used were
carefully selected to incrementally vary
the deformation challenge so that al-
gorithm deficiencies—with respect to
these varying properties—may be iden-
tified. Some examples of challenging
problems are shown in Fig. 4.
A key point about the proposed
dataset is that the exaggerated nature of
the deformations, such as twisting, of-
ten contradicts the underlying assump-
tions of state-of-the-art approaches.
Due to changes of the internal mate-
rial and surface creases, geometry is
often locally non-isometric, which is
problematic for many shape descrip-
tors. The model has intrinsic symme-
tries and, with the exception of the target scan, all scans are partial.
Information about the data underpinning the results presented
here, including how to access them, can be found in the Cardiff
University data catalogue (here).
3.1. Initial correspondences
Most correspondence methods require an initial set of sparse or
dense correspondences that are subsequently refined. Due to the
challenging variations in both the local and global appearance,
three sets of initial correspondences using different methods were
produced to find an optimal approach. The following methods
were used to acquire the initial sets of correspondences: diffusion
pruning [TMRL14], region-level correspondence [KO19], and non-
rigid iterative closest point (N-ICP) [BP13]. All methods took a
similar amount of time to compute. Where possible these initial
correspondences have been used for fairer comparisons.
c
2020 The Author(s)
Eurographics Proceedings c
2020 The Eurographics Association.
R. M. Dyke et al. / SHREC’20: Non-rigid Shape Correspondence of Physically-Based Deformations
(a) (b) (c)
Figure 4: Illustrations of some of the challenges in the dataset. (a) Partial scans (green indicates the boundary). (b) Complex deformations.
(c) Missing geometry caused by self-occlusion.
The diffusion pruning method of [TMRL14] was used to pro-
duce a set of globally consistent correspondences from an initial
set of point-wise descriptors. Due to the significant deformation, lo-
cal geometry is often non-isometric and thus local descriptors that
rely on near-isometries performed poorly. Signature of histograms
of orientations (SHOT) [TSDS10] signatures were computed with
10 bins at two scales, which covered 2% & 5% of the surface area
square rooted. Due to memory limitations and computation time,
diffusion pruning was performed with the default parameters, ex-
cept K=5 and d=25%.
The region-level correspondence method of [KO19] was used to
produce a set of correspondences between segmented shapes. The
method is capable of finding region-based matches using a shape
graph that describes the connectivity of consistently segmented
shapes. The method was run using nearly all default parameters,
with numComponentsRange ={10,9,8,7}. A dense point-to-
point mapping was subsequently recovered using nearest neigh-
bours of a functional map from a state-of-the-art approach [NO17].
The non-rigid registration method of [BP13] was used to register
the shapes together. Point-to-point correspondences were computed
using nearest neighbour between the vertices of the two surfaces.
The method’s parameters were set to w1 =1 (point-to-plane term),
w2 =1 (point-to-point term), w3 =1 (global rigidity term), w4 =
1000 (local rigidity term) and iter =100.
4. Correspondence methods
This section presents the methods that are examined in this work.
Eight methods were evaluated using the benchmark; namely: non-
rigid registration with re-weighted sparsities [LYLG19], non-rigid
partial functional maps [RCB17], anisotropic non-rigid registra-
tion [DLRT19], non-rigid partial functional maps [VLB17], pre-
cise recovery of non-isometric functional maps [EBC17], continu-
ous and orientation-preserving functional maps [RPWO18], data-
driven non-rigid registration FARM+, and a commercial non-rigid
registration tool R3DS Wrap 3.4.
4.1. Robust Non-Rigid Registration with Reweighted Position
and Transformation Sparsity
To cope with non-rigid deformation with large motion, [LYLG19]
proposes a robust non-rigid registration method using re-weighted
sparsities on position and transformation to estimate deformations
between 3D shapes. The energy function is formulated with posi-
tion and transformation sparsity on both the data and smoothness
terms, and a smoothness constraint is defined using local rigidity.
The double sparsity-based non-rigid registration model is enhanced
with a re-weighting scheme, and solved by transferring the model
into four alternately-optimised sub-problems which have exact so-
lutions and guaranteed convergence. Experimental results on both
public datasets and real scanned datasets show that the method out-
performs other state-of-the-art approaches [LYLG19,DSL19], and
is more robust to noise and outliers than conventional non-rigid reg-
istration methods.
The set of pruned and N-ICP correspondences were provided,
and was run using parameters optimised by the authors.
4.2. Partial Functional Correspondence
[RCB17] extends the functional mapping framework to address
the problem of partial input data. The authors discovered that it is
possible to estimate a partial correspondence with functional maps.
Computation of a partial functional map C
C
Cis formulated as an alter-
nating minimisation problem with two steps. In the first step, corre-
spondences are regularised based on assumptions about the overlap
of the source mesh. The slope, orthogonality, and rank of C
C
CC
C
C
are incorporated to help regularise this step. In the second step,
the mapping is regularised by the part. Solutions with a dissimi-
lar area and long boundaries are penalised. This method assumes
the deformation to be near-isometric. While this is not necessarily
the case, being able to effectively handle partial data is critical for
this dataset, and is typically sufficient. SHOT was used to compute
dense point-wise descriptors.
For the experiments, shapes were re-scaled—as described in the
method’s code. All parameters remained default, with the exception
of n_eigen =100.
4.3. Non-rigid Registration under Anisotropic Deformations
[DLRT19] proposes a non-rigid registration pipeline that estimates
a correspondence between two surfaces in two steps. First, diffu-
sion pruning is used to compute an initial sparse set of globally
consistent correspondences. An implementation of N-ICP with an
as-rigid-as-possible regularisation term that is generalised to sup-
port r-ring neighbourhoods is then used to find a dense set of corre-
spondences. Finally, the dense correspondence is used to estimate
c
2020 The Author(s)
Eurographics Proceedings c
2020 The Eurographics Association.
R. M. Dyke et al. / SHREC’20: Non-rigid Shape Correspondence of Physically-Based Deformations
local anisotropy on the source surface. For subsequent iterations,
the original geodesics used for diffusion pruning are replaced with
anisotropic geodesics.
The described pipeline is fully automatic. However, for compar-
ative purposes, our pre-computed correspondences are used for ini-
tialisation. All other parameters remain as described in the original
paper.
4.4. Efficient Deformable Shape Correspondence via Kernel
Matching
[VLB17] proposes an algorithm to compute vertex-to-vertex
correspondence between non-isometric shapes. The work ex-
tends [VLR17], primarily incorporating the use of heat kernels
and a method to handle partial matching cases. A linear assign-
ment problem (LAP) is solved using a multi-scale approach for
cases where objects have a high number of vertices to relieve the
quadratic memory requirements of solving the LAP. In the original
paper SHOT and heat kernel signatures (HKS) [SOG09] were used
as point-wise descriptors.
Based on the discussions and experimental results in the
original paper, the parameters αand twere set to 107and
{500,323,209,135,88,57,37,24,15,10}respectively. Only SHOT
is used to compute point-wise descriptors, as HKS is sensitive to
changes in topology. Optimal results were achieved by scaling in-
put shapes with respect to the unit area of the source shape. Since
all shapes were captured using the same device, the original scale
was the same.
4.5. Deblurring and Denoising of Maps between Shapes
[EBC17] observes that functional maps typically lack speci-
ficity, moreover recovering vertex-to-vertex correspondences from
a functional map leads to undesirable noise. The authors propose
a method to refine a functional map, which is capable of recover-
ing vertex-to-point correspondences. This is desirable when trans-
porting high frequency information between surfaces—such as tex-
tures. The authors incorporate a correspondence regulariser that
favours smooth maps. The method removes noise by first blurring
the map, and then applying their proposed smoothness term. Point-
wise correspondences are subsequently recovered from the map-
ping, projected to a facet.
This method was run in three configurations, using each respec-
tive set of pre-computed initial correspondences. Due to memory
limitations caused by computing the wave kernel map, all configu-
rations used a subset of 200 correspondences—selected using far-
thest point sampling (FPS) based on geodesic distances. The fol-
lowing parameters were modified k1=120 & k2=120.
4.6. Continuous and Orientation-preserving Correspondences
via Functional Maps
[RPWO18] proposes a method that attempts to address the prob-
lem of symmetric ambiguity for functional mapping methods. The
method also attempts to ensure that the mapping remains bijective
and continuous when recovering point-wise correspondences from
a given functional map. The wave kernel signature (WKS) is used
as a point-wise descriptor. WKS was shown to be robust to some
topological changes in the seminal paper [ASC11], although the
descriptor is known to be strictly invariant only under isometric de-
formation. Due to the symmetrical appearance of the shape used
in this dataset, distinguishing such ambiguity is beneficial. How-
ever, the authors remark that the method is not designed to directly
handle partial cases.
The method was run both with and without our sets of initial
correspondences. Similarly to [EBC17], due to memory limitations
of computing the wave kernel map, 200 correspondences were se-
lected using geodesic-based FPS. Parameters were configured to
the default settings used in the paper, with num_iters =10.
The parameters for computing WKS were numTimes =100 and
skipSize =10.
4.7. FARM+: Functional Automatic Registration Method for
3D Human Bodies
FARM+ a variant of [MMRC20] is used. This method relies on the
registration of a morphable model exploiting the functional map
framework [OBCS12]. In the original paper, automatic landmarks
are detected on protrusions relying only on geometrical information
of the discrete-time evolution process (DEP) [MOR18] descriptor.
These landmarks are used to initialise a dense correspondence in
the functional domain, and also to retrieve finer local correspon-
dence over hands and heads. Then, a learned deformable template
of humans bodies is optimised to fit the target model. Finally, a
local refinement is applied to align the template to the target us-
ing an as-rigid-as-possible regularisation. The correspondence be-
tween the template and target is achieved using nearest-neighbour
between vertices. This method has been refined by [MMRC19],
removing some iterative steps and using ZoomOut [MRR19] re-
finement for functional maps. In this challenge, we start from
[MMRC19]. Since the provided template is not capable of defor-
mation, it is animated using Mixamo [Ado20] and some deforma-
tion basis is defined to inflate or shrink the template along the di-
rection of the surface normals. To compute landmarks, the mini-
mum and maximum of the first Laplacian eigenfunctions are used,
and six landmarks are classified over extremal points of the rabbit’s
ears, arms, and legs. Another main change of the original methods
of [MMRC19] and [MMRC20] is that no local correspondence is
used. All parameters were left unchanged from the original method,
which were tuned for the specific domain of human bodies.
4.8. R3DS Wrap 3.4
[Rus19] develops a commercial software product with functional-
ity to non-rigidly register surfaces called Wrap 3. The method uses
landmark points to compute an optimal alignment between two
non-rigid surfaces. The method uses a multiple-step sub-division
surface approach with N-ICP in a coarse-to-fine manner to establish
an approximate non-rigid alignment, which is subsequently refined
in further steps.
Wrap 3 was used to register the scans both with and without our
initial pruned correspondences. Better results were achieved by set-
c
2020 The Author(s)
Eurographics Proceedings c
2020 The Eurographics Association.
R. M. Dyke et al. / SHREC’20: Non-rigid Shape Correspondence of Physically-Based Deformations
ting the final weight of control points (the initial correspondences)
to zero, all other settings remained as per default.
5. Evaluation
The quality of correspondences is measured following the protocol
described by [KLF11] using the sparse texture markers as ground-
truths. For convenience, we describe the protocol for computing
the geodesic error of correspondences here. For an estimated cor-
respondence (x,y)X×Yand the respective ground-truth corre-
spondence (x,y)X×Y. The geodesic distance between the cor-
responding points on Yis dY(y,y)
ε(x) = dY(y,y)
area(Y)1/2.(1)
6. Results
In this section we discuss the performance achieved by correspon-
dence methods on our dataset. We examine how different initialisa-
tion techniques impact the performance of a selection of methods.
Then the affects of variations in pose and internal material are scru-
tinised. It should be noted that the density of the correspondences
acquired is not wholly reported because all methods report a dense
mapping of 100% in most cases.
6.1. Initial correspondences
In Fig. 5the performance of the initial correspondence methods de-
scribed in Section 3.1 is reported. The methods are abbreviated as
follows: N-ICP [BP13] refers to [BP13], Pruning [TMRL14] refers
to the diffusion pruning method of [TMRL14], and SEG [KO19]
refers to the region-level correspondence method of [KO19]. N-
ICP [BP13] performed the best. This may be due to the shapes hav-
ing a reasonable initial rigid alignment, which is necessary when
using N-ICP. All deformations are largely locally non-isometric,
this causes point-wise descriptors that methods use on unreliable.
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
% Correspondences
N-ICP [BP13]
Pruning [TMRL14]
SEG [KO19]
Figure 5: Error curves for the methods used to establish an ini-
tial correspondence. Note, Pruning [TMRL14] only estimated
7.4250% of correspondences.
These initial correspondences were subsequently used to ini-
tialise the relevant shape correspondence and registration meth-
ods. In Fig. 6, a comparison of the performance of a selection of
methods using different initial correspondences is reported. The re-
sults show that using the initial correspondences of N-ICP [BP13]
greatly reduces the resulting error of the subsequent methods.
R3DS Wrap 3 + N-ICP [EBC17] + N-ICP
R3DS Wrap 3 + Pruning [EBC17] + Pruning
R3DS Wrap 3 + SEG [EBC17] + SEG
R3DS Wrap 3 (none) [RPWO18] + N-ICP
[DLRT19] + N-ICP [RPWO18] + Pruning
[DLRT19] + Pruning [RPWO18] + SEG
[DLRT19] + SEG [RPWO18] (none)
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
% Correspondences
(a) R3DS Wrap 3
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
(b) [EBC17]
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
% Correspondences
(c) [DLRT19]
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
(d) [RPWO18]
Figure 6: Comparison of the error of methods initialised with
different initial correspondence techniques (N-ICP [BP13], Prun-
ing [TMRL14], SEG [KO19], or none).
Table 1summarises the same performance measurements nu-
merically by reporting the area under the curve AUC of each
method for each set of initial correspondences. All methods per-
form best using N-ICP [BP13] for initialisation, with the excep-
tion of R3DS Wrap 3, which achieved its best results using none.
This slight improvement may be a consequence of the coarse-to-
fine strategy being able to converge to a more optimal solution.
[RPWO18] achieve better results using no correspondence initiali-
sation compared to Pruning [TCL13] or SEG [KO19], or just us-
ing WKS [ASC11] descriptors. In all cases, using SEG [KO19]
produced better results than using Pruning [TMRL14].
6.2. Track results
Hereafter, methods initialised with N-ICP [BP13] correspondences
are qualified by an asterisk (). Comprehensive results—measured
by AUC—of running each method on each scan—grouped by pose
or by internal material—are reported in Table 2. Error curves that
complement Table 2are given in Figs. 7&8. Scans that are
members of a given column were examined collectively. FARM+
achieved the highest overall accuracy of any method using a semi-
automatic approach. Of the fully-automatic methods, [RPWO18]
c
2020 The Author(s)
Eurographics Proceedings c
2020 The Eurographics Association.
R. M. Dyke et al. / SHREC’20: Non-rigid Shape Correspondence of Physically-Based Deformations
Table 1: (left) The AUCs are calculated from the cumulative error curves of the initial correspondence methods reported in Fig. 5. (right) The
resulting AUCs of methods using each set of initial correspondences—reported in Fig. 6. Note, [TMRL14] reports an average of 7.4250%
vertex correspondences.
Initial correspondences
Initialisation method AUC Method N-ICP
[BP13]
Pruning
[TMRL14]SEG
[KO19] None
N-ICP [BP13] 0.8736 R3DS Wrap 3 0.8763 0.5869 0.6050 0.8837
Pruning [TMRL14] 0.6151 [EBC17] 0.8829 0.5430 0.5891 N/A
SEG [KO19] 0.5323 [DLRT19] 0.8771 0.5812 0.6290 N/A
[RPWO18] 0.9015 0.5480 0.6347 0.7609
performed the best. The pose that all methods performed the
best on, on average, was the indented pose. The sporadic non-
isometry, limited deformation, and slight topological change may
have helped. Conversely, twist was the most challenging pose. The
most challenging internal material was the risotto. This is likely to
be due to the subtle variations induced on local geometry and how
the risotto grains affected the way the rabbit bent in the distinct
poses. However, excluding the results of [RCB17] and [VLB17],
all methods achieve a particularly high accuracy on the stretch pose.
Although there is a large amount of non-rigid motion, the topology
remains consistent, and the non-isometric deformation is relatively
simple.
R3DS Wrap 3 [EBC17][RCB17]
[RPWO18][LYLG19][VLB17]
[DLRT19]FARM+
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
% Correspondences
(a) Twist
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
(b) Indent
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
% Correspondences
(c) Inflate
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
(d) Stretch
Figure 7: Cumulative error curves with scans grouped by the pose
exhibited.
R3DS Wrap 3 performed unexpectedly poorly on the indent
pose, with the worst performance of any method on scan no. 5.
[RCB17] performed poorly in most scenarios, especially in cases
R3DS Wrap 3 [EBC17][RCB17]
[RPWO18][LYLG19][VLB17]
[DLRT19]FARM+
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
% Correspondences
(a) Couscous
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
(b) Risotto
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
% Correspondences
(c) Chickpea
Figure 8: Cumulative error curves with scans grouped by the in-
ternal material selected.
where a pose exhibited greater non-isometry. For all poses, ex-
cept inflate, FARM+ converges to 100% correspondence within the
smallest geodesic error. [RPWO18] performs the worst on the twist
pose, this is understandable as the fused geometry caused by twist-
ing contradicts the assumption of continuity.
As shown in Fig. 9, overall, FARM+ performed the best of
all methods. [RPWO18] performed the best of all the fully-
automatic approaches. The performance of [DLRT19] is compa-
rable to [LYLG19], with only a slight improvement over the initial
N-ICP [BP13] correspondences.
7. Conclusions
We consider the problem of establishing correspondence between
shapes with different internal materials in challenging poses. A new
dataset was created with high quality texture-based ground-truths.
c
2020 The Author(s)
Eurographics Proceedings c
2020 The Eurographics Association.
R. M. Dyke et al. / SHREC’20: Non-rigid Shape Correspondence of Physically-Based Deformations
Table 2: The total area under the curve of scans grouped by the type of pose exhibited, scans grouped by material, and the overall perfor-
mance of each method over all scans is reported. The method that achieved the best results in each configuration is emphasised in bold, and
the second best in bold italics. In the final two rows the mean and standard deviation of each column is reported.
Pose Internal material
Method Twist Indent Inflate Stretch Couscous Risotto Chickpea Overall
R3DS Wrap 3 0.9025 0.8129 0.9005 0.9418 0.9265 0.8071 0.9277 0.8837
[EBC17]0.8730 0.8830 0.8689 0.9195 0.8944 0.8591 0.8979 0.8829
[RCB17] 0.5249 0.6247 0.6136 0.5778 0.5840 0.5570 0.6170 0.5863
[RPWO18]0.8708 0.9004 0.9070 0.9420 0.8956 0.8950 0.9122 0.9015
[BP13] 0.8620 0.8713 0.8646 0.9087 0.8842 0.8579 0.8813 0.8736
[LYLG19]0.8598 0.8719 0.8651 0.9088 0.8822 0.8581 0.8816 0.8733
[VLB17] 0.6369 0.7610 0.6827 0.5521 0.7660 0.5966 0.6695 0.6692
[DLRT19]0.8616 0.8796 0.8712 0.9058 0.8886 0.8604 0.8850 0.8771
FARM+ 0.8999 0.9338 0.8780 0.9438 0.9281 0.9111 0.8992 0.9113
Mean 0.7636 0.8023 0.7967 0.7932 0.8126 0.7623 0.8008
Std. 0.1698 0.1318 0.1307 0.2040 0.1484 0.1581 0.1551
0 0.2 0.40.60.8 1
0
20
40
60
80
100
Geodesic error
% Correspondences
R3DS Wrap 3
[EBC17]
[RCB17]
[RPWO18]
[LYLG19]
[VLB17]
[DLRT19]
FARM+
Figure 9: Overall performance of methods.
The resulting accuracy achieved by using different correspondence
initialisation techniques was investigated. We discover that in this
scenario, N-ICP [BP13] performed the best for correspondence ini-
tialisation. Of all the methods, FARM+ achieved the greatest accu-
racy using a semi-automatic approach, while [RPWO18] performed
the best of the fully-automatic approaches.
Further work would include an extended investigation into the
performance of different shape descriptors and initial correspon-
dence techniques on this dataset.
For many of the methods evaluated, it is unclear how to best op-
timise the parameters. It was possible to incrementally change the
parameters to achieve better results, however this is a time consum-
ing strategy and not necessarily possible in cases where ground-
truths are not available. Further investigation into optimal parame-
ters on a range of benchmark datasets is required to give a greater
overview of what parameters should be selected in a given scenario.
Acknowledgements
We thank the authors of methods that did not participate but made
their code available online [VLB17,EBC17,RCB17,RPWO18,
Rus19]. We also thank Seana Dykes for helping to fabricate the
toy rabbit. This work has been supported by the Cardiff University
EPSRC Doctoral Training Partnership [grant ref. EP/N509449/1].
References
[Ado20] ADOBE INC.: Mixamo. https://www.mixamo.com/, July
2008–2020. 4
[ASC11] AUBRY M., SCHLICKEWEI U., CREME RS D .: The Wave Ker-
nel Signature: A quantum mechanical approach to shape analysis. In
International Conference on Computer Vision Workshops (Nov. 2011),
ICCV ’11, IEEE, pp. 1626–1633. doi:10.1109/ICCVW.2011.
6130444.4,5
[ASK05] ANGUELOV D., SRINIVASAN P., KOLLER D., THRU N S.,
RODGERS J., DAVIS J.: SCAPE: Shape completion and animation of
people. ACM Transactions on Graphics 24, 3 (July 2005), 408–416.
doi:10.1145/1073204.1073207.2
[BBC10] BRO NS TE IN A. M., BRO NS TE IN M. M., CA ST EL LA NI U.,
DUBROVI NA A., GUIBAS L. J., HO RAU D R. P., KIM ME L R., KN OS -
SOW D., LAVANTE E. V., MATEUS D., OVSJANIKOV M. , SH AR MA
A.: SHREC’10 track: Correspondence finding. In Eurographics Work-
shop on 3D Object Retrieval (Oct. 2010), 3DOR ’10, The Eurographics
Association, pp. 87–91. doi:10.2312/3DOR/3DOR10/087-091.
2
[BBL17] BRO NS TE IN M. M., BRU NA J., LECUN Y., SZ LA M A.,
VANDE RG HE YN ST P.: Geometric deep learning: Going beyond eu-
clidean data. Signal Processing Magazine 34, 4 (July 2017), 18–42.
doi:10.1109/MSP.2017.2693418.2
[BCBB16] BIASOTT I S., CE RR I A., BRO NS TE IN A., BRONSTEIN M.:
Recent trends, applications, and perspectives in 3D shape similarity
assessment. Computer Graphics Forum 35, 6 (Oct. 2016), 87–119.
doi:10.1111/cgf.12734.2
[BP13] BOUAZ IZ S., PAULY M.: Dynamic 2D/3D registration for
the Kinect. In ACM SIGGRAPH 2013 Courses (July 2013), SIG-
GRAPH ’13, Association for Computing Machinery, pp. 21:1–21:14.
doi:10.1145/2504435.2504456.2,3,5,6,7
[BRLB14] BOGO F., RO ME RO J., LOPER M., BLAC K M. J.: FAUST:
Dataset and evaluation for 3D mesh registration. In Conference on Com-
puter Vision and Pattern Recognition (June 2014), CVPR ’14, IEEE,
pp. 3794–3801. doi:10.1109/CVPR.2014.491.2
[DLRT19] DYKE R. M ., L AI Y.-K., ROS IN P. L., TAM G. K.: Non-rigid
registration under anisotropic deformations. Computer Aided Geometric
Design 71 (May 2019), 142–156. doi:10.1016/j.cagd.2019.
04.014.2,3,5,6,7
[DSL19] DYKE R. M., STRIDE C., LAI Y.-K., ROS IN P. L., AUB RY
M., BOYAR SKI A., BRO NS TE IN A. M., BRONS TE IN M . M. , CRE-
MERS D., FISHER M., GRO UE IX T., G UO D ., K IM V. G., KI MM EL
R., LÄHNER Z., LIK., LITANY O., REM EZ T., ROD OL À E., RUS SE LL
c
2020 The Author(s)
Eurographics Proceedings c
2020 The Eurographics Association.
R. M. Dyke et al. / SHREC’20: Non-rigid Shape Correspondence of Physically-Based Deformations
B. C., SAHILLIO ˘
GLU Y., SLO SS BE RG R., TAM G. K. L., VES TN ER
M., WUZ., YANG J .: Shape correspondence with isometric and non-
isometric deformations. In Eurographics Workshop on 3D Object Re-
trieval (May 2019), 3DOR ’19, The Eurographics Association, pp. 111–
119. doi:10.2312/3dor.20191069.2,3
[EBC17] EZUZ D., BEN-CHEN M.: Deblurring and denoising of maps
between shapes. Computer Graphics Forum 36, 5 (Aug. 2017), 165–174.
doi:10.1111/cgf.13254.2,3,4,5,6,7
[EEBC20] EDELSTEIN M., EZUZ D., BEN-CHEN M.: ENIGMA: Evo-
lutionary Non-Isometric Geometry MAtching. ACM Transactions on
Graphics 39, 4 (July 2020). doi:10.1145/3386569.3392447.2
[EHA19] EZUZ D., HEEREN B., AZENCOT O., RU MP F M., BE N-
CHEN M.: Elastic correspondence between triangle meshes. Computer
Graphics Forum 38, 2 (June 2019), 121–134. doi:10.1111/cgf.
13624.2
[JYZ19] JIANG T., YANG X., ZHA NG J., TIA N F., LI U S., XI-
ANG N., QIAN K.: Huber-L1-based non-isometric surface registration.
The Visual Computer 35, 6 (May 2019), 935–948. doi:10.1007/
s00371-019- 01670-1.2
[KLF11] KIM V. G., LI PM AN Y., FU NK HO US ER T.: Blended intrinsic
maps. ACM Transactions on Graphics 30, 4 (July 2011). doi:10.
1145/2010324.1964974.5
[KO19] KLE IM AN Y., OVSJANIKOV M.: Robust structure-based shape
correspondence. Computer Graphics Forum 38, 1 (Apr. 2019), 7–20.
doi:10.1111/cgf.13389.2,3,5,6
[LRB16] LÄHNER Z., RO DO E., BRON ST EI N M. M., CRE -
MERS D., BURGHARD O., COS MO L., DIE CK MA NN A., KLE IN R.,
SAHILLIO ˘
GLU Y.: Matching of deformable shapes with topological
noise. In Eurographics Workshop on 3D Object Retrieval (May 2016),
3DOR ’16, The Eurographics Association, pp. 55–60. doi:10.2312/
3dor.20161088.2
[LYLG19] LIK., YANG J., LAI Y. K., GU O D.: Robust non-rigid reg-
istration with reweighted position and transformation sparsity. Transac-
tions on Visualization and Computer Graphics 25, 6 (June 2019), 2255–
2269. doi:10.1109/TVCG.2018.2832136.3,6,7
[MMR19] MELZI S., MARIN R., RODOLÀ E., CASTELLANI U., REN
J., POULENA RD A., WONKA P., OVSJANIKOV M.: Matching humans
with different connectivity. In Eurographics Workshop on 3D Object Re-
trieval (May 2019), 3DOR ’19, The Eurographics Association, pp. 121–
128. doi:10.2312/3dor.20191070.1
[MMRC19] MARIN R., MELZI S., RODOLÀ E., CASTELLANI U.:
High-resolution augmentation for automatic template-based matching of
human models. In International Conference on 3D Vision (Sept. 2019),
3DV ’19, IEEE, pp. 230–239. doi:10.1109/3DV.2019.00034.4
[MMRC20] MARIN R., MELZI S., RODOLÀ E., CASTELLANI U.:
FARM: Functional automatic registration method for 3D human bod-
ies. Computer Graphics Forum 39, 1 (Feb. 2020), 160–173. doi:
10.1111/cgf.13751.4
[MOR18] MELZI S., OVSJANIKOV M., ROFFO G., CRISTANI M.,
CASTELLANI U.: Discrete time evolution process descriptor for shape
analysis and matching. ACM Transactions on Graphics 37, 1 (Jan. 2018),
4:1–4:18. doi:10.1145/3144454.4
[MRR19] MELZI S., REN J., ROD OL À E., SH AR MA A., WONKA P.,
OVSJANIKOV M.: ZoomOut: Spectral upsampling for efficient shape
correspondence. ACM Transactions on Graphics 38, 6 (Nov. 2019),
155:1–155:14. doi:10.1145/3355089.3356524.4
[NO17] NOGNENG D., OVSJANIKOV M.: Informative descriptor preser-
vation via commutativity for shape matching. Computer Graphics Forum
36, 2 (May 2017), 259–267. doi:10.1111/cgf.13124.3
[OBCS12] OVSJANIKOV M ., B EN -C HE N M. , SO LO MO N J.,
BUTSCHER A., GUIBA S L.: Functional maps: A flexible repre-
sentation of maps between shapes. ACM Transactions on Graphics 31,
4 (July 2012), 30:1–30:11. doi:10.1145/2185520.2185526.4
[RCB17] ROD OL À E., CO SM O L., BRO NS TE IN M. M., TO RSELLO
A., CREMERS D.: Partial functional correspondence. Computer Graph-
ics Forum 36, 1 (Jan. 2017), 222–236. doi:10.1111/cgf.12797.
2,3,6,7
[RCL17] ROD OL À E., CO SM O L., LI TANY O., BRONSTEIN M. M.,
BRON ST EI N A. M., AU DE BE RT N., HA MZ A A. B., BOU LC H A.,
CASTELLANI U., DOM. N., DUONG A.-D., FURU YA T., GAS -
PARE TTO A., HONG Y., KI M J., SAU X B. L., LIT MA N R., MA SO UM I
M., MINELLO G., NGUYEN H.-D., NGUYEN V.-T., O HB UC HI R.,
PHAM V.-K., PH AN T. V., RE ZA EI M., TORSELLO A., TRAN M.-
T., TR AN Q.-T., TRUO NG B., WAN L., ZOU C.: Deformable shape
retrieval with missing parts. In Eurographics Workshop on 3D Object
Retrieval (Apr. 2017), 3DOR ’17, The Eurographics Association, pp. 85–
94. doi:10.2312/3dor.20171057.2
[RDP99] ROB IN ET TE K. M., DAA NE N H., PAQUE T E.: The CAESAR
project: A 3D surface anthropometry survey. In International Conference
on 3D Digital Imaging and Modeling (Aug. 1999), 3DIM ’99, IEEE,
pp. 380–386. doi:10.1109/IM.1999.805368.2
[RPWO18] REN J ., P OU LE NARD A., WONKA P., OVSJANIKOV M.:
Continuous and orientation-preserving correspondences via functional
maps. ACM Transactions on Graphics 37 (Dec. 2018), 248:1–248:16.
doi:10.1145/3272127.3275040.3,4,5,6,7
[Rus19] RUS SI AN 3DSC ANNER: Wrap 3.4. https://www.
russian3dscanner.com/, June 2019. 4,7
[Sah19] SAHILLIO ˘
GLU Y.: Recent advances in shape correspon-
dence. The Visual Computer (Sept. 2019). doi:10.1007/
s00371-019- 01760-0.2
[SOG09] SUN J., OVSJANIKOV M ., G UI BAS L.: A concise and provably
informative multi-scale signature based on heat diffusion. In Proceed-
ings of the Symposium on Geometry Processing (Aug. 2009), vol. 28 of
SGP ’09, Eurographics Association, pp. 1383–1392. doi:10.1111/
j.1467-8659.2009.01515.x.4
[SPF19] SCHMIDT F., PH IL LI PS F., FLE MI NG R. W.: Visual perception
of shape-transforming processes: ‘shape scission’. Cognition 189 (Aug.
2019), 167–180. doi:10.1016/j.cognition.2019.04.006.1
[TCL13] TAM G. K. L., CH EN G Z., LA I Y., LAN GB EI N F. C., LIU
Y., MAR SH AL L D., MA RTI N R. R., SUN X., RO SI N P. L.: Regis-
tration of 3D point clouds and meshes: A survey from rigid to nonrigid.
Transactions on Visualization and Computer Graphics 19, 7 (July 2013),
1199–1217. doi:10.1109/TVCG.2012.310.2,5
[TMRL14] TAM G. K. L., MA RTI N R. R., RO SI N P. L., LAI Y.-K .: Dif-
fusion pruning for rapidly and robustly selecting global correspondences
using local isometry. ACM Transactions on Graphics 33, 1 (Feb. 2014),
4:1–4:17. doi:10.1145/2517967.2,3,5,6
[TSDS10] TOM BARI F., SALTI S., DISTEFAN O L.: Unique signatures
of histograms for local surface description. In European Conference on
Computer Vision (Sept. 2010), ECCV ’10, Springer, pp. 356–369. doi:
10.1007/978-3- 642-15558- 1_26.3
[vKZHCO11] VAN KAIC K O. , ZH AN G H. , HA MA RN EH G., COH EN -
ORD.: A survey on shape correspondence. Computer Graphics Fo-
rum 30, 6 (July 2011), 1681–1707. doi:10.1111/j.1467-8659.
2011.01884.x.2
[VLB17] VESTNER M., LÄHNER Z., BOYARSKI A., LITAN Y O.,
SLOSSBERG R., REMEZ T., RO DO E., BRONSTEIN A., BRON ST EI N
M., KIMMEL R., CREMERS D.: Efficient deformable shape correspon-
dence via kernel matching. In International Conference on 3D Vision
(Oct. 2017), 3DV ’17, IEEE, pp. 517–526. doi:10.1109/3DV.
2017.00065.2,3,4,6,7
[VLR17] VESTNER M., LITMAN R., RODOE., BRON ST EI N A.,
CREMERS D.: Product manifold filter: Non-rigid shape correspondence
via kernel density estimation in the product space. In Conference on
Computer Vision and Pattern Recognition (July 2017), CVPR ’17, IEEE,
pp. 6681–6690. doi:10.1109/CVPR.2017.707.2,4
c
2020 The Author(s)
Eurographics Proceedings c
2020 The Eurographics Association.
... We have also conducted experiments on the SHREC'2020 dataset (Task.1 [59]). Here, the dataset contains 11 partial scans and one full scan of a rabbit toy. ...
... From left to right : test-set0 (articulated deformations), test-set1 (near-isometric deformations), test-set2 (non-isometric deformations), test-set3 (topological and geometric changes), all test-sets. Quantitative evaluation (Geodesic Error Curves) on SHREC'2020 and comparison with existing approaches including variants of the Functional Maps framework, as reported in[59]. Considered poses/deformations, from left to right: twist, indent, inflate, stretch, and overall. ...
Article
Full-text available
In deformable registration, the geometric framework -- large deformation diffeomorphic metric mapping (or LDDMM, in short) -- has inspired numerous techniques for comparing, deforming, averaging and analyzing shapes or images. In this work, we make use of deep residual neural networks to solve the non-stationary ODE (flow equation) based on a Eulers discretization scheme. The central idea is to represent time-dependent velocity fields as fully connected ReLU neural networks (building blocks) and derive optimal weights by minimizing a regularized loss function. Computing minimizing paths between deformations, thus between shapes, turns to find optimal network parameters by back-propagating over the intermediate building blocks. Geometrically, at each time step, ResNet-LDDMM searches for an optimal partition of the space into multiple polytopes, and then computes optimal velocity vectors as affine transformations on each of these polytopes. As a result, different parts of the shape, even if they are close, can be made to belong to different polytopes, and therefore be moved in different directions without costing too much energy. Importantly, we show how diffeomorphic transformations, or more precisely bilipshitz transformations, are predicted by our algorithm. We illustrate these ideas on diverse registration problems of 3D shapes under complex topology-preserving transformations.
... Shape registration is a special case of correspondence, where our goal is to find an optimal deformation between the scan and a fixed template. For this, we consider the recent SHREC'20 benchmark [81], consisting of 11 partial scans of stuffed toy rabbits to be registered to a single scan. This benchmark is particularly challenging due to granulated surface deformation, scanning artefacts, and limited data and supervision. ...
Preprint
Full-text available
In this work we present a novel approach for computing correspondences between non-rigid objects, by exploiting a reduced representation of deformation fields. Different from existing works that represent deformation fields by training a general-purpose neural network, we advocate for an approximation based on mesh-free methods. By letting the network learn deformation parameters at a sparse set of positions in space (nodes), we reconstruct the continuous deformation field in a closed-form with guaranteed smoothness. With this reduction in degrees of freedom, we show significant improvement in terms of data-efficiency thus enabling limited supervision. Furthermore, our approximation provides direct access to first-order derivatives of deformation fields, which facilitates enforcing desirable regularization effectively. Our resulting model has high expressive power and is able to capture complex deformations. We illustrate its effectiveness through state-of-the-art results across multiple deformable shape matching benchmarks. Our code and data are publicly available at: https://github.com/Sentient07/DeformationBasis.
... This choice to treat point correspondences between objects as functions leads to simpler convex leastsquare optimisation problems and provide greater flexibility to incorporate linear constraints to the problem. FM with several applications in different areas of computer graphics such as partial matching, deformation and symmetry analysis, exploration of shape collections etc. [21]- [23], has been shown to perform well in challenging settings [24]. ...
... This choice to treat point correspondences between objects as functions leads to simpler convex leastsquare optimisation problems and provide greater flexibility to incorporate linear constraints to the problem. FM with several applications in different areas of computer graphics such as partial matching, deformation and symmetry analysis, exploration of shape collections etc. [21]- [23], has been shown to perform well in challenging settings [24]. ...
Preprint
Full-text available
Handling object deformations for robotic grasping is still a major problem to solve. In this paper, we propose an efficient learning-free solution for this problem where generated grasp hypotheses of a region of an object are adapted to its deformed configurations. To this end, we investigate the applicability of functional map (FM) correspondence, where the shape matching problem is treated as searching for correspondences between geometric functions in a reduced basis. For a user selected region of an object, a ranked list of grasp candidates is generated with local contact moment (LoCoMo) based grasp planner. The proposed FM-based methodology maps these candidates to an instance of the object that has suffered arbitrary level of deformation. The best grasp, by analysing its kinematic feasibility while respecting the original finger configuration as much as possible, is then executed on the object. We have compared the performance of our method with two different state-of-the-art correspondence mapping techniques in terms of grasp stability and region grasping accuracy for 4 different objects with 5 different deformations.
... In this study, the so-called non-rigid template registration method [43] is used using Wrap 3.4 software (Russian3dscanner, Moscow, Russia). First, a high-quality individual scan was selected to serve as the template mesh. ...
Article
Full-text available
The use of 3D anthropometric data of children’s heads and faces has great potential in the development of protective gear and medical products that need to provide a close fit in order to function well. Given the lack of detailed data of this kind, the aim of this study is to map the size and shape variation of Dutch children’s heads and faces and investigate possible implications for the design of a ventilation mask. In this study, a dataset of heads and faces of 303 Dutch children aged six months to seven years consisting of traditional measurements and 3D scans were analysed. A principal component analysis (PCA) of facial measurements was performed to map the variation of the children’s face shapes. The first principal component describes the overall size, whilst the second principal component captures the more width related variation of the face. After establishing a homology between the 3D scanned face shapes, a second principal component analysis was done on the point coordinates, revealing the most prominent variations in 3D shape within the sample.
... In this section, we conduct comprehensive experiments to evaluate the performance of our method on various data sets including TOSCA [9], SCAPE [3], SHREC'16 [14] and SHREC'20 [16] as well as patches extracted from TOSCA. TOSCA and SCAPE are data sets of approximately isometric shapes; SHREC'16 is also a data set of approximately isometric shapes but includes cuts and holes. ...
Preprint
Full-text available
In this work, a simple and efficient dual iterative refinement (DIR) method is proposed for dense correspondence between two nearly isometric shapes. The key idea is to use dual information, such as spatial and spectral, or local and global features, in a complementary and effective way, and extract more accurate information from current iteration to use for the next iteration. In each DIR iteration, starting from current correspondence, a zoom-in process at each point is used to select well matched anchor pairs by a local mapping distortion criterion. These selected anchor pairs are then used to align spectral features (or other appropriate global features) whose dimension adaptively matches the capacity of the selected anchor pairs. Thanks to the effective combination of complementary information in a data-adaptive way, DIR is not only efficient but also robust to render accurate results within a few iterations. By choosing appropriate dual features, DIR has the flexibility to handle patch and partial matching as well. Extensive experiments on various data sets demonstrate the superiority of DIR over other state-of-the-art methods in terms of both accuracy and efficiency.
Preprint
Non-rigid registration computes an alignment between a source surface with a target surface in a non-rigid manner. In the past decade, with the advances in 3D sensing technologies that can measure time-varying surfaces, non-rigid registration has been applied for the acquisition of deformable shapes and has a wide range of applications. This survey presents a comprehensive review of non-rigid registration methods for 3D shapes, focusing on techniques related to dynamic shape acquisition and reconstruction. In particular, we review different approaches for representing the deformation field, and the methods for computing the desired deformation. Both optimization-based and learning-based methods are covered. We also review benchmarks and datasets for evaluating non-rigid registration methods, and discuss potential future research directions.
Article
Full-text available
Important new developments have appeared since the most recent direct survey on shape correspondence published almost a decade ago. Our survey covers the period from 2011, their stopping point, to 2019, inclusive. The goal is to present the recent updates on correspondence computation between surfaces or point clouds embedded in 3D. Two tables summarizing and classifying the prominent, to our knowledge, papers of this period, and a large section devoted to their discussion lay down the foundation of our survey. The discussion is carried out in chronological order to reveal the distribution of various types of correspondence methods per year. We also explain our classification criteria along with the most basic solution examples. We finish with conclusions and future research directions.
Article
We present a simple and efficient method for refining maps or correspondences by iterative upsampling in the spectral domain that can be implemented in a few lines of code. Our main observation is that high quality maps can be obtained even if the input correspondences are noisy or are encoded by a small number of coefficients in a spectral basis. We show how this approach can be used in conjunction with existing initialization techniques across a range of application scenarios, including symmetry detection, map refinement across complete shapes, non-rigid partial shape matching and function transfer. In each application we demonstrate an improvement with respect to both the quality of the results and the computational speed compared to the best competing methods, with up to two orders of magnitude speed-up in some applications. We also demonstrate that our method is both robust to noisy input and is scalable with respect to shape complexity. Finally, we present a theoretical justification for our approach, shedding light on structural properties of functional maps.
Article
Shape-deforming processes (e.g., squashing, bending, twisting) can radically alter objects’ shapes. After such a transformation, some features are due to the object’s original form, while others are due to the transformation, yet it is challenging to separate the two. We tested whether observers can distinguish the causal origin of different features, teasing apart the characteristics of the original shape from those imposed by transformations, a process we call ‘shape scission’. Using computer graphics, we created 8 unfamiliar objects and subjected each to 8 transformations (e.g., “twisted”, “inflated”, “melted”). One group of participants named transformations consistently. A second group arranged cards depicting the objects into classes according to either (i) the original shape or (ii) the type of transformation. They could do this almost perfectly, suggesting that they readily distinguish the causal origin of shape features. Another group used a digital painting interface to indicate which locations on the objects appeared transformed, with responses suggesting they can localise features caused by transformations. Finally, we parametrically varied the magnitude of the transformations, and asked another group to rate the degree of transformation. Ratings correlated strongly with transformation magnitude with a tendency to overestimate small magnitudes. Responses were predicted by both the magnitude and area affected by the transformation. Together, the fndings suggest that observers can scission object shapes into original shape and transformation features and access the resulting representational layers at will.
Article
Non-rigid registration is challenging because it is ill-posed with high degrees of freedom and is thus sensitive to noise and outliers. We propose a robust non-rigid registration method using reweighted sparsities on position and transformation to estimate the deformations between 3-D shapes. We formulate the energy function with position and transformation sparsity on both the data term and the smoothness term, and define the smoothness constraint using local rigidity. The double sparsity based non-rigid registration model is enhanced with a reweighting scheme, and solved by transferring the model into four alternately-optimized subproblems which have exact solutions and guaranteed convergence. Experimental results on both public datasets and real scanned datasets show that our method outperforms the state-of-the-art methods and is more robust to noise and outliers than conventional non-rigid registration methods.
Article
In shape analysis and matching, it is often important to encode information about the relation between a given point and other points on a shape, namely, its context. To this aim, we propose a theoretically sound and efficient approach for the simulation of a discrete time evolution process that runs through all possible paths between pairs of points on a surface represented as a triangle mesh in the discrete setting. We demonstrate how this construction can be used to efficiently construct a multiscale point descriptor, called the Discrete Time Evolution Process Descriptor, which robustly encodes the structure of neighborhoods of a point across multiple scales. Our work is similar in spirit to the methods based on diffusion geometry, and derived signatures such as the HKS or the WKS, but provides information that is complementary to these descriptors and can be computed without solving an eigenvalue problem. We demonstrate through extensive experimental evaluation that our descriptor can be used to obtain accurate results in shape matching in different scenarios. Our approach outperforms similar methods and is especially robust in the presence of large nonisometric deformations, including missing parts.
Article
Shape correspondence is an important and challenging problem in geometry processing. Generalized map representations, such as functional maps, have been recently suggested as an approach for handling difficult mapping problems, such as partial matching and matching shapes with high genus, within a generic framework. While this idea was shown to be useful in various scenarios, such maps only provide low frequency information on the correspondence. In many applications, such as texture transfer and shape interpolation, a high quality pointwise map that can transport high frequency data between the shapes is required. We name this problem map deblurring and propose a robust method, based on a smoothness assumption, for its solution. Our approach is suitable for non-isometric shapes, is robust to mesh tessellation and accurately recovers vertex-to-point, or precise, maps. Using the same framework we can also handle map denoising, namely improvement of given pointwise maps from various sources. We demonstrate that our approach outperforms the state-of-the-art for both deblurring and denoising of maps on benchmarks of non-isometric shapes, and show an application to high quality intrinsic symmetry computation.
Article
Many signal processing problems involve data whose underlying structure is non-Euclidean, but may be modeled as a manifold or (combinatorial) graph. For instance, in social networks, the characteristics of users can be modeled as signals on the vertices of the social graph. Sensor networks are graph models of distributed interconnected sensors, whose readings are modelled as time-dependent signals on the vertices. In genetics, gene expression data are modeled as signals defined on the regulatory network. In neuroscience, graph models are used to represent anatomical and functional structures of the brain. Modeling data given as points in a high-dimensional Euclidean space using nearest neighbor graphs is an increasingly popular trend in data science, allowing practitioners access to the intrinsic structure of the data. In computer graphics and vision, 3D objects are modeled as Riemannian manifolds (surfaces) endowed with properties such as color texture. Even more complex examples include networks of operators, e.g., functional correspondences or difference operators in a collection of 3D shapes, or orientations of overlapping cameras in multi-view vision ("structure from motion") problems. The complexity of geometric data and the availability of very large datasets (in the case of social networks, on the scale of billions) suggest the use of machine learning techniques. In particular, deep learning has recently proven to be a powerful tool for problems with large datasets with underlying Euclidean structure. The purpose of this paper is to overview the problems arising in relation to geometric deep learning and present solutions existing today for this class of problems, as well as key difficulties and future research directions.
Article
The recent introduction of 3D shape analysis frameworks able to quantify the deformation of a shape into another in terms of the variation of real functions yields a new interpretation of the 3D shape similarity assessment and opens new perspectives. Indeed, while the classical approaches to similarity mainly quantify it as a numerical score, map-based methods also define (dense) shape correspondences. After presenting in detail the theoretical foundations underlying these approaches, we classify them by looking at their most salient features, including the kind of structure and invariance properties they capture, as well as the distances and the output modalities according to which the similarity between shapes is assessed and returned. We also review the usage of these methods in a number of 3D shape application domains, ranging from matching and retrieval to annotation and segmentation. Finally, the most promising directions for future research developments are discussed.