Photo by goumbik from unsplash
In this article, we introduce a novel lower bound on the support size of lowband graph signals. This result allows the deduction of an optimality criterion for the lowband and… Click to show full abstract
In this article, we introduce a novel lower bound on the support size of lowband graph signals. This result allows the deduction of an optimality criterion for the lowband and sparse decomposition of any graph signal, establishing the uniqueness of well behaving solutions. A comparison of the new bound with previously introduced results is performed, showing the improvements brought by the present work. An illustration on a practical denoising usecase on a real graph is also provided.
Keywords:
graph signals;
uncertainty principle;
principle lowband;
graph;
lowband graph
Journal Title: IEEE Signal Processing Letters
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: IEEE Signal Processing Letters
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!