Adaptive Gaussian Kernel Sizing for Crowd Counting

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing crowd counting systems face challenges in accurately calculating the size of Gaussian kernels due to uneven crowd densities and complex spatial relationships in real-world scenarios, leading to difficulties in training convolutional neural networks and reducing the accuracy of crowd counting.

Innovation Solution

A method is introduced to adaptively calculate the size of Gaussian kernels by dividing the crowd density map into rectangular areas, calculating the average distance of k nearest heads, and using bilinear interpolation to estimate and weight these distances, ensuring accurate kernel sizes that align with the perspective relationship in the image.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If the size of Gaussian kernel is fixed for all heads, then the system is simple to implement, but it cannot accurately reflect the perspective relationship 'a big look at near and a small look in the distance' leading to reduced counting accuracy

Engineering Contradiction:
Improvecrowd counting accuracyVSAvoidkernel size calculation complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent applies local quality by making the Gaussian kernel size adaptive to local crowd density characteristics. Each head's kernel size is determined by the average distance to its k-nearest neighboring heads, allowing different regions of the image to have appropriately scaled kernels that reflect local spatial relationships and perspective effects.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The patent performs preliminary calculation of kernel sizes before the main crowd counting process. By pre-computing the average distance to k-nearest heads for each head and storing these values, the system prepares the adaptive kernel size information in advance, which is then used during the density map generation phase without adding significant computational overhead during training.

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If additional spatial information (body size, line features) is collected and labeled to reflect perspective relationship, then the accuracy of perspective relationship estimation is improved, but the workload and time cost of manual labeling becomes unbearable

Engineering Contradiction:
Improveperspective relationship estimation accuracyVSAvoiddata labeling time cost
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent implements self-service by enabling the system to automatically derive spatial relationship information from existing head center point coordinates without requiring manual labeling of additional features. The average distance to k-nearest heads is computed algorithmically from the available data, allowing the system to serve its own information needs using existing resources.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent introduces an intermediary approach by using the average distance to k-nearest heads as a proxy for direct spatial measurements like body size or line features. This intermediary metric captures the essential perspective relationship information without requiring direct measurement of physical dimensions, bridging the gap between available data and needed spatial understanding.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Measurement precision

If the crowd density map is divided into multiple rectangular areas with different kernel sizes, then the perspective relationship is better captured, but the computational complexity increases

Engineering Contradiction:
Improvespatial relationship representation accuracyVSAvoidprocessing efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent applies dynamics by making the kernel size a dynamic parameter that varies continuously across the image based on local crowd density. Instead of fixing kernel sizes for entire rectangular regions, each head receives a customized kernel size determined by its local neighborhood, allowing the system to adapt to fine-grained spatial variations without rigid regional divisions.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS11983929B2Method for adaptively calculating size of Gaussian kernel in crowd counting system
Publication Date: 2024.05.14 CRSC COMM & INFORMATION GRP CO LTD
  • US11983929B2 patent drawing

AI summary

A method of calculating a size of a Gaussian kernel in a crowd counting system. The method includes dividing a crowd density map into several areas at equal intervals; calculating an estimated value of average distance of k nearest heads with respect to a head center point coordinate of a current person; calculating a weight coefficient for an average distance of k nearest heads; calculating a size of a Gaussian kernel corresponding to the head center point coordinate of the current person; determining whether there are any head center point coordinates of which sizes of Gaussian kernels have not been calculated yet in training data. If there are head center point coordinates of which sizes of the Gaussian kernels have not been calculated in the training data, recalculating an estimated value of average distance of k nearest heads with respect to another head center point coordinate of another current person.