Related papers: Constructing Parseval Fusion Frames via Operators
We consider estimating a random vector from its noisy projections onto low dimensional subspaces constituting a fusion frame. A fusion frame is a collection of subspaces, for which the sum of the projection operators onto the subspaces is…
We consider the problem of fusing measurements from multiple sensors, where the sensing regions overlap and data are non-negative---possibly resulting from a count of indistinguishable discrete entities. Because of overlaps, it is, in…
In this paper we consider series expansions via a frame and a non-frame and the possibilities for interchange of the two sequences, both in the Hilbert and Banach space setting. First we give a characterization of frame-related concepts in…
Upon improving and extending the concept of redundancy of frames, we introduce the notion of redundancy of fusion frames, which is concerned with the properties of lower and upper redundancies. These properties are achieved by considering…
Scaling artist-designed meshes to high triangle numbers remains challenging for autoregressive generative models. Existing transformer-based methods suffer from long-sequence bottlenecks and limited quantization resolution, primarily due to…
This paper presents a scalable physics-based block preconditioner for mixed-dimensional models in beam-solid interaction and their application in engineering. In particular, it studies the linear systems arising from a regularized…
We address the problem of fusing array operations based on criteria such as shape compatibility, data reusability, and communication. We formulate the problem as a graph partition problem that is general enough to handle loop fusion,…
The development of scalable and wavenumber-robust iterative solvers for Helmholtz problems is challenging but also relevant for various application fields. In this work, two-level Schwarz domain decomposition preconditioners are enhanced by…
Frames are the foundation of the linear operators used in the decomposition and reconstruction of signals, such as the discrete Fourier transform, Gabor, wavelets, and curvelet transforms. The emergence of sparse representation models has…
Recent research has shown that the properties of overcomplete Gabor frames and frames arising from shift-invariant systems form a precise match with certain conditions that are necessary for a frame in $L^2(\mathbf R)$ to have a…
Successive differences on a sequence of data help to discover some smoothness features of this data. This was one of the main reasons for rewriting the classical interpolation formula in terms of such data differences. The aim of this paper…
Frames play an important role in various practical problems related to signal and image processing. In this paper, we define computable frames in computable Hilbert spaces and obtain computable versions of some of their characterizations.…
A Hilbert space frame on $R^n$ is {\it scalable} if we can scale the vectors to make them a tight frame. There are known classifications of scalable frames. There are two basic questions here which have never been answered in any $R^n$:…
In this article we obtain families of frames for the space B_\omega of functions with band in [-\omega,\omega] by using the theory of shift-invariant spaces. Our results are based on the Gramian analysis of A. Ron and Z. Shen and a variant,…
This paper presents novel strategies for spawning and fusing submaps within an elastic dense 3D reconstruction system. The proposed system uses spatial understanding of the scanned environment to control memory usage growth by fusing…
Data fusion has become an active research topic in recent years. Growing computational performance has allowed the use of redundant sensors to measure a single phenomenon. While Bayesian fusion approaches are common in general applications,…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
Modern Foundation Models (FMs) are typically trained on corpora spanning a wide range of different data modalities, topics and downstream tasks. Utilizing these models can be very computationally expensive and is out of reach for most…
We study the problem of multimodal fusion in this paper. Recent exchanging-based methods have been proposed for vision-vision fusion, which aim to exchange embeddings learned from one modality to the other. However, most of them project…
Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using…