Related papers: Design of a Simple Orthogonal Multiwavelet Filter …
Boolean matrix factorization (BMF) approximates a given binary input matrix as the product of two smaller binary factors. As opposed to binary matrix factorization which uses standard arithmetic, BMF uses the Boolean OR and Boolean AND…
Orthogonal wavelet transforms are a cornerstone of modern signal and image denoising because they combine multiscale representation, energy preservation, and perfect reconstruction. In this paper, we show that these advantages can be…
We present a simple proof of the factorization of (complex) symmetric matrices into a product of a square matrix and its transpose, and discuss its application in establishing a uniqueness property of certain antilinear operators.
This article presents a novel approach to solving the sparsity-constrained Orthogonal Nonnegative Matrix Factorization (SCONMF) problem, which requires decomposing a non-negative data matrix into the product of two lower-rank non-negative…
In recent years some attempts have been done to relate the RBF with wavelets in handling high dimensional multiscale problems. To the author's knowledge, however, the orthonormal and bi-orthogonal RBF wavelets are still missing in the…
Boolean matrix factorization (BMF) approximates a given binary input matrix as the product of two smaller binary factors. Unlike binary matrix factorization based on standard arithmetic, BMF employs the Boolean OR and AND operations for the…
We propose an analytical approach to design flattened wavelength splitters with cascaded Mach-Zehnder interferometers when wavelength dependence of the directional couplers cannot be neglected. We start from a geometrical representation of…
The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs,…
Nonnegative Matrix Factorization (NMF) is a widely used technique for data representation. Inspired by the expressive power of deep learning, several NMF variants equipped with deep architectures have been proposed. However, these methods…
Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…
Decomposing tensors into orthogonal factors is a well-known task in statistics, machine learning, and signal processing. We study orthogonal outer product decompositions where the factors in the summands in the decomposition are required to…
An original multiplex scheme is introduced, which is based on Mallat's multiresolution formulation of wavelet systems. This system is adaptable and its implementation is well matched to digital signal processors and computers. The approach…
In this paper we characterize and construct novel oversampled filter banks implementing fusion frames. A fusion frame is a sequence of orthogonal projection operators whose sum can be inverted in a numerically stable way. When properly…
We develop an effective computational tool for simulating the scattering of 1D waves by a composite layer architected in an otherwise homogeneous medium. The layer is designed as the union of segments cut from various mother periodic media,…
In this paper we propose a general spectral theory for tensors. Our proposed factorization decomposes a tensor into a product of orthogonal and scaling tensors. At the same time, our factorization yields an expansion of a tensor as a…
Orthogonal wavelets, or wavelet frames, for L^2(R) are associated with quadrature mirror filters (QMF). The latter constitute a set of complex numbers which relate the dyadic scaling of functions on R to the Z-translates, and which satisfy…
In this paper we present a general approach to multivariate periodic wavelets generated by scaling functions of de la Vall\'ee Poussin type. These scaling functions and their corresponding wavelets are determined by their Fourier…
In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a…
This paper describes various approaches to modeling a random process with a given rational power spectral density. The main attention is paid to the spectral form of mathematical description, which allows one to obtain a relation for the…
Matrix factorization (MF) is a versatile learning method that has found wide applications in various data-driven disciplines. Still, many MF algorithms do not adequately scale with the size of available datasets and/or lack…