Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Manuel Favela

dblp:326/5198 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0003-7485-6661ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
image retrieval
0.712023
SeeSaw: Interactive Ad-hoc Search Over Image Databases · Proc. ACM Manag. Data 2023
Information retrieval
relevance feedback
0.712023
SeeSaw: Interactive Ad-hoc Search Over Image Databases · Proc. ACM Manag. Data 2023
Information retrieval
retrieval models
0.212023
SeeSaw: Interactive Ad-hoc Search Over Image Databases · Proc. ACM Manag. Data 2023
Information retrieval › cross-modal retrieval
visual-semantic embedding
0.212023
SeeSaw: Interactive Ad-hoc Search Over Image Databases · Proc. ACM Manag. Data 2023

Methods — techniques the papers use, named apart from their topics

box annotation · 0.7active learning · 0.7CLIP · 0.7
YearPublicationVenuePosition
2023 SeeSaw: Interactive Ad-hoc Search Over Image Databases
abstract
As image datasets become ubiquitous, the problem of ad-hoc searches over image data is increasingly important. Many high-level data tasks in machine learning, such as constructing datasets for training and testing object detectors, imply finding ad-hoc objects or scenes within large image datasets as a key sub-problem. New foundational visual-semantic embeddings trained on massive web datasets such as Contrastive Language-Image Pre-Training (CLIP) can help users start searches on their own data, but we find there is a long tail of queries where these models fall short in practice. Seesaw is a system for interactive ad-hoc searches on image datasets that integrates state-of-the-art embeddings like CLIP with user feedback in the form of box annotations to help users quickly locate images of interest in their data even in the long tail of harder queries. One key challenge for Seesaw is that, in practice, many sensible approaches to incorporating feedback into future results, including state-of-the-art active-learning algorithms, can worsen results compared to introducing no feedback, partly due to CLIP's high-average performance. Therefore, Seesaw includes several algorithms that empirically result in larger and also more consistent improvements. We compare Seesaw's accuracy to both using CLIP alone and to a state-of-the-art active-learning baseline and find Seesaw consistently helps improve results for users across four datasets and more than a thousand queries. Seesaw increases Average Precision (AP) on search tasks by an average of .08 on a wide benchmark (from a base of .72), and by a .27 on a subset of more difficult queries where CLIP alone performs poorly.
Oscar R. Moll Thomae, Manuel Favela, Samuel Madden 0001, Vijay Gadepally, Michael J. Cafarella
Proc. ACM Manag. Data2