UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization

Mikhailiuk, A; Wilmot, C; Perez-Ortiz, M; Yue, D; Mantiuk, R; (2020) Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization. In: Proceedings - International Conference on Pattern Recognition. IEEE: Milan, Italy. Green open access

[thumbnail of 2004.05691v1.pdf]
Preview
Text
2004.05691v1.pdf - Accepted Version

Download (1MB) | Preview

Abstract

Pairwise comparison data arise in many domains with subjective assessment experiments, for example in image and video quality assessment. In these experiments observers are asked to express a preference between two conditions. However, many pairwise comparison protocols require a large number of comparisons to infer accurate scores, which may be unfeasible when each comparison is time-consuming (e.g. videos) or expensive (e.g. medical imaging). This motivates the use of an active sampling algorithm that chooses only the most informative pairs for comparison. In this paper we propose ASAP, an active sampling algorithm based on approximate message passing and expected information gain maximization. Unlike most existing methods, which rely on partial updates of the posterior distribution, we are able to perform full updates and therefore much improve the accuracy of the inferred scores. The algorithm relies on three techniques for reducing computational cost: inference based on approximate message passing, selective evaluations of the information gain, and selecting pairs in a batch that forms a minimum spanning tree of the inverse of information gain. We demonstrate, with real and synthetic data, that ASAP offers the highest accuracy of inferred scores compared to the existing methods. We also provide an open-source GPU implementation of ASAP for large-scale experiments.

Type: Proceedings paper
Title: Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization
Event: 2020 25th International Conference on Pattern Recognition (ICPR)
Open access status: An open access version is available from UCL Discovery
DOI: 10.1109/ICPR48806.2021.9412676
Publisher version: https://doi.org/10.1109/ICPR48806.2021.9412676
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Message passing , Graphics processing units , Approximation algorithms , Sampling methods , Real-time systems , Computational efficiency , Quality assessment
UCL classification: UCL
UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/10095672
Downloads since deposit
41Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item