Back to search

Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science

Event-based clustering and looming detection

Abstract

dc:description.abstract

Based on the sequential K-means algorithm, we present a real-time, accurate and automatic clustering method for asynchronous events generated by the optical flow algorithm of Ridwan and Cheng. The complexity of our algorithm does not increase with increasing number of events. We also designed an implementation of the elbow method capable of detecting the number of clusters without any a priori assumptions on objects. In addition, we designed a merge algorithm capable of merging multiple touching clusters into one for enhancing the results of our clustering algorithm. The output of our clustering algorithm is then used with a single object looming detection algorithm to detect looming for multiple objects. We tested our algorithm on both simulated and captured data sets against two other well-known algorithms. Our algorithm is fast and accurate both in cluster detection quality and looming detection quality.

Degree

thesis:*
Level thesis:degree_level
Masters
Grantor dc:publisher
Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science
Year dc:date.issued
2019

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Kamranian, Behnam
  • University of Lethbridge. Faculty of Arts and Science
Advisor dc:contributor.supervisor
  • Cheng, Howard

Subjects

dc:subject × 4

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10133/5596

Chain of custody

source
Harvested from
University of Lethbridge
Base URL
opus.uleth.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Kamranian, Behnam; University of Lethbridge. Faculty of Arts and Science. Event-based clustering and looming detection. Masters thesis, Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, 2019. https://hdl.handle.net/10133/5596