Inception-Based Crowd Counting -- Being Fast while Remaining Accurate

• URL: http://arxiv.org/abs/2210.09796v1
• Date: Tue, 18 Oct 2022 12:12:13 GMT
• Title: Inception-Based Crowd Counting -- Being Fast while Remaining Accurate
• Authors: Yiming Ma
• Abstract summary: A new method, based on Inception-V3, is proposed to reduce the amount of computation. Experiments show that ICC can at best reduce 85.3 percent calculations with 24.4 percent performance loss.
• Score: 3.274290296343038
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent sophisticated CNN-based algorithms have demonstrated their extraordinary ability to automate counting crowds from images, thanks to their structures which are designed to address the issue of various head scales. However, these complicated architectures also increase computational complexity enormously, making real-time estimation implausible. Thus, in this paper, a new method, based on Inception-V3, is proposed to reduce the amount of computation. This proposed approach (ICC), exploits the first five inception blocks and the contextual module designed in CAN to extract features at different receptive fields, thereby being context-aware. The employment of these two different strategies can also increase the model's robustness. Experiments show that ICC can at best reduce 85.3 percent calculations with 24.4 percent performance loss. This high efficiency contributes significantly to the deployment of crowd counting models in surveillance systems to guard the public safety. The code will be available at https://github.com/YIMINGMA/CrowdCounting-ICC,and its pre-trained weights on the Crowd Counting dataset, which comprises a large variety of scenes from surveillance perspectives, will also open-sourced.

Related papers

• ProgRoCC: A Progressive Approach to Rough Crowd Counting [66.09510514180593]
  We label Rough Crowd Counting that delivers better accuracy on the basis of training data that is easier to acquire. We propose an approach to the rough crowd counting problem based on CLIP, termed ProgRoCC. Specifically, we introduce a progressive estimation learning strategy that determines the object count through a coarse-to-fine approach.
  arXiv  Detail & Related papers  (2025-04-18T01:57:42Z)
• Embodied Crowd Counting [86.10533153162476]
  Embodied Crowd Counting (ECC) is an interactive simulator that enables large scale scenes and large object quantity. A prior probability distribution that approximates realistic crowd distribution is introduced to generate crowds. This method contains a MLLM driven coarse-to-fine navigation mechanism, enabling active Z-axis exploration.
  arXiv  Detail & Related papers  (2025-03-11T12:23:34Z)
• COTR: Compact Occupancy TRansformer for Vision-based 3D Occupancy Prediction [60.87168562615171]
  The autonomous driving community has shown significant interest in 3D occupancy prediction. We propose Compact Occupancy TRansformer (COTR) with a geometry-aware occupancy encoder and a semantic-aware group decoder. COTR outperforms baselines with a relative improvement of 8%-15%.
  arXiv  Detail & Related papers  (2023-12-04T14:23:18Z)
• Window-Based Early-Exit Cascades for Uncertainty Estimation: When Deep Ensembles are More Efficient than Single Models [5.0401589279256065]
  We show that ensembles can be more computationally efficient (at inference) than scaling single models within an architecture family. In this work, we investigate extending these efficiency gains to tasks related to uncertainty estimation. Experiments on ImageNet-scale data across a number of network architectures and uncertainty tasks show that the proposed window-based early-exit approach is able to achieve a superior uncertainty-computation trade-off.
  arXiv  Detail & Related papers  (2023-03-14T15:57:54Z)
• ClusTR: Exploring Efficient Self-attention via Clustering for Vision Transformers [70.76313507550684]
  We propose a content-based sparse attention method, as an alternative to dense self-attention. Specifically, we cluster and then aggregate key and value tokens, as a content-based method of reducing the total token count. The resulting clustered-token sequence retains the semantic diversity of the original signal, but can be processed at a lower computational cost.
  arXiv  Detail & Related papers  (2022-08-28T04:18:27Z)
