Related papers: Frames and Finite Dimensionality: Frame Transforma…
A common belief in high-dimensional data analysis is that data are concentrated on a low-dimensional manifold. This motivates simultaneous dimension reduction and regression on manifolds. We provide an algorithm for learning gradients on…
The aim of this paper is to provide a coherent framework for transforming boundary pairs of digital images from one resolution to another without knowledge of the full images. It is intended to facilitate the simultaneous usage of…
$E$-frames are a new generalization for the concept of frames for $\mathcal{H}$, where $E$ is an infinite invertible complex matrix mapping on $\bigoplus_{n=1}^{\infty}\mathcal{H}$. This article is dedicated to investigating some notions…
The frame algorithm uses a simple recursive formula to approximate an unknown vector from its frame coefficients. This note introduces an adaptive version of the frame algorithm that maximizes the error reduction between steps in terms of…
We consider existence and uniqueness of symmetric approximation of frames by normalized tight frames and of symmetric orthogonalization of bases by orthonormal bases in Hilbert spaces H . More precisely, we determine whether a given frame…
We introduce the notion of a cross-frame potential function, which takes one frame as input and returns its cross-frame potential value with respect to another frame. We analyze the behavior of this new function to determine what…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
We study the fundamental problem of polytope membership aiming at large convex polytopes, i.e. in high dimension and with many facets, given as an intersection of halfspaces. Standard data-structures as well as brute force methods cannot…
The present thesis shows that Quantum Information concepts can be used to better understand the quantum-to-classical boundary in mesoscopic and macroscopic systems. Our findings suggest a way to push this boundary towards the macroscopic…
Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the…
Two curves are affinely equivalent if there exists an affine mapping transforming one of them onto the other. Thus, detecting affine equivalence comprises, as important particular cases, similarity, congruence and symmetry detection. In…
We present a frame interpolation algorithm that synthesizes multiple intermediate frames from two input images with large in-between motion. Recent methods use multiple networks to estimate optical flow or depth and a separate network…
We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves…
Multi-frame depth estimation improves over single-frame approaches by also leveraging geometric relationships between images via feature matching, in addition to learning appearance-based features. In this paper we revisit feature matching…
The purpose of this paper is to propose a definition of continuous frames of rank n for Krein spaces and to study their basic properties. Similarly to the Hilbert space case, continuous frames are characterized by the analysis, the…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
The scaled boundary finite element method (SBFEM) has recently been employed as an efficient means to model three-dimensional structures, in particular when the geometry is provided as a voxel-based image. To this end, an octree…
This note is a survey and collection of results, as well as presenting some original research. For Bessel sequences and frames, the analysis, synthesis and frame operators as well as the Gram matrix are well-known, bounded operators. We…
This paper extends three results from classical finite frame theory over real or complex numbers to binary frames for the vector space ${\mathbb Z}_2^d$. Without the notion of inner products or order, we provide an analog of the…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…