640 research outputs found
Spectrahedral cones generated by rank 1 matrices
Let be the cone of positive semi-definite
matrices as a subset of the vector space of real symmetric
matrices. The intersection of with a linear subspace of is called a spectrahedral cone. We consider spectrahedral cones such
that every element of can be represented as a sum of rank 1 matrices in
. We shall call such spectrahedral cones rank one generated (ROG). We show
that ROG cones which are linearly isomorphic as convex cones are also
isomorphic as linear sections of the positive semi-definite matrix cone, which
is not the case for general spectrahedral cones. We give many examples of ROG
cones and show how to construct new ROG cones from given ones by different
procedures. We provide classifications of some subclasses of ROG cones, in
particular, we classify all ROG cones for matrix sizes not exceeding 4. Further
we prove some results on the structure of ROG cones. We also briefly consider
the case of complex or quaternionic matrices. ROG cones are in close relation
with the exactness of semi-definite relaxations of quadratically constrained
quadratic optimization problems or of relaxations approximating the cone of
nonnegative functions in squared functional systems.Comment: Version 2: section on complex and quaternionic case added, many
sections completely rewritte
Branching laws for Verma modules and applications in parabolic geometry. I
We initiate a new study of differential operators with symmetries and combine
this with the study of branching laws for Verma modules of reductive Lie
algebras. By the criterion for discretely decomposable and multiplicity-free
restrictions of generalized Verma modules [T. Kobayashi,
http://dx.doi.org/10.1007/s00031-012-9180-y {Transf. Groups (2012)}], we are
brought to natural settings of parabolic geometries for which there exist
unique equivariant differential operators to submanifolds. Then we apply a new
method (F-method) relying on the Fourier transform to find singular vectors in
generalized Verma modules, which significantly simplifies and generalizes many
preceding works. In certain cases, it also determines the Jordan--H\"older
series of the restriction for singular parameters. The F-method yields an
explicit formula of such unique operators, for example, giving an intrinsic and
new proof of Juhl's conformally invariant differential operators [Juhl,
http://dx.doi.org/10.1007/978-3-7643-9900-9 {Progr. Math. 2009}] and its
generalizations. This article is the first in the series, and the next ones
include their extension to curved cases together with more applications of the
F-method to various settings in parabolic geometries
Signing Information in the Quantum Era
Signatures are primarily used as a mark of authenticity, to demonstrate that the sender of a message is who they claim to be. In the current digital age, signatures underpin trust in the vast majority of information that we exchange, particularly on public networks such as the internet. However, schemes for signing digital information which are based on assumptions of computational complexity are facing challenges from advances in mathematics, the capability of computers, and the advent of the quantum era. Here we present a review of digital signature schemes, looking at their origins and where they are under threat. Next, we introduce post-quantum digital schemes, which are being developed with the specific intent of mitigating against threats from quantum algorithms whilst still relying on digital processes and infrastructure. Finally, we review schemes for signing information carried on quantum channels, which promise provable security metrics. Signatures were invented as a practical means of authenticating communications and it is important that the practicality of novel signature schemes is considered carefully, which is kept as a common theme of interest throughout this review
Geometrodynamics: Spacetime or Space ?
This thesis concerns the split of Einstein's field equations (EFE's) with
respect to nowhere null hypersurfaces. Areas covered include A) the foundations
of relativity, deriving geometrodynamics from relational first principles and
showing that this form accommodates a sufficient set of fundamental matter
fields to be classically realistic, alternative theories of gravity that arise
from similar use of conformal mathematics. B) GR Initial value problem (IVP)
methods, the badness of timelike splits of the EFE's and studying braneworlds
under guidance from GR IVP and Cauchy problem methods.Comment: Thesis, University of London, Examined in June by Prof Chris Isham
and Prof James Vickers. 226 pages including 21 figure
Content Recognition and Context Modeling for Document Analysis and Retrieval
The nature and scope of available documents are changing significantly in many areas of document analysis and retrieval as complex, heterogeneous collections become accessible to virtually everyone via the web. The increasing level of diversity presents a great challenge for document image content categorization, indexing, and retrieval. Meanwhile, the processing of documents with unconstrained layouts and complex formatting often requires effective leveraging of broad contextual knowledge.
In this dissertation, we first present a novel approach for document image content categorization, using a lexicon of shape features. Each lexical word corresponds to a scale and rotation invariant local shape feature that is generic enough to be detected repeatably and is segmentation free. A concise, structurally indexed shape lexicon is learned by clustering and partitioning feature types through graph cuts. Our idea finds successful application in several challenging tasks, including content recognition of diverse web images and language identification on documents composed of mixed machine printed text and handwriting.
Second, we address two fundamental problems in signature-based document image retrieval. Facing continually increasing volumes of documents, detecting and recognizing unique, evidentiary visual entities (\eg, signatures and logos) provides a practical and reliable supplement to the OCR recognition of printed text. We propose a novel multi-scale framework to detect and segment signatures jointly from document images, based on the structural saliency under a signature production model. We formulate the problem of signature retrieval in the unconstrained setting of geometry-invariant deformable shape matching and demonstrate state-of-the-art performance in signature matching and verification.
Third, we present a model-based approach for extracting relevant named entities from unstructured documents. In a wide range of applications that require structured information from diverse, unstructured document images, processing OCR text does not give satisfactory results due to the absence of linguistic context. Our approach enables learning of inference rules collectively based on contextual information from both page layout and text features.
Finally, we demonstrate the importance of mining general web user behavior data for improving document ranking and other web search experience. The context of web user activities reveals their preferences and intents, and we emphasize the analysis of individual user sessions for creating aggregate models. We introduce a novel algorithm for estimating web page and web site importance, and discuss its theoretical foundation based on an intentional surfer model. We demonstrate that our approach significantly improves large-scale document retrieval performance
Motion-capture-based hand gesture recognition for computing and control
This dissertation focuses on the study and development of algorithms that enable the analysis and recognition of hand gestures in a motion capture environment. Central to this work is the study of unlabeled point sets in a more abstract sense. Evaluations of proposed methods focus on examining their generalization to users not encountered during system training.
In an initial exploratory study, we compare various classification algorithms based upon multiple interpretations and feature transformations of point sets, including those based upon aggregate features (e.g. mean) and a pseudo-rasterization of the capture space. We find aggregate feature classifiers to be balanced across multiple users but relatively limited in maximum achievable accuracy. Certain classifiers based upon the pseudo-rasterization performed best among tested classification algorithms. We follow this study with targeted examinations of certain subproblems.
For the first subproblem, we introduce the a fortiori expectation-maximization (AFEM) algorithm for computing the parameters of a distribution from which unlabeled, correlated point sets are presumed to be generated. Each unlabeled point is assumed to correspond to a target with independent probability of appearance but correlated positions. We propose replacing the expectation phase of the algorithm with a Kalman filter modified within a Bayesian framework to account for the unknown point labels which manifest as uncertain measurement matrices. We also propose a mechanism to reorder the measurements in order to improve parameter estimates. In addition, we use a state-of-the-art Markov chain Monte Carlo sampler to efficiently sample measurement matrices. In the process, we indirectly propose a constrained k-means clustering algorithm. Simulations verify the utility of AFEM against a traditional expectation-maximization algorithm in a variety of scenarios.
In the second subproblem, we consider the application of positive definite kernels and the earth mover\u27s distance (END) to our work. Positive definite kernels are an important tool in machine learning that enable efficient solutions to otherwise difficult or intractable problems by implicitly linearizing the problem geometry. We develop a set-theoretic interpretation of ENID and propose earth mover\u27s intersection (EMI). a positive definite analog to ENID. We offer proof of EMD\u27s negative definiteness and provide necessary and sufficient conditions for ENID to be conditionally negative definite, including approximations that guarantee negative definiteness. In particular, we show that ENID is related to various min-like kernels. We also present a positive definite preserving transformation that can be applied to any kernel and can be used to derive positive definite EMD-based kernels, and we show that the Jaccard index is simply the result of this transformation applied to set intersection. Finally, we evaluate kernels based on EMI and the proposed transformation versus ENID in various computer vision tasks and show that END is generally inferior even with indefinite kernel techniques.
Finally, we apply deep learning to our problem. We propose neural network architectures for hand posture and gesture recognition from unlabeled marker sets in a coordinate system local to the hand. As a means of ensuring data integrity, we also propose an extended Kalman filter for tracking the rigid pattern of markers on which the local coordinate system is based. We consider fixed- and variable-size architectures including convolutional and recurrent neural networks that accept unlabeled marker input. We also consider a data-driven approach to labeling markers with a neural network and a collection of Kalman filters. Experimental evaluations with posture and gesture datasets show promising results for the proposed architectures with unlabeled markers, which outperform the alternative data-driven labeling method
Can humain association norm evaluate latent semantic analysis?
This paper presents the comparison of word association norm created by a psycholinguistic experiment to association lists generated by algorithms operating on text corpora. We compare lists generated by Church and Hanks algorithm and lists generated by LSA algorithm. An argument is presented on how those automatically generated lists reflect real semantic relations
- …