Robust object counting through distribution uncertainty matching and optimal transport

Object counting can be formulated as a density estimation task using point-annotated images. Although such labeling is cost-effective, trained models can be sensitive to annotation noise. In this paper, we propose a method called DUMLO (Distribution Uncertainty Matching for Loss Optimization) that defines a loss function between a ground-truth density map and a target density map by modeling uncertainty over an augmented set of points. DUMLO formulates the loss function as a coupling between two optimal transport problems, which involves an unknown density map defined over the augmented points. To solve the problem, we propose a new algorithm, called Trihorn, which jointly estimates the loss function and the density map of the augmentation set. The latter can be interpreted as a measure of the uncertainty associated with the annotations. We provide a theoretical analysis and show that the generalization error bound of the proposed loss is tight. We extensively evaluate our model on benchmark datasets from three real-world applications: pathology cell counting, crowd counting and Vehicle Images Datasets. Our results demonstrate that the proposed model achieves good performance in terms of Mean Absolute Error and is robust to annotation noise while exhibiting a fast convergence property.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-08-19
DOI
https://doi.org/10.1038/s41598-025-14056-2
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust object counting through distribution uncertainty matching and optimal transport

Marco Agus, Rachida Zegour, Jens Schneider, Nauman Ullah Gilal et al.
Scientific Reports
Data Management and Algorithms
article

Robust object counting through distribution uncertainty matching and optimal transport

Marco Agus, Rachida Zegour, Jens Schneider, Nauman Ullah Gilal, Sabri Boughorbel, Khaled Al Thelaya, Fethi Jarray
article en

Abstract

Object counting can be formulated as a density estimation task using point-annotated images. Although such labeling is cost-effective, trained models can be sensitive to annotation noise. In this paper, we propose a method called DUMLO (Distribution Uncertainty Matching for Loss Optimization) that defines a loss function between a ground-truth density map and a target density map by modeling uncertainty over an augmented set of points. DUMLO formulates the loss function as a coupling between two optimal transport problems, which involves an unknown density map defined over the augmented points. To solve the problem, we propose a new algorithm, called Trihorn, which jointly estimates the loss function and the density map of the augmentation set. The latter can be interpreted as a measure of the uncertainty associated with the annotations. We provide a theoretical analysis and show that the generalization error bound of the proposed loss is tight. We extensively evaluate our model on benchmark datasets from three real-world applications: pathology cell counting, crowd counting and Vehicle Images Datasets. Our results demonstrate that the proposed model achieves good performance in terms of Mean Absolute Error and is robust to annotation noise while exhibiting a fast convergence property.

Scientific ReportsVol. 15(1)
Institut des Régions Arides (TN), Hamad bin Khalifa University (QA), Tunis El Manar University (TN)
Hamad Bin Khalifa University
Openalex Percentile: Top 74%
Data Management and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.