atlas

Research map / Learning theory and algorithms / Clustering

Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis

CVPR 2024 · Learning theory and algorithms › Clustering · approach: Subspace clustering · 36 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Formulates non-rigid point set registration as unsupervised clustering (source as centroids, target as members), using a Tikhonov-regularized Laplacian (l1) kernel with closed-form updates and a clustering-improved Nyström approximation.

Problem

Non-rigid point set registration without correspondences, especially for shapes under large deformations.

Approach

Treats the source point set as clustering centroids and the target as clustering members in a holistic clustering objective, replaces the Gaussian kernel with an l1-induced Laplacian kernel in Tikhonov regularization for robust smooth displacement fields, and uses Elkan k-means to select landmarks for an improved Nyström approximation with a proven error bound.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the proposed clustering-based registration instead of GMM2D non-rigid point set registration · IMM hand, Subject 1RMSE: 0.0571 -> 0.0383Helped
Use the proposed clustering-based registration instead of GMM2D non-rigid point set registration · IMM hand, Subject 2RMSE: 0.0547 -> 0.0481Helped
Use the proposed clustering-based registration instead of GMM2D non-rigid point set registration · IMM hand, Subject 3RMSE: 0.0734 -> 0.0537Helped
Use the proposed clustering-based registration instead of GMM2D non-rigid point set registration · IMM hand, Subject 4RMSE: 0.0917 -> 0.0879Helped
Use the proposed method instead of Nerfies3D non-rigid point cloud registration · FAUST, average across intra- and inter-subject settingsRMSE: 0.0129 -> 0.0092Helped
Use the proposed method instead of NSFP3D non-rigid point cloud registration · TOSCA, average across animal classesRMSE: 2.0710 -> 1.5247Helped
Replace the Gaussian kernel with the Laplacian kernel (ablation)Proposed registration method · Bunny registration under varying noiseRMSEHelped
Replace random Nyström sampling with clustering-improved Nyström approximation (ablation)Proposed registration method · FAUST model-pair testsregistration errorHelped
Replace random Nyström sampling with clustering-improved Nyström approximation (ablation)Proposed registration method · FAUST model-pair testsmatrix approximation errorHelped
Replace the Gaussian kernel with the Laplacian kernel (ablation)Proposed registration method · Bunny registrationiterations to convergenceHelped

Surprising findings

Limitations

Experimental setup

Datasets: IMM hand dataset FAUST TOSCA ShapeNet Stanford Bunny CT lung volumes MRA brain vessels

Benchmarks: IMM hand dataset FAUST TOSCA

Metrics: RMSE running time

Baselines: MR-RPM BCPD GMM ZAC GBCPD Fast RNRR AMM NRR Sinkhorn Nerfies NDP NSFP

Builds on: Coherent Point Drift BCPD Elkan k-means fuzzy clustering Nyström method

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy