2021
DOI: 10.1609/aaai.v35i3.16332
|View full text |Cite
|
Sign up to set email alerts
|

Learning to Count via Unbalanced Optimal Transport

Abstract: Counting dense crowds through computer vision technology has attracted widespread attention. Most crowd counting datasets use point annotations. In this paper, we formulate crowd counting as a measure regression problem to minimize the distance between two measures with different supports and unequal total mass. Specifically, we adopt the unbalanced optimal transport distance, which remains stable under spatial perturbations, to quantify the discrepancy between predicted density maps and point annotations. An … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 60 publications
(7 citation statements)
references
References 43 publications
0
6
0
Order By: Relevance
“…We use the mathematical tool of optimal transport (OT) to solve for Π . OT finds the most efficient way of moving mass between two distributions [30], and has previously been applied to single-cell alignment [11, 40] and spatial transcriptomics alignment [24, 45]. We seek to transport the mass of slice đť’® 1 to đť’® 2 where the mass is represented as a distribution over each slice’s spots.…”
Section: Methodsmentioning
confidence: 99%
“…We use the mathematical tool of optimal transport (OT) to solve for Π . OT finds the most efficient way of moving mass between two distributions [30], and has previously been applied to single-cell alignment [11, 40] and spatial transcriptomics alignment [24, 45]. We seek to transport the mass of slice đť’® 1 to đť’® 2 where the mass is represented as a distribution over each slice’s spots.…”
Section: Methodsmentioning
confidence: 99%
“…propose to use optimal transport to match the distributions of the point annotations and the density maps [38]. In [23], the unbalanced optimal transport is introduced to quantify the discrepancy between predicted density maps and point annotations. S3 further proposes semibalanced Sinkhorn divergence to solve the limitations of amount constraint and entropic bias [12].…”
Section: Related Work 21 Fully-supervised Crowd Countingmentioning
confidence: 99%
“…BL [3] introduces a novel loss function based on Bayes theorem, allowing the model to learn directly from the ground-truth point map. Out of the same purpose, several other works have incorporated optimal transport [4], [30]- [32] theory into crowd counting. Moreover, to enhance model performance, some approaches have designed to leverage auxiliary tasks such as foreground classification [33]- [35], depth estimation [24] and perspective estimation [25].…”
Section: A Fully-supervised Crowd Countingmentioning
confidence: 99%