Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Illumination invariant foreground detection using multi-subspace learning
Dong Y., Han T., Desouza G. International Journal of Knowledge-based and Intelligent Engineering Systems14 (1):31-41,2010.Type:Article
Date Reviewed: Jul 27 2010

Video surveillance has become ubiquitous in our lives, causing both beneficial and harmful results. However, the trend of increasing video surveillance will continue as long as the technology for automated processing of video streams improves. Background subtraction, one of the most popular components of the automated content analysis of video data, removes the stable background from the data so that moving foregrounds can be extracted and analyzed. The problem is that the background is often not as stable as it seems, due to noise, illumination changes, and the alteration of background objects. This paper proposes a new method to cope with illumination changes to the background.

The technique needs images of the background illuminated with different lighting conditions. These images are clustered, and then a probabilistic model of the background is computed for each cluster using principal component analysis. The model forms a subspace in a larger vector space of images. This calibration step has to be done before the system is deployed. During the surveillance mode, the closest subspace for each incoming video frame is identified. The projection to the subspace is considered the background. By subtracting the background from the video frame, the system extracts the foreground.

As the authors acknowledge, there are a few issues with the method, including the handling of background alteration and determining the number of clusters. The paper fails to mention that the calibration step may not be possible in uncontrolled environments such as cities and highways. A more incremental approach to the calibration is required.

The authors’ approach should be more effective in handling illumination changes than a standard approach that uses a single subspace. Overall, the paper is well organized and easy to follow.

Reviewer:  T. Kubota Review #: CR138187 (1012-1278)
Bookmark and Share
  Featured Reviewer  
 
Eigenvalues And Eigenvectors (Direct And Iterative Methods) (G.1.3 ... )
 
 
Invariants (I.4.7 ... )
 
 
Linear Approximation (G.1.2 ... )
 
 
General (G.1.0 )
 
 
General (I.4.0 )
 
 
Image Representation (I.4.10 )
 
  more  
Would you recommend this review?
yes
no
Other reviews under "Eigenvalues And Eigenvectors (Direct And Iterative Methods)": Date
On two more Eigenvalue methods for an alternating sequential parallel system
Wallach Y. Computing 32(1): 33-41, 1984. Type: Article
Feb 1 1985
Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
Courtois P., Semal P. Journal of the ACM 31(4): 804-825, 1984. Type: Article
Jun 1 1985
Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
Grimes R., Simon H. (ed) ACM Transactions on Mathematical Software 14(3): 241-256, 1988. Type: Article
Mar 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy