Abstract
Recursive least squares (RLS) dictionary learning algorithm is one of the well-known dictionary update approaches which continuously update the dictionary per arrival of new training data. In RLS algorithm a forgetting factor is added to control the memory and the effect of the previous data in the dictionary update stage. In this paper, we generalize the RLS algorithm by introducing an additional correction weight for the arrival data. This additional correction weight adaptively controls the relative consistency between the arrival data and the existing dictionary estimate. Consequently, we show that the conventional RLS is a special case of our method. Synthetic data, with and without containing outliers, are used to train both methods. Experimental results verify that adding the correction weight in our proposed method improves the recovery of original dictionary and MSE of sparse representation for both types of training data. The improvement increases as the percentage of outliers increase.
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.