Count Anything
- URL: http://arxiv.org/abs/2605.30846v1
- Date: Fri, 29 May 2026 05:08:31 GMT
- Title: Count Anything
- Abstract summary: We study text-guided object counting across domains, where a model takes an image and a natural-language query as input and returns an instance-grounded set of target points.<n>Based on CLOC, we propose Count Anything, a generalist model for text-guided object counting.
- Score: 41.17667085289094
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Object counting remains fragmented across domain-specific datasets and task formulations, despite rapid progress in generalist vision models. Existing counting models are often tailored to scenarios such as crowds, vehicles, cells, crops, or remote-sensing objects, and thus struggle to generalize across categories, visual domains, object scales, and density distributions. In this paper, we study text-guided object counting across domains, where a model takes an image and a natural-language query as input and returns an instance-grounded set of target points whose cardinality gives the count. This formulation unifies category-conditioned counting with interpretable spatial localization. To support this setting, we construct CLOC, a Cross-domain Large-scale Object Counting dataset that reorganizes diverse public data sources into a unified benchmark. CLOC covers six visual domains: General Scene, Remote Sensing, Histopathology, Cellular Microscopy, Agriculture, and Microbiology, with about 220K images, 619 categories, and 15M object instances. Based on CLOC, we propose Count Anything, a generalist model for text-guided object counting. Unlike density-map-based methods, which dominate counting models, Count Anything adopts discrete instance points and performs dual-granularity instance enumeration. A Region-level Sparse Counter provides object-level anchors for large and sparse targets, while a Pixel-level Dense Counter handles small, crowded, and weakly bounded targets via dense point prediction. A point-centric supervision strategy enables learning from heterogeneous annotations, and Complementary Count Fusion combines both counters in a parameter-free manner. Extensive experiments show that Count Anything achieves strong accuracy and multi-domain generalization, outperforming existing open-world counting methods. Code is available at: https://github.com/Mengqi-Lei/count-anything.
Related papers
- Count Anything at Any Granularity [55.70950689938894]
KubriCount is the largest and most comprehensively annotated counting dataset to date.<n>We train a multi-grained counting model that jointly leverages text and visual exemplars as complementary target specifications.<n>HieraCount substantially improves multi-grained counting accuracy and generalizes robustly to challenging real-world scenarios.
arXiv Detail & Related papers (2026-05-11T17:32:37Z) - Bootstrapping MLLM for Weakly-Supervised Class-Agnostic Object Counting [59.37613121962146]
We propose WS-COC, the first MLLM-driven weakly-supervised framework for class-agnostic object counting.<n> WS-COC matches or even surpasses many state-of-art fully-supervised methods while significantly reducing annotation costs.
arXiv Detail & Related papers (2026-02-13T09:58:35Z) - OmniCount: Multi-label Object Counting with Semantic-Geometric Priors [52.28092505350977]
This paper introduces a more practical approach enabling simultaneous counting of multiple object categories using an open-vocabulary framework.<n>Our solution, OmniCount, stands out by using semantic and geometric insights (priors) from pre-trained models to count multiple categories of objects as specified by users.<n>Our comprehensive evaluation in OmniCount-191, alongside other leading benchmarks, demonstrates OmniCount's exceptional performance, significantly outpacing existing solutions.
arXiv Detail & Related papers (2024-03-08T16:38:11Z) - AFreeCA: Annotation-Free Counting for All [17.581015609730017]
We introduce an unsupervised sorting methodology to learn object-related features that are subsequently refined and anchored for counting purposes.
We also present a density classifier-guided method for dividing an image into patches containing objects that can be reliably counted.
arXiv Detail & Related papers (2024-03-07T23:18:34Z) - Point, Segment and Count: A Generalized Framework for Object Counting [40.192374437785155]
Class-agnostic object counting aims to count all objects in an image with respect to example boxes or class names.
We propose a generalized framework for both few-shot and zero-shot object counting based on detection.
PseCo achieves state-of-the-art performance in both few-shot/zero-shot object counting/detection.
arXiv Detail & Related papers (2023-11-21T06:55:21Z) - Zero-Shot Object Counting with Language-Vision Models [50.1159882903028]
Class-agnostic object counting aims to count object instances of an arbitrary class at test time.
Current methods require human-annotated exemplars as inputs which are often unavailable for novel categories.
We propose zero-shot object counting (ZSC), a new setting where only the class name is available during test time.
arXiv Detail & Related papers (2023-09-22T14:48:42Z) - Dilated-Scale-Aware Attention ConvNet For Multi-Class Object Counting [18.733301622920102]
Multi-class object counting expands the scope of application of object counting task.
The multi-target detection task can achieve multi-class object counting in some scenarios.
We propose a simple yet efficient counting network based on point-level annotations.
arXiv Detail & Related papers (2020-12-15T08:38:28Z) - Rethinking Object Detection in Retail Stores [55.359582952686175]
We propose a new task, simultaneously object localization and counting, abbreviated as Locount.
Locount requires algorithms to localize groups of objects of interest with the number of instances.
We collect a large-scale object localization and counting dataset with rich annotations in retail stores.
arXiv Detail & Related papers (2020-03-18T14:01:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.