Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorErichson, N. Benjamin
dc.contributor.authorBrunton, Steven L.
dc.contributor.authorKutz, J. Nathan
dc.date.accessioned2016-12-16T16:30:11Z
dc.date.available2016-12-16T16:30:11Z
dc.date.issued2016-11-29
dc.identifier.citationErichson , N B , Brunton , S L & Kutz , J N 2016 , ' Compressed dynamic mode decomposition for background modeling ' , Journal of Real-Time Image Processing , vol. First Online . https://doi.org/10.1007/s11554-016-0655-2en
dc.identifier.issn1861-8219
dc.identifier.otherPURE: 248203435
dc.identifier.otherPURE UUID: 9818e55a-1530-4593-ba2a-a9508ad0436a
dc.identifier.otherRIS: Erichson2016
dc.identifier.otherScopus: 85000350946
dc.identifier.otherWOS: 000489318600010
dc.identifier.urihttps://hdl.handle.net/10023/9981
dc.descriptionJNK acknowledges support from Air Force Office of Scientific Research (FA9500-15-C-0039). SLB acknowledges support from the Department of Energy under award DE-EE0006785. NBE acknowledges support from the UK Engineering and Physical Sciences Research Council (EP/L505079/1).en
dc.description.abstractWe introduce the method of compressed dynamic mode decomposition (cDMD) for background modeling. The dynamic mode decomposition is a regression technique that integrates two of the leading data analysis methods in use today: Fourier transforms and singular value decomposition. Borrowing ideas from compressed sensing and matrix sketching, cDMD eases the computational workload of high-resolution video processing. The key principal of cDMD is to obtain the decomposition on a (small) compressed matrix representation of the video feed. Hence, the cDMD algorithm scales with the intrinsic rank of the matrix, rather than the size of the actual video (data) matrix. Selection of the optimal modes characterizing the background is formulated as a sparsity-constrained sparse coding problem. Our results show that the quality of the resulting background model is competitive, quantified by the F-measure, recall and precision. A graphics processing unit accelerated implementation is also presented which further boosts the computational performance of the algorithm.
dc.format.extent14
dc.language.isoeng
dc.relation.ispartofJournal of Real-Time Image Processingen
dc.rights© The Author(s) 2016. Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.en
dc.subjectDynamic Mode Decompositionen
dc.subjectBackground modelingen
dc.subjectMatrix sketchingen
dc.subjectSparse codingen
dc.subjectGPU-accelerated computingen
dc.subjectQA Mathematicsen
dc.subject3rd-NDASen
dc.subject.lccQAen
dc.titleCompressed dynamic mode decomposition for background modelingen
dc.typeJournal articleen
dc.description.versionPublisher PDFen
dc.contributor.institutionUniversity of St Andrews. School of Mathematics and Statisticsen
dc.identifier.doihttps://doi.org/10.1007/s11554-016-0655-2
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record