CONSENSUS OPTIMIZATION FOR DISTRIBUTED REGISTRATION

Sanyal, Rajat and Chaudhury, Kunal N (2018) CONSENSUS OPTIMIZATION FOR DISTRIBUTED REGISTRATION. In: IEEE Global Conference on Signal and Information Processing (GlobalSIP), NOV 26-29, 2018, Anaheim, CA, pp. 668-672.

Preview	PDF Consensus Optimization for Distributed Network.pdf - Presentation Download (2MB) | Preview
	PDF 08645966.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

We consider the problem of jointly registering multiple point sets using rigid transforms. We propose a distributed algorithm based on consensus optimization for the least-squares formulation of this problem. In each iteration, the computation is distributed among the point sets and the results are averaged. For each point set, the dominant cost per iteration is the SVD of a square matrix of size d, where d is the ambient dimension. Existing methods for joint registration are either centralized or perform the optimization sequentially. The proposed algorithm is naturally more scalable than these methods. As an application, we integrate the proposed algorithm within a divide-and-conquer approach for sensor network localization. In particular, we are able to localize very large networks, which are beyond the scope of most existing localization methods.

Item Type:	Conference Proceedings
Publisher:	IEEE
Additional Information:	Copyright for this article belongs to IEEE
Keywords:	sensor network localization; registration; scalability; distributed algorithm; consensus optimization
Department/Centre:	Division of Electrical Sciences > Electrical Engineering
Date Deposited:	29 May 2019 09:35
Last Modified:	09 Jun 2019 05:21
URI:	http://eprints.iisc.ac.in/id/eprint/62352

Actions (login required)

View Item