Real Time Image Processing Applied To Traffic Queue Detection Algorithm
Real Time Image Processing Applied To Traffic Queue Detection Algorithm
Prepared by
A.UMAMAHESWARARAO
Email-id:umamahesh1201@yahoo.com
&
RAMA KRISHNA
Email-id: @yahoo.com
Of Third IT,
ABSTRACT_____________________
This paper primarily aims at the new technique of video image
processing used to solve problems associated with the real-time road traffic control
systems. There is a growing demand for road traffic data of all kinds. Increasing
congestion problems and problems associated with existing detectors spawned an
interest in such new vehicle detection technologies. But the systems have difficulties
with congestion, shadows and lighting transitions.
Problem concerning any practical image processing application to road
traffic is the fact that real world images are to be processed in real time. Various
algorithms, mainly based on back ground techniques, have been developed for this
purposes since back ground based algorithms are very sensitive to ambient lighting
conditions, they have not yielded the expected results. So a real-time image tracking
approach using edged detection techniques was developed for detecting vehicles
under these trouble-posing conditions.
This paper will give a general overview of the image processing
technique used in analysis of video images, problems associated with it, methods of
vehicle detection and tracking, pre-processing techniques and the paper also
presents the real-time image processing technique used to measure traffic queue
parameters.
TABLE OF CONTENTS
(1) Introduction
2.1
Digital Signal
2.2
2.3
Parameters measurable...
2.4
Pipeline preprocessing...
Threshold selection...
8.2
10
8.3
11
(9) Conclusion
12
References .
13
INTRODUCTION _____________________
The word Digital implies that the information in the computer is represented
and sent by variables that taken limited number of discrete values.
Digital Signal
Digital systems functions more reliable, because only tow states are used
(zeros and ones BINARY SYSTEM). The word signal is a function of independent
variables. The signal it self carries some kind of information available for
observation.
By processing we mean operating in some fashion on signal to extract some
useful information. In many cases the processing will be none destructive
TRANEFER MODE of the given data signal.
Signal processing will be done in many ways.
1.
2.
3.
4.
Traffic parameters measurable: Traffic volumes, Speed, Headways, Inter-vehicle gaps, Vehicle classification,
Origin and destination of traffic, Junction turning.
CCTV
camera
RAM
64k bytes
ADC
Backing store
2 M-byte
16-bit
MiniComputer
(data bus)
DAC
monitor
Printer
Pre-processing:
High SNR of the camera output reduces the quantity of processing enormous
data flow.
1.
Block diagram
frame 1
frame 2
L+2
L+2
Median Filter
Line profile 0
Line profile 1
No(motion)
Yes(motion)
Dif<T
h1
1.
This program selects a grey value from the histogram of the window, where
there are approx. zero edge points above this grey value.
When the window contains an object, the left-limit of the histogram shifts
towards the maximum grey value, otherwise it shifts towards the origin.
The no. of edge points greater than the left limit grey value of each window is
extracted for a large no. of frames (200) to get enough parameters below and
above a proper threshold value.
This nos. are used to create a histogram where its horizontal and vertical
axes correspond to the no. of edge points greater than left limit and the
frequency of repetition of these numbers for a period of operation of the
algorithm (200 frames).
This histogram is smoothed using a median filter and we expect to get two
peaks in the resulted diagram, one peak related to the frames passing a
vehicle and the other related to the frames without vehicles for that window.
However, as it can be seen in the figure given below, there are other number
of edge points (32-40) between peaks 20 & 60, which are related to those
vehicles in each profile. We use statistical approach based on selecting a point
on the horizontal axis, where the sum of the entropy of the points above and
below this point is maximum. This point is selected as the threshold value for
the next period.
entry and exit paths of the junction cross the polygon. However, the polygon
should not cover the pedestrian marked lines. This step is shown in the figure
given below.
The second step of the algorithm is to define a minimum numbers of key
regions inside the boundary of the polygon, covering the junction.
These key regions are used for detecting vehicles entering and exiting the
junction, based on first vehicle in first-vehicle-out logic.
Following the application of the vehicle detection on each profile, a status
vector is created for each window in each frame.
If a vehicle is detected in a window, a one is inserted on its corresponding
status vector; otherwise, a Zero is inserted.
Now by analyzing the status vector of each window, the TMJ parameters are
calculated for each path of the junction.
Polygon Covered
Junction
The main queue parameters we were interested in identifying were the length
of the queue, the period of occurrence and the slope of the occurrence of the
queue behind the traffic lights.
Level>Th
Level>Th
N
motion detection
Q
U
E
U
E
D
E
T
E
C
T
I
O
N
Level>Th
Level>Th
vehicle detection
E
D
G
E
D
E
T
E
C
T
I
O
N
Conclusions
BIBLIOGRAPHY
Rourke, A., and Bell, M.G.H.: Queue detection and congestion monitoring
using mage processing, Traffic Engg. And Control.