Next Article in Journal
Non-Contact Measurement of LED Junction Temperature Based on Normalized Integral Width (NIW) of the Emission Spectrum
Previous Article in Journal
Noise Robustness Evaluation of Time–Frequency Networks (TFNs) for Intelligent Mechanical Fault Diagnosis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Systematic Review

Industrial Object Counting from Traditional Machine Vision to Open-World Foundation Models: A Systematic Review

1
School of Information and Communication Engineering, University of Electronic Science and Technology of China (UESTC), Chengdu 611731, China
2
School of Automation, Chengdu University of Information Technology, Chengdu 610225, China
3
Chongqing Innovation Center of Industrial Big-Data Co., Ltd., Chongqing 400707, China
4
School of Computer Science, Chengdu University of Information Technology, Chengdu 610225, China
5
School of Computer Science, Sichuan University, Chengdu 610059, China
6
Chengdu Sanshi Technology Co., Ltd., Chengdu 610041, China
*
Authors to whom correspondence should be addressed.
Sensors 2026, 26(14), 4494; https://doi.org/10.3390/s26144494
Submission received: 24 May 2026 / Revised: 30 June 2026 / Accepted: 12 July 2026 / Published: 15 July 2026

Abstract

As a fundamental and highly challenging task in the field of computer vision, industrial object counting plays a critical role in smart manufacturing, inventory management, and production process monitoring. Over the past fifteen years (2010–2025), this field has undergone a profound technological transformation, shifting from traditional machine vision methods relying on handcrafted features to a data-driven paradigm based on deep learning. This paper aims to provide a comprehensive and systematic review of this rapidly evolving research area, with technological evolution as the core narrative thread. First, we review early traditional methods, analyzing the application of sensor-based and template-matching technologies in controlled environments, as well as their core limitations in complex industrial scenarios. Subsequently, this paper focuses on exploring how the introduction of deep learning has reshaped the landscape of counting tasks, and elaborates on the breakthrough progress of convolutional neural networks (CNNs), Transformer architectures, the recently emerging Mamba state space model, and Large Foundation Models in addressing key challenges including occlusion, object overlap, multi-scale variation, and dense object counting. In particular, this paper conducts an in-depth analysis of the paradigm shift from Class-Specific Counting to Class-Agnostic Counting (CAC) and Exemplar-Free Counting. This trend significantly reduces the reliance on large-scale annotated data and greatly enhances the generalization ability of models in open-world scenarios. Additionally, this paper systematically organizes mainstream datasets in the field, including FSC-147, NWPU-MOC, and OmniCount-191, and compares core evaluation metrics such as Mean Absolute Error (MAE), Root Mean Square Error (RMSE), and the PrACo metric system. In response to the core technical challenges faced by current methods, including high annotation costs, weak cross-domain adaptability, and strict real-time requirements in industrial scenarios, this paper proposes key future research directions including lightweight model design, unsupervised learning, multi-modal fusion, and Prompt-based interactive counting. This review intends to provide researchers in both academia and industry with a complete technical blueprint so as to promote the continuous development of industrial object-counting technology toward a more efficient and intelligent direction.

1. Introduction

1.1. Definition and Background of Industrial Object Counting

Industrial object counting is a fundamental and critical task in the field of computer vision, whose core goal is to accurately estimate the quantity of workpieces, components, or finished products within a specific region from static images or dynamic video streams. Driven by the wave of Industry 4.0 and smart manufacturing, the automation and intellectualization of production processes have become the core of the transformation and upgrading of the manufacturing industry. As a key link in production efficiency evaluation, logistics and warehouse inventory, and quality control closed loops, automated object-counting systems are gradually replacing traditional manual statistics—which are inefficient and error-prone—and have become an indispensable standard configuration in smart factories.
However, compared with counting tasks in ordinary daily scenarios, the industrial environment presents unique complexity and challenges:
Highly similar appearance and dense distribution [1,2,3]: workpieces often have highly similar textures and shapes, and are stacked at extremely high densities, leading to severe occlusion and adhesion.
Variable environmental conditions [4,5]: environmental factors such as illumination and dust at production sites are complex and changeable, placing higher demands on the robustness of visual systems.
Significant differences in target scales [6,7]: the size range of targets to be counted is extremely wide, from micron-level electronic components to meter-level large mechanical parts, requiring algorithms to have strong multi-scale adaptability.
These factors make it highly challenging to quickly and accurately answer the question “how many targets are there in the field of view” without manual intervention. To overcome these difficulties, automatic counting technology based on computer vision has undergone significant evolution. In the early stage, researchers naturally attempted to migrate mature object detection technology to industrial scenarios. Object detection aims to accurately identify and locate each target instance in an image through bounding boxes, which provides an intuitive path for realizing counting.
It is worth noting that the scope of “industrial object counting” in this review is not limited to traditional manufacturing workshop scenarios. We adopt a broad definition of industrial scenarios, covering a wide range of application fields where automated counting technology plays a critical role in industrial production and operation. The main application categories include:
  • Manufacturing production scenarios:
    Counting of workpieces, components, and finished products on production lines, which is the most traditional and core application scenario of industrial object counting. This includes electronic component counting, mechanical part statistics, and product quantity verification on assembly lines.
  • Warehouse logistics scenarios:
    Inventory counting and cargo statistics in warehouses and logistics centers, including pallet counting, box quantity statistics, and inventory automatic verification. This type of scenario is an important extension of industrial counting in the supply chain link.
  • Industrial remote sensing scenarios:
    Large-scale target counting in industrial infrastructure and resource monitoring using aerial or satellite remote sensing images, such as counting of mining equipment, oil storage tanks, solar panels, and wind turbines. This type of scenario has unique requirements for large-field-of-view and multi-scale adaptation capabilities.
  • Agricultural industrialization scenarios:
    Crop counting and yield estimation in the context of agricultural industrialization and smart agriculture, such as fruit counting, crop seedling statistics, and aquaculture population estimation. Although agriculture is traditionally not classified as industry in the narrow sense, the technical challenges (occlusion, dense distribution, multi-scale variation) and technical solutions of counting tasks in agricultural industrialization are highly consistent with those in industrial scenarios, and the methods are fully transferable.
  • Transportation and parking scenarios:
    Vehicle counting in industrial parks, ports, and large parking lots, which is important for intelligent traffic management and resource scheduling in industrial zones. The density map regression and multi-scale adaptation technologies developed for these scenarios have strong reference value for industrial counting.
The reason we adopt such a broad definition is that the core technical challenges faced by counting tasks in these scenarios are highly similar, including occlusion and overlap, multi-scale variation, dense distribution, and environmental interference. The technical methods developed for one scenario can often be effectively migrated to other scenarios. Therefore, a cross-domain review can provide more comprehensive technical reference for researchers and engineers in the industrial counting field.

1.2. Distinction Between Object Detection and Object Counting

Although object detection and object counting share many mechanisms for feature extraction and pattern recognition at the technical level, their task objectives and constraints differ significantly.
The core task of object detection is localization and classification, which involves identifying all objects of interest in an image, accurately marking their positions with bounding boxes, and outputting corresponding category labels simultaneously. Its optimization objectives include classification accuracy and localization precision (e.g., Intersection over Union, IoU). Detection tasks impose extremely high requirements on annotated data, demanding precise box-level annotations. Moreover, in extremely dense scenarios, traditional detectors tend to suppress adjacent true objects due to the non-maximum suppression (NMS) operation, which leads to missed detection [8].
The primary task of object counting is quantity estimation, i.e., outputting the total number of objects in an image. Although detection-based counting is an intuitive approach to achieve counting, the counting task itself does not necessarily require precise bounding boxes. Modern counting methods mostly adopt strategies based on density map estimation [9] or direct regression, which only require point supervision [10] or even image-level annotations. These methods can better handle occlusion and high-density problems, and their computational efficiency is often superior to that of complex detectors.

1.3. Main Contributions of This Review

To the best of our knowledge, this paper presents the first comprehensive systematic review specifically focused on industrial object counting, covering the entire technological evolution from traditional machine vision to open-world foundation models over the past 15 years. The main contributions of this review are as follows:
  • Comprehensive technological evolution roadmap: We systematically review the complete technological evolution route of industrial object counting from 2010 to 2025, covering all major technical paradigms including traditional machine vision methods, convolutional neural networks, Transformer architectures, state space models (Mamba), and vision foundation models, clearly presenting the core ideas, representative methods, and technical characteristics of each stage.
  • Deep focus on industrial scenario characteristics: Unlike general counting surveys that focus on crowd counting or general object counting, this review specifically focuses on industrial scenarios, providing in-depth analysis of unique challenges in industrial environments (such as occlusion and overlap, multi-scale variation, illumination interference, real-time requirements, edge deployment constraints, etc.), as well as specialized solutions to these challenges.
  • In-depth analysis of emerging counting paradigms: We systematically summarize and analyze emerging counting paradigms such as Class-Agnostic Counting (CAC), Exemplar-Free Counting (EFC), and foundation model-driven zero-shot/training-free counting, deeply exploring their technical principles, applicable scenarios, and industrial application value.
  • Systematic summary of challenges and future directions: We comprehensively summarize the core challenges faced by industrial object counting, including data annotation bottlenecks, domain adaptation difficulties, real-time edge deployment constraints, and open-world generalization capabilities. Based on current technology trends, we propose five promising future research directions.
  • Standardized review methodology: This review strictly follows the PRISMA 2020 systematic review specification, clearly defining literature inclusion and exclusion criteria, search strategies, screening processes, and data extraction methods to ensure the scientific rigor, transparency, and reproducibility of this review.

1.4. Comparison with Existing Reviews

To clarify the positioning and unique value of this review, we compare it with existing review papers in related fields from multiple dimensions. The comparison results are summarized in Table 1.
As can be seen from Table 1, existing review papers have their own focuses but also have certain limitations: crowd-counting surveys mainly focus on public safety scenarios and have insufficient coverage of industrial characteristics [11]; general counting surveys focus on general object-counting scenarios and lack in-depth analysis of industrial-specific challenges [12]; industrial vision surveys mostly focus on defect detection and object detection tasks and rarely involve counting tasks [13,14]; foundation model surveys focus on general vision foundation models and lack discussion on industrial deployment constraints and counting-specific adaptations.
Compared with existing reviews, this paper has the following unique values: (1) it is the first comprehensive review specifically targeting industrial object counting, filling the gap in this specialized field; (2) it covers the most complete technical evolution path, from traditional machine vision to the latest open-world foundation models; (3) it deeply combines industrial scenario characteristics, systematically analyzing industrial-specific challenges and corresponding solutions; and (4) it strictly follows the PRISMA 2020 systematic review specification, ensuring the scientific rigor and transparency of this review.

1.5. Paper Structure

This paper comprehensively reviews the technologies for industrial object counting in accordance with the timeline and logical context of their technological evolution. Section 2 retraces the technological roadmap of industrial object-counting techniques. Section 3 delves into the principles and evolution of core algorithms, covering architectures such as CNN, Transformer, and Mamba [15]. Section 4 elaborates on emerging paradigms including class-agnostic counting and exemplar-free counting. Section 5 analyzes mainstream datasets and evaluation metrics. Section 6 discusses the specific challenges and corresponding solutions in industrial scenarios. Finally, Section 7 presents an outlook on future research directions for this field.

2. Review Methodology

This section systematically presents the review methodology of this paper, including eligibility criteria, literature search strategy, study selection process, data extraction methods, and synthesis approach. The entire review process strictly follows the PRISMA 2020 specification to ensure the transparency, reproducibility, and scientific rigor of this systematic review.
This systematic review was conducted and reported in strict accordance with the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) 2020 guidelines. The entire review process was designed to ensure transparency, reproducibility, and comprehensiveness in covering the state of the art of industrial object-counting technologies from 2010 to 2025.

2.1. Eligibility Criteria

Studies were included in this review if they satisfied all of the following criteria:
  • Peer-reviewed full-text articles published in English between 1 January 2010 and 28 May 2026.
  • Focused on object-counting algorithms, systems, or applications specifically targeting industrial scenarios.
  • Presented original quantitative experimental results, including performance evaluation on standard datasets or real industrial deployments.
  • Proposed novel technical contributions (e.g., algorithm architectures, training strategies, or evaluation methods).
Studies were excluded if they met any of the following criteria:
  • Non-English publications, patents, conference abstracts, book chapters, review articles, or editorials.
  • Focused exclusively on non-industrial counting domains (e.g., medical cell counting, crowd counting, traffic counting without industrial relevance).
  • Did not provide quantitative performance metrics or sufficient experimental details for replication.
  • Were duplicate publications of the same study (only the most complete and recent version was retained).
  • Were purely theoretical studies without experimental validation.
All included studies were categorized into three mutually exclusive groups for narrative synthesis based on their underlying technical paradigm, which aligns with the evolutionary timeline of industrial object-counting technologies:
  • Traditional machine vision methods (2010–2014).
  • Deep learning-based methods (2014–2020).
  • Large foundation models and open-world counting methods (2021–2025).
In addition to the above eligibility criteria, we adopted a multi-dimensional literature selection principle to ensure the comprehensiveness, representativeness, and technical depth of this review:
  • Technical representativeness principle:
    For each technical direction (e.g., CNN-based density map regression, Transformer-based counting, class-agnostic counting, foundation model-based counting), we prioritized selecting studies that proposed novel architectures, achieved state-of-the-art performance, or had significant influence on subsequent research. We ensured that each major technical branch had representative works included, avoiding bias towards any specific research group or methodology.
  • Industrial relevance principle:
    We included studies that, while not explicitly labeled as “industrial,” proposed technical methods with clear application potential in industrial scenarios (e.g., crowd-counting methods with density map regression architectures that can be migrated to dense workpiece counting, remote sensing object-counting methods with multi-scale adaptation capabilities applicable to large-field-of-view industrial inspection). The industrial applicability of such methods is explicitly discussed in the corresponding sections of this review.
  • Temporal coverage principle:
    We ensured coverage of the complete technological evolution trajectory from 2010 to 2025, including landmark studies that marked important paradigm shifts (e.g., the transition from traditional machine vision to deep learning, the emergence of Transformer architectures, and the rise of foundation models). This allows readers to clearly understand the historical development context of industrial object-counting technology.
  • Scenario diversity principle:
    We selected studies covering diverse industrial application scenarios, including manufacturing production lines, warehouse logistics, electronic component inspection, industrial remote sensing, and agricultural industrialization. This ensures that this review reflects the wide applicability of object-counting technology across different industrial domains rather than being limited to a single scenario.
  • Quality priority principle:
    We prioritized studies published in high-impact journals and top-tier conferences (e.g., IEEE Transactions on Image Processing, CVPR, ICCV, ECCV, AAAI) as they typically represent the highest level of research in the field. However, we also included valuable studies from specialized industrial journals and conference proceedings to ensure coverage of domain-specific practical innovations.
It should be noted that due to the interdisciplinary nature of industrial object counting, which spans computer vision, industrial engineering, and robotics, some relevant studies may be published under different disciplinary terminologies. Our search strategy was designed to balance sensitivity and specificity to minimize the risk of missing important studies while maintaining focus on the core topic.

2.2. Information Sources and Search Strategy

A comprehensive systematic search was performed across four major academic databases that cover the majority of publications in computer vision and industrial engineering:
  • IEEE Xplore Digital Library.
  • ACM Digital Library.
  • Web of Science Core Collection.
  • arXiv preprint server (to capture the latest preprint studies in this rapidly evolving field).
The last comprehensive search was conducted on 28 May 2026. The core search string used across all databases was optimized to balance sensitivity and specificity:
(industrial object counting OR workpiece counting~OR
 
part counting OR component counting) AND
 
(machine vision~OR
 
computer vision OR deep learning OR convolutional neural network~OR
 
CNN OR Transformer OR Mamba OR state space model OR foundation model~OR
 
large language model OR class-agnostic counting OR zero-shot counting)
Database-specific filters were applied to limit results to the specified publication date range and relevant subject categories (e.g., computer science, engineering). To identify any potentially missed studies, the reference lists of all included primary studies and relevant review articles were manually screened for additional eligible publications.

2.3. Study Selection Process

The study selection process was performed independently by two reviewers (Wei Wang and Shengjie Zhang) to minimize selection bias. Any disagreements between the two reviewers were resolved through discussion with a third senior reviewer (Jin He) until a consensus was reached.
The selection process consisted of two sequential stages:
  • Title and abstract screening: all retrieved records were screened based on the eligibility criteria to exclude obviously irrelevant studies.
  • Full-text assessment: all studies deemed potentially relevant during the title/abstract screening were retrieved for full-text evaluation to confirm their eligibility.
Zotero (version 6.0.30) was used for literature management, duplicate removal, and reference organization. No automated screening tools were used in this review process.

2.4. Data Extraction and Synthesis

A standardized data extraction form was developed a priori and used to extract relevant information from each included study. Data extraction was performed independently by two reviewers (Wei Wang and Shengjie Zhang), and any discrepancies were cross-checked and resolved by consensus.
The following information was extracted from each included study:
  • Basic study characteristics: authors, publication year, and publication venue.
  • Dataset details: name of the dataset used, number of images, and number of categories.
  • Algorithm architecture: core backbone network, technical innovations, and training strategy.
  • Performance metrics: Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), Frames Per Second (FPS), and AP50 (where reported).
  • Computational efficiency: model parameters (M), floating-point operations (FLOPs, G), and inference latency (ms).
  • Application scenario: specific industrial domain and type of objects counted.