• CloudAttention: Efficient Multi-Scale Attention Scheme For 3D Point Cloud Learning [81.85951026033787]
  We set transformers in this work and incorporate them into a hierarchical framework for shape classification and part and scene segmentation. We also compute efficient and dynamic global cross attentions by leveraging sampling and grouping at each iteration. The proposed hierarchical model achieves state-of-the-art shape classification in mean accuracy and yields results on par with the previous segmentation methods.
  arXiv  Detail & Related papers  (2022-07-31T21:39:15Z)
• FusionCount: Efficient Crowd Counting via Multiscale Feature Fusion [36.15554768378944]
  This paper proposes a novel crowd counting architecture (FusionCount) It exploits the adaptive fusion of a large majority of encoded features instead of relying on additional extraction components to obtain multiscale features. Experiments on two benchmark databases demonstrate that our model achieves state-of-the-art results with reduced computational complexity.
  arXiv  Detail & Related papers  (2022-02-28T10:04:07Z)
• Verifiable Coded Computing: Towards Fast, Secure and Private Distributed Machine Learning [13.09925205966904]
  Stragglers, Byzantine workers, and data privacy are the main bottlenecks in distributed cloud computing. We propose Verifiable Coded Computing framework that decouples Byzantine node detection challenge from the straggler tolerance. Our experiments show that VCC speeds up the conventional uncoded implementation of distributed logistic regression by $3.2times-6.9times$.
  arXiv  Detail & Related papers  (2021-07-27T17:23:09Z)
• Efficient Inference via Universal LSH Kernel [35.22983601434134]
  We propose mathematically provable Representer Sketch, a concise set of count arrays that can approximate the inference procedure with simple hashing computations and aggregations. Representer Sketch builds upon the popular Representer Theorem from kernel literature, hence the name. We show that Representer Sketch achieves up to 114x reduction in storage requirement and 59x reduction in complexity without any drop in accuracy.
  arXiv  Detail & Related papers  (2021-06-21T22:06:32Z)
• PSCNet: Pyramidal Scale and Global Context Guided Network for Crowd Counting [44.306790250158954]
  This paper proposes a novel crowd counting approach based on pyramidal scale module (PSM) and global context module (GCM) PSM is used to adaptively capture multi-scale information, which can identify a fine boundary of crowds with different image scales. GCM is devised with low-complexity and lightweight manner, to make the interactive information across the channels of the feature maps more efficient.
  arXiv  Detail & Related papers  (2020-12-07T11:35:56Z)
• CARAFE++: Unified Content-Aware ReAssembly of FEatures [132.49582482421246]
  We propose unified Content-Aware ReAssembly of FEatures (CARAFE++), a universal, lightweight and highly effective operator to fulfill this goal. CARAFE++ generates adaptive kernels on-the-fly to enable instance-specific content-aware handling. It shows consistent and substantial gains across all the tasks with negligible computational overhead.
  arXiv  Detail & Related papers  (2020-12-07T07:34:57Z)
• Bayesian Multi-Scale Neural Network for Crowd Counting [0.0]
  Crowd counting is a challenging yet critical task in computer vision.<n>Recent advances using Convolutional Neural Networks (CNNs) that estimate density maps have shown significant success.<n>We propose a novel deep learning architecture that effectively addresses these challenges.
  arXiv  Detail & Related papers  (2020-07-11T21:43:20Z)
• Semi-Supervised Crowd Counting via Self-Training on Surrogate Tasks [50.78037828213118]
  This paper tackles the semi-supervised crowd counting problem from the perspective of feature learning. We propose a novel semi-supervised crowd counting method which is built upon two innovative components.
  arXiv  Detail & Related papers  (2020-07-07T05:30:53Z)
• Faster Secure Data Mining via Distributed Homomorphic Encryption [108.77460689459247]
  Homomorphic Encryption (HE) is receiving more and more attention recently for its capability to do computations over the encrypted field. We propose a novel general distributed HE-based data mining framework towards one step of solving the scaling problem. We verify the efficiency and effectiveness of our new framework by testing over various data mining algorithms and benchmark data-sets.
  arXiv  Detail & Related papers  (2020-06-17T18:14:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.