Robust point matching via vector field consensus
In this paper, we propose an efficient algorithm, called vector field consensus, for
establishing robust point correspondences between two sets of points. Our algorithm starts …
establishing robust point correspondences between two sets of points. Our algorithm starts …
Algorithm-dependent generalization bounds for multi-task learning
Often, tasks are collected for multi-task learning (MTL) because they share similar feature
structures. Based on this observation, in this paper, we present novel algorithm-dependent …
structures. Based on this observation, in this paper, we present novel algorithm-dependent …
Group sparse multiview patch alignment framework with view consistency for image classification
No single feature can satisfactorily characterize the semantic concepts of an image.
Multiview learning aims to unify different kinds of features to produce a consensual and …
Multiview learning aims to unify different kinds of features to produce a consensual and …
A geometric viewpoint of manifold learning
In many data analysis tasks, one is often confronted with very high dimensional data. The
manifold assumption, which states that the data is sampled from a submanifold embedded in …
manifold assumption, which states that the data is sampled from a submanifold embedded in …
Linking heterogeneous input spaces with pivots for multi-task learning
Most existing works on multi-task learning (MTL) assume the same input space for different
tasks. In this paper, we address a general setting where different tasks have heterogeneous …
tasks. In this paper, we address a general setting where different tasks have heterogeneous …
A differential geometry perspective on orthogonal recurrent models
Recently, orthogonal recurrent neural networks (RNNs) have emerged as state-of-the-art
models for learning long-term dependencies. This class of models mitigates the exploding …
models for learning long-term dependencies. This class of models mitigates the exploding …
Online discriminant projective non-negative matrix factorization
Projective non-negative matrix factorization (PNMF) learns a subspace spanned by several
non-negative bases by minimizing the distance between samples and their reconstructions …
non-negative bases by minimizing the distance between samples and their reconstructions …
Multi-task learning and its applications to biomedical informatics
J Zhou - 2014 - keep.lib.asu.edu
In many fields one needs to build predictive models for a set of related machine learning
tasks, such as information retrieval, computer vision and biomedical informatics …
tasks, such as information retrieval, computer vision and biomedical informatics …
Mismatch Removal Based on Gaussian Mixture Model for Aircraft Surface Texture Mapping
G Niu, L Wang, Z Tan - Information Technology and Control, 2020 - itc.ktu.lt
Aiming at the fact of lower efficiency and higher time cost for feature matching in aircraft
surface texture mapping process, a novel mismatch removal method based on Gaussian …
surface texture mapping process, a novel mismatch removal method based on Gaussian …
The complexity of algorithmic hypothesis class
T Liu - 2016 - opus.lib.uts.edu.au
Statistical learning theory provides the mathematical and theoretical foundations for
statistical learning algorithms and inspires the development of more efficient methods. It is …
statistical learning algorithms and inspires the development of more efficient methods. It is …