Demo Data from SIGIR 2026 / reviewers in the wild / expert
Mariamma Antony
dblp:157/7917
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.
| Artificial intelligence
1 paper |
Trustworthy machine learning · 87% Image recognition and object detection · 13% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › robustness › corruption robustness
image compression robustness |
0.9 | 1 | 2025 | CheXwhatsApp: A Dataset for Exploring Challenges in the Diagnosis of Chest X-rays through Mobile Devices · CVPR 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.9 | 1 | 2025 | CheXwhatsApp: A Dataset for Exploring Challenges in the Diagnosis of Chest X-rays through Mobile Devices · CVPR 2025 |
Medical and health informatics › digital health
mobile health |
0.9 | 1 | 2025 | CheXwhatsApp: A Dataset for Exploring Challenges in the Diagnosis of Chest X-rays through Mobile Devices · CVPR 2025 |
Computer vision › Image recognition and object detection › medical image analysis
medical image classification |
0.3 | 1 | 2025 | CheXwhatsApp: A Dataset for Exploring Challenges in the Diagnosis of Chest X-rays through Mobile Devices · CVPR 2025 |
Methods — techniques the papers use, named apart from their topics
explainability analysis · 1.7benchmarking · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CheXwhatsApp: A Dataset for Exploring Challenges in the Diagnosis of Chest X-rays through Mobile DevicesabstractMobile health (mHealth) has emerged as a transformative solution to enhance healthcare accessibility and affordability, particularly in resource-constrained regions and low-to-middle-income countries. mHealth leverages mobile platforms to improve healthcare accessibility, addressing radiologist shortages in low-resource settings by enabling remote diagnosis and consultation through mobile devices. Mobile phones allow healthcare workers to transmit radiographic images, such as chest X-rays (CXR), to specialists or AI-driven models for interpretation. However, AI-based diagnosis using CXR images shared via apps like WhatsApp suffers from reduced predictability and explainability due to compression artifacts, and there is a lack of datasets to systematically study these challenges. To address this, we introduce CheXwhatsApp, a dataset of 141,804 paired original and WhatsApp-compressed CXR images. We present a benchmarking study which shows the dataset improves prediction stability and explainability of state-of-the-art models by up to 80%, while also enhancing localization performance. CheXwhatsApp is open-sourced to support advancements in mHealth applications for CXR analysis1. Mariamma Antony, Rajiv Porana, Sahil M. Lathiya, Siva Teja Kakileti, Chiranjib Bhattacharyya |
CVPR | 1 |
| 2014 | Finding a small set of high degree nodes in time-varying graphsabstractA time-varying graph (TVG) can model useful practical scenarios such as intermittent contact between nodes. High degree nodes in such networks can act as central nodes for efficient implementation of different applications such as information dissemination. In this paper, we propose a distributed algorithm for finding a low cardinality set of high degree nodes in a time-varying graph. The algorithm efficiently exploits the overlap in coverage between nodes to reduce the size of the set and finds a small subset of all high degree nodes in the network while still maintaining almost the same coverage as the set of all high degree nodes. It also finds temporal paths from all nodes to the high degree nodes found which can be used for routing information to the nodes. Mariamma Antony, Arobinda Gupta |
WoWMoM | 1 |