The official repository for the paper "Learning-to-Count by Learning-to-Rank", accepted as an oral presentation at CRV2023. We attempt to solve the problem of weakly supervised object counting using pairwise image ranking.
Fully supervised object counting methods typically rely on density map annotations, which are labor intensive to collect. We propose a novel method to exploit pairwise image ranking, which is a significantly weaker form of annotations. These annotations require an annotator to estimate a boolean label
In addition to learning directly from pairwise image annotations, we introduces a novel adversarial regularization loss, which encourages the network output to have the structure of a density map while also solving the pairwise ranking problem.
|- src
|- scripts
|- train.py
Penguins: https://www.robots.ox.ac.uk/~vgg/data/penguins/
Trancos: https://gram.web.uah.es/data/datasets/trancos/index.html
Mall: https://personal.ie.cuhk.edu.hk/~ccloy/downloads_mall_dataset.html