Abstract
Signal representation is a prime problem in signal processing. In this paper, we propose a subspace graph filtering method for signal representation. We demonstrate an extended singular value decomposition (SVD) model of signal essentially is a subspace graph filtering, and build a bridge from SVD to graph filtering. A smoothing subspace graph filtering is sequentially learned in the space provided by SVD. In the experiments, we compare the signal restoration performance between the extended SVD and the proposed subspace graph filtering. It shows that clean signal can be better reconstructed from the noisy signal in our smoothing subspace than the SVD space, where the learned smoothed bases of graph filtering are more robust than the bases of SVD to cope with noise.
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.