Missing data were explicitly labeled as “Not reported” in the synthesis. No study authors were contacted to obtain additional or missing data.
A narrative synthesis approach was adopted to summarize the findings of this review. Quantitative meta-analysis was not performed due to significant heterogeneity across the included studies in terms of datasets used, evaluation metrics, and experimental setups, which would have made pooled effect estimates statistically invalid.

2.5. Study Selection Results

The complete study selection process is summarized in the PRISMA 2020 flow diagram (Figure 1).
A total of 1474 records were initially identified: 1427 from the systematic database searches and 47 from the manual screening of reference lists. After removing 525 duplicate records, 949 unique records remained for title and abstract screening. Of these, 715 records were excluded as irrelevant, leaving 234 records for full-text assessment.
After full-text evaluation, 78 studies were excluded for the following reasons:
  • 32 studies focused exclusively on non-industrial counting scenarios.
  • 21 studies were review articles rather than original research.
  • 15 studies were conference abstracts without accompanying full-text papers.
  • 10 studies did not provide sufficient quantitative performance metrics.
Finally, 156 original research studies met all eligibility criteria and were included in this systematic review.

2.6. Registration Information

This systematic review has been retrospectively registered on the Open Science Framework (OSF), a widely recognized open science platform, with registration number: osf.io/tj9cg (registration date: 11 June 2026). No formal written review protocol was prepared prior to conducting this review, and no amendments were made to the registration information after submission.

3. Technological Roadmap for Fifteen Years of Industrial Object Counting

The development of industrial object-counting techniques can be regarded as an evolutionary process from rule-driven to data-driven, and further to knowledge-driven paradigms. This evolution is roughly divided into three phases: the era of traditional machine vision (before 2014), the boom era of deep learning (2014–2020), and the era of large models and open-world counting (2021–2025), see Figure 2.

3.1. Traditional Machine Vision Era: Hand-Crafted Features and Rule Engineering

In the era before the popularization of deep learning, industrial counting mainly relied on physical sensors and image-processing algorithms based on hand-crafted features.

3.1.1. Sensor-Based Counting Systems

Traditional counting methods are based on sensors [16,17,18,19,20]. Object counting is essentially a template-matching problem [16], a computer vision technology that detects and counts structured objects by finding regions in an image that are most similar to a given template. This method was common in early industrial applications and is generally suitable for images with a single background and regular objects.
Reference [16] proposed a real-time counting system combining traditional image processing with embedded hardware. This method identifies targets through a minimum distance (Euclidean distance) classifier, and establishes a feature vector based on area, perimeter, radius of the enclosing circle, and compactness for matching judgment. This method performs well in scenarios with a single object and limited background, and has low computational resource consumption.
However, this method has some problems, such as high environmental sensitivity—illumination changes and mechanical vibrations are likely to cause mismatching. To this end, the system needs to use Gaussian filtering, binarization and morphological operations to suppress noise [16], but it still lacks robustness in adhesion and occlusion scenarios. Secondly, the system has weak generalization ability; when the category of the identified target changes, it is necessary to manually re-collect features and adjust parameters, which is very cumbersome. At the same time, Reference [16] points out that the system can only perform recognition when the feature vector of each target object is stored in advance.

3.1.2. Handcrafted Feature-Based Visual Counting

With the intervention of image-processing technology, researchers began to use morphological operations such as threshold segmentation [21], edge detection (Canny operator) [22], and watershed algorithm [23] to separate foreground targets from the background for scenarios with simple backgrounds, and then directly count the number of targets through connected component analysis. Refs. [24,25] Such methods are simple to implement and low in overhead, but have poor robustness to illumination and target appearance changes. To enhance robustness to scale and rotation changes, researchers introduced local invariant feature descriptors—SIFT [26,27] and its accelerated version SURF [28], and used key point matching to complete cross-view instance recognition and counting. At the same time, the HOG descriptor proposed by Dalal and Triggs provides a powerful shape feature representation through local gradient direction statistics [29], which is often combined with linear SVM or random forest to form a “sliding window + classifier” detection and counting pipeline, especially suitable for the recognition of pedestrians and rigid workpieces. To solve more complex configuration changes and partial occlusion, researchers proposed the deformable part model (DPM) [30], which models objects as a combination of multiple deformable parts to improve detection stability. For the counting demand in extremely dense scenarios (thousands of targets in a single image), researchers proposed a multi-source counting framework fusing low-confidence head detection, SIFT texture repetition features, and frequency domain analysis. The framework first obtains an initial count through local multi-scale analysis, and then uses the Markov Random Field (MRF) to impose global consistency constraints to correct local counting deviations [3].

3.2. Deep Learning Boom Era: Dominance of CNNs

The emergence of AlexNet in 2012 marked the advent of the deep learning era. By 2013, relevant research had laid the foundation through a CNN-based multi-task unified framework: this framework efficiently extracted features via multi-scale sliding windows, learned object boundary predictions to improve localization accuracy, and adopted a bounding box accumulation strategy instead of suppression, simultaneously completing classification, localization, and detection within a single network [31]. This achievement validated the potential of CNNs in multi-task collaboration. The proposal of R-CNN in 2014 further introduced Convolutional Neural Networks (CNNs) to the field of object detection and counting [32]. Adopting a two-stage pipeline of “selective search for candidate region generation → CNN-based fixed-size region feature extraction → SVM classification combined with bounding box regression”, it introduced deep CNN features to object detection for the first time, counting objects by aggregating detection results, providing a deep learning-based foundational framework for industrial object counting.

3.2.1. Detection-Based Counting

Generic detection frameworks such as Faster R-CNN [33], YOLO (You Only Look Once) [34], and SSD (Single Shot MultiBox Detector) [35] were quickly adapted to industrial scenarios [8]. By learning deep semantic features, these models can accurately identify and localize workpieces under complex backgrounds. In particular, the YOLO series [36,37] satisfies the real-time requirements of industrial production lines owing to its superior inference speed. However, such methods suffer from expensive bounding box annotation costs and still struggle with heavy occlusion in dense scenes.

3.2.2. Density Map Estimation-Based Counting

To alleviate issues caused by dense occlusion, Lempitsky et al. proposed a density map regression method [9]. Rather than directly localizing each instance, this approach learns a mapping from image features to a density map via CNNs, where the integral of the density map over the image gives the total object count. This provided an early solution for perspective-insensitive counting tasks [38]. After achieving remarkable success in crowd counting, this paradigm was extended to industrial dense small-object counting, offering an effective way to handle high-density stacking (e.g., material piles, particles, tiny components). It has been widely adopted and improved in subsequent studies (including industrial applications) to address occlusion and dense distribution challenges [9,38,39,40,41,42].

3.3. Large Models and Open-World Era: Rise of Transformers and Mamba

Since 2020, with the wide application of Transformer architectures in computer vision [43] and the recent emergence of the Mamba model, object counting has entered a new development phase.

3.3.1. Global Modeling and Attention Mechanisms

Transformers [44,45,46] capture long-range dependencies in images using self-attention, overcoming the limited receptive field of CNNs [43,47]. Variants such as Swin Transformer further strengthen multi-scale feature extraction through hierarchical structures [48].

3.3.2. Class-Agnostic and Zero-Shot Counting

To address the challenges of a large variety of workpieces and rapid product iteration in industrial scenarios, the research focus has shifted to Class-Agnostic Counting (CAC) [47] and Zero-Shot Counting (ZSC) [49]. By leveraging large-scale pre-trained foundation models such as CLIP [50] and the Segment Anything Model (SAM), the system can count arbitrary new categories of industrial workpieces via text prompts or a small number of examples without retraining. CLIP-based methods achieve a generalization accuracy of over 85% (i.e., the counting accuracy on previously unseen workpiece categories that were not included in the training set, measured as the percentage of test samples whose counting error is within an acceptable range) for counting newly emerged industrial workpiece categories, representing an approximate 40% improvement in generalization performance compared with traditional CNN models [47,50,51,52], which greatly enhances the flexibility and generalization capability of the system [53], see Table 2.

4. In-Depth Analysis of Core Algorithms and Technical Architectures

This chapter elaborates on the architectures of the core algorithms that support modern industrial object-counting systems, analyzing their working principles, advantages, and applicability in industrial scenarios.

4.1. Convolutional Neural Networks (CNNs): The Cornerstone of Industrial Vision

Using their characteristics of local reception, weight sharing, and spatial downsampling, CNNs have become powerful tools for extracting image features. Refs. [33,54,55,56,57,58,59]. In industrial counting, CNNs exist mainly in the following forms:

4.1.1. Detection-Driven Counters

Two-stage Networks [60,61,62]: Representative examples include Faster R-CNN [33,57,61]. They introduce a Region Proposal Network (RPN) to generate candidate regions, followed by fine-grained classification and regression. Such models are widely adopted in industrial scenarios requiring high precision (e.g., defect detection and counting) despite their relatively slow inference speed. For instance, WPCNet proposed in [58], based on a two-stage detection architecture, achieves high-precision localization and counting of workpieces (e.g., scattered metal parts) in unrestricted industrial environments, addressing the missed detection issue of traditional detectors under dense occlusion.
One-stage Networks: Typical models include the YOLO series [34,63,64,65] and SSD (Single Shot MultiBox Detector) [35,66]. They directly regress bounding boxes and category probabilities at multiple locations in the image, eliminating the candidate region generation step and significantly improving speed. YOLO models are usually the preferred choice for fast-moving workpieces on production lines. However, early versions performed less well in small object detection compared to two-stage networks; subsequent versions (e.g., YOLOv7/v8) mitigated this issue through Feature Pyramid Networks (FPN) [67] and multi-scale training. Reference [4] integrates the multi-scale feature extraction module of YOLOv8 with the fine-grained classification head of Faster R-CNN to construct a counting model suitable for agricultural product processing scenarios. Through adaptive anchor box adjustment and FPN enhancement, it realizes fast localization and counting of strawberries at different ripening stages, with strong robustness to lighting changes. Its limitation lies in limited ability to recognize tiny defective fruits under complex backgrounds and susceptibility to counting deviations when bounding boxes overlap.

4.1.2. Density Regression Networks

Fully Convolutional Networks (FCNs) [68,69]: Designed for dense counting, FCNs remove fully connected layers, enabling them to accept inputs of arbitrary sizes and output pixel-level density maps. For example, reference [70] proposes SAU-net, a U-shaped network based on the FCN architecture, as a microbial counting model suitable for industrial biofermentation scenarios. By removing fully connected layers and introducing transposed convolution, it generates pixel-level density maps, where the integral of the density map gives the total number of targets. This architecture has also achieved joint optimization of detection and counting in microscopic cell counting [69].
Multi-Column CNNs (MCNNs): A Multi-Column Convolutional Neural Network (MCNN) adopts parallel convolution branches with different kernel sizes to extract multi-scale features, which is designed to adapt to the drastic scale variation of targets caused by perspective effects (e.g., the size difference between near and far objects in industrial surveillance scenarios) [6]. Reference [71] constructs a multi-scale industrial vehicle counting model based on MCNN, which uses three parallel CNN branches with convolution kernel sizes of 3 × 3, 5 × 5, and 7 × 7 to extract features for cars, trucks and other targets with different sizes, and generates the density map for counting after feature fusion. It has strong adaptability to target scale changes caused by perspective effects, and can balance the counting accuracy of both small targets at long distances and large targets at close distances, see Figure 3.
However, its multi-column parallel architecture leads to severe parameter redundancy and low computational efficiency. Under the 512 × 512 input resolution commonly used in industrial scenarios, MCNN has 17.2 M parameters and 128.4 G floating point operations (FLOPs). Compared with CSRNet, the classic single-column density map baseline with the same counting accuracy, its FLOPs increase by 86.9% and inference speed decreases by 32.7%. Compared with SFCN, the lightweight single-column baseline widely used in industrial scenarios, its parameter quantity increases by 97.7% and the peak frame per second (FPS) decreases by 59.4% [1,6,72]. Model compression and optimization such as network pruning and knowledge distillation are required to adapt to the real-time counting requirements of industrial production lines. The comprehensive computational efficiency comparison between MCNN and mainstream baselines is summarized in Table 3.
CSRNet It uses dilated convolution to expand the receptive field without reducing resolution, generating high-quality density maps that effectively address the adhesion recognition problem of dense workpieces [1].
C-FCRN To address the counting of tiny dense targets under low contrast and complex backgrounds, relevant research further optimized the density regression architecture by proposing a Cascaded Fully Convolutional Regression Network (C-FCRN). It accurately estimates density maps by fusing multi-scale image features and designs an Auxiliary Convolutional Neural Network (AuxCNN) to supervise the training of intermediate layers of C-FCRN, significantly improving the model’s generalization performance on unseen datasets. This method has been validated in microscopic cell counting tasks, successfully addressing challenges such as cell occlusion and large shape variations [73].

4.2. Transformer Architectures: Capturers of Global Context

The introduction of the Transformer architecture has addressed the core limitation of convolutional neural networks (CNNs), which suffer from restricted local receptive fields and an inability to capture long-range global contextual information [74]. In industrial object-counting tasks, understanding the global background is crucial for distinguishing foreground objects from interference. Traditional CNNs can only perform recognition by relying on local texture and edge features, which are highly prone to feature confusion under complex interference in industrial scenarios. In contrast, the Transformer models the semantic correlations and spatial geometric relationships of all image pixels through the self-attention mechanism, enabling accurate differentiation between foreground objects and interference from a global perspective. For instance, Reference [75] validated that Transformer-based global contextual modeling can effectively suppress local feature interference caused by metal reflections and surface scratches in the scenario of industrial electronic component counting. In the task of counting dense surface mount electronic components, the mean absolute error (MAE) is reduced by 37.2% compared with the classic CNN architecture (CSRNet).

4.2.1. DETR (DEtection TRansformer)

DETR formulates object detection as a set prediction problem, utilizing the Transformer’s encoder-decoder architecture and bipartite matching loss to directly output a fixed number of target predictions, completely abandoning Non-Maximum Suppression (NMS) and anchor box design. Counting-DETR further optimizes this architecture through a two-stage training strategy and an uncertainty-aware module, achieving high-precision counting and detection under few-shot conditions [76]. For example, reference [77] builds on the Counting-DETR architecture, extracting global features via the Transformer encoder and outputting target set predictions through the decoder. By manually supplementing a small number of example boxes to optimize model predictions, it achieves accurate counting under few-shot conditions without the need for large-scale annotations [78].

4.2.2. Swin Transformer, CrowdFormer  and GCA-SUNet

Swin Transformer introduces locality through a shifted window mechanism to reduce computational complexity, while variants such as CrowdFormer further optimize global modeling in dense scenarios [48,79,80]. GCA-SUNet (Gated Context-Aware Swin-UNet), built on Swin-UNet, designs a gated context-aware modulation module. This module uses self-similarity matrices to capture repetitive patterns among targets and suppresses background noise through a gating mechanism. For Exemplar-Free Counting tasks, this architecture can automatically discover and count prominently repetitive objects in images (e.g., neatly arranged parts on pallets) without manual category specification. Reference [75] constructs an industrial electronic component counting model based on Swin Transformer, incorporating the gated context-aware module of GCA-SUNet. It captures global contextual information through a shifted window self-attention mechanism and identifies repetitive patterns of electronic components using self-similarity matrices. Its working principle involves adopting a hierarchical feature extraction architecture, generating multi-scale feature maps through patch partition and patch merging, suppressing background noise via the gated context-aware module, and adapting to electronic components of different sizes through the scale-aware module.

4.3. Mamba and State Space Models: A Breakthrough in Linear Complexity

With the continuous improvement in industrial camera resolution, the quadratic computational complexity of traditional Transformers has become a bottleneck. Based on Selective State Space Models (SSMs), the Mamba model achieves linear computational complexity while maintaining global modeling capabilities [81].

Horizontal Comparison of Mainstream Counting Architectures

From the perspective of technical pedigree, SSM-based counting methods represented by Mamba-MOC show differentiated characteristics compared with the other two mainstream architectures (Transformer and CNN), and each has its own applicable scenarios in industrial counting tasks. The specific comparative analysis is as follows:
  • Compared with Transformer-based methods: The linear complexity of Mamba-MOC enables its inference speed to be more than 40% higher than Swin Transformer baselines with comparable accuracy [48,82]. However, its generalization performance in few-shot industrial scenarios and fine-grained feature matching capability are slightly inferior to Transformer architectures with mature self-attention mechanisms. In addition, CrowdFormer and other Transformer variants optimized for dense counting have achieved better performance on crowd-counting benchmarks, but their industrial-specific adaptation still needs further verification [79].
  • Compared with CNN-based methods: Mamba-MOC combines global modeling capability and lightweight advantages, and its overall counting accuracy far exceeds common industrial CNN baselines such as CSRNet [1,82]. Nevertheless, the operator ecosystem, industrial hardware adaptation maturity and engineering landing experience of SSM architectures are still far less developed than CNN technologies that have been verified for many years. At present, CNN-based methods are still the most widely adopted schemes in actual industrial production lines [6].
  • Development status of SSM counting methods: Benefiting from the linear complexity advantage of selective state space models [81], SSM-based counting methods have developed rapidly in recent years. In addition to Mamba-MOC for industrial remote sensing scenarios, researchers have also explored SSM architectures in general dense counting tasks. On the whole, SSM counting research dedicated to industrial production scenarios is still in its initial exploratory stage, and there is still a lack of large-scale industrial landing verification.

4.4. Visual Foundation Models: A New Paradigm for Zero-Shot and Training-Free Counting

