Moving Objects Detection Based on the Precise Background Compensation Under Dynamic Scene

Moving Objects Detection Based on the Precise Background Compensation Under Dynamic Scene

Yan Wang (School of Computer Science and Engineering, Hebei University of Technology, Tianjin, China), Yang Yu (School of Computer Science and Engineering, Hebei University of Technology, Tianjin, China), Gang Yan (School of Computer Science and Engineering, Hebei University of Technology, Tianjin, China) and Yingchun Guo (School of Computer Science and Engineering, Hebei University of Technology, Tianjin, China)
Copyright: © 2014 |Pages: 16
DOI: 10.4018/ijapuc.2014010104

Abstract

In order to detect the moving object under dynamic scenes accurately, this paper proposes a moving object detection method which is based on the precise background compensation. First, the SURF (Speeded-Up Robust Features) algorithm is used to extract feature points, and the BBF(Best-Bin-First) search algorithm is adopted to match feature points, in addition the reverse constraint strategy is employed to remove the mismatching points. To enhance the accuracy of the background compensation, a dynamic threshold is set to remove the target feature points influence for the global motion parameters. At last, a combination of interval three-frame- -differencing and morphological method is used to detect the moving objects. Experimental results show that this method has good performance on multiple moving targets detection.
Article Preview

The Overall Process Of The Algorithm

This algorithm includes three steps as followings:

Purchase this article to continue reading all 16 pages >

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 11: 4 Issues (2019): Forthcoming, Available for Pre-Order
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing