Related papers: Frames and Finite Dimensionality: Frame Transforma…
Recovering structure and motion parameters given a image pair or a sequence of images is a well studied problem in computer vision. This is often achieved by employing Structure from Motion (SfM) or Simultaneous Localization and Mapping…
We present some work relating to fractal transformations on masked iterated function systems and demonstrate how well known algorithms for generating fractal transformations can be modifed for these systems. We also demonstrate that these…
Operator-valued frames are natural generalization of frames that have been used in quantum computing, packets encoding, etc. In this paper, we focus on developing the theory about operator-valued frames for finite Hilbert spaces. Some…
A frame is a generalization of a basis of a vector space to a redundant overspanning set whose vectors are linearly dependent. Frames find applications in signal processing and quantum information theory. We present a genetic algorithm that…
An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…
A frame is a system of vectors $S$ in Hilbert space $\mathscr{H}$ with properties which allow one to write algorithms for the two operations, analysis and synthesis, relative to $S$, for all vectors in $\mathscr{H}$; expressed in…
We consider frames in a finite-dimensional Hilbert space Hn where frames are exactly the spanning sets of the vector space. We present a method to determine the maximum robustness of a frame. We present results on tight subframes and…
Motivated by a host of recent applications requiring some amount of redundancy, frames are becoming a standard tool in the signal processing toolbox. In this paper, we study a specific class of frames, known as discrete Fourier transform…
The definition of dual fusion frame presents technical problems related to the domain of the synthesis operator. The notion commonly used is the analogous to the canonical dual frame. Here a new concept of dual is studied in…
We propose Framer for interactive frame interpolation, which targets producing smoothly transitioning frames between two images as per user creativity. Concretely, besides taking the start and end frames as inputs, our approach supports…
Quantum reference frame transformations have been proposed to provide a means by which to translate descriptions of quantum systems relative to each other. At present, there are several differing frameworks for describing quantum reference…
In this paper we deal with the connection of frames with the class of Hilbert Schmidt operators. First we give an easy criteria for operators being in this class using frames. It is the equivalent to the criteria using orthonormal bases.…
In comparison to classical shallow representation learning techniques, deep neural networks have achieved superior performance in nearly every application benchmark. But despite their clear empirical advantages, it is still not well…
We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…
We study how to implement and transform frame perspectives for quantum processes in the process-matrix formalism. We argue that, for pure processes, the causal reference frames (CRF)and time-delocalized subsystems (TDS) formalisms should be…
This paper concerns the geometric structure of optimizers for frame potentials. We consider finite, real or complex frames and rotation or unitarily invariant potentials, and mostly specialize to Parseval frames, meaning the frame potential…
We develop a theory and an algorithm for constructing minimal-degree polynomial moving frames for polynomial curves in an affine space. The algorithm is equivariant under volume-preserving affine transformations of the ambient space and the…
One approach to ease the construction of frames is to first construct local components and then build a global frame from these. In this paper we will show that the study of the relation between a frame and its local components leads to the…
Feature transformation aims to extract a good representation (feature) space by mathematically transforming existing features. It is crucial to address the curse of dimensionality, enhance model generalization, overcome data sparsity, and…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…