Abstract:
We use a weighted graph Laplacian matrix to oversample signals. Due to spectral folding caused by downsampling graph signals, critically sampled graph filter banks must decompose the graph into bipartite subgraphs and transform each subgraph.
Thus, the conventional method cannot use all original graph edges in a single stage transformation. Oversampling the graph lets us add nodes and edges arbitrarily.
This method yields one oversampled bipartite graph with all edges of the original non-bipartite graph. We decompose graph signals using the oversampled graph and the critically sampled graph filter bank.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