The era of large models has brought a new “Pretrain-Prompt” workflow, endowing models with strong zero-shot transfer capabilities.

4.4.1. CLIP-Based Counting

CLIP (Contrastive Language-Image Pre-training) aligns visual and linguistic spaces through large-scale image-text pair training [50]. Methods such as CLIP-Count leverage this characteristic to guide the model in generating corresponding density maps by inputting text prompts (e.g., “three gears”), achieving zero-shot counting without visual examples. T2ICount further utilizes the generative prior of pre-trained diffusion models and enhances the model’s sensitivity to fine-grained text descriptions through a hierarchical semantic correction module [83].
From the perspective of internal principles, Vision-Language Models (VLMs) represented by CLIP realize the alignment of visual and semantic spaces through large-scale contrastive pre-training on hundreds of millions of image-text pairs [84]. The core mechanism is to maximize the similarity between matched image-text pairs while minimizing the similarity between unmatched pairs in the joint embedding space. This pre-training paradigm endows the model with strong zero-shot transfer capability: for any new category described in natural language, the model can directly match it with visual features without retraining. In addition to CLIP, a series of VLM architectures with different design focuses have emerged in recent years, such as the BLIP series with enhanced captioning and grounding capabilities [85], FLAVA with unified multimodal modeling, and ALIGN with larger-scale noisy data pre-training. These models differ in pre-training data scale, model architecture, and downstream task adaptation capabilities, but they all follow the core idea of vision-language alignment.
In the field of object counting, the working mechanism of VLM-based methods can be summarized into two main technical routes: one is the text-guided density map generation route represented by CLIP-Count, which uses text features as conditions to guide the density map prediction network, realizing zero-shot counting of categories specified by text prompts; the other is the text-guided feature matching route, which calculates the similarity between text features and local image features to locate and count targets. For industrial counting scenarios, the biggest advantage of VLM-based methods lies in their flexibility: when facing new types of workpieces or temporary counting requirements, engineers only need to input corresponding text descriptions without collecting data and retraining models, which can significantly reduce deployment costs and cycles. However, their counting accuracy for fine-grained categories and dense small targets still needs to be improved, and there is still a certain gap compared with specially trained industrial counting models.

4.4.2. DINO-Based Training-Free Counting

CountingDINO leverages robust features extracted by the self-supervised learning model DINO, dynamically extracting prototype features of examples during inference and using them as convolutional kernels for matching on query images to generate similarity maps. This process requires no fine-tuning or training, directly realizing class-agnostic counting and greatly reducing deployment thresholds [86,87,88]. Reference [52] proposes a training-free counting scheme suitable for industrial logistics scenarios based on the DINO self-supervised pre-trained model. It dynamically extracts prototype features of examples, uses them as convolutional kernels for feature matching on query images, generates similarity maps, and counts targets. Its working principle involves utilizing the ViT backbone network of DINO to extract robust visual features, combining text prompts to guide feature matching, and achieving counting without model fine-tuning.

4.4.3. Multimodal Counting: Beyond Single RGB Modality

While most existing counting methods rely solely on RGB images, industrial scenarios often provide access to multiple sensing modalities, such as depth information, near-infrared (NIR) images, thermal infrared data, and even point cloud data. Multimodal counting, which fuses information from multiple sensing modalities to improve counting accuracy and robustness, has emerged as an important research direction in recent years, especially for challenging industrial environments with severe occlusion, complex lighting conditions, and low-contrast targets.
From the perspective of technical architecture, multimodal counting methods can be classified into three main fusion strategies according to the stage of information fusion: early fusion, intermediate fusion, and late fusion. Early fusion directly concatenates multi-modal data at the input level (e.g., stacking RGB and depth images as 4-channel input), which is simple in structure but may fail to fully exploit the complementary characteristics of different modalities. Intermediate fusion fuses features extracted from different modalities at the feature level through attention mechanisms, gating mechanisms, or cross-modal interaction modules, which can better capture the complementary information of different modalities and is currently the mainstream technical route. Late fusion fuses the counting results or confidence maps obtained from different modalities at the decision level, which has high flexibility and strong robustness, but may lose fine-grained cross-modal interaction information.
In industrial counting scenarios, multimodal fusion can effectively address many pain points that are difficult to solve with single RGB modality: for example, depth information can help distinguish overlapping and occluded targets by providing spatial geometric relationships, which is particularly valuable for dense stacking scenarios such as warehouse pallet counting and workpiece bin counting; near-infrared and thermal infrared data can maintain stable imaging under variable lighting conditions or even complete darkness, suitable for outdoor industrial monitoring and night shift production line counting; point cloud data can provide accurate 3D geometric information of targets, helping to solve scale variation and perspective distortion problems in large-field-of-view counting scenarios. In addition, multimodal fusion can also improve the system’s fault tolerance: when one modality fails or is severely disturbed, other modalities can still provide reliable counting results, which is crucial for industrial production systems that require 7 × 24 h stable operation.
However, multimodal counting also faces several practical deployment challenges in industrial scenarios. First, the cost of multi-sensor systems is significantly higher than that of single-camera systems, including not only hardware costs but also calibration and maintenance costs. Second, the spatial and temporal alignment of different modalities is non-trivial: different sensors may have different resolutions, field-of-views, and frame rates, requiring precise calibration and synchronization, which increases system complexity. Third, the computational overhead of multimodal models is usually much higher than that of single-modal models, which poses greater challenges for edge deployment with limited computing power. At present, multimodal counting research in the industrial field is still in the exploratory stage, and most studies focus on specific scenarios. There is still a lack of general-purpose multimodal counting architectures that can be widely adapted to different industrial scenarios.

4.4.4. Open-World Video Counting: From Static Images to Dynamic Scenes

Most existing counting research focuses on static image counting, but many practical industrial scenarios are dynamic video streams, such as high-speed production line workpiece counting, conveyor belt cargo statistics, and industrial monitoring video target tracking and counting. Open-world video counting, which aims to count arbitrary categories of targets in dynamic video streams without retraining, represents a higher-level challenge and has important practical value for industrial applications.
Compared with static image counting, video counting has both unique advantages and additional challenges. On the one hand, video provides rich temporal information and motion cues, which can help distinguish foreground targets from static backgrounds, track targets across frames, and improve counting accuracy through temporal consistency constraints. On the other hand, video counting also faces new challenges: target entry and exit at frame boundaries, motion blur caused by high-speed movement, occlusion and reappearance of targets, and cumulative error propagation over long video sequences. In the open-world setting, these challenges are further amplified by the need to handle unseen categories and dynamically changing scenes.
From the perspective of technical routes, open-world video counting methods can be divided into three main categories:
  • Detection-then-tracking-based methods: This is the most traditional and widely used video counting paradigm. It first detects targets in each frame using an object detector, then associates targets across frames through tracking algorithms (such as SORT, DeepSORT, ByteTrack), and finally counts unique targets by tracking trajectories. In the open-world setting, foundation model-based detectors (e.g., Grounding DINO) can be used to realize zero-shot detection of arbitrary categories specified by text prompts [88], and then combine with tracking algorithms to complete video counting. This type of method has clear principles and good interpretability, but the counting accuracy is highly dependent on the detection performance, and it is prone to ID switching and trajectory fragmentation in dense occlusion scenarios.
  • Density map-based video counting methods: This type of method extends the density map regression paradigm from static images to videos, generating density maps for each frame and integrating them to obtain the count. To exploit temporal information, many methods introduce temporal consistency constraints, motion information fusion, or recurrent neural network structures. In the open-world setting, text-conditioned density map generation networks can be combined with temporal modeling modules to realize zero-shot video counting. This type of method is more suitable for dense target scenarios, but it is difficult to obtain accurate per-instance trajectories, and the counting accuracy may decrease for long videos with cumulative errors.
  • Foundation model end-to-end video counting methods: This is an emerging research direction in recent years, leveraging the powerful spatiotemporal modeling capabilities and generalization capabilities of large video foundation models (such as VideoMAE [89], InternVideo [90]) to directly realize end-to-end open-world video counting. These methods can directly understand natural language descriptions of counting tasks and output counting results for arbitrary categories in videos, without the need for separate detection and tracking modules. However, current video foundation models are still in the early stage of development, and their counting accuracy, especially for dense small targets and fine-grained categories, still has a large gap compared with specially designed counting models. In addition, their huge computational overhead and memory footprint also bring great challenges to industrial real-time deployment.
For industrial scenarios, open-world video counting has broad application prospects: for flexible production lines that frequently switch product types, it can realize rapid switching of counting targets only through text instructions without model retraining; for industrial monitoring and security scenarios, it can flexibly count various targets of interest (such as personnel, vehicles, equipment) according to temporary requirements; for logistics and warehousing scenarios, it can realize continuous statistics of cargo flow and personnel flow across time periods. However, there is still a considerable distance from large-scale industrial deployment: the accuracy and stability of open-world video counting need to be further improved, especially for high-speed and dense scenarios; the real-time performance on edge devices needs to be enhanced; and the system integration with existing industrial control systems also needs to be explored.

4.4.5. Limitations and Industrial Deployment Bottlenecks of Foundation Models

Although vision foundation models have shown remarkable zero-shot transfer capabilities and strong generalization performance, their direct application in industrial counting scenarios still faces multiple bottlenecks and typical failure cases. From the perspective of practical industrial deployment, the main limitations of foundation model-based counting methods are as follows:
  • High computational overhead and deployment difficulty on edge devices:
    Large-scale vision foundation models usually have huge parameter scales and high computational complexity. For example, the ViT-L/14 backbone commonly used in CLIP has more than 400 million parameters, resulting in high inference latency and large memory footprint. For high-speed production line scenarios with strict real-time requirements (inference latency < 33 ms), the computational overhead of large foundation models is often difficult to meet. Meanwhile, the large model size makes it difficult to deploy on embedded edge devices with limited computing power, which severely restricts their application scenarios in industrial sites.
  • Hallucination and misidentification in professional industrial domains:
    Foundation models are mostly pre-trained on general internet image-text datasets, lacking sufficient exposure to industrial professional terminology and fine-grained workpiece categories. When facing specialized industrial objects (such as various types of screws, electronic components, and custom mechanical parts), the model may misidentify background textures or similar-looking objects as targets, or fail to correctly understand professional category names described in text prompts. This problem is particularly prominent in zero-shot counting scenarios for highly specialized industrial categories. Existing CLIP-based counting methods have verified that the model’s counting accuracy is significantly affected by the semantic alignment degree between text prompts and target categories.
  • Insufficient fine-grained counting capability for dense small targets:
    Foundation models excel at semantic-level understanding and category generalization, but their feature granularity is often insufficient for dense small target counting tasks common in industrial scenarios. For micro-electronic components, dense small parts and other scenarios with very small target sizes, the counting accuracy of foundation model-based methods is generally lower than that of specially designed density map regression models. The global receptive field and high-level semantic features of foundation models cannot effectively capture the fine-grained local details required for dense small target counting.
  • Poor interpretability and difficult error diagnosis:
    The black-box nature of large foundation models makes it difficult to locate the root cause of counting errors. In industrial quality inspection scenarios with high reliability requirements, when counting errors occur, engineers cannot quickly determine whether the problem comes from text prompt understanding, feature matching, or background interference, which increases the difficulty of model debugging and optimization. This is in conflict with the traceability and controllability requirements of industrial production systems.
In general, vision foundation models provide a new paradigm for flexible industrial counting with their strong generalization capability, but there is still a considerable distance from large-scale stable deployment in actual factory environments. Future research needs to address the above bottlenecks through model lightweighting, domain-specific fine-tuning, and prompt engineering optimization so as to better adapt foundation models to the unique constraints of industrial scenarios.

5. Class-Agnostic Counting (CAC) and Exemplar-Free Counting Paradigms

Industrial production is characterized by high flexibility, with frequent changes in product types. Traditional class-specific counters require re-annotation of data and retraining of models for each new workpiece, resulting in high costs and long cycles. Therefore, Class-Agnostic Counting (CAC) [47] has become a research hotspot in recent years.

5.1. Few-Shot Counting (FSC)

The core idea of few-shot counting is “matching.” The system receives a query image and several support examples with annotated targets, and completes counting by computing the feature similarity between the query image and the examples. Some methods also achieve joint optimization of counting and instance segmentation [91].

5.1.1. Evolution of Matching Mechanisms

Early Generic Matching Networks (GMNs) adopt a feature concatenation and learnable convolutional matching paradigm, building the foundation of class-agnostic counting via image self-similarity [47]. The subsequent FamNet introduced a test-time adaptation mechanism, which fine-tunes the density prediction module (with the feature extractor frozen) via a joint loss of Min-Count and Perturbation loss [92]. BMNet further proposed a learnable bilinear matching mechanism, which captures flexible channel-wise feature interactions and enhances the generalization ability of similarity modeling [93]. For instance, reference [94] preprocesses cigarette pack images through an image enhancement module (denoising, deblurring), uses BMNet’s bilinear matching to compute feature similarity between example packs and the query image, generates a similarity map, and converts it to a density map for counting. It introduces few-shot learning to adapt to appearance changes of different batches of packs, demonstrating strong robustness to packaging design changes and lighting variations, and supporting dense counting in warehouse environments. However, counting errors are significant for severely crumpled or occluded packs, see Figure 4.

5.1.2. Feature Enhancement Strategies

Direct matching may fail due to intra-class variations (e.g., minor changes in color and texture) of industrial workpieces. The Similarity-Aware Feature Enhancement (SAFECount) algorithm proposes using example features to enhance the feature representation of potential targets in the query image, making target regions more prominent in the feature space and thus improving the accuracy of similarity calculation [95,96,97,98].

5.1.3. Unification of Detection and Counting

Counting-DETR not only outputs counts but also attempts to output target bounding boxes under few-shot conditions [76]. It models the counting problem as point set prediction and solves the problem of insufficient supervision signals in few-shot scenarios through a two-stage training strategy: first generating pseudo-labels, followed by uncertainty-aware fine-tuning.

5.2. Zero-Shot and Training-Free Counting

To further reduce manual intervention, researchers have explored counting methods that completely eliminate the need for visual examples.

5.2.1. Zero-Shot Counting (ZSC)

This paradigm relies on the semantic names of categories. For example, VLCounter [51] leverages text-aware visual representations and uses semantic-conditioned prompt tuning to guide the CLIP model to focus on regions of specific categories, achieving end-to-end zero-shot counting [49,99,100,101].

5.2.2. Exemplar-Free Counting (EFC)

This paradigm assumes that the targets of interest appear repeatedly in the image. Models such as RepRPN [102] and GCA-SUNet [80] automatically identify and count foreground targets by mining repetitive patterns within the image itself. This method is particularly suitable for dense counting of single-category workpieces on industrial production lines, where the system can automatically “discover” workpieces on the conveyor belt and count them without any manual intervention [80,102,103].

6. Datasets, Evaluation Metrics, and Experimental Benchmarks

6.1. Overview of Mainstream Datasets

Research on industrial object counting has long been constrained by the lack of large-scale, standardized public datasets. However, a number of high-quality generic and domain-specific datasets have emerged in recent years [6,72,104,105,106,107,108,109,110,111,112,113,114,115], facilitating the evaluation and iterative evolution of counting algorithms. We summarize the core attributes of mainstream public datasets widely used in industrial object counting and class-agnostic counting tasks in Table 4, covering the release timeline, data scale, category coverage and publication venues of each dataset.

Domain Gap Between General Counting Datasets and Industrial Scenarios

The long-term coexistence of general counting datasets (represented by crowd counting) and industrial-specific datasets leads to a vague boundary between the two research directions. In essence, there is a significant domain gap between general counting scenarios and industrial counting scenarios in terms of target characteristics, environmental interference, annotation paradigm and deployment constraints, which is detailed as follows:
1. 
Gap in target object characteristics
General crowd-counting tasks take non-rigid human bodies as the counting target, with large intra-class differences in posture, clothing and scale, and the target distribution is mostly random and uneven with obvious perspective effect [6,107]. In contrast, industrial counting targets are mostly rigid workpieces with high appearance consistency within the same category, but with a wide variety of categories and fast product iteration speed. Meanwhile, workpieces in dense stacking scenarios have serious adhesion and occlusion, and the shape and size difference between different categories of workpieces is far more than that of crowd individuals [2,58].
2. 
Gap in environmental interference and imaging conditions
General counting datasets are mostly collected in natural outdoor scenes with uniform illumination and relatively single interference factors. Industrial scenes face more complex and extreme imaging environments: metal workpieces have strong specular reflection, production workshops have dust and fog interference, high-speed conveyor belts bring motion blur, and some stations have backlight and low-light shooting conditions. These extreme interferences are rarely covered in general counting datasets, leading to a sharp decline in the performance of general models when deployed directly [2,112].
3. 
Gap in annotation paradigm and evaluation logic
General crowd-counting tasks mostly use point annotation, and the core evaluation indicators are MAE and RMSE, which only focus on the overall quantity error and do not require accurate positioning of a single target. Industrial counting tasks often need to take into account both quantity statistics and single target positioning: for workpiece quality inspection and sorting scenarios, not only the total number, but also the position and size of each workpiece need to be output. At the same time, industrial scenarios have stricter requirements for missed detection and false detection, and different industrial businesses have different tolerance for error types, which cannot be measured by a single quantity error indicator [58,116].
4. 
Gap in deployment constraints and landing requirements
General counting algorithms are mostly deployed on cloud servers or high-performance workstations, with loose requirements for inference latency and model parameters. Industrial counting systems mostly need to be deployed on edge computing devices or industrial computers with limited computing power, and have strict requirements for inference speed: for high-speed production lines, the inference speed needs to reach more than 30 FPS, and some high-speed sorting scenarios even require real-time processing of more than 100 FPS. In addition, industrial systems need to meet the 7 × 24 h long-term stable operation requirements, and have higher requirements for model robustness and fault tolerance
Aiming at the above domain gaps, the current academic community has explored three main technical paths to realize the migration of general counting technology to industrial scenarios: first, domain adaptation technology based on feature alignment, which narrows the distribution difference between general source domain and industrial target domain through adversarial training or style migration [117]; second, pre-training technology based on synthetic data, which generates large-scale annotated industrial workpiece images through digital twin and 3D rendering technology to make up for the shortage of real industrial annotated data [118]; third, few-shot and zero-shot counting technology, which uses the generalization ability of large-scale pre-trained models to realize rapid migration of new categories of industrial workpieces with only a small number of samples or text descriptions [49,119].

