Search results for "vector"

Least-squares community extraction in feature-rich networks using similarity data

2021

We explore a doubly-greedy approach to the issue of community detection in feature-rich networks. According to this approach, both the network and feature data are straightforwardly recovered from the underlying unknown non-overlapping communities, supplied with a center in the feature space and intensity weight(s) over the network each. Our least-squares additive criterion allows us to search for communities one-by-one and to find each community by adding entities one by one. A focus of this paper is that the feature-space data part is converted into a similarity matrix format. The similarity/link values can be used in either of two modes: (a) as measured in the same scale so that one may …

Efficient Multi-scale Patch-Based Segmentation

2015

The objective of this paper is to devise an efficient and accurate patch-based method for image segmentation. The method presented in this paper builds on the work of Wu et al. [14] with the introduction of a compact multi-scale feature representation and heuristics to speed up the process. A smaller patch representation along with hierarchical pruning allowed the inclusion of more prior knowledge, resulting in a more accurate segmentation. We also propose an intuitive way of optimizing the search strategy to find similar voxel, making the method computationally efficient. An additional approach at improving the speed was explored with the integration of our method with Optimised PatchMatch…

Kernel-Based Framework for Multitemporal and Multisource Remote Sensing Data Classification and Change Detection

2008

The multitemporal classification of remote sensing images is a challenging problem, in which the efficient combination of different sources of information (e.g., temporal, contextual, or multisensor) can improve the results. In this paper, we present a general framework based on kernel methods for the integration of heterogeneous sources of information. Using the theoretical principles in this framework, three main contributions are presented. First, a novel family of kernel-based methods for multitemporal classification of remote sensing images is presented. The second contribution is the development of nonlinear kernel classifiers for the well-known difference and ratioing change detectio…

From the nearest neighbour rule to decision trees

1998

This paper proposes an algorithm to design a tree-like classifier whose result is equivalent to that achieved by the classical Nearest Neighbour rule. The procedure consists of a particular decomposition of a d-dimensional feature space into a set of convex regions with prototypes from just one class. Some experimental results over synthetic and real databases are provided in order to illustrate the applicability of the method.

Feature Extraction and Selection for Pain Recognition Using Peripheral Physiological Signals.

2019

In pattern recognition, the selection of appropriate features is paramount to both the performance and the robustness of the system. Over-reliance on machine learning-based feature selection methods can, therefore, be problematic; especially when conducted using small snapshots of data. The results of these methods, if adopted without proper interpretation, can lead to sub-optimal system design or worse, the abandonment of otherwise viable and important features. In this work, a deep exploration of pain-based emotion classification was conducted to better understand differences in the results of the related literature. In total, 155 different time domain and frequency domain features were e…

Emphasizing visualization and physical applications in the study of eigenvectors and eigenvalues

2016

Multi-agent Reinforcement Learning for Simulating Pedestrian Navigation

2012

In this paper we introduce a Multi-agent system that uses Reinforcement Learning (RL) techniques to learn local navigational behaviors to simulate virtual pedestrian groups. The aim of the paper is to study empirically the validity of RL to learn agent-based navigation controllers and their transfer capabilities when they are used in simulation environments with a higher number of agents than in the learned scenario. Two RL algorithms which use Vector Quantization (VQ) as the generalization method for the space state are presented. Both strategies are focused on obtaining a good vector quantizier that generalizes adequately the state space of the agents. We empirically state the convergence…

(Approximate) Low-Mode Averaging with a new Multigrid Eigensolver

2015

We present a multigrid based eigensolver for computing low-modes of the Hermitian Wilson Dirac operator. For the non-Hermitian case multigrid methods have already replaced conventional Krylov subspace solvers in many lattice QCD computations. Since the $\gamma_5$-preserving aggregation based interpolation used in our multigrid method is valid for both, the Hermitian and the non-Hermitian case, inversions of very ill-conditioned shifted systems with the Hermitian operator become feasible. This enables the use of multigrid within shift-and-invert type eigensolvers. We show numerical results from our MPI-C implementation of a Rayleigh quotient iteration with multigrid. For state-of-the-art lat…

Intertwining operators between different Hilbert spaces: connection with frames

2009

In this paper we generalize a strategy recently proposed by the author concerning intertwining operators. In particular we discuss the possibility of extending our previous results in such a way to construct (almost) isospectral self-adjoint operators living in different Hilbert spaces. Many examples are discussed in details. Many of them arise from the theory of frames in Hilbert spaces, others from the so-called g-frames.

A Comparison of Advanced Regression Algorithms for Quantifying Urban Land Cover

2014

Quantitative methods for mapping sub-pixel land cover fractions are gaining increasing attention, particularly with regard to upcoming hyperspectral satellite missions. We evaluated five advanced regression algorithms combined with synthetically mixed training data for quantifying urban land cover from HyMap data at 3.6 and 9 m spatial resolution. Methods included support vector regression (SVR), kernel ridge regression (KRR), artificial neural networks (NN), random forest regression (RFR) and partial least squares regression (PLSR). Our experiments demonstrate that both kernel methods SVR and KRR yield high accuracies for mapping complex urban surface types, i.e., rooftops, pavements, gras…