paper-with-me

홈 › Papers

SYRAC: Synthesize, Rank, and Count

2023-10-02 · Adriano D'Alessandro, Ali Mahdavi-Amiri, Ghassan Hamarneh

Crowd counting is a critical task in computer vision, with several important applications. However, existing counting methods rely on labor-intensive density map annotations, necessitating the manual localization of each individual pedestrian. While recent efforts have attempted to alleviate the annotation burden through weakly or semi-supervised learning, these approaches fall short of significantly reducing the workload. We propose a novel approach to eliminate the annotation burden by leveraging latent diffusion models to generate synthetic data. However, these models struggle to reliably understand object quantities, leading to noisy annotations when prompted to produce images with a specific quantity of objects. To address this, we use latent diffusion models to create two types of synthetic data: one by removing pedestrians from real images, which generates ranked image pairs with a weak but reliable object quantity signal, and the other by generating synthetic images with a predetermined number of objects, offering a strong but noisy counting signal. Our method utilizes the ranking image pairs for pre-training and then fits a linear layer to the noisy synthetic images using these crowd quantity features. We report state-of-the-art results for unsupervised crowd counting.

📄 PDF Abstract BibTeX arXiv:2310.01662

Code (1)

adrian-dalessandro/SYRAC 공식 구현 tf

Tasks

Crowd Counting

Methods 이 논문이 사용한 방법론

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Exploring Collatz Dynamics with Human-LLM Collaboration

2026-03-10 · Edward Y. Chang arxiv

We present a comprehensive structural analysis of the Collatz conjecture through ~1014 computational experiments yielding 630 formal results. By systematically deploying 29 distinct mathematical paradigms--including tran…

Amortizing Pragmatic Program Synthesis with Rankings

2024-06-01 · Yewen Pu, Saujas Vaduguru, Priyan Vaithilingam, Elena Glassman 외

The usage of Rational Speech Acts (RSA) framework has been successful in building \emph{pragmatic} program synthesizers that return programs which, in addition to being logically consistent with user-generated examples, …

Program Synthesis

Amortizing Pragmatic Program Synthesis with Rankings

2023-09-01 · Yewen Pu, Saujas Vaduguru, Priyan Vaithilingam, Elena Glassman 외

In program synthesis, an intelligent system takes in a set of user-generated examples and returns a program that is logically consistent with these examples. The usage of Rational Speech Acts (RSA) framework has been suc…

Program Synthesis

Explain then Rank: Scale Calibration of Neural Rankers Using Natural Language Explanations from LLMs

2024-02-19 · Puxuan Yu, Daniel Cohen, Hemank Lamba, Joel Tetreault 외

In search settings, calibrating the scores during the ranking process to quantities such as click-through rates or relevance levels enhances a system's usefulness and trustworthiness for downstream users. While previous …

Document RankingLearning-To-Rank

Real-Time Packet Loss Concealment With Mixed Generative and Predictive Model

2022-05-11 · Jean-Marc Valin, Ahmed Mustafa, Christopher Montgomery, Timothy B. Terriberry 외

As deep speech enhancement algorithms have recently demonstrated capabilities greatly surpassing their traditional counterparts for suppressing noise, reverberation and echo, attention is turning to the problem of packet…

Packet Loss ConcealmentSpeech EnhancementSpeech Synthesis