paper-with-me

Papers

Shape-Graph Matching Network (SGM-net): Registration for Statistical Shape Analysis

2023-08-14 · Shenyuan Liang, Mauricio Pamplona Segundo, Sathyanarayanan N. Aakur, Sudeep Sarkar, Anuj Srivastava

This paper focuses on the statistical analysis of shapes of data objects called shape graphs, a set of nodes connected by articulated curves with arbitrary shapes. A critical need here is a constrained registration of points (nodes to nodes, edges to edges) across objects. This, in turn, requires optimization over the permutation group, made challenging by differences in nodes (in terms of numbers, locations) and edges (in terms of shapes, placements, and sizes) across objects. This paper tackles this registration problem using a novel neural-network architecture and involves an unsupervised loss function developed using the elastic shape metric for curves. This architecture results in (1) state-of-the-art matching performance and (2) an order of magnitude reduction in the computational cost relative to baseline approaches. We demonstrate the effectiveness of the proposed approach using both simulated data and real-world 2D and 3D shape graphs. Code and data will be made publicly available after review to foster research.

📄 PDF Abstract BibTeX arXiv:2308.06869

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Matching

Similar Papers 제목 키워드 기반

3D Shape Registration Using Spectral Graph Embedding and Probabilistic Matching

2021-06-21 · Avinash Sharma, Radu Horaud, Diana Mateus

We address the problem of 3D shape registration and we propose a novel technique based on spectral graph theory and probabilistic matching. The task of 3D shape analysis involves tracking, recognition, registration, etc.…

Dimensionality ReductionGraph EmbeddingGraph Matching

Articulated Shape Matching Using Laplacian Eigenfunctions and Unsupervised Point Registration

2020-12-14 · Diana Mateus, Radu Horaud, David Knossow, Fabio Cuzzolin 외

Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to map these graphs onto lower dimensional …

ClusteringGraph Matching

Procrustes registration of two-dimensional statistical shape models without correspondences

2019-11-26 · Alma Eguizabal, Peter J. Schreier, Jürgen Schmidt

Statistical shape models are a useful tool in image processing and computer vision. A Procrustres registration of the contours of the same shape is typically perform to align the training samples to learn the statistical…

Dynamic Time WarpingVocal Bursts Valence Prediction

Integrating Efficient Optimal Transport and Functional Maps For Unsupervised Shape Correspondence Learning

2024-03-04 · CVPR 2024 1 · Tung Le, Khai Nguyen, Shanlin Sun, Nhat Ho 외

In the realm of computer vision and graphics, accurately establishing correspondences between geometric 3D shapes is pivotal for applications like object tracking, registration, texture transfer, and statistical shape an…

Object Trackingvalid

A Combinatorial Solution to Non-Rigid 3D Shape-to-Image Matching

2016-11-16 · CVPR 2017 7 · Florian Bernard, Frank R. Schmidt, Johan Thunberg, Daniel Cremers

We propose a combinatorial solution for the problem of non-rigidly matching a 3D shape to 3D image data. To this end, we model the shape as a triangular mesh and allow each triangle of this mesh to be rigidly transformed…

Image Registration