Related papers: Global symmetric approximation of frames
In this paper we establish Parseval type identities and surprising new inequalities for Hilbert-Schmidt frames. Our results generalize and improve the remarkable results which have been obtained by Balan et al. and G{\u{a}}vru{\c{t}}a.
This paper is devoted to general nonconvex problems of multiobjective optimization in Hilbert spaces. Based on Mordukhovich's limiting subgradients, we define a new notion of Pareto critical points for such problems, establish necessary…
Many problems in computer vision can be formulated as geometric estimation problems, i.e. given a collection of measurements (e.g. point correspondences) we wish to fit a model (e.g. an essential matrix) that agrees with our observations.…
Finite frames, or spanning sets for finite-dimensional Hilbert spaces, are a ubiquitous tool in signal processing. There has been much recent work on understanding the global structure of collections of finite frames with prescribed…
So far there has not been paid attention to frames that are balanced, i.e. those frames which sum is zero. In this paper we consider balanced frames, and in particular balanced unit norm tight frames, in finite dimensional Hilbert spaces.…
Given a set of vectors (the data) in a Hilbert space H, we prove the existence of an optimal collection of subspaces minimizing the sum of the square of the distances between each vector and its closest subspace in the collection. This…
This work presents a quantitative framework for describing the overcompleteness of a large class of frames. It introduces notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and $\mathcal{E} =…
In this paper, we establish Parseval identities and surprising new inequalities for weaving frames in Hilbert space, which involve scalar $\lambda\in\rs$. By suitable choices of $\lambda$, one obtains the previous results as special cases.…
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
A frame approach to determining the most general solution admitting a desired symmetry group has been examined previously in Riemannian and teleparallel geometries with some success. In teleparallel geometries, one must determine the…
Finite unit norm tight frames provide Parseval-like decompositions of vectors in terms of redundant components of equal weight. They are known to be exceptionally robust against additive noise and erasures, and as such, have great potential…
This investigation seeks to establish the practicality of numerical frame approximations. Specifically, it develops a new method to approximate the inverse frame operator and analyzes its convergence properties. It is established that…
Linear subspace representations of appearance variation are pervasive in computer vision. This paper addresses the problem of robustly matching such subspaces (computing the similarity between them) when they are used to describe the scope…
Many scientific and engineering applications feature nonsmooth convex minimization problems over convex sets. In this paper, we address an important instance of this broad class where we assume that the nonsmooth objective is equipped with…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
In this paper, we focus on frames of operators or K-frames on Hilbert spaces in Parseval cases. Since equal-norm tight frames play important roles for robust data transmission, we aim to study this topics on Parseval K-frames. We will show…
We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…
Topology optimization of frame structures under free-vibration eigenvalue constraints constitutes a challenging nonconvex polynomial optimization problem with disconnected feasible sets. In this article, we first formulate it as a…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
A very useful identity for Parseval frames for Hilbert spaces was obtained by Balan, Casazza, Edidin, and Kutyniok. In this paper, we obtain a similar identity for Parseval p-approximate Schauder frames for Banach spaces which admits a…