kNN-Res: Residual Neural Network with kNN-Graph coherence for point cloud registration

📅 2023-03-31
🏛️ Pacific Rim Knowledge Acquisition Workshop
📈 Citations: 1
Influential: 0
📄 PDF
🤖 AI Summary
Batch effects in high-dimensional CyTOF data severely impede cross-condition comparisons, while conventional normalization methods fail to preserve the complex topological structure of cell populations. To address this, we propose an end-to-end residual neural network framework for point cloud registration. Our method is the first to incorporate k-nearest neighbor (kNN) graph consistency as a differentiable geometric constraint; theoretical analysis via Jacobian-based surrogate loss ensures local topological fidelity. We further design a constant-time randomized kNN approximation algorithm to enable efficient optimization in high dimensions. The approach is particularly suited to complex deformations characterized by multi-object or articulated local rigidity and global non-rigidity. Extensive validation on 2D synthetic benchmarks and high-dimensional cytometry datasets demonstrates substantial improvements in post-registration biological signal fidelity. The implementation is publicly available under the MIT license.
📝 Abstract
In this paper, we present a method based on a residual neural network for point set registration that preserves the topological structure of the target point set. Similar to coherent point drift (CPD), the registration (alignment) problem is viewed as the movement of data points sampled from a target distribution along a regularized displacement vector field. Although the coherence constraint in CPD is stated in terms of local motion coherence, the proposed regularization relies on a global smoothness constraint as a proxy for preserving local topology. This makes CPD less flexible when the deformation is locally rigid but globally non-rigid as in the case of multiple objects and articulate pose registration. A kNN-graph coherence cost and geometric-aware statistical distances are proposed to mitigate these issues. To create an end-to-end trainable pipeline, a simple Jacobian-based cost is introduced as a proxy for the intrinsically discrete kNN-graph cost. We present a theoretical justification for our Jacobian-based cost showing that it is sufficient for the preservation of the kNN-graph of the transformed point set. Further, to tackle the registration of high-dimensional point sets, a constant time stochastic approximation of the kNN-graph coherence cost is introduced. The proposed method is illustrated on several 2-dimensional examples and tested on high-dimensional flow cytometry datasets where the task is to align two distributions of cells whilst preserving the kNN-graph in order to preserve the biological signal of the transformed data. The implementation of the proposed approach is available at https://github.com/MuhammadSaeedBatikh/kNN-Res_Demo/ under the MIT license.
Problem

Research questions and friction points this paper is trying to address.

Address batch effects in high-dimensional CyTOF data
Preserve topological structures of cellular populations
Enable accurate batch normalization for comparative analysis
Innovation

Methods, ideas, or system contributions that make the work stand out.

Residual neural network for CyTOF batch normalization
Jacobian-based cost ensures local topology preservation
Stochastic approximation for high-dimensional registration
🔎 Similar Papers
No similar papers found.
M
Muhammad S. Battikh
Systems and Computer Engineering Department, Al-Azhar University, Egypt
D
Dillon Hammill
John Curtin School of Medical Research, The Australian National University, Australia
Matthew Cook
Matthew Cook
University of Groningen, Faculty of Science and Engineering & CogniGron Centre
Models of ComputationCortical Information Processing
Artem Lensky
Artem Lensky
UNSW Canberra at the Australian Defence Force Academy
DefenceArtificial IntelligenceQuantitative FinanceMedical Data AnalysisEducation