Conference Paper

Incremental Non-negative Matrix Factorization for Dynamic Background Modelling.

Conference: Pattern Recognition in Information Systems, Proceedings of the 7th International Workshop on Pattern Recognition in Information Systems, PRIS 2007, In conjunction with ICEIS 2007, Funchal, Madeira, Portugal, June 2007
Source: DBLP
0 Bookmarks
 · 
326 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Automatic moving object detection and tracking is very important task in video surveillance applications. In this paper, we propose a novel scheme for moving object detection based on Locality Preserving Projections (LPP). It is also known as Laplacian eigenmaps, which optimally preserves the neighborhood structure of the data set [1]. The proposed method was tested on standard PETS dataset and many real time video sequence and the results was satisfactory.
    2nd International Conference on Computer, Communication, Control and Information Technology( C3IT-2012), Mumbai, India; 02/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: This chapter gives an overview of recent background modeling and foreground detection, and presents resources, datasets and codes publicly available. To purchase the handbook: http://www.crcpress.com/product/isbn/9781482205374
    Handbook on "Background Modeling and Foreground Detection for Video Surveillance: Traditional and Recent Approaches, Implementations, Benchmarking and Evaluation", 06/2014: chapter Chapter 2; CRC Press, Taylor and Francis Group., ISBN: 9781482205374
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Current Background Subtraction (BGS) algorithms are mostly pixel-based methods. We propose an Interest-Point(IP)-based BGS algorithm applicable in IP-based Computer Vision applications. Based on a block-wise processing strategy, the frames are divided into blocks of the same size. IPs inside each block are together Events. Throughout the frame sequence, the algorithm stores the Events in each block as well as the numbers of their occurrences (Repetition Index (RI)) in a Binary Tree. The RI is used to classify Events as either background or foreground. The background Events appear significantly more often than foreground Events. Events with an RI greater than a certain threshold are classified as background, the rest as foreground. This Event classification is used to label IPs of frames into the foreground and background IPs. Experimental results quantitatively show that the proposed algorithm delivers a good subtraction rate in comparison with other BGS approaches. Moreover, it creates a map of the background usable for further processing, it is robust to changes in illumination and can keep itself updated to changes in the background.
    Electronic Letters on Computer Vision and Image Analysis (ELCVIA). 06/2014; 13(1):50-67.

Full-text (2 Sources)

Download
228 Downloads
Available from
May 31, 2014