Examinando por Autor "Sanchez, A."

Mostrando 1 - 3 de 3

Complex Networks applied to Dynamic Vision Systems
(Yamir Moreno. Universidad Rey Juan Carlos/ Regino Criado. Universidad Rey Juan Carlos, 2011-10-24) Criado, R.; Romance, M.; Sanchez, A.; Suarez, P.D.
We presented an novel application of complex network theory to the visual tracking problem in videos considering multiple targets. The implemented system has been tested successfully with different videos of different spatial resolu- tions producing accurate targets' detection and tracking at a real-time framerate.
Interest Point Detection in Images by a Local Centrality Algorithm on Complex Networks
(Yamir Moreno. Universidad Rey Juan Carlos/ Regino Criado. Universidad Rey Juan Carlos, 2011-04-01) Criado, R.; Romance, M.; Sanchez, A.
The field of Digital Image Processing offers an interesting framework for the application of the Complex Networks theory. Since images can be seen as organized data structures of adjacent pixels, it becomes natural to model and analyze them using complex network properties. We present a local centrality algorithm on a network with the aim detect the position and importance of interest points (i.e. corners) in a digital image. An spatial and weighted complex network is associated to the image and a new method for locating these feature points based on a local centrality measure of the corresponding network, is proposed.
Solving the edge-disjoint paths problem using a two-stage method
(Wiley, 2020) Martin, B.; Sanchez, A.; Beltrán-Royo, César; Duarte, A.
There exists a wide variety of network problems where several connection requests occur simultaneously. In general, each request is attended by finding a route in the network, where the origin and destination of such a route are those hosts that wish to establish a connection for information exchange. As is well documented in the related literature, the exchange of information through disjoint routes increases the effective bandwidth, velocity, and the probability of receiving the corresponding information. The definition of disjoint paths may refer to nodes, edges, or both. One of the most studied variants is the one where disjointness implies not to share edges. This optimization problem is usually known as the maximum edge-disjoint paths problem. This urn:x-wiley:09696016:media:itor12544:itor12544-math-0001-hard optimization problem has applications in real-time communications, very large scale integration design, scheduling, bin packing, or load balancing. The proposed approach hybridizes an integer linear programming formulation of the problem with an evolutionary algorithm. Empirical results using 174 previously reported instances show that the proposed procedure compares favorably to previous metaheuristics for this problem. We confirm the significance of the results by conducting nonparametric statistical tests