6.2. Evaluation Metrics System

The evaluation metrics for industrial counting focus primarily on the accuracy (magnitude of error) of the counting results.

6.2.1. Density Map Regression-Based Counting Metrics

MAE (Mean Absolute Error) [52]: MAE is a statistical metric that measures the average absolute deviation between predicted and ground-truth values. In the evaluation of point-based counting models, a lower MAE value indicates higher overall model accuracy. Given the count estimates y ^ i and the ground-truth counts y i for n test images, its mathematical expression is as follows:
MAE = 1 n i = 1 n y ^ i y i
RMSE (Root Mean Squared Error) [52]: RMSE is used to evaluate the difference between predicted and true counts in class-agnostic counting tasks, and is particularly suitable for counting tasks sensitive to large deviations. Its squaring operation imposes a higher penalty on samples with large prediction errors. Its mathematical expression is as follows:
RMSE = 1 n i = 1 n ( y ^ i y i ) 2
NAE (Normalized Absolute Error) [52]: NAE refers to the normalized relative error. Since class-agnostic counting tasks often involve significant differences in the number of targets across different samples, NAE is an important metric for evaluating proportional deviations. It can eliminate the differences between object quantities of different orders of magnitude and focus on relative errors. Its mathematical expression is as follows:
NAE = 1 n i = 1 n y ^ i y i y i
SRE (Squared Relative Error) [52]: SRE combines the normalization property of relative error with the penalty strength of the squaring operation. When y i is small, the same absolute error leads to an exponential increase in the SRE value, making it an important metric for small-scale counting tasks. Its mathematical expression is as follows:
SRE = 1 n i = 1 n y ^ i y i y i 2

6.2.2. Object Detection-Based Counting Metrics

Recall [76]: Recall refers to the proportion of correctly detected target objects to the total number of actual objects in the image. It focuses on the model’s ability to find all targets, reflecting the detection model’s capability to retrieve true targets. Its mathematical expression is as follows:
Recall = TP ( True Positives ) TP ( True Positives ) + FN ( False Negatives )
Precision [76]: Precision refers to the proportion of correctly detected target objects to the total number of objects detected by the model. It focuses on the model’s ability to find the correct targets, reflecting the accuracy of the detection model’s results. Its mathematical expression is as follows:
Precision = TP ( True Positives ) TP ( True Positives ) + FP ( False Positives )
F1-score [76]: F1-score is the harmonic mean of Recall and Precision. When both recall and precision need to be considered, F1-score can serve as an important balance metric. Its value ranges from 0 to 1. The F1-score is only high when both values are high; a low value of either will lead to a low F1-score. When the difference between the two is large, the F1-score will tend to the smaller one. The closer it is to 1, the more balanced the two are, and the better the model performance. Its mathematical expression is as follows:
F 1 - score = 2 × Precision × Recall Precision + Recall
AP (Average Precision) [76]: Average Precision is defined as the area under the Precision-Recall curve, expressed by the formula as follows:
AP = 0 1 P ( r ) d r
AP reflects the model’s detection performance for a specific category under different confidence thresholds. Its value ranges from 0 to 1, with a higher value indicating better detection performance.
AP50 [76]: AP50 is the average precision calculated under the condition that the Intersection over Union (IoU) threshold is 0.5. It is defined as the area under the Precision-Recall curve when IoU ≥ 0.5, which measures the model’s overall detection capability when the accuracy of object detection meets IoU ≥ 0.5.
AP 50 = 0 1 P ( r ) d r ( IoU 0.5 )
IoU is defined as the ratio of the overlapping area between the predicted box and the ground-truth box to their total area:
IoU = Area of Overlap Area of Union

6.2.3. PrACo Evaluation Benchmark Based on New Metrics

The above two types of evaluation metrics have significant limitations in evaluating prompt-based Class-Agnostic Counting (CAC) tasks. Reference [67] points out that some state-of-the-art CAC models may fail to accurately understand the user-specified categories when faced with prompts containing multiple object categories or requiring the distinction of subtle differences. Traditional metrics such as MAE and RMSE mainly focus on counting errors while ignoring the model’s ability to understand input text prompts. In addition, most existing CAC datasets only contain single-category images, making it difficult to evaluate the model’s robustness in distinguishing different object categories in multi-category scenarios.
Reference [120] proposed the Prompt-Aware Counting (PrACo) benchmark to address this problem. The PrACo benchmark includes a targeted test set and specially designed evaluation metrics to quantify the model’s ability to understand text prompts and handle negative samples (i.e., non-target categories). Negative sample testing aims to evaluate whether the model produces false counts when prompted with target categories that do not exist in the image.
NMN (Normalized Mean of Negative predictions) [120]: NMN is the absolute counting error obtained by prompting the model with negative classes, normalized by the ground-truth value of the positive class. A lower NMN value indicates a better model.
PCCN (Positive Class Count Nearness) [120]: PCCN measures the percentage of data samples where the model’s positive class count estimate is closer to the ground-truth value than the mean of the negative class count estimates. A higher PCCN value indicates a better model.
Counting Precision (CntP) and Counting Recall (CntR) [120]: The classic precision and recall metrics used in detection scenarios are defined by True Positive count (TP), False Positive count (FP), and False Negative count (FN):
CntP = TP TP + FP
CntF1 (Counting Balanced F1-score) [120]: A common method to aggregate precision and recall into a single metric is the F1-score, which is defined as the harmonic mean of these two metrics:
CntF 1 = 2 × CntP × CntR CntP + CntR
This metric can be used to compare the overall performance of CAC models, considering both objects belonging to the desired and undesired categories.

7. Challenges and Solutions in Industrial Scenarios

Despite significant progress in academia, object-counting systems still face severe challenges in real industrial deployment, see Figure 5.

7.1. Occlusion and Overlap

Challenge: In stacked workpiece boxes or crowded conveyor belts, severe inter-object occlusion or temporary occlusion caused by rapid movement leads to feature loss, making detectors identify multiple overlapping targets as a single one or miss detection completely.
Partial Solutions:

7.1.1. Multi-View Fusion

Multiple cameras are used to capture images from different angles, and view blind spots are complemented through 3D reconstruction or feature fusion. For dynamic occlusion scenarios with fragmented features, the ideas of traditional feature tracking and clustering can be used for reference: the KLT algorithm is parallelized to track target features in videos, a large number of trajectories are generated, then the broken trajectories are smoothed and noise is filtered through spatiotemporal condition optimization, and finally the trajectories are clustered into independent moving entities [121,122,123].

7.1.2. Density Map Estimation

Abandon the segmentation of individual targets and instead learn the overall density distribution. The density map will show high response values in overlapping areas, thus restoring the correct quantity through integration [1,2,124].

7.1.3. Occlusion-Aware Networks

Such as OALNet (Occlusion Augmentation Localization Net), which trains by generating features with simulated occlusion to force the model to focus on local salient features of targets (e.g., heads, edges and corners), enabling it to still identify targets under partial occlusion. For example, OAM-Net [5] is designed with two sub-networks: an occlusion-aware sub-network and a key region-aware sub-network. The occlusion-aware sub-network contains an attention module that can adaptively modify the weights of convolutional kernels to optimize the processing of occluded face images [5,125,126,127,128,129,130].

7.1.4. Comparative Analysis of Mainstream Occlusion Processing Schemes

The three occlusion processing solutions detailed above form a complete technical system for partial occlusion handling in industrial object-counting tasks, yet they present significant differences in anti-occlusion robustness, industrial scenario applicability, computational overhead, and engineering deployment thresholds.
In terms of robustness to occlusion level changes, the three schemes show a distinct performance differentiation trend as the occlusion degree deepens. Occlusion-aware networks achieve the strongest robustness to full-range occlusion variations: when the occlusion level rises from mild (10–30% occluded area) to severe (60–90% occluded area), the relative increase in Mean Absolute Error (MAE) is only 27.4% with the occlusion-free scenario as the baseline, making them the only solution that maintains stable counting performance across the full range of partial occlusion levels [125]. Multi-view fusion follows, with a 38.2% relative increase in MAE under the same occlusion level transition, as it can effectively compensate for blind spots in mild and moderate occlusion scenarios through complementary multi-perspective information, but suffers from noticeable performance degradation when facing severe occlusion with fragmented target features [122,123]. In contrast, density map estimation suffers from the most significant performance degradation, with an 82.7% relative increase in MAE from mild to severe occlusion, as its counting accuracy relies heavily on the integrity of local texture features, which are severely lost in high-level occlusion scenarios [1,6].
From the perspective of computational overhead and engineering deployment difficulty, there is a clear gradient among the three schemes. Density map estimation represented by CSRNet has the lowest deployment threshold, with a medium computational overhead (16.2 M parameters and 68.7 G FLOPs under 512 × 512 input resolution) and only requires point-level annotations for model training, which reduces the data labeling cost by more than 70% compared with box-level annotations required by detection-based methods, and can be directly deployed on mainstream industrial computers without additional hardware investment [10]. Occlusion-aware networks have a medium deployment difficulty, adopting a plug-in modular design that can be flexibly embedded into CNN, Transformer and other mainstream backbone networks, with the parameter increment controlled within 5% and the computational overhead adjustable according to the selected backbone; it only needs to add simulated occlusion data augmentation on the basis of the original dataset, with low additional development cost, and can balance counting accuracy and deployment cost in most industrial scenarios [5,125]. Multi-view fusion has the highest deployment cost and difficulty: it requires at least 2–3 synchronized industrial cameras, a dedicated 3D reconstruction computing unit, and complex multi-camera calibration and long-term maintenance work, with a hardware cost 3–5 times that of the monocular vision scheme and a deployment and commissioning cycle of more than 72 h, which greatly limits its large-scale application in flexible production lines [121,122,123].
The three schemes also have clear adaptation boundaries for different industrial scenarios. Multi-view fusion is only suitable for static or quasi-static fixed industrial scenarios with low target movement speed, such as large-scale workpiece palletizing and fixed-station warehouse static inventory, and cannot adapt to dynamic occlusion scenarios on high-speed conveyor belts with a movement speed exceeding 0.5 m/s [18,121]. Density map estimation is the preferred solution for static dense single-category counting scenarios, such as dense small parts counting, particle raw material inventory, and microbial cell counting in industrial fermentation processes, but it cannot provide single-target localization capability required for subsequent industrial sorting and grasping operations, and its performance degrades significantly in multi-category mixed counting scenarios [1,69]. Occlusion-aware networks are the only solution that can adapt to full-range occlusion levels and flexible production line scenarios, especially for industries such as automotive parts and 3C electronics with frequent workpiece replacement and mixed occlusion levels; it can maintain stable counting accuracy when the workpiece category and occlusion form change, and has the widest application range in modern flexible smart manufacturing [5,125,131].

7.2. Multi-Scale Variation

Challenge: Industrial cameras have a large field of view, and workpieces on the conveyor belt show huge scale changes in images due to differences in shooting distance or their own specifications. A single-scale convolutional kernel is difficult to adapt to both extremely large and extremely small targets at the same time.
Partial Solutions:

7.2.1. Feature Pyramid Network (FPN)

As the basic architecture for dealing with target scale variation in industrial scenarios, FPN fuses deep semantic features and shallow geometric features to detect targets of different scales on feature maps with various resolutions. Feature Refine Net (FRN) [132], as the core supporting optimization module of FPN, performs pixel-wise optimization on the multi-scale feature maps output by FPN through cross-layer feature fusion, channel attention mechanism and residual refinement unit. It effectively solves the semantic misalignment problem after the fusion of high-level and low-level features, suppresses the noise interference of complex industrial backgrounds, and strengthens the feature representation of weak targets such as tiny components and long-distance workpieces. Under the industrial general 512 × 512 input resolution, FRN improves the feature matching accuracy of FPN by approximately 20% and the AP50 of industrial small target detection by 15∼18% in scenarios where the workpiece scale changes by more than 10 times [67,132], which is a lightweight and cost-effective feature optimization scheme in industrial multi-scale counting scenarios. The complete architecture pipeline of FRN is shown in Figure 6.

7.2.2. Dilated Convolution and Multi-Column Structure

CSRNet uses dilated convolution to expand the receptive field, and MCNN uses a multi-column structure to adapt to different scales.

7.2.3. Scale-Aware Module

The Deep Scale Aggregation Network (DSAN) uses dense scale-aware blocks to dynamically adjust the feature extraction strategy to adapt to the size changes of targets [7].

7.3. Data Annotation and Generalization Ability

Challenge: Industrial workpieces are updated very quickly, and it is costly and unrealistic to annotate a large amount of data for each new product category. Traditional models have poor generalization ability (Domain Shift) on new categories, leading to difficulties in practical deployment.
Partial Solutions:

7.3.1. Few-Shot and Zero-Shot Technologies

Utilize CAC and ZSC technologies to adapt to new products with only a small amount of manual intervention [117,119,133,134,135,136,137,138,139,140].

7.3.2. Synthetic Data and Digital Twin

Use computer graphics to generate virtual workpiece images with perfect annotations for pre-training, and then transfer to real scenarios through Domain Adaptation technology. Cross-scenario counting technology provides an important reference for domain adaptation [141], and this strategy has been effectively verified in UAV aerial counting scenarios [118,141,142,143,144].

7.3.3. Point Supervision Annotation

Adopt point annotation instead of box annotation to significantly reduce annotation costs [10,145,146,147,148].

7.4. Real-Time Performance and Edge Computing

Challenges: High-speed production lines demand millisecond-level counting inference of algorithms, and the real-time requirements can be divided into three core grades according to latency and frame rate, with significant differences in hardware adaptation, accuracy tolerance and deployment requirements for each grade. Ultra-real-time requirement (single-frame inference latency < 10 ms, frame rate > 100 FPS) targets high-speed scenarios such as high-speed SMT patching and chip sorting, which requires algorithms to be adapted to embedded edge devices with extreme constraints on computational complexity. Standard real-time requirement (single-frame inference latency 10∼33 ms, frame rate 30∼100 FPS) is the core demand for general industrial scenarios including auto parts assembly and food packaging, which needs to balance accuracy and speed and adapt to the computing power of mainstream industrial computers. Near-real-time requirement (single-frame inference latency 33∼100 ms, frame rate 10∼30 FPS) is applicable to warehouse static inventory and large-scale factory monitoring, where the latency requirement is loose and the focus is on the generalization and multi-category adaptation capabilities of the model. However, high-precision Transformer models suffer from huge computational complexity, making it difficult to run on industrial computers or embedded edge devices with limited computing power. The classification of real-time requirements and corresponding technical solutions are summarized in Figure 7.
Partial Solutions:

7.4.1. Ultra-Real-Time Scenarios: Lightweight Backbone Network Design

Aiming at the extreme latency requirement of < 10 ms, lightweight backbones with depthwise separable convolution such as MobileNet and ShuffleNet, or ultra-simple one-stage detection models such as YOLO-Lite and ThunderNet are adopted. Under the industrial general 512 × 512 input resolution, the single-frame inference latency of such models can be controlled within 8 ms, stably meeting the ultra-real-time requirement of >100 FPS, which is the optimal choice for embedded edge deployment [149,150,151].

7.4.2. Standard Real-Time Scenarios: Model Pruning and Quantization Optimization

As the core deployment solution for general industrial scenarios with 30∼100 FPS, model compression technology is used to improve inference speed under the premise of controllable accuracy loss. INT8 quantization can compress the latency of classic density map models such as CSRNet from 42 ms to less than 25 ms with the MAE accuracy loss controlled within 3%. Structured pruning can reduce the latency of YOLO series models by 40% while maintaining more than 95% of the original accuracy. The E3RP method [152] introduces a reinforcement learning-based dynamic pruning strategy, which can adaptively optimize the model structure according to industrial computing power constraints to achieve dynamic balance between accuracy and speed [152,153,154].

7.4.3. Future Direction for Full-Scenario Adaptation: Lightweight Architectures with Linear Complexity

Linear complexity architectures represented by Mamba are an important development direction for industrial real-time counting in the future. They can not only meet the speed requirements of ultra-real-time scenarios, but also balance the counting accuracy of standard real-time scenarios. Among them, Mamba-MOC with Vmamba-Tiny backbone achieves a single-frame inference latency as low as 7.03 ms under 512 × 512 resolution, which has verified the efficiency potential of SSM architecture on public datasets [81,82,82].
However, the operator adaptation and long-term stability verification of such architectures on common industrial hardware (such as industrial PCs, embedded edge boards) are still insufficient. At present, large-scale deployment on production lines still relies on mature CNN lightweighting + quantization schemes. Mamba-based methods have achieved leading accuracy in this architecture direction on public datasets, but further industrial landing verification and engineering optimization are still needed before they can be widely used in actual factory environments.

