Buscar
Mostrando ítems 31-40 de 84
1920-2015: un siglo de Visión por Computador
(Universidad de Córdoba, 2015)
Dentro de 5 años se cumplirá exactamente un siglo desde la aparición de esta Ciencia a la que aún seguimos refiriéndonos como Visión por Computador. A diferencia de otras Ciencias, con mucha más tradición, conocemos ...
A New Clustering Algorithm Based on Pattern Extraction in Molecular Fingerprints
(2017-12-11)
In this paper an algorithm for the extraction of patterns in chemical fingerprints is described. As input this algorithm uses a fingerprint representation of the molecule dataset, generating a group of consistent disjoint ...
LAIM discretization for multi-label data
(2017)
Multi-label learning is a challenging task in data mining which has attracted growing attention in recent years. Despite the fact that many multi-label datasets have continuous features, general algorithms developed specially ...
Three hypothesis algorithm with occlusion reasoning for multiple people tracking
(IS&T and SPIE, 2015)
This work proposes a detection-based tracking algorithm able to locate and keep the identity of multiple
people, who may be occluded, in uncontrolled stationary environments. Our algorithm builds a tracking graph
that ...
Detection of early warning signals in paleoclimate data using a genetic time series segmentation algorithm
(2017)
This paper proposes a time series segmentation algorithm combining a clustering technique and a genetic algorithm to automatically find segments sharing common statistical characteristics in paleoclimate time series. The ...
A new approach for multi-view gait recognition on unconstrained paths
(2017)
Direction changes cause di culties for most of the gait recognition systems, due to appearance
changes. We propose a new approach for multi-view gait recognition, which
focuses on recognizing people walking on unconstrained ...
Evaluación distribuida transparente para algoritmos evolutivos en JCLEC
(2017)
La evaluaci ´on de los individuos en un algoritmo evolutivo constituye
generalmente la etapa con un mayor coste computacional. Este hecho se acent ´ua
en los problemas de miner´ıa de datos debido al cada vez mayor tama˜no ...
Keypoint descriptor fusion with Dempster-Shafer Theory
(2017)
Keypoint matching is the task of accurately nding the location of a scene point in two images. Many keypoint
descriptors have been proposed in the literature aiming at providing robustness against scale, translation and ...
Optimización de ataques a redes complejas mediante un algoritmo de colonias de abejas artificiales
(Universidad de Salamanca, 2016)
En los últimos años, ha crecido el interés en formular como
un problema de optimización la tarea de concebir ataques efectivos que
causen el máximo daño sobre redes complejas. En este caso, los ataques
se modelan como ...
Semi-supervised Learning for Ordinal Kernel Discriminant Analysis
(Elsevier, 2016)
Ordinal classication considers those classication problems where the labels of
the variable to predict follow a given order. Naturally, labelled data is scarce
or di_cult to obtain in this type of problems because, in ...