Abstract
We consider the problem of recovering a smooth graph signal from noisy samples taken at a small number of graph nodes. The recovery problem is formulated as a convex optimization problem which minimizes the total variation (accounting for the smoothness of the graph signal) while controlling the empirical error. We solve this total variation minimization problem efficiently by applying a recent algorithm proposed by Nesterov for non-smooth optimization problems. Furthermore, we develop a distributed implementation of our algorithm and verify the performance of our scheme on a large-scale real-world dataset.
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 callDisclaimer: 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.