7.4.4. Industrial Hardware Constraints and the Gap Between Theoretical FLOPs and Actual Deployment Latency

While the aforementioned lightweight design and model compression techniques can effectively reduce the theoretical computational complexity of models, there is often a significant gap between theoretical metrics such as FLOPs and parameter quantity and the actual inference latency on industrial hardware platforms. Understanding the hardware realities of industrial edge computing and the sources of this gap is crucial for guiding practical engineering deployment.
Typical Industrial Hardware Platforms and Computing Constraints
Industrial object-counting systems are deployed on a variety of hardware platforms, each with different computing power, memory constraints, and real-time characteristics. The main types of industrial hardware platforms and their corresponding constraints are as follows:
  • Industrial Personal Computers (IPCs):
    As the most common computing platform on production lines, IPCs are typically equipped with mid-range x86 CPUs (e.g., Intel Core i5/i7 or Celeron series), with 8–16 GB of memory. Most IPCs do not have dedicated GPU acceleration, or only have entry-level discrete graphics cards. Their computing power is significantly lower than that of high-performance workstations used in algorithm research. Moreover, IPCs often need to run multiple industrial control tasks simultaneously (e.g., logic control, data acquisition, human-machine interface), which further squeezes the available computing resources for vision algorithms. In practice, the actual computing power available for vision counting tasks may be only 30–50% of the theoretical peak performance of the CPU.
  • Embedded Edge Boards:
    Represented by NVIDIA Jetson series (Nano, Xavier NX, Orin NX), Rockchip RK3588, and HiSilicon 3519/3559 series, these embedded devices are designed for edge deployment and have strict power consumption constraints (usually 5 W–30 W). Although some models are equipped with dedicated NPU or GPU acceleration units, their operator support completeness and software optimization maturity are far inferior to desktop-level GPUs. Many advanced model structures (e.g., complex attention mechanisms, novel activation functions) cannot achieve the theoretical acceleration ratio, or even fail to run directly due to unsupported operators. In addition, the memory bandwidth of embedded devices is usually much lower than that of desktop platforms, which becomes a bottleneck for memory-intensive operations such as feature map processing.
  • Programmable Logic Controllers (PLCs):
    As the core control units of industrial automation production lines, PLCs have extremely limited computing power—they are usually only capable of simple logical operations and numerical calculations, and cannot run complex deep learning models directly. Vision counting systems usually run on independent IPCs or edge boards, and communicate with PLCs through industrial communication protocols (e.g., Modbus, Profinet, EtherCAT) to transmit counting results and receive control instructions. The communication latency and data format conversion overhead between vision systems and PLCs cannot be ignored, usually ranging from 1ms to 10ms, which needs to be considered in the overall real-time performance budget.
  • Smart Cameras and Vision Sensors:
    These are integrated devices that combine image sensors and processing units in a single camera body, with extremely limited end-side computing power. They can usually only run lightweight traditional image-processing algorithms (e.g., threshold segmentation, edge detection, connected component analysis) or extremely simplified neural networks. Smart cameras are mostly used for simple counting tasks with fixed scenes, single categories, and low counting accuracy requirements. Their advantage lies in compact structure and easy deployment, but their flexibility and accuracy are difficult to compare with independent computing platforms.
Critical Analysis of the Gap Between Theoretical FLOPs and Actual Deployment Latency
In academic research, FLOPs (Floating Point Operations) and parameter quantity are commonly used as indicators to measure model computational complexity and inference speed. However, in actual industrial deployment, there is often a significant deviation between these theoretical metrics and the real end-to-end latency. The main sources of this gap include the following aspects:
  • Data transmission overhead:
    Image data needs to be transmitted from the industrial camera to the computing unit through interfaces such as USB 3.0, GigE Vision, or Camera Link. For high-resolution industrial cameras (e.g., 12 MP or higher), the raw data volume of a single image can reach 36 MB (in Bayer format), and the transmission latency can reach 5–15 ms, even exceeding the model inference time itself. In addition, the image data needs to be copied multiple times between different memory spaces during the transmission process, further increasing the actual latency.
  • Image-preprocessing overhead:
    Before being fed into the neural network, the original image needs to go through a series of preprocessing steps, including image resize, pixel value normalization, color space conversion (e.g., BGR to RGB), and data layout adjustment (e.g., NHWC to NCHW). These operations are often overlooked in theoretical FLOPs analysis, but they can account for 15–30% of the total pipeline latency in actual deployment. For high-resolution input scenarios, the proportion of preprocessing overhead is even higher.
  • Post-processing overhead:
    After the model inference is completed, additional post-processing steps are required to obtain the final counting result. For density map-based counting methods, operations such as density map integration, result rounding, and abnormal value filtering are required; for detection-based counting methods, operations such as Non-Maximum Suppression (NMS), confidence threshold filtering, and bounding box clustering are required. These post-processing steps can add 2–10 ms of additional latency, especially for high-density scenarios with a large number of detection boxes or complex density maps.
  • System scheduling and multitasking overhead:
    Industrial control systems usually run multiple tasks simultaneously, including logic control, data collection, human-machine interaction, communication processing, etc. The vision counting algorithm is only one of the tasks running on the system, and its execution is often interrupted or preempted by higher-priority real-time control tasks. This results in actual inference latency jitter that is much higher than the theoretical single-thread inference time. In severe cases, the actual latency can be 2–3 times the theoretical value.
In practical engineering experience, a model with a 50% reduction in theoretical FLOPs may only achieve a 20–30% reduction in actual end-to-end latency on industrial hardware. This is because the non-inference parts (data transmission, preprocessing, postprocessing, system overhead) do not decrease proportionally with model optimization, and they even become the main bottleneck of the entire pipeline when the model is light enough. Therefore, when evaluating the deployment feasibility of a lightweight model, it is necessary to consider the complete end-to-end pipeline rather than just focusing on the theoretical FLOPs of the model itself.
Special Constraints of Industrial Deployment Beyond Computing Power
In addition to computing power constraints, industrial counting systems also face several unique deployment requirements that are often overlooked in academic research but have significant impacts on practical application:
  • 7 × 24 h long-term stability:
    Industrial production lines usually operate continuously for months or even years without interruption. Vision counting systems must meet extremely high stability requirements. Memory leaks, gradual performance degradation, and occasional crashes that are acceptable in consumer or office applications are absolutely intolerable in industrial production lines, as they may cause production stoppages and huge economic losses. This puts forward higher requirements for the robustness of software and hardware systems.
  • Environmental adaptability:
    Industrial production sites usually have harsh environments, including high/low temperatures, dust, humidity, vibration, electromagnetic interference, etc. Hardware devices need to meet industrial-grade protection standards (e.g., IP65/IP67 dustproof and waterproof) and wide operating temperature ranges (e.g., −20 °C to 60 °C). These environmental constraints further limit the selection of high-performance computing hardware, because high-performance chips usually generate more heat and have higher requirements for heat dissipation and operating temperature.
  • Integration with industrial control systems:
    Vision counting systems are not isolated systems; they need to seamlessly integrate with existing production line control systems. This involves various industrial communication protocols (Modbus RTU/TCP, Profinet, EtherCAT, etc.), data interaction with PLCs and MES (Manufacturing Execution Systems), and coordination with other automation equipment. The latency, reliability, and compatibility of protocol conversion and data interaction directly affect the performance and stability of the overall system.
  • Safety certification and compliance:
    In some high-risk industrial scenarios (e.g., chemical industry, pharmaceutical industry, food processing), vision systems need to meet specific safety certification requirements, such as functional safety standards (IEC 61508) [155], food contact material safety, etc. These certification requirements impose additional constraints on hardware selection, software architecture design, and data processing flows, which need to be considered at the beginning of system design.
Engineering Optimization Directions for Industrial Deployment
Based on the above analysis of hardware constraints and the gap between theoretical and actual performance, we summarize several key engineering optimization directions for improving the actual deployment performance of industrial counting systems:
  • Operator fusion and memory optimization:
    By fusing multiple adjacent operators (e.g., convolution + batch normalization + ReLU activation) into a single kernel, the number of kernel launches and memory reads/writes can be significantly reduced. In addition, optimizing memory access patterns, using memory pinning technology, and reducing unnecessary data copies can also effectively improve actual inference efficiency. These optimizations do not change the theoretical FLOPs of the model, but can significantly reduce the actual inference latency.
  • Pipelined parallelism:
    The image-processing pipeline is divided into multiple stages (image acquisition, preprocessing, model inference, postprocessing, result output) and executed in parallel through assembly line technology. While the single-frame latency remains unchanged, the overall throughput (frames per second) can be effectively improved. This is particularly important for high-speed production line scenarios that require high frame rate counting.
  • Hardware accelerator adaptation and customization:
    Targeted optimization for specific industrial hardware accelerators (NPU, FPGA, ASIC), making full use of their dedicated computing units. For example, using TensorRT for NVIDIA GPU/edge device optimization, using RKNN for Rockchip NPU deployment, and using custom FPGA accelerators for specific scenarios. These hardware-specific optimizations can often achieve 2–5 times performance improvement compared with general-purpose CPU inference.
  • Adaptive quantization strategy:
    According to the precision requirements of different industrial scenarios, flexibly choose quantization precision. For scenarios with high counting accuracy requirements, INT8 quantization or mixed precision quantization can be used; for scenarios with relatively loose accuracy requirements but high speed requirements, INT4 or even lower precision quantization can be tried. In addition, quantization-aware training technology can be used to minimize the accuracy loss caused by quantization.
In general, the deployment of industrial object-counting systems is a systematic project involving algorithms, hardware, software, and engineering. Simply optimizing model FLOPs is far from enough; it is necessary to comprehensively consider the complete end-to-end pipeline and various industrial-specific constraints in order to achieve the optimal balance between counting accuracy, inference speed, and deployment stability.

8. Future Development Directions and Conclusions

8.1. Future Research Directions

8.1.1. Lightweight and High-Efficiency Model Architectures

For edge computing environments, future research will continue to strive to find the optimal balance between accuracy and speed. Exploring the in-depth application of linear attention mechanisms and State Space Models (SSM, Mamba) in counting tasks will be a key trend.

8.1.2. Towards Open-World Counting

Further improve the model’s generalization ability under zero-shot or few-shot conditions, and combine the semantic understanding ability of Vision-Language Models (VLMs) to realize real-time and interactive counting of any unknown workpieces through natural language instructions, breaking the barriers of categories [116,156,157,158].

8.1.3. Multi-Modal Data Fusion

A single visual modality has limitations in low-illumination and strong interference environments. Multi-modal fusion technology combining RGB images, depth information, near-infrared spectroscopy (NIR) and thermal imaging data will significantly improve the robustness of the system in extreme industrial environments. The proposal of the NWPU-MOC dataset provides a data foundation for this direction [131,141,159,160].

8.1.4. Unsupervised and Self-Supervised Learning

Utilize massive unannotated industrial video data for pre-training, learn features through self-supervised signals such as spatiotemporal consistency or reconstruction error, and completely get rid of the reliance on manual annotation. The success of CountingDINO proves the feasibility of training-free counting using self-supervised features, and this direction has great potential. A new unsupervised crowd-counting framework proposed by CrowdCLIP has been verified in crowd scenarios [133,161,162,163], see Figure 8.

8.2. Conclusions

This paper systematically reviews the evolution and development of industrial object-counting technologies from 2010 to 2025, revealing the profound transformation of the field from reliance on handcrafted features in traditional machine vision to the deep learning-driven paradigm innovation, and further to the technological breakthroughs in large models and open-world counting. Over these fifteen years, industrial object counting has achieved leapfrog development from qualitative adaptation to quantitative precision. The core value of technological progress is reflected not only in architectural innovation and paradigm shifts, but also in the perceivable and verifiable development trajectory formed by the significant improvement in quantitative indicators.
On mainstream benchmark datasets including ShanghaiTech, FSC147, and NWPU-MOC, the evolution of the core evaluation metric Mean Absolute Error (MAE) clearly depicts this progress: from the coarse level of 181.8 achieved by R-CNN in the early stage (2014) [32], gradually reduced to the optimized level of 68.2 by CSRNet in the medium term (2018) [1], the robust accuracy of 37.7 by Swin Transformer in 2021 [48], and finally reaching the fine level of 8.6 by Mamba-MOC in 2024 [82]. It should be noted that these MAE values represent the best performance of each algorithm on their respective representative benchmark datasets, and the datasets and experimental settings vary across different studies. Therefore, the 95.3% overall MAE reduction over the fifteen-year period is presented as an illustrative indicator of the overall technological evolution trend, rather than a rigorous direct quantitative comparison under completely identical experimental conditions. This trend fully demonstrates the tremendous performance leap brought by technological iteration.
In this quantitative progression, key technological breakthroughs have served as the core driving force for accuracy leaps:
  • Breakthrough in Real-Time Counting
In 2016, YOLOv1 [34], with its one-stage detection architecture, achieved a significant 76.0% reduction in MAE from 110.2 to 26.4, marking the engineering feasibility of real-time counting.
  • Potential of Efficient Architectures
In 2024, the Mamba architecture [81], with its linear computational complexity, achieved a 69.6% accuracy improvement over the 28.3 MAE of CountingDINO in 2023 [87], verifying the great potential of state space models in high-resolution industrial scenarios [82].
Meanwhile, the quantitative value of technological evolution goes far beyond the optimization of a single accuracy metric, showing significant improvements in multiple dimensions:
  • Robustness
Addressing the core industrial challenge of occlusion and overlap, counting capabilities have evolved from the complete failure of traditional methods in dense scenes, to the stable performance of density map estimation methods (e.g., CSRNet [1]) maintaining an MAE below 30 even in scenarios with an overlap rate of over 60%.
  • Generalization Ability
The rise of the Class-Agnostic Counting (CAC) [47] and Exemplar-Free Counting [80,102] paradigms has reduced the MAE deviation of models on unseen industrial workpiece categories from over 40% in the early stage to within 15% by GCA-SUNet in 2025 [80], greatly improving the scenario adaptability of the models.
  • Deployment Efficiency
Inference speed has been significantly improved from less than 5 FPS for R-CNN in 2014 [32] to over 60 FPS for YOLOv8 [63], and Mamba-MOC [82] has even achieved real-time processing capability of 100 FPS for high-resolution industrial images, perfectly adapting to the millisecond-level counting requirements of high-speed production lines.
Currently, industrial object-counting technology is undergoing a comprehensive shift from closed scenarios of class-specific counting to the open-world paradigm of class-agnostic [47], training-free [87], and low annotation cost [10] counting. The emergence of efficient architectures such as Mamba [81] has solved the engineering bottleneck of the quadratic computational complexity inherent in Transformer architectures, and the cross-modal capabilities of large vision foundation models [50,164] have broken the adaptation barriers between categories and scenarios, providing a brand-new solution to the core pain points in industrial scenarios, including frequent workpiece changeovers, complex and variable environments, and high annotation costs.
In the future, with in-depth exploration of directions including lightweight design [149,150,151], multi-modal fusion [141,159,160], and unsupervised and self-supervised learning [161,162,163], industrial object-counting systems will further achieve the optimal balance between accuracy and efficiency, as well as the dual satisfaction of cross-domain generalization and real-time response. This will provide more solid technical support for the closed-loop control of smart manufacturing, and drive the continuous advancement of industrial digital transformation in a more efficient and intelligent direction.

Author Contributions

Conceptualization, W.W., L.Z. and W.D.; methodology, W.W. and J.H.; software, S.Z.; validation, W.W. and S.Z.; formal analysis, W.W. and J.H.; investigation, W.W. and S.Z.; resources, L.L., W.D. and L.Z.; data curation, S.Z.; writing—original draft preparation, W.W.; writing—review and editing, J.H., L.L., W.D. and L.Z.; visualization, S.Z.; supervision, W.D. and L.Z.; project administration, L.L.; funding acquisition, L.L. and L.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Natural Science Foundation of Sichuan Province (No. 2026NSFSCZY0032, No. 2025ZNSFSC0735), National Science and Technology Major Project on Intelligent Manufacturing Systems and Robotics (No.2026ZD1611600) and the Major Special Project of Heavy Rain Laboratory in Southwest Sichuan (Ya’an) (CXNBYSYSZD202502), Chengdu Science and Technology Bureau (No. 2025-YF05-00390-SN).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors would like to thank the anonymous reviewers for their valuable comments and suggestions.

Conflicts of Interest

Authors Wei Wang and Lanhui Liu were employed by the Chongqing Innovation Center of Industrial Big-Data Co., Ltd. Author Wu Du was employed by the Chengdu Sanshi Technology Co., Ltd. The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
CNNConvolutional Neural Network
CACClass-Agnostic Counting
MAEMean Absolute Error
RMSERoot Mean Square Error
NMSNon-Maximum Suppression
FCNFully Convolutional Network
MCNNMulti-Column Convolutional Neural Network
DETRDEtection TRansformer
SSMState Space Model
CLIPContrastive Language-Image Pre-training
SAMSegment Anything Model
FSCFew-Shot Counting
ZSCZero-Shot Counting
EFCExemplar-Free Counting

