R-local unlabeled sensing: A novel graph matching approach for multiview unlabeled sensing under local permutations

arXiv1911.06382MaRDI QIDQ6329207

Author name not available (Why is that?)

Publication date: 14 November 2019

Abstract: Unlabeled sensing is a linear inverse problem where the measurements are scrambled under an unknown permutation leading to loss of correspondence between the measurements and the rows of the sensing matrix. Motivated by practical tasks such as mobile sensor networks, target tracking and the pose and correspondence estimation between point clouds, we study a special case of this problem restricting the class of permutations to be local and allowing for multiple views. In this setting, namely unlabeled multi-view sensing with local permutation, previous results and algorithms are not directly applicable. In this paper, we propose a computationally efficient algorithm that creatively exploits the machinery of graph alignment and Gromov-Wasserstein alignment and leverages the multiple views to estimate the local permutations. Simulation results on synthetic data sets indicate that the proposed algorithm is scalable and applicable to the challenging regimes of low to moderate SNR.

Has companion code repository: https://github.com/aabbas02/QAP-for-ULS

This page was built for publication: R-local unlabeled sensing: A novel graph matching approach for multiview unlabeled sensing under local permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6329207)