Search Results for author: Guillermo Ruiz

Found 8 papers, 3 papers with code

Are metrics measuring what they should? An evaluation of image captioning task metrics

no code implementations4 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.

Image Captioning

Similarity search on neighbor's graphs with automatic Pareto optimal performance and minimum expected quality setups based on hyperparameter optimization

1 code implementation19 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.

Hyperparameter Optimization

Regionalized models for Spanish language variations based on Twitter

no code implementations12 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.

Word Embeddings

Hyperparameter-Free Losses for Model-Based Monocular Reconstruction

1 code implementation16 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).

3D Reconstruction Benchmarking +2

A scalable solution to the nearest neighbor search problem through local-search methods on neighbor graphs

1 code implementation29 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.

Clustering

Proximal Navigation Graphs and t-spanners

no code implementations7 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

Cannot find the paper you are looking for? You can Submit a new open access paper.