Eusebio J. Aguilera-Aguilera

According to our database, Eusebio J. Aguilera-Aguilera authored at least 7 papers between 2014 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2017

New method for obtaining optimal polygonal approximations to solve the min- $$\varepsilon$$ ε problem.

Ángel Carmona-Poyato, Eusebio J. Aguilera-Aguilera, Francisco José Madrid-Cuevas, Manuel J. Marín-Jiménez, Nicolás Luis Fernández García

Neural Comput. Appl., 2017

2016

An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves.

Francisco José Madrid-Cuevas, Eusebio J. Aguilera-Aguilera, Ángel Carmona-Poyato, Rafael Muñoz-Salinas, Rafael Medina Carnicer, Nicolás Luis Fernández García

J. Vis. Commun. Image Represent., 2016

Fast computation of optimal polygonal approximations of digital planar closed curves.

Eusebio J. Aguilera-Aguilera, Ángel Carmona-Poyato, Francisco José Madrid-Cuevas, Manuel Jesús Marín-Jiménez

Graph. Model., 2016

2015

Novel method to obtain the optimal polygonal approximation of digital planar curves based on Mixed Integer Programming.

Eusebio J. Aguilera-Aguilera, Ángel Carmona-Poyato, Francisco José Madrid-Cuevas, Rafael Muñoz-Salinas

J. Vis. Commun. Image Represent., 2015

New Method for Obtaining Optimal Polygonal Approximations.

Ángel Carmona-Poyato, Eusebio J. Aguilera-Aguilera, Francisco José Madrid-Cuevas, David López-Fernández

Proceedings of the Pattern Recognition and Image Analysis - 7th Iberian Conference, 2015

Unsupervised Approximation of Digital Planar Curves.

Eusebio J. Aguilera-Aguilera, Ángel Carmona-Poyato, Francisco José Madrid-Cuevas, Rafael Medina Carnicer

Proceedings of the Pattern Recognition and Image Analysis - 7th Iberian Conference, 2015

2014

The computation of polygonal approximations for 2D contours based on a concavity tree.

Eusebio J. Aguilera-Aguilera, Ángel Carmona-Poyato, Francisco José Madrid-Cuevas, Rafael Medina Carnicer

J. Vis. Commun. Image Represent., 2014