A foreground extraction algorithm based on the Peaceman-Rachford splitting method

MaRDI QIDQ3307328zbMATH OpenFDO

Authors

Publication date 12 August 2020

zbMATH Keywords

convex programmingforeground extractionPeaceman-Rachford splitting method

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Machine vision and scene understanding (68T45)

Recommendations

• A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
• An improved total variation regularized RPCA for moving object detection with dynamic background
• A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit
• Generalized Peaceman-Rachford splitting method for separable convex programming with applications to image processing
• An inertial proximal Peaceman-Rachford splitting method

Cited in

(2)

• scientific article; zbMATH DE number 2084596 (Why is no real title available?)
• scientific article; zbMATH DE number 7267105 (Why is no real title available?)

This page was built for publication: A foreground extraction algorithm based on the Peaceman-Rachford splitting method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3307328)