Shape and Centroid Independent Clustring Algorithm for Crowd Management Applications

08/02/2016
by   Yasser Mohammad Seddiq, et al.
0

Clustering techniques play an important role in data mining and its related applications. Among the challenging applications that require robust and real-time processing are crowd management and group trajectory applications. In this paper, a robust and low-complexity clustering algorithm is proposed. It is capable of processing data in a manner that is shape and centroid independent. The algorithm is of low complexity due to the novel technique to compute the matrix power. The algorithm was tested on real and synthetic data and test results are reported.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2018

Linear density-based clustering with a discrete density model

Density-based clustering techniques are used in a wide range of data min...
research
05/15/2023

Online Sequence Clustering Algorithm for Video Trajectory Analysis

Target tracking and trajectory modeling have important applications in s...
research
02/01/2016

Scene Invariant Crowd Segmentation and Counting Using Scale-Normalized Histogram of Moving Gradients (HoMG)

The problem of automated crowd segmentation and counting has garnered si...
research
05/11/2020

Hardware Implementation of Adaptive Watermarking Based on Local Spatial Disorder Analysis

With the increasing use of the internet and the ease of exchange of mult...
research
01/06/2010

Document Clustering with K-tree

This paper describes the approach taken to the XML Mining track at INEX ...
research
03/25/2020

A Survey on Trajectory Data Management, Analytics, and Learning

Recent advances in sensor and mobile devices have enabled an unprecedent...

Please sign up or login with your details

Forgot password? Click here to reset