Extending computational harmonic analysis tools from the classical setting of regular lattices to the more general setting of graphs and networks is very important, and much research has been done recently. The generalized Haar–Walsh transform (GHWT) developed by Irion and Saito (2014) is a multiscale transform for signals on graphs, which is a generalization of the classical Haar and Walsh–Hadamard transforms. We propose the
- Award ID(s):
- 1743819
- NSF-PAR ID:
- 10088776
- Date Published:
- Journal Name:
- Demonstratio Mathematica
- Volume:
- 52
- Issue:
- 1
- ISSN:
- 2391-4661
- Page Range / eLocation ID:
- 40 to 55
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract extended generalized Haar–Walsh transform (eGHWT), which is a generalization of the adapted time–frequency tilings of Thiele and Villemoes (1996). The eGHWT examines not only the efficiency of graph-domain partitions but also that of “sequency-domain” partitionssimultaneously . Consequently, the eGHWT and its associated best-basis selection algorithm for graph signals significantly improve the performance of the previous GHWT with the similar computational cost, , where$$O(N \log N)$$ N is the number of nodes of an input graph. While the GHWT best-basis algorithm seeks the most suitable orthonormal basis for a given task among more than possible orthonormal bases in$$(1.5)^N$$ , the eGHWT best-basis algorithm can find a better one by searching through more than$$\mathbb {R}^N$$ possible orthonormal bases in$$0.618\cdot (1.84)^N$$ . This article describes the details of the eGHWT best-basis algorithm and demonstrates its superiority using several examples including genuine graph signals as well as conventional digital images viewed as graph signals. Furthermore, we also show how the eGHWT can be extended to 2D signals and matrix-form data by viewing them as a tensor product of graphs generated from their columns and rows and demonstrate its effectiveness on applications such as image approximation.$$\mathbb {R}^N$$ -
Extending computational harmonic analysis tools from the classical setting of regular lattices to the more general setting of graphs and networks is very important and much research has been done recently. Our previous Generalized Haar-Walsh Transform (GHWT) is a multiscale transform for signals on graphs, which is a generalization of the classical Haar and Walsh-Hadamard Transforms. This article proposes the extended Generalized Haar-Walsh Transform (eGHWT). The eGHWT and its associated best-basis selection algorithm for graph signals will significantly improve the performance of the previous GHWT with the similar computational cost, O(N log N) where N is the number of nodes of an input graph. While the previous GHWT/best-basis algorithm seeks the most suitable orthonormal basis for a given task among more than 1.5^N possible bases, the eGHWT/best-basis algorithm can find a better one by searching through more than 0.618 ⋅ (1.84)^N possible bases. This article describes the details of the eGHWT/basis-basis algorithm and demonstrates its superiority using several examples including genuine graph signals as well as conventional digital images viewed as graph signals. Keywords: Multiscale basis dictionaries, wavelets on graphs, graph signal processing, adapted time-frequency analysis, the best-basis algorithmmore » « less
-
Abstract Our previous multiscale graph basis dictionaries/graph signal transforms—Generalized Haar-Walsh Transform (GHWT); Hierarchical Graph Laplacian Eigen Transform (HGLET); Natural Graph Wavelet Packets (NGWPs); and their relatives—were developed for analyzing data recorded on vertices of a given graph. In this article, we propose their generalization for analyzing data recorded on edges, faces (i.e., triangles), or more generally
-dimensional simplices of a simplicial complex (e.g., a triangle mesh of a manifold). The key idea is to use the Hodge Laplacians and their variants for hierarchical partitioning of a set of$$\kappa $$ -dimensional simplices in a given simplicial complex, and then build localized basis functions on these partitioned subsets. We demonstrate their usefulness for data representation on both illustrative synthetic examples and real-world simplicial complexes generated from a co-authorship/citation dataset and an ocean current/flow dataset.$$\kappa $$ -
Let A be a separable simple exact Z-stable C∗-algebra. We show that the unitary group of \tilde{A} has the cancellation property. If A has continuous scale then the Cuntz semigroup of A has strict comparison property and a weak cancellation property. Let C be a 1-dimensional noncommutative CW complex with K1(C) = {0}. Suppose that λ : Cu∼(C) → Cu∼(A) is a morphism in the augmented Cuntz semigroups which is strictly positive. Then there exists a sequence of homomorphisms φn : C → A such that limn→∞ Cu∼(φn) = λ. This result leads to the proof that every separable amenable simple C∗-algebra in the UCT class has rationally generalized tracial rank at most one.more » « less