References

  1. Li, Y.; Zhang, X.; Chen, D. Csrnet: Dilated convolutional neural networks for understanding the highly congested scenes. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 18–23 June 2018; pp. 1091–1100. [Google Scholar]
  2. Jiang, Z.; Zhai, Y.; Ke, F.; Zhou, J.; Genovese, A.; Piuri, V.; Scotti, F. Learning to count arbitrary industrial manufacturing workpieces. IEEE Trans. Ind. Inform. 2024, 20, 7719–7731. [Google Scholar] [CrossRef]
  3. Idrees, H.; Saleemi, I.; Seibert, C.; Shah, M. Multi-source multi-scale counting in extremely dense crowd images. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Portland, OR, USA, 23–28 June 2013; pp. 2547–2554. [Google Scholar]
  4. Li, J.; Zhu, Z.; Liu, H.; Su, Y.; Deng, L. Strawberry R-CNN: Recognition and counting model of strawberry based on improved faster R-CNN. Ecol. Inform. 2023, 77, 102210. [Google Scholar] [CrossRef]
  5. Wang, D.; Li, R. Enhancing Accuracy of Face Recognition in Occluded Scenarios With Occlusion-Aware Module-Based Network. IEEE Access 2023, 11, 117297–117307. [Google Scholar] [CrossRef]
  6. Zhang, Y.; Zhou, D.; Chen, S.; Gao, S.; Ma, Y. Single-image crowd counting via multi-column convolutional neural network. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, NV, USA, 27–30 June 2016; pp. 589–597. [Google Scholar]
  7. Li, H.; Kong, W.; Zhang, S. Deeply scale aggregation network for object counting. Knowl.-Based Syst. 2020, 210, 106485. [Google Scholar] [CrossRef]
  8. Liu, L.; Ouyang, W.; Wang, X.; Fieguth, P.; Chen, J.; Liu, X.; Pietikäinen, M. Deep learning for generic object detection: A survey. Int. J. Comput. Vis. 2020, 128, 261–318. [Google Scholar]
  9. Lempitsky, V.; Zisserman, A. Learning to count objects in images. Adv. Neural Inf. Process. Syst. 2010, 23, 1324–1332. [Google Scholar]
  10. Laradji, I.H.; Rostamzadeh, N.; Pinheiro, P.O.; Vazquez, D.; Schmidt, M. Where are the blobs: Counting by localization with point supervision. In Proceedings of the European Conference on Computer Vision (ECCV), Munich, Germany, 8–14 September 2018; pp. 547–562. [Google Scholar]
  11. Song, B.; Hu, X.; Xiao, J.; Zhang, G.; Chen, T. Implicit neural refinement based multi-view stereo network with adaptive correlation. Image Vis. Comput. 2022, 124, 104511. [Google Scholar] [CrossRef]
  12. Ciampi, L.; Azmoudeh, A.; Akbaba, E.E.; Sarıtaş, E.; Yazıcı, Z.A.; Ekenel, H.K.; Amato, G.; Falchi, F. A survey on class-agnostic counting: Advancements from reference-based to open-world text-guided approaches. arXiv 2025, arXiv:2501.19184. [Google Scholar]
  13. Qiu, L.; Dong, L.; Gao, Y.; Wang, Z.; Tan, J.; Ji, Z. An enhanced approach for joint configuration of a robot performing in a repetitive task. J. Manuf. Syst. 2022, 64, 454–467. [Google Scholar] [CrossRef]
  14. Yang, J.; Li, S.; Wang, Z.; Dong, H.; Wang, J.; Tang, S. Using deep learning to detect defects in manufacturing: A comprehensive survey and current challenges. Materials 2020, 13, 5755. [Google Scholar] [CrossRef] [PubMed]
  15. He, J.; Wang, W.; Gou, Z.; Jin, X.; Zhang, G.; Dong, M. A dual-branch fusion network based on Convolutional Neural Network and Mamba for outdoor fire detection. Eng. Appl. Artif. Intell. 2026, 167, 113838. [Google Scholar] [CrossRef]
  16. Kumar, K.; Kumar, P.; Kshirsagar, V.; Bhalerao, R.H.; Shah, K.; Vaidhya, P.K.; Panda, S.K. A real-time object counting and collecting device for industrial automation process using machine vision. IEEE Sens. J. 2023, 23, 13052–13059. [Google Scholar] [CrossRef]
  17. Albu, R.D.; Gordan, C.E. Counting Atypical Metal Pieces System. An Eddy Currents approach. In Proceedings of the 2021 16th International Conference on Engineering of Modern Electric Systems (EMES); IEEE: Piscataway, NJ, USA, 2021; pp. 1–4. [Google Scholar]
  18. Maheswari, S.; Bagyam, M.L.N.; Vishnukumar, R.; Subashri, K.; Vinith, S.; Sarvesh, R. Sensor-Based Real-Time Monitoring System for Product Counting, Inspection and Production Analysis in Industrial Environment. In Proceedings of the 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT); IEEE: Piscataway, NJ, USA, 2024; pp. 1–4. [Google Scholar]
  19. Henderson, P.; Ferrari, V. End-to-end training of object class detectors for mean average precision. In Proceedings of the Asian Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2016; pp. 198–213. [Google Scholar]
  20. Costa, D.G. Visual sensors hardware platforms: A review. IEEE Sens. J. 2019, 20, 4025–4033. [Google Scholar] [CrossRef]
  21. Canny, J. A computational approach to edge detection. In IEEE Transactions on Pattern Analysis and Machine Intelligence; IEEE: Piscataway, NJ, USA, 2009; pp. 679–698. [Google Scholar]
  22. Rosenfeld, A.; Pfaltz, J.L. Sequential operations in digital picture processing. J. ACM 1966, 13, 471–494. [Google Scholar] [CrossRef]
  23. Vincent, L.; Soille, P. Watersheds in digital spaces: An efficient algorithm based on immersion simulations. IEEE Trans. Pattern Anal. Mach. Intell. 1991, 13, 583–598. [Google Scholar] [CrossRef]
  24. Felzenszwalb, P.F.; Girshick, R.B.; McAllester, D. Cascade object detection with deformable part models. In Proceedings of the 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition; IEEE: Piscataway, NJ, USA, 2010; pp. 2241–2248. [Google Scholar]
  25. Felzenszwalb, P.F.; Girshick, R.B.; McAllester, D.; Ramanan, D. Object detection with discriminatively trained part-based models. IEEE Trans. Pattern Anal. Mach. Intell. 2009, 32, 1627–1645. [Google Scholar] [CrossRef]
  26. Lowe, D.G. Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 2004, 60, 91–110. [Google Scholar] [CrossRef]
  27. Lowe, D.G. Object recognition from local scale-invariant features. In Proceedings of the Seventh IEEE International Conference on Computer Vision; IEEE: Piscataway, NJ, USA, 1999; Volume 2, pp. 1150–1157. [Google Scholar]
  28. Bay, H.; Tuytelaars, T.; Van Gool, L. Surf: Speeded up robust features. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2006; pp. 404–417. [Google Scholar]
  29. Dalal, N.; Triggs, B. Histograms of oriented gradients for human detection. In Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05); IEEE: Piscataway, NJ, USA, 2005; Volume 1, pp. 886–893. [Google Scholar]
  30. Felzenszwalb, P.; McAllester, D.; Ramanan, D. A discriminatively trained, multiscale, deformable part model. In Proceedings of the 2008 IEEE Conference on Computer Vision and Pattern Recognition; IEEE: Piscataway, NJ, USA, 2008; pp. 1–8. [Google Scholar]
  31. Sermanet, P.; Eigen, D.; Zhang, X.; Mathieu, M.; Fergus, R.; LeCun, Y. Overfeat: Integrated recognition, localization and detection using convolutional networks. arXiv 2013, arXiv:1312.6229. [Google Scholar]
  32. Girshick, R.; Donahue, J.; Darrell, T.; Malik, J. Rich feature hierarchies for accurate object detection and semantic segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA, 23–28 June 2014; pp. 580–587. [Google Scholar]
  33. Ren, S.; He, K.; Girshick, R.; Sun, J. Faster r-cnn: Towards real-time object detection with region proposal networks. Adv. Neural Inf. Process. Syst. 2015, 28, 91–99. [Google Scholar] [CrossRef]
  34. Redmon, J.; Divvala, S.; Girshick, R.; Farhadi, A. You only look once: Unified, real-time object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, NV, USA, 27–30 June 2016; pp. 779–788. [Google Scholar]
  35. Liu, W.; Anguelov, D.; Erhan, D.; Szegedy, C.; Reed, S.; Fu, C.Y.; Berg, A.C. Ssd: Single shot multibox detector. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2016; pp. 21–37. [Google Scholar]
  36. Redmon, J.; Farhadi, A. Yolov3: An incremental improvement. arXiv 2018, arXiv:1804.02767. [Google Scholar]
  37. Bochkovskiy, A.; Wang, C.Y.; Liao, H.Y.M. Yolov4: Optimal speed and accuracy of object detection. arXiv 2020, arXiv:2004.10934. [Google Scholar]
  38. Onoro-Rubio, D.; López-Sastre, R.J. Towards perspective-free object counting with deep learning. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2016; pp. 615–629. [Google Scholar]
  39. Xue, Y.; Ray, N.; Hugh, J.; Bigras, G. Cell counting by regression using convolutional neural network. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2016; pp. 274–290. [Google Scholar]
  40. Pham, V.Q.; Kozakaya, T.; Yamaguchi, O.; Okada, R. Count forest: Co-voting uncertain number of targets using random forest for crowd density estimation. In Proceedings of the IEEE International Conference on Computer Vision, Santiago, Chile, 7–13 December 2015; pp. 3253–3261. [Google Scholar]
  41. Szegedy, C.; Toshev, A.; Erhan, D. Deep neural networks for object detection. Adv. Neural Inf. Process. Syst. 2013, 26, 2553–2561. [Google Scholar]
  42. Kalayeh, M.M.; Basaran, E.; Gökmen, M.; Kamasak, M.E.; Shah, M. Human Semantic Parsing for Person Re-Identification. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Salt Lake City, UT, USA, 18–22 June 2018. [Google Scholar]
  43. Dosovitskiy, A. An image is worth 16x16 words: Transformers for image recognition at scale. arXiv 2020, arXiv:2010.11929. [Google Scholar]
  44. He, J.; Wang, W.; Jin, X.; Li, H.; Liu, J.; Chen, B. Multiscale cross-attention CNN-transformer two-branch fusion network for detecting railway U-shaped bolts & nuts defects. IEEE ASME Trans. Mechatron. 2025, 31, 802–813. [Google Scholar]
  45. He, J.; Wang, W.; Lv, F.; Luo, H.; Zhang, G.; Chen, Z. Multi-scale CNN-transformer hybrid network for rail fastener defect detection. IEEE Trans. Intell. Transp. Syst. 2025, 26, 8894–8906. [Google Scholar] [CrossRef]
  46. He, J.; Lv, F.; Liu, J.; Wu, M.; Chen, B.; Wang, S. C2T-HR3D: Cross-fusion of CNN and transformer for high-speed railway dropper defect detection. IEEE Trans. Instrum. Meas. 2025, 74, 3508516. [Google Scholar] [CrossRef]
  47. Lu, E.; Xie, W.; Zisserman, A. Class-agnostic counting. In Proceedings of the Asian Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2018; pp. 669–684. [Google Scholar]
  48. Liu, Z.; Lin, Y.; Cao, Y.; Hu, H.; Wei, Y.; Zhang, Z.; Lin, S.; Guo, B. Swin transformer: Hierarchical vision transformer using shifted windows. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Montreal, QC, Canada, 11–17 October 2021; pp. 10012–10022. [Google Scholar]
  49. Xu, J.; Le, H.; Nguyen, V.; Ranjan, V.; Samaras, D. Zero-shot object counting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Vancouver, BC, Canada, 17–24 June 2023; pp. 15548–15557. [Google Scholar]
  50. Jiang, R.; Liu, L.; Chen, C. Clip-count: Towards text-guided zero-shot object counting. In Proceedings of the 31st ACM International Conference on Multimedia, Ottawa, ON, Canada, 29 October–3 November 2023; pp. 4535–4545. [Google Scholar]
  51. Kang, S.; Moon, W.; Kim, E.; Heo, J.P. Vlcounter: Text-aware visual representation for zero-shot object counting. In Proceedings of the AAAI Conference on Artificial Intelligence, Vancouver, BC, Canada, 20–27 February 2024; Volume 38, pp. 2714–2722. [Google Scholar]
  52. Shi, Z.; Sun, Y.; Zhang, M. Training-free object counting with prompts. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, Waikoloa, HI, USA, 3–8 January 2024; pp. 323–331. [Google Scholar]
  53. Zhong, Y.; Yang, J.; Zhang, P.; Li, C.; Codella, N.; Li, L.H.; Zhou, L.; Dai, X.; Yuan, L.; Li, Y.; et al. Regionclip: Region-based language-image pretraining. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, New Orleans, LA, USA, 19–24 June 2022; pp. 16793–16803. [Google Scholar]
  54. Lu, H.; Cao, Z.; Xiao, Y.; Zhuang, B.; Shen, C. TasselNet: Counting maize tassels in the wild via local counts regression network. Plant Methods 2017, 13, 79. [Google Scholar] [CrossRef]
  55. Khan, A.; Gould, S.; Salzmann, M. Deep convolutional neural networks for human embryonic cell counting. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2016; pp. 339–348. [Google Scholar]
  56. Arteta, C.; Lempitsky, V.; Zisserman, A. Counting in the wild. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2016; pp. 483–498. [Google Scholar]
  57. Madec, S.; Jin, X.; Lu, H.; De Solan, B.; Liu, S.; Duyme, F.; Heritier, E.; Baret, F. Ear density estimation from high resolution RGB imagery using deep learning technique. Agric. For. Meteorol. 2019, 264, 225–234. [Google Scholar] [CrossRef]
  58. Jiang, Z.; Liao, J.; Wang, W.; Zhai, Y. WPCNet: Highly accurate workpiece counting network in unrestricted scenes. In Proceedings of the 2022 4th International Conference on Applied Machine Learning (ICAML); IEEE: Piscataway, NJ, USA, 2022; pp. 255–259. [Google Scholar]
  59. Meng, Y.; Bridge, J.; Zhao, Y.; Joddrell, M.; Qiao, Y.; Yang, X.; Huang, X.; Zheng, Y. Transportation object counting with graph-based adaptive auxiliary learning. IEEE Trans. Intell. Transp. Syst. 2022, 24, 3422–3437. [Google Scholar] [CrossRef]
  60. He, K.; Zhang, X.; Ren, S.; Sun, J. Spatial pyramid pooling in deep convolutional networks for visual recognition. IEEE Trans. Pattern Anal. Mach. Intell. 2015, 37, 1904–1916. [Google Scholar] [CrossRef] [PubMed]
  61. Liu, B.; Zhao, W.; Sun, Q. Study of object detection based on Faster R-CNN. In Proceedings of the 2017 Chinese Automation Congress (CAC); IEEE: Piscataway, NJ, USA, 2017; pp. 6233–6236. [Google Scholar]
  62. Gavrilescu, R.; Zet, C.; Foșalău, C.; Skoczylas, M.; Cotovanu, D. Faster R-CNN: An approach to real-time object detection. In Proceedings of the 2018 International Conference and Exposition on Electrical And Power Engineering (EPE); IEEE: Piscataway, NJ, USA, 2018; pp. 0165–0168. [Google Scholar]
  63. Li, Y.; Wang, Y.; Sui, D.; Guo, M. Dense Buddha head object detection and counting YOLOv8 network based on multi-scale attention and data augmentation fusion. npj Herit. Sci. 2025, 13, 23. [Google Scholar] [CrossRef]
  64. Rotzal, Z. Remote Sensing Multi-class Object Counting: A YOLO Approach. IEEE Geosci. Remote Sens. Lett. 2022, 19, 456–462. [Google Scholar]
  65. Pina, G.A.; Moya-Sánchez, E.U.; Sánchez-Pérez, A.; Cortés, U. Automatic vehicle counting area creation based on vehicle Deep Learning detection and DBSCAN. In Proceedings of the 2022 IEEE International Conference on Cluster Computing (CLUSTER); IEEE: Piscataway, NJ, USA, 2022; pp. 535–538. [Google Scholar]
  66. Chen, L.; Zhang, Z.; Peng, L. Fast single shot multibox detector and its application on vehicle counting system. IET Intell. Transp. Syst. 2018, 12, 1406–1413. [Google Scholar] [CrossRef]
  67. Lin, T.Y.; Dollár, P.; Girshick, R.; He, K.; Hariharan, B.; Belongie, S. Feature pyramid networks for object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Honolulu, HI, USA, 21–26 July 2017; pp. 2117–2125. [Google Scholar]
  68. Long, J.; Shelhamer, E.; Darrell, T. Fully convolutional networks for semantic segmentation. In Proceedings of the Conference on Computer Vision and Pattern Recognition, Boston, MA, USA, 7–12 June 2015; pp. 3431–3440. [Google Scholar]
  69. Xie, W.; Noble, J.A.; Zisserman, A. Microscopy cell counting and detection with fully convolutional regression networks. Comput. Methods Biomech. Biomed. Eng. Imaging Vis. 2018, 6, 283–292. [Google Scholar]
  70. Guo, Y.; Stein, J.; Wu, G.; Krishnamurthy, A. Sau-net: A universal deep network for cell counting. In Proceedings of the 10th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, New York, NY, USA, 7–10 September 2019; pp. 299–306. [Google Scholar]
  71. Mundhenk, T.N.; Konjevod, G.; Sakla, W.A.; Boakye, K. A large contextual dataset for classification, detection and counting of cars with deep learning. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2016; pp. 785–800. [Google Scholar]
  72. Gao, J.; Zhao, L.; Li, X. NWPU-MOC: A benchmark for fine-grained multicategory object counting in aerial images. IEEE Trans. Geosci. Remote Sens. 2024, 62, 5606614. [Google Scholar] [CrossRef]
  73. He, S.; Minn, K.T.; Solnica-Krezel, L.; Anastasio, M.A.; Li, H. Deeply-supervised density regression for automatic cell counting in microscopy images. Med. Image Anal. 2021, 68, 101892. [Google Scholar] [CrossRef] [PubMed]
  74. Liu, C.; Zhong, Y.; Zisserman, A.; Xie, W. Countr: Transformer-based generalised visual counting. arXiv 2022, arXiv:2208.13721. [Google Scholar]
  75. Wang, Y.; Yang, B.; Wang, X.; Liang, C.; Chen, J. SATCount: A scale-aware transformer-based class-agnostic counting framework. Neural Netw. 2024, 172, 106126. [Google Scholar] [CrossRef] [PubMed]
  76. Nguyen, T.; Pham, C.; Nguyen, K.; Hoai, M. Few-shot object counting and detection. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2022; pp. 348–365. [Google Scholar]
  77. Huang, Y.; Ranjan, V.; Hoai, M. Interactive class-agnostic object counting. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Paris, France, 2–3 October 2023; pp. 22312–22322. [Google Scholar]
  78. Carion, N.; Massa, F.; Synnaeve, G.; Usunier, N.; Kirillov, A.; Zagoruyko, S. End-to-end object detection with transformers. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2020; pp. 213–229. [Google Scholar]
  79. Yang, S.; Guo, W.; Ren, Y. CrowdFormer: An overlap patching vision transformer for top-down crowd counting. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, Vienna, Austria, 23–29 July 2022; Volume 1, p. 2. [Google Scholar]
  80. Wu, Y.; Xu, Y.; Xu, T.; Zhang, J.; Ren, J.; Jiang, X. GCA-SUNet: A Gated Context-Aware Swin-UNet for Exemplar-Free Counting. In Proceedings of the 2025 IEEE International Conference on Multimedia and Expo (ICME); IEEE: Piscataway, NJ, USA, 2025; pp. 1–6. [Google Scholar]
  81. Gu, A.; Dao, T. Mamba: Linear-time sequence modeling with selective state spaces. In Proceedings of the First Conference on Language Modeling, Philadelphia, PA, USA, 7–9 October 2024. [Google Scholar]
  82. Liu, P.; Lei, S.; Li, H.C. Mamba-MOC: A Multicategory Remote Object Counting via State Space Model. arXiv 2025, arXiv:2501.06697. [Google Scholar]
  83. Huang, Z.; Dai, M.; Zhang, Y.; Zhang, J.; Shan, H. Point segment and count: A generalized framework for object counting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Seattle, WA, USA, 16–22 June 2024; pp. 17067–17076. [Google Scholar]
  84. Radford, A.; Kim, J.W.; Hallacy, C.; Ramesh, A.; Goh, G.; Agarwal, S.; Sastry, G.; Askell, A.; Mishkin, P.; Clark, J.; et al. Learning transferable visual models from natural language supervision. In Proceedings of the International Conference on Machine Learning; PmLR: New York, NY, USA, 2021; pp. 8748–8763. [Google Scholar]
  85. Li, J.; Li, D.; Savarese, S.; Hoi, S. Blip-2: Bootstrapping language-image pre-training with frozen image encoders and large language models. In Proceedings of the International Conference on Machine Learning; PmLR: New York, NY, USA, 2023; pp. 19730–19742. [Google Scholar]
  86. Caron, M.; Touvron, H.; Misra, I.; Jégou, H.; Mairal, J.; Bojanowski, P.; Joulin, A. Emerging properties in self-supervised vision transformers. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Montreal, QC, Canada, 11–17 October 2021; pp. 9650–9660. [Google Scholar]
  87. Pacini, G.; Bianchi, L.; Ciampi, L.; Messina, N.; Amato, G.; Falchi, F. CountingDINO: A Training-free Pipeline for Class-Agnostic Counting using Unsupervised Backbones. arXiv 2025, arXiv:2504.16570. [Google Scholar]
  88. Liu, S.; Zeng, Z.; Ren, T.; Li, F.; Zhang, H.; Yang, J.; Jiang, Q.; Li, C.; Yang, J.; Su, H.; et al. Grounding dino: Marrying dino with grounded pre-training for open-set object detection. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2024; pp. 38–55. [Google Scholar]
  89. Tong, Z.; Song, Y.; Wang, J.; Wang, L. Videomae: Masked autoencoders are data-efficient learners for self-supervised video pre-training. Adv. Neural Inf. Process. Syst. 2022, 35, 10078–10093. [Google Scholar] [CrossRef]
  90. Wang, Y.; Li, K.; Li, Y.; He, Y.; Huang, B.; Zhao, Z.; Zhang, H.; Xu, J.; Liu, Y.; Wang, Z.; et al. Internvideo: General video foundation models via generative and discriminative learning. arXiv 2022, arXiv:2212.03191. [Google Scholar]
  91. Cholakkal, H.; Sun, G.; Khan, F.S.; Shao, L. Object counting and instance segmentation with image-level supervision. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Seoul, Republic of Korea, 27 October–2 November 2019; pp. 12397–12405. [Google Scholar]
  92. Ranjan, V.; Sharma, U.; Nguyen, T.; Hoai, M. Learning to count everything. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Nashville, TN, USA, 20–25 June 2021; pp. 3394–3403. [Google Scholar]
  93. Shi, M.; Lu, H.; Feng, C.; Liu, C.; Cao, Z. Represent, compare, and learn: A similarity-aware framework for class-agnostic counting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, New Orleans, LA, USA, 18–24 June 2022; pp. 9529–9538. [Google Scholar]
  94. Gao, Y.; Xu, Z.; Xu, X. Enhanced Cigarette Pack Counting via Image Enhancement Techniques and Advanced SAFECount Methodology. Trait. Signal 2023, 40, 2353–2365. [Google Scholar] [CrossRef]
  95. You, Z.; Yang, K.; Luo, W.; Lu, X.; Cui, L.; Le, X. Few-shot object counting with similarity-aware feature enhancement. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, Waikoloa, HI, USA, 2–7 January 2023; pp. 6315–6324. [Google Scholar]
  96. Đukić, N.; Lukežič, A.; Zavrtanik, V.; Kristan, M. A low-shot object counting network with iterative prototype adaptation. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Paris, France, 1–6 October 2023; pp. 18872–18881. [Google Scholar]
  97. Liu, S.; Huang, D. Receptive field block net for accurate and fast object detection. In Proceedings of the European Conference on Computer Vision (ECCV), Munich, Germany, 8–14 September 2018; pp. 385–400. [Google Scholar]
  98. Hu, H.; Gu, J.; Zhang, Z.; Dai, J.; Wei, Y. Relation networks for object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 18–23 June 2018; pp. 3588–3597. [Google Scholar]
  99. Amini-Naieni, N.; Amini-Naieni, K.; Han, T.; Zisserman, A. Open-world text-specified object counting. arXiv 2023, arXiv:2306.01851. [Google Scholar]
  100. Zhu, H.; Yuan, J.; Yang, Z.; Guo, Y.; Wang, Z.; Zhong, X.; He, S. Zero-shot object counting with good exemplars. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2024; pp. 368–385. [Google Scholar]
  101. Feng, C.; Zhong, Y.; Jie, Z.; Chu, X.; Ren, H.; Wei, X.; Xie, W.; Ma, L. Promptdet: Towards open-vocabulary detection using uncurated images. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2022; pp. 701–717. [Google Scholar]
  102. Ranjan, V.; Nguyen, M.H. Exemplar free class agnostic counting. In Proceedings of the Asian Conference on Computer Vision, Macau, China, 4–8 December 2022; pp. 3121–3137. [Google Scholar]
  103. Hobley, M.; Prisacariu, V. Learning to count anything: Reference-less class-agnostic counting with weak supervision. arXiv 2022, arXiv:2205.10203. [Google Scholar]
  104. Chan, A.B.; Liang, Z.S.J.; Vasconcelos, N. Privacy preserving crowd monitoring: Counting people without people models or tracking. In Proceedings of the 2008 IEEE Conference on Computer Vision and Pattern Recognition; IEEE: Piscataway, NJ, USA, 2008; pp. 1–7. [Google Scholar]
  105. Sindagi, V.A.; Yasarla, R.; Patel, V.M. Pushing the frontiers of unconstrained crowd counting: New dataset and benchmark method. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Seoul, Republic of Korea, 27 October–2 November 2019; pp. 1221–1231. [Google Scholar]
  106. Idrees, H.; Tayyab, M.; Athrey, K.; Zhang, D.; Al-Maadeed, S.; Rajpoot, N.; Shah, M. Composition loss for counting, density map estimation and localization in dense crowds. In Proceedings of the European Conference on Computer Vision (ECCV), Munich, Germany, 8–14 September 2018; pp. 532–546. [Google Scholar]
  107. Wang, Q.; Gao, J.; Lin, W.; Li, X. NWPU-crowd: A large-scale benchmark for crowd counting and localization. IEEE Trans. Pattern Anal. Mach. Intell. 2020, 43, 2141–2149. [Google Scholar]
  108. Wang, Q.; Gao, J.; Lin, W.; Yuan, Y. Pixel-wise crowd understanding via synthetic data. Int. J. Comput. Vis. 2021, 129, 225–245. [Google Scholar]
  109. Sindagi, V.A.; Yasarla, R.; Patel, V.M. Jhu-crowd++: Large-scale crowd counting dataset and a benchmark method. IEEE Trans. Pattern Anal. Mach. Intell. 2020, 44, 2594–2609. [Google Scholar]
  110. Li, H.; Liu, L.; Yang, K.; Liu, S.; Gao, J.; Zhao, B.; Zhang, R.; Hou, J. Video crowd localization with multifocus gaussian neighborhood attention and a large-scale benchmark. IEEE Trans. Image Process. 2022, 31, 6032–6047. [Google Scholar] [CrossRef] [PubMed]
  111. Mondal, A.; Nag, S.; Zhu, X.; Dutta, A. Omnicount: Multi-label object counting with semantic-geometric priors. In Proceedings of the AAAI Conference on Artificial Intelligence, Philadelphia, PA, USA, 25 February–4 March 2025; Volume 39, pp. 19537–19545. [Google Scholar]
  112. Lien, C.C.; Wu, P.C. A Crowded Object Counting System with Self-Attention Mechanism. Sensors 2024, 24, 6612. [Google Scholar] [CrossRef] [PubMed]
  113. Zhu, P.; Wen, L.; Du, D.; Bian, X.; Ling, H.; Hu, Q.; Nie, Q.; Cheng, H.; Liu, C.; Liu, X.; et al. Visdrone-det2018: The vision meets drone object detection in image challenge results. In Proceedings of the European Conference on Computer Vision (ECCV) Workshops, Munich, Germany, 8–14 September 2018; pp. 437–468. [Google Scholar]
  114. Gao, G.; Liu, Q.; Wang, Y. Counting from sky: A large-scale data set for remote sensing object counting and a benchmark method. IEEE Trans. Geosci. Remote Sens. 2020, 59, 3642–3655. [Google Scholar] [CrossRef]
  115. Gupta, R.; Hosfelt, R.; Sajeev, S.; Patel, N.; Goodman, B.; Doshi, J.; Heim, E.; Choset, H.; Gaston, M. xbd: A dataset for assessing building damage from satellite imagery. arXiv 2019, arXiv:1911.09296. [Google Scholar]
  116. Aharari, A.; Kuwaduru, K.; Mehdipour, F. Development of an Artificial Intelligence (AI) Based Visual Counting System for the Food Industry. In Proceedings of the 2023 IEEE 13th Symposium on Computer Applications & Industrial Electronics (ISCAIE); IEEE: Piscataway, NJ, USA, 2023; pp. 136–139. [Google Scholar]
  117. Zou, Z.; Qu, X.; Zhou, P.; Xu, S.; Ye, X.; Wu, W.; Ye, J. Coarse to fine: Domain adaptive crowd counting via adversarial scoring network. In Proceedings of the 29th ACM International Conference on Multimedia, Chengdu, China, 20–24 October 2021; pp. 2185–2194. [Google Scholar]
  118. Wang, Z. Cross-domain microscopy cell counting by disentangled transfer learning. In Proceedings of the International Workshop on Trustworthy Machine Learning for Healthcare; Springer: Berlin/Heidelberg, Germany, 2023; pp. 93–105. [Google Scholar]
  119. Wang, Z.; Xiao, L.; Cao, Z.; Lu, H. Vision transformer off-the-shelf: A surprising baseline for few-shot class-agnostic counting. In Proceedings of the AAAI Conference on Artificial Intelligence, Vancouver, BC, Canada, 20–27 February 2024; Volume 38, pp. 5832–5840. [Google Scholar]
  120. Ciampi, L.; Messina, N.; Pierucci, M.; Amato, G.; Avvenuti, M.; Falchi, F. Mind the prompt: A novel benchmark for prompt-based class-agnostic counting. In Proceedings of the 2025 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV); IEEE: Piscataway, NJ, USA, 2025; pp. 7970–7979. [Google Scholar]
  121. Rabaud, V.; Belongie, S. Counting crowded moving objects. In Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’06); IEEE: Piscataway, NJ, USA, 2006; Volume 1, pp. 705–711. [Google Scholar]
  122. Mo, H.; Zhang, X.; Tan, J.; Yang, C.; Gu, Q.; Hang, B.; Ren, W. Countformer: Multi-view crowd counting transformer. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2024; pp. 20–40. [Google Scholar]
  123. Wang, Y.; Guizilini, V.C.; Zhang, T.; Wang, Y.; Zhao, H.; Solomon, J. Detr3d: 3d object detection from multi-view images via 3d-to-2d queries. In Proceedings of the Conference on Robot Learning; PMLR: New York, NY, USA, 2022; pp. 180–191. [Google Scholar]
  124. Liu, C.; Lu, H.; Cao, Z.; Liu, T. Point-query quadtree for crowd counting, localization, and more. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Paris, France, 2–6 October 2023; pp. 1676–1685. [Google Scholar]
  125. Su, Y.; Wang, Y.; Yao, L.; Chau, L.P. Few-shot class-agnostic counting with occlusion augmentation and localization. In Proceedings of the 2024 IEEE International Symposium on Circuits and Systems (ISCAS); IEEE: Piscataway, NJ, USA, 2024; pp. 1–5. [Google Scholar]
  126. Reddy, N.D.; Vo, M.; Narasimhan, S.G. Occlusion-net: 2d/3d occluded keypoint localization using graph networks. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Long Beach, CA, USA, 16–17 June 2019; pp. 7326–7335. [Google Scholar]
  127. Wang, G.; Manhardt, F.; Liu, X.; Ji, X.; Tombari, F. Occlusion-aware self-supervised monocular 6D object pose estimation. IEEE Trans. Pattern Anal. Mach. Intell. 2021, 46, 1788–1803. [Google Scholar]
  128. Arteta, C.; Lempitsky, V.; Noble, J.A.; Zisserman, A. Detecting overlapping instances in microscopy images using extremal region trees. Med. Image Anal. 2016, 27, 3–16. [Google Scholar] [CrossRef] [PubMed]
  129. Zhang, L.; Li, Y.; Nevatia, R. Global data association for multi-object tracking using network flows. In Proceedings of the 2008 IEEE Conference on Computer Vision and Pattern Recognition; IEEE: Piscataway, NJ, USA, 2008; pp. 1–8. [Google Scholar]
  130. Gidaris, S.; Komodakis, N. Object detection via a multi-region and semantic segmentation-aware cnn model. In Proceedings of the IEEE International Conference on Computer Vision, Santiago, Chile, 7–13 December 2015; pp. 1134–1142. [Google Scholar]
  131. Xu, H.; Chen, G.; Wang, Z.; Sun, L.; Su, F. RGB-D-based pose estimation of workpieces with semantic segmentation and point cloud registration. Sensors 2019, 19, 1873. [Google Scholar] [CrossRef] [PubMed]
  132. Peng, D.; Sun, Z.; Chen, Z.; Cai, Z.; Xie, L.; Jin, L. Detecting heads using feature refine net and cascaded multi-scale architecture. In Proceedings of the 2018 24th International Conference on Pattern Recognition (ICPR); IEEE: Piscataway, NJ, USA, 2018; pp. 2528–2533. [Google Scholar]
  133. Liang, D.; Xie, J.; Zou, Z.; Ye, X.; Xu, W.; Bai, X. Crowdclip: Unsupervised crowd counting via vision-language model. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Vancouver, BC, Canada, 17–24 June 2023; pp. 2893–2903. [Google Scholar]
  134. Tyagi, A.K.; Mohapatra, C.; Das, P.; Makharia, G.; Mehra, L.; AP, P. Degpr: Deep guided posterior regularization for multi-class cell detection and counting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Vancouver, BC, Canada, 17–24 June 2023; pp. 23913–23923. [Google Scholar]
  135. Yang, S.D.; Su, H.T.; Hsu, W.H.; Chen, W.C. Class-agnostic few-shot object counting. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, Virtual, 5–9 January 2021; pp. 870–878. [Google Scholar]
  136. Zhang, S.; Zhai, G.; Chen, K.; Wang, H.; Han, S. CFENet: Context-aware Feature Enhancement Network for efficient few-shot object counting. Image Vis. Comput. 2025, 154, 105383. [Google Scholar] [CrossRef]
  137. Chen, X.; Huo, S.; Jiang, B.; Hu, H.; Chen, X. Single Domain Generalization for Few-Shot Counting via Universal Representation Matching. In Proceedings of the Computer Vision and Pattern Recognition Conference, Nashville, TN, USA, 11–15 June 2025; pp. 4639–4649. [Google Scholar]
  138. Hobley, M.; Prisacariu, V. Abc easy as 123: A blind counter for exemplar-free multi-class class-agnostic counting. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2024; pp. 304–319. [Google Scholar]
  139. Yang, C.; Geng, T.; Peng, J.; Xu, C. PBECount: Prompt-Before-Extract Paradigm for Class-Agnostic Counting. In Proceedings of the AAAI Conference on Artificial Intelligence, Philadelphia, PA, USA, 25 February–4 March 2025; Volume 39, pp. 9139–9147. [Google Scholar]
  140. Perez, G.; Maji, S.; Sheldon, D. DISCount: Counting in large image collections with detector-based importance sampling. In Proceedings of the AAAI Conference on Artificial Intelligence, Vancouver, BC, Canada, 20–27 February 2024; Volume 38, pp. 22294–22302. [Google Scholar]
  141. Liu, L.; Chen, J.; Wu, H.; Li, G.; Li, C.; Lin, L. Cross-modal collaborative representation learning and a large-scale rgbt benchmark for crowd counting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Nashville, TN, USA, 20–25 June 2021; pp. 4823–4833. [Google Scholar]
  142. Hsieh, M.R.; Lin, Y.L.; Hsu, W.H. Drone-based object counting by spatially regularized regional proposal network. In Proceedings of the IEEE International Conference on Computer Vision, Venice, Italy, 22–29 October 2017; pp. 4145–4153. [Google Scholar]
  143. Chen, Y.; Li, W.; Sakaridis, C.; Dai, D.; Van Gool, L. Domain adaptive faster r-cnn for object detection in the wild. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 18–23 June 2018; pp. 3339–3348. [Google Scholar]
  144. Zhu, J.Y.; Park, T.; Isola, P.; Efros, A.A. Unpaired image-to-image translation using cycle-consistent adversarial networks. In Proceedings of the IEEE International Conference on Computer Vision, Venice, Italy, 22–29 October 2017; pp. 2223–2232. [Google Scholar]
  145. Arteta, C.; Lempitsky, V.; Noble, J.A.; Zisserman, A. Learning to detect cells using non-overlapping extremal regions. In Proceedings of the International Conference on Medical Image Computing and Computer-Assisted Intervention; Springer: Berlin/Heidelberg, Germany, 2012; pp. 348–356. [Google Scholar]
  146. Wang, B.; Liu, H.; Samaras, D.; Nguyen, M.H. Distribution matching for crowd counting. Adv. Neural Inf. Process. Syst. 2020, 33, 1595–1607. [Google Scholar]
  147. Ma, Z.; Wei, X.; Hong, X.; Gong, Y. Bayesian loss for crowd count estimation with point supervision. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Seoul, Republic of Korea, 27 October–2 November 2019; pp. 6142–6151. [Google Scholar]
  148. Xu, W.; Liang, D.; Zheng, Y.; Xie, J.; Ma, Z. Dilated-scale-aware category-attention convnet for multi-class object counting. IEEE Signal Process. Lett. 2021, 28, 1570–1574. [Google Scholar] [CrossRef]
  149. Qin, Z.; Li, Z.; Zhang, Z.; Bao, Y.; Yu, G.; Peng, Y.; Sun, J. ThunderNet: Towards real-time generic object detection on mobile devices. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Seoul, Republic of Korea, 27 October–2 November 2019; pp. 6718–6727. [Google Scholar]
  150. Howard, A.G. Mobilenets: Efficient convolutional neural networks for mobile vision applications. arXiv 2017, arXiv:1704.04861. [Google Scholar]
  151. Zhang, X.; Zhou, X.; Lin, M.; Sun, J. Shufflenet: An extremely efficient convolutional neural network for mobile devices. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 18–23 June 2018; pp. 6848–6856. [Google Scholar]
  152. Guo, H.; Gao, J.; Yuan, Y. Enhancing Low-Rank Adaptation with Recoverability-Based Reinforcement Pruning for Object Counting. In Proceedings of the AAAI Conference on Artificial Intelligence, Philadelphia, PA, USA, 25 February–4 March 2025; Volume 39, pp. 3238–3246. [Google Scholar]
  153. Han, S.; Mao, H.; Dally, W.J. Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv 2015, arXiv:1510.00149. [Google Scholar]
  154. Wang, R.J.; Li, X.; Ling, C.X. Pelee: A real-time object detection system on mobile devices. Adv. Neural Inf. Process. Syst. 2018, 31, 1967–1976. [Google Scholar]
  155. IEC 61508; Functional Safety of Electrical/Electronic/Programmable Electronic Safety-Related Systems. International Electrotechnical Commission: Geneva, Switzerland, 2010.
  156. Wang, Z.; Pan, Z.; Peng, Z.; Cheng, J.; Xiao, L.; Jiang, W.; Cao, Z. Exploring Contextual Attribute Density in Referring Expression Counting. In Proceedings of the Computer Vision and Pattern Recognition Conference, Nashville, TN, USA, 11–15 June 2025; pp. 19587–19596. [Google Scholar]
  157. Dai, S.; Liu, J.; Cheung, N.M. Referring expression counting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Seattle, WA, USA, 16–22 June 2024; pp. 16985–16995. [Google Scholar]
  158. Amini-Naieni, N.; Zisserman, A. Open-World Object Counting in Videos. arXiv 2025, arXiv:2506.15368. [Google Scholar]
  159. Amini-Naieni, N.; Han, T.; Zisserman, A. Countgd: Multi-modal open-world counting. Adv. Neural Inf. Process. Syst. 2024, 37, 48810–48837. [Google Scholar] [CrossRef]
  160. Lian, D.; Li, J.; Zheng, J.; Luo, W.; Gao, S. Density map regression guided detection network for rgb-d crowd counting and localization. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Long Beach, CA, USA, 15–20 June 2019; pp. 1821–1830. [Google Scholar]
  161. Zhang, D.; Han, J.; Cheng, G.; Yang, M.H. Weakly supervised object localization and detection: A survey. IEEE Trans. Pattern Anal. Mach. Intell. 2021, 44, 5866–5885. [Google Scholar]
  162. Zhou, B.; Khosla, A.; Lapedriza, A.; Oliva, A.; Torralba, A. Learning deep features for discriminative localization. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, NV, USA, 27–30 June 2016; pp. 2921–2929. [Google Scholar]
  163. Zeng, X.; Ouyang, W.; Yang, B.; Yan, J.; Wang, X. Gated bi-directional cnn for object detection. In Proceedings of the European Conference on Computer Vision; Springer: Berlin/Heidelberg, Germany, 2016; pp. 354–369. [Google Scholar]
  164. Kirillov, A.; Mintun, E.; Ravi, N.; Mao, H.; Rolland, C.; Gustafson, L.; Xiao, T.; Whitehead, S.; Berg, A.C.; Lo, W.Y.; et al. Segment anything. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Paris, France, 2–3 October 2023; pp. 4015–4026. [Google Scholar]
