Related papers: Generalized Matrix Spectral Factorization with Sym…
As a generalization of orthonormal wavelets in $L_2(R)$, tight framelets (also called tight wavelet frames) are of importance in wavelet analysis and applied sciences due to their many desirable properties in applications such as image…
We give a number of explicit matrix-algorithms for analysis/synthesis in multi-phase filtering; i.e., the operation on discrete-time signals which allow a separation into frequency-band components, one for each of the ranges of bands, say…
Nonnegative matrix factorization (NMF) is widely used for clustering with strong interpretability. Among general NMF problems, symmetric NMF is a special one that plays an important role in graph clustering where each element measures the…
We introduce twisted matrix factorizations for quantum complete intersections of codimension two. For such an algebra, we show that in a given dimension, almost all the indecomposable modules with bounded minimal projective resolutions…
Multiresolution Matrix Factorization (MMF) is unusual amongst fast matrix factorization algorithms in that it does not make a low rank assumption. This makes MMF especially well suited to modeling certain types of graphs with complex…
Interpolatory filters are of great interest in subdivision schemes and wavelet analysis. Due to the high-order linear-phase moment property, interpolatory refinement filters are often used to construct wavelets and framelets with high-order…
As a main research area in applied and computational harmonic analysis, the theory and applications of framelets have been extensively investigated. Most existing literature is devoted to framelet systems that only use one dilation matrix…
The generalized Morse wavelets are shown to constitute a superfamily that essentially encompasses all other commonly used analytic wavelets, subsuming eight apparently distinct types of analysis filters into a single common form. This…
Braid matrices $\hat{R}(\theta)$, corresponding to vector representations, are spectrally decomposed obtaining a ratio $f_{i}(\theta)/f_{i}(-\theta)$ for the coefficient of each projector $P_{i}$ appearing in the decomposition. This…
Tight framelets on a smooth and compact Riemannian manifold $\mathcal{M}$ provide a tool of multiresolution analysis for data from geosciences, astrophysics, medical sciences, etc. This work investigates the construction, characterizations,…
Algebraic geometry, although little explored in signal processing, provides tools that are very convenient for investigating generic properties in a wide range of applications. Generic properties are properties that hold "almost…
We demonstrate a method for general linear optical networks that allows one to factorize any SU($n$) matrix in terms of two SU($n-1)$ blocks coupled by an SU(2) entangling beam splitter. The process can be recursively continued in an…
The wavelet scattering transform creates geometric invariants and deformation stability. In multiple signal domains, it has been shown to yield more discriminative representations compared to other non-learned representations and to…
With the recent success of representation learning methods, which includes deep learning as a special case, there has been considerable interest in developing techniques that incorporate known physical constraints into the learned…
We introduce a new general purpose multiresolution preconditioner for symmetric linear systems. Most existing multiresolution preconditioners use some standard wavelet basis that relies on knowledge of the geometry of the underlying domain.…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
In this paper, we completely solve the matrix extension problem with symmetry and provide a step-by-step algorithm to construct such a desired matrix $\mathsf{P}_e$ from a given matrix $\mathsf{P}$. Furthermore, using a cascade structure,…
Matrix factorizations of a hypersurface yield a description of the asymptotic structure of minimal free resolutions over the hypersurface. We introduce a new concept of matrix factorizations for complete intersections that allows us to…
Para-Hermitian polynomial matrices obtained by matrix spectral factorization lead to functions useful in control theory systems, basis functions in numerical methods or multiscaling functions used in signal processing. We introduce a fast…
Laplacian pyramid based Laurent polynomial (LP$^2$) matrices are generated by Laurent polynomial column vectors and have long been studied in connection with Laplacian pyramidal algorithms in Signal Processing. In this paper, we investigate…