Motion Detection Using Differential Histogram Equalization
Motion Detection Using Differential Histogram Equalization
Abstract-In attention to general motion detection methods, ambiguous region which is between motion and silence
differential sequences of frames make some convenience regions to be realized as the class of movement (Fig. 1b).
which expand it’s usability for lots of applications. In Comparing Fig. 1a with Fig. 1b, we notice that the Bayes test
practice, differential sequences of frames have been affected for minimum cost is a likelihood ratio test with a different
by environmental noises and CCD cameras structure that threshold from Bayes test for minimum error [11].
make difficulty detection in volubility of objects. In this In these systems the second priority after the motion
method using differential histogram equalization, we try to detection is the speed of data processing. Increasing the speed
enhance and increase the contrast between data and noise of process causes an immediate result to the expert operator
histogram levels. The new threshold levels adaptively and the central control system. Therefore although accurate
obtained by simple algorithm and doesn’t need to know motion detection may be achieved by iterative methods,
probability distribution function of the noise. because of their long calculations time may not be used in
real time systems.
Keywords– Motion Detection, Histogram Equalization, Adaptive
Threshold. II. METHOD DESCRIPTION
187
n k : The number of pixels with K differential brightness sequential images which were obtained from video capture
system. The simple but reliable and adaptive thresholding by
level. using DHE can allow us to real-time surveillance. Fig. 8a
k nj shows the original image which is obtained from video
Sk = CDF[k] = ∑ (2)
j= 0 n capture system. The speed of video capturing system was 25
Sk , cumulative distribution function, is new differential frames per second that in addition to processing decreases to
20 frames per second. The result of difference of two
brightness level. Percentage of each new brightness level sequential images is shown in Fig. 8b. In order to find the
computed by equation (3): region of the moving object it is necessary to determine a
closed contour around the detected motion. This may be done
Ps [K.Sk ] = ∑ Pr [K.S j ] by first the differentiation of two consecutive frames
j (3) following DHE calculations which is shown in Fig. 8c and
for [K.S j ] = [K.Sk ] applying the algorithm mentioned in section (IV) which
results to Fig. 8d. The number of nonzero continuous
Equation (3) converts a number of the adjacent brightness brightness levels (ZL and ZR) that is used here are two. The
levels that occurred with small amplitude, to one brightness some simple and small noise which is remained can be
level with remarkable amplitude. Different between Figs. 4 removed by morphological processing [10]. It is done by two
and 5 shows it. stages of Morphology algorithm (Dilation/Erosion) followed
by using the remove particle algorithms will lead to figure (8-
e). In this case a uniform and binary region of the moving
IV. ADAPTIVE THRESHOLD object will be achieved by using the filling algorithm as
shown if Fig. 8f.
As a previous discussion, motions contain big area and Also it is necessary to find out a rectangle around the
motions with high contrast relative to background doesn’t moving object. The number of rectangles depends on the
need to complex or high precision algorithm because these number of motion detected regions in each camera which is
motion can be detected simply. The problem is detection of shown in Fig. 8f.
motions with brightness levels near to background or motions It is not necessary to transmit the entire image, because the
with small area. Two last properties cause to: (1) low background of the images is constant. We just extract the
moving images from the boundary that was obtained as Fig.
amplitude of motion brightness levels, (2) ling motion
8f. The results of the moving objects from the Fig. 8a are
brightness level near the center of DHE which the noise
shown in Figs. 8g and 8h. Finally, extracted images from
levels stand here. After DHE which is shown in Fig. 5, we try
moving object are sent through LAN and/or Modem to
to detect a threshold adaptively. The thresholds calculated as Central Security System.
nonzero continuous brightness levels with a number of
specific zero amplitude level after them. Because of small VI. CONCLUSION
and low variation, after DHE brightness levels of motion
have a continuously state at the corner of histogram. In some application such as security systems it is necessary
Threshold between motions levels and noise can be using of methods which are fast, reliable and simple. Usually
calculated by counting the continuous brightness levels with high precision boundary detection using likelihood ratio is
zero amplitude between them. Numbers of allowable zero not essential in security systems but also detection of motion
amplitude levels depend to motion area and brightness is vital. In this method using differential histogram
variation. Usually, it is equals two. equalization, we try to minimize the cost for the motion class
by enhancing and increasing the contrast between motion and
Fig. 7 shows the flowchart for obtaining the thresholds. H iR
no-motion histogram levels. The new threshold levels
Shows the Right side of DHE and H Lj shows the Left side of adaptively obtained by simple algorithm and doesn’t need to
it { i ∈ (0, 255], j ∈ [−255, 0) }. TR and TL are Right and Left know probability distribution function of the noise. This
threshold levels of DHE. ZR and ZL shows continuous method is applied for monitoring and security system of
brightness levels with zero amplitude from the two corners Electrical and Mechanical Eng. Departments of Amirkabir
re-entrant to centre of DHE. X is the numbers of allowable University (10 floors and 30 cameras). The result of it had
continuous levels with zero amplitude that usually is 2. good efficiency for fast detection of motion and cause to
reduce the human inspection fault.
V. EXPERIMENTAL RESULT
188
ACKNOWLEDGEMENT
REFERENCES
[1] McKenna, SJ. , Jabri, S., Duric, Z., Rosenfeld, Wechsler, H., “Tracking
groups of people” Int. J. Comput. Vision Image Understanding, vol. 80, pp.
42-56, 2000.
[2] Sukthankar, R., Stockton, R., “Argues: the digital doorman” IEEE Trans.
Intell. System, vol. 16(2), pp. 14-19, 2001.
[3] Kim, J.B., Lee, C.W., Hwang, S.W., Kim, H.J. “A real time moving
object detection for video monitoring system” Proc. ITC-CSCC 1, pp. 454-
457,2001b.
[4] Nariman, H., Alireza, M., Neil, B., “Automatic thresholding for change
detection in digital video” Proc. SPIE 4067, pp. 133-142, 2000.
[5]Kittler, J. Illingworth, J., “Minimum error thresholding pattern
recognition”, vol. 19 (1), pp. 41-47, 1986.
[6] Aach, T., Kaup, A., Mester, R., “Statistical model-based change
detection in moving video” Signal Processing, Vol. 31, pp.165-180, 1993.
[7] Kim, M., Chai, J.G., Kim, D., Lee, H., Lee, M.H., Ahn, C., Ho, Y.s., “A
vop generation tool: Automatic segmentation of moving objects in image
sequences based on spatio-temporal information” IEEE Trans. Circuits Sys.
Video Tech., Vol. 9, no. 8, pp. 1216-1226, 1999.
[8] Kim, J.B., Kim, H.J.,”Efficient region-based motion segmentation for
video monitoring system” Pattern recognition, vol. 24 (3), pp. 113-128, 2003.
[9] Teklap, A.M., Digital video processing, Prentice Hall, upper saddle river,
NJ, 1995.
[10] Gonzalez, R. C., and Woods, R. E., Digital Image Processing, Addison-
Wesley Publishing Company, Massachusetts, 1992.
[11] K. Fukunaga, Introduction to Statistical Pattern Recognition, Academic
Press, INC, 1992. Fig. 7. Shows the flowchart to
[12] L. Wang, W. Hu, T. Tan, “Recent Development in human motion achieving to thresholds
analysis”, Pattern Recognition, vol. 36, pp. 585-601, 2003.
189
Fig. 8a. The Original Image Fig. 8b. The result of difference of two Fig. 8c. After Differential Histogram
sequential images Equalization
Fig. 8d. The result of adaptive thresholding Fig. 8e. Particle removing Fig. 8f. Motion boundary detection
Fig. 8g. First moving object Fig. 8h. Second moving object
190