Abstract
Product graphs are a useful way to model richer forms of graph-structured data that can be multi-modal in nature. In this work, we study the reconstruction or estimation of smooth signals on product graphs from noisy measurements. We motivate and present representations and algorithms that exploit the inherent structure in product graphs for better and more computationally efficient recovery. These contributions stem from the key insight that smooth graph signals on product graphs can be structured as low-rank tensors. We develop and present algorithms primarily based on two approaches, the first of which is the Tucker decomposition for tensors, while the second is a flexible convex optimization formulation. We further present numerical experiments that exhibit the superior performance of these methods with respect to existing methods for smooth signal recovery on graphs.
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 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.
