Abstract
Abstract Graph signal processing (GSP) can be understood as a branch in which signal processing, a branch in electrical engineering, collaborates with graph theory, a branch in mathematics. In GSP, digitalized signals are represented by graphs and it gives a simple representation of sampled data with vertices and edges of the graph. GSP employs a method called subsampling in which a subset of the original data set is selected which serves to reduce the size of the data [9]. This work selects the dominating set of the graph as the subsample, in deviation from the previous works on GSP. We are using the properties of dominating vertices to draw the advantages of such a subsampling. A more efficient subsampling process to ‘efficient dominating set’ is also presented and an upper bound for the number of vertices in such a subsampling is found. The case when efficient dominating set does not exist is also discussed. We also described some special cases of subsampling.KeywordsGraph signal processingDominating setEfficient dominating set
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.
