IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7087130.html
   My bibliography  Save this article

Moving Object Detection in Dynamic Environment via Weighted Low-Rank Structured Sparse RPCA and Kalman Filtering

Author

Listed:
  • Ting Liu
  • Lingwei Xu

Abstract

As a classical problem for computer vision, moving object detection (MOD) can be efficiently achieved by foreground and background separation. The Robust Principal Component Analysis (RPCA)-based method has been potentially utilized to solve the problem. However, the detection accuracy for RPCA-based method is limited for complex scenes with slow-motion. Besides, it is time consuming for the way to seek for background modeling based on solving a low-rank minimization problem, for which multiple frames of the videos are required as the input. Therefore, a real-time MOD framework (LSRPCA_KF) is proposed for the dynamic background, where a weighted low-rank and structured sparse RPCA algorithm is used to achieve background modeling for history data, while the online MOD is achieved by the background subtraction method and updated by the Kalman filter for every real time frame. Specifically, for the background model, a newly designed weight is incorporated to distinguish the significance of different singular values, and a structured sparse prior is added to penalty the spatial connection property of the moving object. Besides, the weighted low-rank and structured sparse RPCA model is efficiently solved by the Alternating Direction Method of Multipliers (ADMM) optimization algorithm. Experimental results demonstrated that better performance of our method with significantly reduced delay in processing and better detect the moving object has been achieved, especially for the dynamic background.

Suggested Citation

  • Ting Liu & Lingwei Xu, 2022. "Moving Object Detection in Dynamic Environment via Weighted Low-Rank Structured Sparse RPCA and Kalman Filtering," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-11, June.
  • Handle: RePEc:hin:jnlmpe:7087130
    DOI: 10.1155/2022/7087130
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7087130.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7087130.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/7087130?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:7087130. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.