Abstract
This article establishes a multitask graph filter model based on the recursive least square (RLS) method and proposes an online distributed alternating direction method of multipliers (ODADMM) algorithm. We are interested in the time-varying graph signal, i.e., the graph filter is estimated from streaming data. Considering that current popular graph shift operators' energy can not be preserved, which will lead to slow estimation speed, so the RLS method is adopted in graph filters (GFs) to improve the convergence rate. Besides, a multitask GFs model is proposed for node-variant GFs, where each vertex cooperates with neighbours to improve the estimation performance by utilizing the correlation of tasks. Then, according to our model, a distributed alternating direction method of multipliers (DADMM) algorithm is designed, while it has enormous computational complexity. To address this drawback, an ODADMM algorithm is further developed, and the algorithm can converge to an optimal point that is validated. Numerical results verify that the proposed algorithm is more competitive in convergence speed and performance than other related algorithms, and two real scenes are tested to verify the effectiveness of the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Network Science and Engineering
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.
