Efficient and Robust Shape Correspondence via Sparsity-Enforced Quadratic Assignment

03/19/2020
by   Rui Xiang, et al.
0

In this work, we introduce a novel local pairwise descriptor and then develop a simple, effective iterative method to solve the resulting quadratic assignment through sparsity control for shape correspondence between two approximate isometric surfaces. Our pairwise descriptor is based on the stiffness and mass matrix of finite element approximation of the Laplace-Beltrami differential operator, which is local in space, sparse to represent, and extremely easy to compute while containing global information. It allows us to deal with open surfaces, partial matching, and topological perturbations robustly. To solve the resulting quadratic assignment problem efficiently, the two key ideas of our iterative algorithm are: 1) select pairs with good (approximate) correspondence as anchor points, 2) solve a regularized quadratic assignment problem only in the neighborhood of selected anchor points through sparsity control. These two ingredients can improve and increase the number of anchor points quickly while reducing the computation cost in each quadratic assignment iteration significantly. With enough high-quality anchor points, one may use various pointwise global features with reference to these anchor points to further improve the dense shape correspondence. We use various experiments to show the efficiency, quality, and versatility of our method on large data sets, patches, and point clouds (without global meshes).

READ FULL TEXT
research
07/26/2020

A Dual Iterative Refinement Method for Non-rigid Shape Matching

In this work, a simple and efficient dual iterative refinement (DIR) met...
research
12/13/2021

DenseGAP: Graph-Structured Dense Correspondence Learning with Anchor Points

Establishing dense correspondence between two images is a fundamental co...
research
03/05/2023

Robust affine feature matching via quadratic assignment on Grassmannians

GraNNI (Grassmannians for Nearest Neighbours Identification) a new algor...
research
07/30/2019

Bilateral Operators for Functional Maps

A majority of shape correspondence frameworks are based on devising poin...
research
11/29/2017

Compression for Smooth Shape Analysis

Most 3D shape analysis methods use triangular meshes to discretize both ...
research
03/05/2019

Efficient representation and manipulation of quadratic surfaces using Geometric Algebras

Quadratic surfaces gain more and more attention among the Geometric Alge...
research
08/30/2013

A Low-Dimensional Representation for Robust Partial Isometric Correspondences Computation

Intrinsic isometric shape matching has become the standard approach for ...

Please sign up or login with your details

Forgot password? Click here to reset