A Robust Bi-Directional Algorithm For People Count In Crowded Areas
- URL: http://arxiv.org/abs/2311.03323v1
- Date: Mon, 6 Nov 2023 18:18:26 GMT
- Title: A Robust Bi-Directional Algorithm For People Count In Crowded Areas
- Authors: Satyanarayana Penke, Gopikrishna Pavuluri, Soukhya Kunda, Satvik M,
CharanKumar Y
- Abstract summary: People counting algorithm presented in this paper, is centered on blob assessment.
The core premise of this work is to extricate count of people inflow and outflow pertaining to a particular area.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: People counting system in crowded places has become a very useful practical
application that can be accomplished in various ways which include many
traditional methods using sensors. Examining the case of real time scenarios,
the algorithm espoused should be steadfast and accurate. People counting
algorithm presented in this paper, is centered on blob assessment, devoted to
yield the count of the people through a path along with the direction of
traversal. The system depicted is often ensconced at the entrance of a building
so that the unmitigated frequency of visitors can be recorded. The core premise
of this work is to extricate count of people inflow and outflow pertaining to a
particular area. The tot-up achieved can be exploited for purpose of statistics
in the circumstances of any calamity occurrence in that zone. Relying upon the
count totaled, the population in that vicinity can be assimilated in order to
take on relevant measures to rescue the people.
Related papers
- Real-Time AI-Driven People Tracking and Counting Using Overhead Cameras [12.04532778397946]
This study proposes a novel approach combining a new object tracking algorithm, a novel counting algorithm, and a fine-tuned object detection model.
This method achieves 97% accuracy in real-time people counting with a frame rate of 20-27 FPS on a low-power edge computer.
arXiv Detail & Related papers (2024-11-15T09:37:49Z) - Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams [9.22255012731159]
We present the first learned competing-counter-based algorithm, called LSS, for identifying heavy hitters, top k, and flow frequency estimation.
Our evaluation demonstrates that LSS can enhance the accuracy and efficiency of Space Saving in identifying heavy hitters, top k, and estimating flow frequencies.
arXiv Detail & Related papers (2024-06-24T02:31:00Z) - Robust Zero-Shot Crowd Counting and Localization With Adaptive Resolution SAM [55.93697196726016]
We propose a simple yet effective crowd counting method by utilizing the Segment-Everything-Everywhere Model (SEEM)
We show that SEEM's performance in dense crowd scenes is limited, primarily due to the omission of many persons in high-density areas.
Our proposed method achieves the best unsupervised performance in crowd counting, while also being comparable to some supervised methods.
arXiv Detail & Related papers (2024-02-27T13:55:17Z) - A Strong Baseline for Crowd Counting and Unsupervised People
Localization [2.690502103971799]
We explore a strong baseline for crowd counting and an unsupervised people localization algorithm based on estimated density maps.
We collect different backbones and training tricks and evaluate the impact of changing them.
We propose a clustering algorithm named isolated KMeans to locate the heads in density maps.
arXiv Detail & Related papers (2020-11-07T08:29:03Z) - A Self-Training Approach for Point-Supervised Object Detection and
Counting in Crowds [54.73161039445703]
We propose a novel self-training approach that enables a typical object detector trained only with point-level annotations.
During training, we utilize the available point annotations to supervise the estimation of the center points of objects.
Experimental results show that our approach significantly outperforms state-of-the-art point-supervised methods under both detection and counting tasks.
arXiv Detail & Related papers (2020-07-25T02:14:42Z) - Fine-Grained Crowd Counting [59.63412475367119]
Current crowd counting algorithms are only concerned with the number of people in an image.
We propose fine-grained crowd counting, which differentiates a crowd into categories based on the low-level behavior attributes of the individuals.
arXiv Detail & Related papers (2020-07-13T01:31:12Z) - 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) - CNN-based Density Estimation and Crowd Counting: A Survey [65.06491415951193]
This paper comprehensively studies the crowd counting models, mainly CNN-based density map estimation methods.
According to the evaluation metrics, we select the top three performers on their crowd counting datasets.
We expect to make reasonable inference and prediction for the future development of crowd counting.
arXiv Detail & Related papers (2020-03-28T13:17:30Z) - A General Method for Robust Learning from Batches [56.59844655107251]
We consider a general framework of robust learning from batches, and determine the limits of both classification and distribution estimation over arbitrary, including continuous, domains.
We derive the first robust computationally-efficient learning algorithms for piecewise-interval classification, and for piecewise-polynomial, monotone, log-concave, and gaussian-mixture distribution estimation.
arXiv Detail & Related papers (2020-02-25T18:53:25Z)
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.