BUDIONO, ARVEL ADELAR (2024) COMPARISON BUS PASSENGER COUNTING AND GENDER DETECTION USING YOLOV8, FASTER R-CNN, AND MASK R-CNN ALGORITHM. S1 thesis, UNIVERSITAS KATOLIK SOEGIJAPRANATA.

Preview	Text 21.K1.0002_ARVEL ADELAR BUDIONO_COVER.pdf Download (923kB) | Preview
	Text 21.K1.0002_ARVEL ADELAR BUDIONO_BAB I.pdf Restricted to Registered users only Download (514kB)
	Text 21.K1.0002_ARVEL ADELAR BUDIONO_BAB II.pdf Restricted to Registered users only Download (495kB)
	Text 21.K1.0002_ARVEL ADELAR BUDIONO_BAB III.pdf Restricted to Registered users only Download (520kB)
	Text 21.K1.0002_ARVEL ADELAR BUDIONO_BAB IV.pdf Restricted to Registered users only Download (10MB)
	Text 21.K1.0002_ARVEL ADELAR BUDIONO_BAB V.pdf Restricted to Registered users only Download (481kB)
Preview	Text 21.K1.0002_ARVEL ADELAR BUDIONO_DAPUS.pdf Download (531kB) | Preview
	Text 21.K1.0002_ARVEL ADELAR BUDIONO_LAMP.pdf Restricted to Registered users only Download (420kB)

Abstract

Bus passengers' data are crucial for the bus agents, especially in Indonesia. With this data, bus agents could identify the traffic for each route of the bus. To handle this problem, many researchers have made a system to count and detect the public transportation passengers with different algorithms. Many researchers defined that You Look Only Once (YOLO) has best performance to overcome the object detection problem that has similarity in this research. The Convolutional Neural Network algorithm is also not inferior in implementing object detection either. In this research, it will investigate these three algorithms, You Only Look Once version 8 (YOLOv8), Faster Region Convolutional Neural Network (Faster R-CNN), and Mask Region Convolutional Neural Network (Mask R-CNN), in counting bus passengers and detecting the bus passenger’s gender. To find the best performance of these two algorithms, they will use a dataset that contains 408 photos of bus passengers. This research aims to analyze the result of the bus passengers data that could reduce the misalignment and determine the best algorithm to use in this case.

Actions (login required)

View Item