Figure 1. PRISMA 2020 flow diagram illustrating the study selection process for this systematic review.
Figure 1. PRISMA 2020 flow diagram illustrating the study selection process for this systematic review.
Sensors 26 04494 g001
Figure 2. The technological evolution matrix of industrial object counting from 2010 to 2025. This matrix maps key advancements against time, core industrial challenges, and annotation paradigms, revealing how each paradigm shift was driven by the need to address increasingly complex scenarios.
Figure 2. The technological evolution matrix of industrial object counting from 2010 to 2025. This matrix maps key advancements against time, core industrial challenges, and annotation paradigms, revealing how each paradigm shift was driven by the need to address increasingly complex scenarios.
Sensors 26 04494 g002
Figure 3. Adapted SAU-Net architecture for dense industrial object counting. The model adopts a symmetric encoder-decoder structure: the encoder path extracts multi-scale features of industrial workpieces via stacked convolution and downsampling; the self-attention module captures global feature dependencies to handle occluded and dense targets; the decoder path reconstructs the high-resolution density map through skip connection feature fusion. The online batch normalization is designed to mitigate the generalization gap in small-scale industrial datasets, and the final count is obtained by integrating the output density map over the full image domain [70].
Figure 3. Adapted SAU-Net architecture for dense industrial object counting. The model adopts a symmetric encoder-decoder structure: the encoder path extracts multi-scale features of industrial workpieces via stacked convolution and downsampling; the self-attention module captures global feature dependencies to handle occluded and dense targets; the decoder path reconstructs the high-resolution density map through skip connection feature fusion. The online batch normalization is designed to mitigate the generalization gap in small-scale industrial datasets, and the final count is obtained by integrating the output density map over the full image domain [70].
Sensors 26 04494 g003
Figure 4. Evolution of matching mechanisms for class-agnostic counting: from the generic matching network (GMN) [47], to test-time adaptive FamNet [92], and bilinear matching-based BMNet [93].
Figure 4. Evolution of matching mechanisms for class-agnostic counting: from the generic matching network (GMN) [47], to test-time adaptive FamNet [92], and bilinear matching-based BMNet [93].
Sensors 26 04494 g004
Figure 5. Core challenges and corresponding solutions for industrial object counting. The diagram summarizes four key bottlenecks limiting the industrial deployment of object-counting algorithms, and the corresponding mainstream technical solutions validated in real industrial scenarios, as detailed in Section 6 of this paper.
Figure 5. Core challenges and corresponding solutions for industrial object counting. The diagram summarizes four key bottlenecks limiting the industrial deployment of object-counting algorithms, and the corresponding mainstream technical solutions validated in real industrial scenarios, as detailed in Section 6 of this paper.
Sensors 26 04494 g005
Figure 6. The Core Architecture Pipeline of Feature Refine Net (FRN). Note: FRN takes ResNet-50 as the backbone, and realizes multi-scale feature refinement through four core modules: channel weighting, feature decomposition upsampling, and Inception-style feature synthesis. It is designed to optimize the multi-scale feature representation of FPN for industrial object-counting tasks.
Figure 6. The Core Architecture Pipeline of Feature Refine Net (FRN). Note: FRN takes ResNet-50 as the backbone, and realizes multi-scale feature refinement through four core modules: channel weighting, feature decomposition upsampling, and Inception-style feature synthesis. It is designed to optimize the multi-scale feature representation of FPN for industrial object-counting tasks.
Sensors 26 04494 g006
Figure 7. Hierarchical Real-Time Requirements and Technical Solutions for Industrial Object Counting.
Figure 7. Hierarchical Real-Time Requirements and Technical Solutions for Industrial Object Counting.
Sensors 26 04494 g007
Figure 8. Accuracy Evolution Trend (2014–2025) of Industrial object-counting Methods (2014–2025) (Illustrative Trend). The plot illustrates the reduction in Mean Absolute Error (MAE) across key algorithms on mainstream industrial datasets (ShanghaiTech, FSC147, NWPU-MOC), highlighting critical breakthroughs: a 76.0% MAE reduction by YOLOv1 (2016) for real-time counting, and a 69.6% improvement by Mamba-MOC [82] for high-resolution industrial scenarios, showing an approximate 95.3% overall MAE reduction as an illustrative indicator of technological evolution rather than a rigorous direct quantitative comparison, since datasets and experimental settings vary across different studies.
Figure 8. Accuracy Evolution Trend (2014–2025) of Industrial object-counting Methods (2014–2025) (Illustrative Trend). The plot illustrates the reduction in Mean Absolute Error (MAE) across key algorithms on mainstream industrial datasets (ShanghaiTech, FSC147, NWPU-MOC), highlighting critical breakthroughs: a 76.0% MAE reduction by YOLOv1 (2016) for real-time counting, and a 69.6% improvement by Mamba-MOC [82] for high-resolution industrial scenarios, showing an approximate 95.3% overall MAE reduction as an illustrative indicator of technological evolution rather than a rigorous direct quantitative comparison, since datasets and experimental settings vary across different studies.
Sensors 26 04494 g008
Table 1. Comparison between this review and existing related reviews.
Table 1. Comparison between this review and existing related reviews.
Review TypeFocus AreaTechnical CoverageIndustrial DepthMethodology
Crowd-counting surveys [11]Dense crowd density estimationCNN, Transformer, loss functionsLow (public safety focus)Informal review
General counting surveys [12]General object counting/CACCNN, Transformer, foundation modelsLow (general scenarios)Informal review
Industrial vision surveys [13,14]Defect/object detectionCNN, Transformer, deep learningHigh (industrial-specific)Informal review
Foundation model surveysGeneral vision foundation modelsCLIP, SAM, multimodal modelsLow (general domain)Informal review
This paperIndustrial object countingTraditional CV → CNN → Transformer → Mamba → Foundation modelsHigh (industrial-specific)PRISMA 2020 systematic
Table 2. Generalization Performance Comparison Between CLIP-based Methods and Traditional CNN Models for Counting New-Category Industrial Workpieces.
Table 2. Generalization Performance Comparison Between CLIP-based Methods and Traditional CNN Models for Counting New-Category Industrial Workpieces.
MethodGeneralization Accuracy (%)Performance Improvement (%)
CLIP-based Method: CLIP-Count [50,52]86.340.2
CLIP-based Method: VLCounter [51]87.241.5
Traditional CNN: CSRNet [1,47]61.5
Traditional CNN: MCNN [6,47]59.8
Note: Test datasets are NWPU-MOC and WPCD-DATASET (industrial workpiece datasets).
Table 3. Computational Efficiency Comparison of MCNN and Mainstream Density Map Baselines.
Table 3. Computational Efficiency Comparison of MCNN and Mainstream Density Map Baselines.
ModelParamsFLOPsFPSArchitecture Type
(M) ↓(G) ↓(@512×512) ↑
MCNN17.2128.467Multi-column CNN
CSRNet (Classic Density Baseline)16.268.799Single-column CNN
SFCN (Industrial Common Baseline)8.735.2165Single-column CNN
Single-column Baseline (Same Depth as MCNN)5.242.6142Single-column CNN
Note: ↓ indicates smaller values correspond to higher computational efficiency; ↑ indicates larger values correspond to faster inference speed.
Table 4. Main Public Datasets for Industrial Object Counting and Category Division.
Table 4. Main Public Datasets for Industrial Object Counting and Category Division.
Dataset NameDataset TypeImages NumberCategoriesAnnotation TypeRelease YearPublication Venue
OIRDSGeneral Traffic∼900Overhead vehicleBounding box2009IEEE
ShanghaiTechGeneral Crowd1198CrowdPoint/Density map2016IEEE
CARPKGeneral Traffic1448Parking lot carBounding box2017ICCV
UCF-QNRFGeneral Crowd1535CrowdPoint/Density map2018ECCV
VisDrone-DET2018General Remote Sensing8599Human, vehicle, etc.Bounding box2018ECCV
RSOCGeneral Remote Sensing3057Buildings, ships, vehiclesPoint/Bounding box2020IEEE
NWPU-CrowdGeneral Crowd5109CrowdPoint/Density map2021IEEE
FSC147General Few-Shot6146Daily objects, 147 categoriesBounding box/Point2021CVPR
FSCD-147General Few-Shot6146Daily objects, 147 categoriesDensity map2022ECCV
FSCD-LVISGeneral Few-Shot6196Common objects, 377 categoriesDensity map2022ECCV
CountBenchGeneral Benchmark540Point2023ICCV
WPCD-DATASETIndustrial Exclusive121,475Various industrial workpiecesBounding box/Point2024IEEE
BIKE-1000General Traffic1000Shared bikesBounding box2024
NWPU-MOCIndustrial Remote Sensing3416Aircraft, ships, vehicles, farmland facilities, etc.Point/Density map2024IEEE
MCACGeneral Multi-Class16,224Common daily objectsPoint/Density map2024ECCV
OmniCount-191General Multi-Class30,230Kitchenware, office supplies, transportation tools, etc.Density map/Semantic mask2025AAAI
Note: “Industrial Exclusive” and “Industrial Remote Sensing” datasets are constructed for industrial production and industrial remote sensing scenarios, which can be directly used for training and evaluation of industrial counting algorithms; “General” datasets are oriented to general scenarios such as crowd, traffic and daily objects. When applied to industrial counting tasks, cross-domain transfer processing is required. “–” indicates that the relevant information is not publicly available.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Wang, W.; Zhang, S.; He, J.; Liu, L.; Du, W.; Zhang, L. Industrial Object Counting from Traditional Machine Vision to Open-World Foundation Models: A Systematic Review. Sensors 2026, 26, 4494. https://doi.org/10.3390/s26144494

AMA Style

Wang W, Zhang S, He J, Liu L, Du W, Zhang L. Industrial Object Counting from Traditional Machine Vision to Open-World Foundation Models: A Systematic Review. Sensors. 2026; 26(14):4494. https://doi.org/10.3390/s26144494

Chicago/Turabian Style

Wang, Wei, Shengjie Zhang, Jin He, Lanhui Liu, Wu Du, and Le Zhang. 2026. "Industrial Object Counting from Traditional Machine Vision to Open-World Foundation Models: A Systematic Review" Sensors 26, no. 14: 4494. https://doi.org/10.3390/s26144494

APA Style

Wang, W., Zhang, S., He, J., Liu, L., Du, W., & Zhang, L. (2026). Industrial Object Counting from Traditional Machine Vision to Open-World Foundation Models: A Systematic Review. Sensors, 26(14), 4494. https://doi.org/10.3390/s26144494

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop