Related papers: Grassmannian Frames with Applications to Coding an…
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…
The Grassmannian of affine subspaces is a natural generalization of both the Euclidean space, points being zero-dimensional affine subspaces, and the usual Grassmannian, linear subspaces being special cases of affine subspaces. We show…
This paper introduces a new quantization scheme for real and complex Grassmannian sources. The proposed approach relies on a structured codebook based on a geometric construction of a collection of bent grids defined from an initial mesh on…
We introduce the orthogonal Grassmannian as a novel kinematic space for describing correlators of massless spinning fields in de Sitter space. By automatically encoding the constraints of conformal symmetry and current conservation, the…
Following a review of related results in rigidity theory, we provide a construction to obtain generically universally rigid frameworks with the minimum number of edges, for any given set of n nodes in two or three dimensions. When a set of…
In this work, we present a novel and practical approach to address one of the longstanding problems in computer vision: 2D and 3D affine invariant feature matching. Our Grassmannian Graph (GrassGraph) framework employs a two stage procedure…
Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…
We propose an approach for capturing the signal variability in hyperspectral imagery using the framework of the Grassmann manifold. Labeled points from each class are sampled and used to form abstract points on the Grassmannian. The…
Every equi-isoclinic tight fusion frame (EITFF) is a type of optimal code in a Grassmannian, consisting of subspaces of a finite-dimensional Hilbert space for which the smallest principal angle between any pair of them is as large as…
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…
The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems,…
The aim of the paper is to present the integrable systems on partial isometries which are related to the restricted Grassmannian in finite dimensional context. Some explicit solutions are obtained.
Grassmannian codes are known to be useful in error-correction for random network coding. Recently, they were used to prove that vector network codes outperform scalar linear network codes, on multicast networks, with respect to the alphabet…
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…
In this paper we will look at the connection of frames and finite dimensionality. A main focus is to present simple algorithms and make them available online. The main result is a way to 'switch' between different frames, giving an…
This paper considers the quantization problem on the Grassmann manifold \mathcal{G}_{n,p}, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The chief result is a closed-form formula for the…
We solve the problem of best approximation by Parseval frames to an arbitrary frame in a subspace of an infinite dimensional Hilbert space. We explicitly describe all the solutions and we give a criterion for uniqueness. This best…
The objective of this paper is to improve the customary definition of redundancy by providing quantitative measures in its place, which we coin upper and lower redundancies, that match better with an intuitive understanding of redundancy…
A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge…