Skip to content

Algorithm for approximating future green-time for a traffic signal. Based on SSD300 object recognition network.

License

Notifications You must be signed in to change notification settings

parinithshekar/traffic-prediction

Repository files navigation

Traffic Prediction

This repository showcases an algorithm based on moving weighted averages that approximates the future green-time for traffic signals. The research paper published on the same can be found here.

The SSD300 model used for this project is derived from pierluigiferrari/ssd_keras. The base model is modified to have only 7 object classes and the weights pre-trained on MS COCO data set are sub-sampled to extract weights for specific vehicle classes.

Prerequisites

  • Tensorflow (Last run on v1.12.0)
  • Keras (Last run on v2.2.4)
  • OpenCV (Last run on v4.2.0)
  • numpy

Download the .h5 model and place it in the root directory

Run

python process.py

This algorithm uses a few hyper-parameters that can be approximated by considering the vehicle and acceleration profiles of different vehicles. The most important parameter is the "Optimal Processing Time" or OPT, which is an estimate of how long a vehicle takes to cross the field of view of the camera that is mounted on the traffic signal. This camera angle is optimal for this algorithm as it gets the best view of the vehicles and detects them with higher accuracy.

This approach has its own limitations that are inherent with any image-processing algorithm, but attempts to give a basis to solve the traffic problem by using minimal hardware/ compute resources.

Videos

Other video sources that this algorithm is tested on and their processed results can be found here

These videos are:

About

Algorithm for approximating future green-time for a traffic signal. Based on SSD300 object recognition network.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages