no code implementations • 4 Jul 2022 • Othón González-Chávez, Guillermo Ruiz, Daniela Moctezuma, Tania A. Ramirez-delReal
Looking to measure how well or not the set of current and more recent metrics are doing, in this article, we present an evaluation of several kinds of Image Captioning metrics and a comparison between them using the well-known MS COCO dataset.
no code implementations • 12 Apr 2022 • Daniela Moctezuma, Tania Ramírez-delReal, Guillermo Ruiz, Othón González-Chávez
As a result, the most-used datasets and metrics are identified.
1 code implementation • 19 Jan 2022 • Eric S. Tellez, Guillermo Ruiz
This manuscript introduces an autotuned algorithm for searching nearest neighbors based on neighbor graphs and optimization metaheuristics to produce Pareto-optimal searches for quality and search speed automatically; the same strategy is also used to produce indexes that achieve a minimum quality.
no code implementations • 12 Oct 2021 • Eric S. Tellez, Daniela Moctezuma, Sabino Miranda, Mario Graff, Guillermo Ruiz
Spanish is one of the most spoken languages in the globe, but not necessarily Spanish is written and spoken in the same way in different countries.
no code implementations • SEMEVAL 2020 • Guillermo Ruiz, Eric S. Tellez, Daniela Moctezuma, Sabino Miranda-Jim{\'e}nez, Tania Ram{\'\i}rez-delReal, Mario Graff
We obtained results analyzing the text and images separately, and also in combination.
1 code implementation • 16 Aug 2019 • Eduard Ramon, Guillermo Ruiz, Thomas Batard, Xavier Giró-i-Nieto
This work proposes novel hyperparameter-free losses for single view 3D reconstruction with morphable models (3DMM).
1 code implementation • 29 May 2017 • Eric S. Tellez, Guillermo Ruiz, Edgar Chavez, Mario Graff
Near neighbor search (NNS) is a powerful abstraction for data access; however, data indexing is troublesome even for approximate indexes.
no code implementations • 7 Apr 2014 • Guillermo Ruiz, Edgar Chávez
We call $G$ a {\em proximal navigation graph} or $PN$-graph if for each edge $(u, v) \in E$ either $u=v$ or there is a node $u_1$ such that $(u, u_1) \in E$ and $\mathbf{d}(u, v) > \mathbf{d}(u_1, v)$.
Computational Geometry