Vicinal Counting Networks

被引:3
|
作者
Ranjan, Viresh [1 ]
Minh Hoai [1 ,2 ]
机构
[1] SUNY Stony Brook, Stony Brook, NY 11794 USA
[2] VinAI Res, Hanoi, Vietnam
关键词
D O I
10.1109/CVPRW56347.2022.00467
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We tackle the task of Few-Shot Counting. Given an image containing multiple objects of a novel visual category and few exemplar bounding boxes depicting the visual category of interest, we want to count all of the instances of the desired visual category in the image. A key challenge in building an accurate few-shot visual counter is the scarcity of annotated training data due to the laborious effort needed for collecting and annotating the data. To address this challenge, we propose Vicinal Counting Networks, which learn to augment the existing training data along with learning to count. A Vicinal Counting Network consists of a generator and a counting network. The generator takes as input an image along with a random noise vector and generates an augmented version of the input image. The counting network learns to count the objects in the original and augmented images. The training signal for the generator comes from the counting loss of the counting network, and the generator aims to synthesize images which result in a small counting loss. Unlike GANs which are trained in an adversarial setting, Vicinal Counting Networks are trained in a cooperative setting where the generator aims to help the counting network in achieving accurate predictions on the synthesized images. We also show that our proposed data augmentation framework can be extended to other counting tasks like crowd counting.
引用
收藏
页码:4220 / 4229
页数:10
相关论文
共 50 条
  • [1] COUNTING NETWORKS
    ASPNES, J
    HERLIHY, M
    SHAVIT, N
    [J]. JOURNAL OF THE ACM, 1994, 41 (05) : 1020 - 1048
  • [2] Counting Phylogenetic Networks
    Colin McDiarmid
    Charles Semple
    Dominic Welsh
    [J]. Annals of Combinatorics, 2015, 19 : 205 - 224
  • [3] Adaptive counting networks
    Tirthapura, S
    [J]. 25TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2005, : 241 - 250
  • [4] Linearizable counting networks
    Herlihy, M
    Shavit, N
    Waarts, O
    [J]. DISTRIBUTED COMPUTING, 1996, 9 (04) : 193 - 203
  • [5] Counting Phylogenetic Networks
    McDiarmid, Colin
    Semple, Charles
    Welsh, Dominic
    [J]. ANNALS OF COMBINATORICS, 2015, 19 (01) : 205 - 224
  • [6] Vicinal Vertex Allocation for Matrix Factorization in Networks
    He, Tiantian
    Bai, Lu
    Ong, Yew-Soon
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (08) : 8047 - 8060
  • [7] Cache Networks of Counting Queues
    Li, Yuanyuan
    Ioannidis, Stratis
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2021, 29 (06) : 2751 - 2764
  • [8] Fast counting with tensor networks
    Kourtis, Stefanos
    Chamon, Claudio
    Mucciolo, Eduardo R.
    Ruckenstein, Andrei E.
    [J]. SCIPOST PHYSICS, 2019, 7 (05):
  • [9] Butterfly Counting in Bipartite Networks
    Sanei-Mehri, Seyed-Vahid
    Sariyuce, Ahmet Erdem
    Tirthapura, Srikanta
    [J]. KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 2150 - 2159
  • [10] NOTES ON SORTING AND COUNTING NETWORKS
    HARDAVELLAS, N
    KARAKOS, D
    MAVRONICOLAS, M
    [J]. DISTRIBUTED ALGORITHMS, 1993, 725 : 234 - 248