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

Aritro Biswas

dblp:159/1144 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 since 2021Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.

Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%
Artificial intelligence
1 paper
Image recognition and object detection · 50% Segmentation and scene understanding · 50%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval
cross-modal retrieval
0.512021
Recipe1M+: A Dataset for Learning Cross-Modal Embeddings for Cooking Recipes and Food Images · IEEE Trans. Pattern Anal. Mach. Intell. 2021
Multimedia analysis and retrieval › multimodal learning
joint embedding learning
0.512021
Recipe1M+: A Dataset for Learning Cross-Modal Embeddings for Cooking Recipes and Food Images · IEEE Trans. Pattern Anal. Mach. Intell. 2021
Multimedia analysis and retrieval › multimodal learning
multimodal embedding
0.512021
Recipe1M+: A Dataset for Learning Cross-Modal Embeddings for Cooking Recipes and Food Images · IEEE Trans. Pattern Anal. Mach. Intell. 2021
Multimedia analysis and retrieval › cross-modal retrieval
recipe-image retrieval
0.512021
Recipe1M+: A Dataset for Learning Cross-Modal Embeddings for Cooking Recipes and Food Images · IEEE Trans. Pattern Anal. Mach. Intell. 2021
Computer vision › Segmentation and scene understanding
scene understanding
0.412020
Detecting Natural Disasters, Damage, and Incidents in the Wild · ECCV (19) 2020
Data mining
dataset construction
0.112021
Recipe1M+: A Dataset for Learning Cross-Modal Embeddings for Cooking Recipes and Food Images · IEEE Trans. Pattern Anal. Mach. Intell. 2021

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

neural network embedding · 1.0classification regularization · 1.0deep learning · 0.4
YearPublicationVenuePosition
2021 Recipe1M+: A Dataset for Learning Cross-Modal Embeddings for Cooking Recipes and Food Images
abstract
In this paper, we introduce Recipe1M+, a new large-scale, structured corpus of over one million cooking recipes and 13 million food images. As the largest publicly available collection of recipe data, Recipe1M+ affords the ability to train high-capacity models on aligned, multi-modal data. Using these data, we train a neural network to learn a joint embedding of recipes and images that yields impressive results on an image-recipe retrieval task. Moreover, we demonstrate that regularization via the addition of a high-level classification objective both improves retrieval performance to rival that of humans and enables semantic vector arithmetic. We postulate that these embeddings will provide a basis for further exploration of the Recipe1M+ dataset and food and cooking in general. Code, data and models are publicly available.
Aritro Biswas, Ferda Ofli, Nicholas Hynes 0002, Amaia Salvador, Yusuf Aytar, Ingmar Weber, Antonio Torralba 0001
IEEE Trans. Pattern Anal. Mach. Intell.2
2020 Detecting Natural Disasters, Damage, and Incidents in the Wild
Ethan Weber, Nuria Marzo, Dim P. Papadopoulos, Aritro Biswas, Àgata Lapedriza, Ferda Ofli, Muhammad Imran 0002, Antonio Torralba 0001
ECCV (19)4
2014 Modeling the Expected Data Collection Time for Vehicular Networks Using Random Walks on a Torus
abstract
We are interested in modeling the total expected data collection time for a set of cars (or other mobile nodes) to aggregate the information that they are each carrying to a single vehicle. Data collection processes between cars -- or other mobile nodes -- can be modeled as random walks of particles on a graph, and in this model, data is transferred between data-possessing cars once they encounter each other on the same node of the graph. We analyze this process in the special case in which this graph is a square grid torus graph. Recursion occurs in the system because once an encounter between multiple cars that possess data occurs, the system becomes analogous to simpler systems with the same graph and with fewer cars that possess data. We make approximations for the total data collection time using this recursive property.
Aritro Biswas, Bhaskar Krishnamachari
MASS1