Abstract
Low rank and sparsity matrix decomposition (LRaSMD) has received considerable interest lately. One of effective methods is called go decomposition (GoDec) which finds low rank and sparse matrices iteratively subject to a predetermined low rank order, $m$ and a sparsity cardinality, $k$ , In order to resolve issue of the empirically determined $m$ and $k$ , the well-known virtual dimensionality (VD) and a minimax-singular value decomposition (MX-SVD) developed in maximum orthogonal complement algorithm (MOCA) are used for this purpose. The constrained energy minimization (CEM) is used for experiments to demonstrate that the GoDec with VD and MX-SVD performs very effectively.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.