Demo Data from VLDB 2026 / reviewers in the wild / expert
Miquel Ferrarons
dblp:135/5254
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2Human-computer interaction and ubiquitous computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Image recognition and object detection · 77% Efficient and distributed learning · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Image recognition and object detection › image retrieval
large-scale image retrieval |
0.2 | 1 | 2014 | High volume offline image recognition · ISMAR 2014 |
Machine learning › Efficient and distributed learning
on-device inference |
0.1 | 1 | 2014 | High volume offline image recognition · ISMAR 2014 |
Methods — techniques the papers use, named apart from their topics
image recognition engine · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | High volume offline image recognitionabstractWe show a prototype of an offline image recognition engine, running on a tablet with Intel®Atom™ processor, searching within less than 250ms through thousands (5000+) of images. Moreover, the prototype still offers the advanced capabilities of recognising real world 3D objects, until now reserved only for cloud solutions. Until now image search within large collections of images could be performed only in the cloud, requiring mobile devices to have Internet connectivity. However, for many use cases the connectivity requirement is impractical, e.g. many museums have no network coverage, or do not want their visitors incurring expensive roaming charges. Existing commercial solutions are very limited in terms of searched collections sizes, often imposing a maximum limit of <100 reference images. Moreover, adding images typically affects the recognition speed and increases RAM requirements. Tomasz Adamek, Luis Martinell, Miquel Ferrarons, Alex Torrents, David Marimon |
ISMAR | 3 |
| 2013 | Memory efficient subsequence DTW for Query-by-Example Spoken Term DetectionabstractIn this paper we propose a fast and memory efficient Dynamic Time Warping (MES-DTW) algorithm for the task of Query-by-Example Spoken Term Detection (QbE-STD). The proposed algorithm is based on the subsequence-DTW (S-DTW) algorithm, which allows the search for small spoken queries within a much bigger search collection of spoken documents by considering fixed start-end points in the query and discovering optimal matching subsequences along the search collection. The proposed algorithm applies some modifications to S-DTW that make it better suited for the QbE-STD task, including a way to perform the matching with virtually no system memory, optimal when querying large scale databases. We also describe the system used to perform QbE-STD, including an energy-based quantification for speech/non-speech detection and an overlap detector for putative matches. We test the system proposed using the Mediaeval 2012 spoken-web-search dataset and show that, in addition to the memory savings, the proposed algorithm brings an advantage in terms of matching accuracy (up to 0.235 absolute MTWV increase) and speed (around 25% faster) in comparison to the original S-DTW. Xavier Anguera Miró, Miquel Ferrarons |
ICME | 2 |