paper-with-me

Papers

Vicinal Counting Networks

2021-09-29 · Viresh Ranjan, Minh Hoai

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. Our code and trained model will be released for research usage.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Crowd CountingData Augmentation

Similar Papers 제목 키워드 기반

Generalization Bounds for Vicinal Risk Minimization Principle

2018-11-11 · Chao Zhang, Min-Hsiu Hsieh, DaCheng Tao

The vicinal risk minimization (VRM) principle, first proposed by \citet{vapnik1999nature}, is an empirical risk minimization (ERM) variant that replaces Dirac masses with vicinal functions. Although there is strong numer…

Generalization Bounds

On the benefits of defining vicinal distributions in latent space

2020-03-14 · Puneet Mangla, Vedant Singh, Shreyas Jayant Havaldar, Vineeth N. Balasubramanian

The vicinal risk minimization (VRM) principle is an empirical risk minimization (ERM) variant that replaces Dirac masses with vicinal functions. There is strong numerical and theoretical evidence showing that VRM outperf…

Self-Calibrating Vicinal Risk Minimisation for Model Calibration

2024-01-01 · CVPR 2024 1 · Jiawei Liu, Changkun Ye, Ruikai Cui, Nick Barnes

Model calibration measuring the alignment between the prediction accuracy and model confidence is an important metric reflecting model trustworthiness. Existing dense binary classification methods without proper regu…

Binary Classificationmodel

Contrastive Vicinal Space for Unsupervised Domain Adaptation

2021-11-26 · Jaemin Na, Dongyoon Han, Hyung Jin Chang, Wonjun Hwang

Recent unsupervised domain adaptation methods have utilized vicinal space between the source and target domains. However, the equilibrium collapse of labels, a problem where the source labels are dominant over the target…

Domain AdaptationUnsupervised Domain Adaptation

VITA: A Multi-Source Vicinal Transfer Augmentation Method for Out-of-Distribution Generalization

2022-04-25 · Minghui Chen, Cheng Wen, Feng Zheng, Fengxiang He 외

Invariance to diverse types of image corruption, such as noise, blurring, or colour shifts, is essential to establish robust models in computer vision. Data augmentation has been the major approach in improving the robus…

Data AugmentationOut-of-Distribution Generalization