Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 37 for “"LINEAR SUBSPACES"”.
-
Strong Choquet Topologies on the Closed Linear Subspaces of Banach Spaces
… of the space. The subcollection of closed linear subspaces is studied under the relative slice topology, as well as a class of topologies similar thereto. It is shown that the collection of closed linear subspaces under the slice topology is homeomorphic to the collection of their …
-
Ordering Non-Linear Subspaces for Airfoil Design and Optimization via Rotation Augmented Gradients
… facilitates aerodynamic optimization, these subspaces are often still computationally expensive to explore. Moreover, the complex data organization of many current nonlinear models make it difficult to reduce dimensionality without model retraining. Inducing orderings of latent components …
-
The flag of best fit as a representative for a collection of linear subspaces
… a technique for representing a collection of subspaces with a flag of best fit, and apply it to practical problems within computer vision and pattern analysis. In particular, we will find a nested sequence of subspaces that are central, with respect to an optimization criterion based on the …
-
Maximum Dimension Of Nonsingular Subspaces Of Mn(F)
… tofind the maximal dimension of nonsingular linear subspaces of Mn(F); which is dependent on the ield. The analysis is conducted over algebraically closed fields, real numbers, rational numbers, andfinite felds. We then develop bounds for the maximal dimension of nonsingular affine subspaces …
-
Hashing for Multimedia Similarity Modeling and Large-Scale Retrieval
… ranking structures that cannot be revealed in linear subspaces. Experiments on large image datasets demonstrate the effectiveness of the proposed method for image retrieval. We further studied the ranking-based hashing method for the cross-media similarity search problem. Specifically, we …
-
Globally -Coordinated Locally-Linear Modeling of Multi-Dimensional Data
… our approach is the first one to track nonlinear appearance variations by using low-dimensional representation of the appearance change in globally-coordinated linear subspaces. In dynamic texture synthesis, we are able to model non-stationary dynamic textures, which cannot be handled by …
-
Dynamic networks in the brain inferred from the analysis of neurophysiology data
… slower timescale, capturing the low-dimensional linear subspaces in which resting-state activities unfold. The third study explores the role of neural dynamics in human motor control. I show that corticomuscular coherence in the beta-band is replaced by alpha- and gammaband coherence during a …
-
On the Zero Set of Holomorphic Sectional Curvature
… semi-de nite and vanishes along high-dimensional linear subspaces in every tangent space. The main result of this dissertation is an upper bound for the dimensions of these subspaces. Due to the holomorphic sectional curvature being a real valued bihomogeneous polynomial of degree 2 on every …
-
Grassmann Dynamics
… real or complex vector space induced by a linear invertible transformation A of the vector space into itself. The Grassmann map GA sends p to Ap, and one asks, what are the dynamics of GA? In the second part, I consider dynamics induced by a linear cocycle covering a diffeomorphism of a …
-
TOPOLOGICAL STRUCTURE OF SPATIALLY-DISTRIBUTED NETWORK CODED INFORMATION
… geographically-distributed wireless network with linear network coded data. We define the coverage complex, a new type of simplicial complex built on the nodes of the network which captures properties of the data coverage, and use tools from algebraic topology, persistent homology, and matroid …
-
Grassmann, Flag, and Schubert varieties in applications
… data with the same identity is assumed to vary linearly. We build on the growing canon of techniques for analyzing and optimizing over data on Grassmann manifolds. Specifically we expand on a recently developed method referred to as the flag mean that finds an average representation for a …
-
Harnessing Sparse and Low-Dimensional Structures for Robust Clustering of Imagery Data
… approach for data from multiple linear subspaces. Our techniques draw from many diverse areas, including lossy data compression, sparse representation, algebraic geometry, and robust statistics. We verify the efficacy of our algorithms by applying them to the segmentation of …
-
Functional Transcendence in Mixed Hodge Theory
… to the derivatives of mixed period mappings. Linear subspaces in the Ax-Schanuel theorem are replaced by weak Mumford-Tate domains, which are certain group orbits of mixed Hodge structures. Likewise, algebraic subtori are replaced by a notion called weakly special subvarieties. We prove that …
-
Strong convergence of recent splitting algorithms and applications of proximal mappings
… algorithms for normal cone operators of closed linear subspaces. This allows us to strengthen existing convergence results. We also explore resolvents and splitting methods. First, we improve Carlier’s recent refinement of the Fenchel-Young inequality with respect to duality and cyclic …
-
Geometric Properties of Grassmannians and Color Image Set Recognition Using Quaternionic Grassmannians
… Among them, Grassmannians, which are spaces of linear subspaces, have nonnegative curvature and are useful in data analysis and signal processing. However, their geometric properties are not as well studied as those of the manifold of positive definite matrices, which has clear hyperbolic …
-
Congruence Testing for Point Sets in 4-Space
… general 4-dimensional rotations, angles between linear subspaces, and the Plücker embedding. In the sequence of steps in the algorithm, high regularities are forced in the structure of point sets. This lets us encounter beautiful mathematical structures on a 3-sphere and the symmetry group of …
-
Universal moduli of sheaves over curves and moduli of flags of varieties via Geometric Invariant Theory
… of dimension <em>n</em> by flags of linear subspaces of P(<em>V</em>) of length <em>n</em>, with each positive dimension component of the flags being required to be non-singular and non-degenerate, and with the dimension 0 component being required to satisfy a Chow stability …
-
The Favard length problem for self-similar sets
… orthogonal projection of E onto one-dimensional linear subspaces. We denote this average projected length by Fav(E). Due to the work of Besicovitch and Federer, a set E ⊂ ℝᵈ having positive and finite length satisfies Fav(E) = 0 if and only if E intersects all Lipschitz graphs in a set of null …
-
Nonparametric Bayesian Models for Supervised Dimension Reduction and Regression
… both the classical setting of</p><p>Euclidean subspaces and the Riemannian setting where the marginal</p><p>distribution is concentrated on a manifold. Our Bayesian perspective</p><p>adds appropriate probabilistic and statistical frameworks that allow</p><p>for rich inference such as …
-
Topics in nonlinear filtering
… dissertation, we study the implementation of nonlinear filtering algorithms that can be used in real time applications. In order to implement a filtering algorithm, one has to discretize the state space, the observation space and the time interval. If one discretizes the observation space first, …
Page 1 of 2