We propose a novel crowd counting approach that leverages abundantly
available unlabeled crowd imagery in a learning-to-rank framework. To induce a
ranking of cropped images , we use the observation that any sub-image of a
crowded scene image is guaranteed to contain the same number or fewer persons
than the super-image. This allows us to address the problem of limited size of
existing datasets for crowd counting. We collect two crowd scene datasets from
Google using keyword searches and query-by-example image retrieval,
respectively. We demonstrate how to efficiently learn from these unlabeled
datasets by incorporating learning-to-rank in a multi-task network which
simultaneously ranks images and estimates crowd density maps. Experiments on
two of the most challenging crowd counting datasets show that our approach
obtains state-of-the-art results.
%0 Generic
%1 citeulike:14566830
%A xxx,
%D 2018
%K augmentation counting semisup
%T Leveraging Unlabeled Data for Crowd Counting by Learning to Rank
%U http://arxiv.org/abs/1803.03095
%X We propose a novel crowd counting approach that leverages abundantly
available unlabeled crowd imagery in a learning-to-rank framework. To induce a
ranking of cropped images , we use the observation that any sub-image of a
crowded scene image is guaranteed to contain the same number or fewer persons
than the super-image. This allows us to address the problem of limited size of
existing datasets for crowd counting. We collect two crowd scene datasets from
Google using keyword searches and query-by-example image retrieval,
respectively. We demonstrate how to efficiently learn from these unlabeled
datasets by incorporating learning-to-rank in a multi-task network which
simultaneously ranks images and estimates crowd density maps. Experiments on
two of the most challenging crowd counting datasets show that our approach
obtains state-of-the-art results.
@misc{citeulike:14566830,
abstract = {{We propose a novel crowd counting approach that leverages abundantly
available unlabeled crowd imagery in a learning-to-rank framework. To induce a
ranking of cropped images , we use the observation that any sub-image of a
crowded scene image is guaranteed to contain the same number or fewer persons
than the super-image. This allows us to address the problem of limited size of
existing datasets for crowd counting. We collect two crowd scene datasets from
Google using keyword searches and query-by-example image retrieval,
respectively. We demonstrate how to efficiently learn from these unlabeled
datasets by incorporating learning-to-rank in a multi-task network which
simultaneously ranks images and estimates crowd density maps. Experiments on
two of the most challenging crowd counting datasets show that our approach
obtains state-of-the-art results.}},
added-at = {2019-02-27T22:23:29.000+0100},
archiveprefix = {arXiv},
author = {xxx},
biburl = {https://www.bibsonomy.org/bibtex/23451ec6f80d33d1814907ef9313b562e/nmatsuk},
citeulike-article-id = {14566830},
citeulike-linkout-0 = {http://arxiv.org/abs/1803.03095},
citeulike-linkout-1 = {http://arxiv.org/pdf/1803.03095},
day = 8,
eprint = {1803.03095},
interhash = {4bb4b30fd529dd87ac71db37bad26418},
intrahash = {3451ec6f80d33d1814907ef9313b562e},
keywords = {augmentation counting semisup},
month = mar,
posted-at = {2018-04-11 09:21:19},
priority = {0},
timestamp = {2019-02-27T22:23:29.000+0100},
title = {{Leveraging Unlabeled Data for Crowd Counting by Learning to Rank}},
url = {http://arxiv.org/abs/1803.03095},
year = 2018
}