EDBT 2026 Demo / reviewers in the wild / expert
Deepak Mittal
dblp:151/8451
· DBLP profile ↗
8ranked-venue papers
2as first author
5since 2021 · last 2024
0000-0001-5699-4794ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 1 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 6 · 1 first-author · 4 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
2 papers |
Vision and language · 44% Learning paradigms · 44% Image recognition and object detection · 12% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Vision and language
image captioning |
0.5 | 1 | 2021 | Perturb, Predict & Paraphrase: Semi-Supervised Learning using Noisy Student for Image Captioning · IJCAI 2021 |
Machine learning › Learning paradigms
semi-supervised learning |
0.5 | 1 | 2021 | Perturb, Predict & Paraphrase: Semi-Supervised Learning using Noisy Student for Image Captioning · IJCAI 2021 |
Computer vision › Image recognition and object detection › object detection
contour detection |
0.1 | 1 | 2020 | ProAlignNet: Unsupervised Learning for Progressively Aligning Noisy Contours · CVPR 2020 |
Methods — techniques the papers use, named apart from their topics
unsupervised learning · 0.9progressive alignment · 0.9teacher-student learning · 0.5self-training · 0.5paraphrase generation · 0.5noisy student training · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Domain Contextual and Relational Graph Model for Predictive MaintenanceabstractThe rotating machine is one of the common components which is examined under predictive maintenance across different industry sectors. Failure of bearings and gear boxes in such rotating machines are typical problems and their inspection is done using multiple sensors such as vibration, ultrasound, torque and temperature. The existing machine learning (ML) methods for bearing fault detection include traditional ML approaches and advanced deep learning algorithms. Nevertheless, these approaches often fail to account for the domain context and relationships between features, which are essential for building generalized, knowledge oriented, and trustworthy models. This work attempts to incorporate these aspects using a domain contextual and relational graph model (DCRG). It involves a graph convolutional network which is constructed with domain inspired features and their relations based on domain knowledge. The proposed method has been inspected using open-source bearing datasets such as Franche-Comté Électronique Mécanique Thermique et Optique (FEMTO), and Xi'an Jiaotong University (XJTU) bearing dataset. DCRG achieves stronger F1 scores (improvement by 5–10%) than the baseline machine learning approaches. Robert Schiller, Trupti Chavan, Akshay Kakkar, Viraj E, Don Williams, Derek Snaidauf, Edward Bowen, Deepak Mittal, Sunil Reddy Tiyyagura |
ICMLA | 8 |
| 2022 | Acoustic Representation Learning on Breathing and Speech Signals for COVID-19 Detection
Debottam Dutta, Debarpan Bhattacharya, Sriram Ganapathy, Amir Hossein Poorjam, Deepak Mittal, Maneesh Kumar Singh 0001 |
INTERSPEECH | 5 |
| 2022 | SPLICEOUT: A Simple and Efficient Audio Augmentation MethodabstractTime masking has become a de facto augmentation technique for speech and audio tasks, including automatic speech recognition (ASR) and audio classification, most notably as a part of SpecAugment.In this work, we propose SPLICEOUT, a simple modification to time masking which makes it computationally more efficient.SPLICEOUT performs comparably to (and sometimes outperforms) SpecAugment on a wide variety of speech and audio tasks, including ASR for seven different languages using varying amounts of training data, as well as on speech translation, sound and music classification, thus establishing itself as a broadly applicable audio augmentation method.SPLICEOUT also provides additional gains when used in conjunction with other augmentation techniques.Apart from the fully-supervised setting, we also demonstrate that SPLICEOUT can complement unsupervised representation learning with performance gains in the semi-supervised and self-supervised settings. Arjit Jain, Pranay Reddy Samala, Deepak Mittal, Preethi Jyothi, Maneesh Kumar Singh 0001 |
INTERSPEECH | 3 |
| 2021 | Perturb, Predict & Paraphrase: Semi-Supervised Learning using Noisy Student for Image CaptioningabstractRecent semi-supervised learning (SSL) methods are predominantly focused on multi-class classification tasks. Classification tasks allow for easy mixing of class labels during augmentation which does not trivially extend to structured outputs such as word sequences that appear in tasks like image captioning. Noisy Student Training is a recent SSL paradigm proposed for image classification that is an extension of self-training and teacher-student learning. In this work, we provide an in-depth analysis of the noisy student SSL framework for the task of image captioning and derive state-of-the-art results. The original algorithm relies on computationally expensive data augmentation steps that involve perturbing the raw images and computing features for each perturbed image. We show that, even in the absence of raw image augmentation, the use of simple model and feature perturbations to the input images for the student model are beneficial to SSL training. We also show how a paraphrase generator could be effectively used for label augmentation to improve the quality of pseudo labels and significantly improve performance. Our final results in the limited labeled data setting (1% of the MS-COCO labeled data) outperform previous state-of-the-art approaches by 2.5 on BLEU4 and 11.5 on CIDEr scores. Arjit Jain, Pranay Reddy Samala, Preethi Jyothi, Deepak Mittal, Maneesh Kumar Singh 0001 |
IJCAI | 4 |
| 2021 | Investigating Feature Selection and Explainability for COVID-19 Diagnostics from Cough SoundsabstractIn this paper, we propose an approach to automatically classify COVID-19 and non-COVID-19 cough samples based on the combination of both feature engineering and deep learning models. In the feature engineering approach, we develop a support vector machine classifier over high dimensional (6373D) space of acoustic features. In the deep learning-based approach, on the other hand, we apply a convolutional neural network trained on the log-mel spectrograms. These two methodologically diverse models are then combined by fusing the probability scores of the models. The proposed system, which ranked 9th on the 2021 Diagnosing COVID-19 using Acoustics (Di- COVA) challenge leaderboard, obtained an area under the receiver operating characteristic curve (AUC) of 0:81 on the blind test data set, which is a 10:9 absolute improvement compared to the baseline. Moreover, we analyze the explainability of the deep learning-based model when detecting COVID-19 from cough signals. Copyright © 2021 ISCA. Flávio Ávila, Amir Hossein Poorjam, Deepak Mittal, Charles Dognin, Ananya Muguli, Srikanth Raj Chetupalli, Sriram Ganapathy, Maneesh Kumar Singh 0001 |
Interspeech | 3 |
| 2020 | ProAlignNet: Unsupervised Learning for Progressively Aligning Noisy Contours
V. S. R. Veeravasarapu, Abhishek Goel, Deepak Mittal, Maneesh Kumar Singh 0001 |
CVPR | 3 |
| 2019 | Studying the plasticity in deep convolutional neural networks using random pruning
Deepak Mittal, Shweta Bhardwaj, Mitesh M. Khapra, Balaraman Ravindran |
Mach. Vis. Appl. | 1 |
| 2018 | Recovering from Random Pruning: On the Plasticity of Deep Convolutional Neural NetworksabstractRecently there has been a lot of work on pruning filters from deep convolutional neural networks (CNNs) with the intention of reducing computations. The key idea is to rank the filters based on a certain criterion (say, l1-norm, average percentage of zeros, etc) and retain only the top ranked filters. Once the low scoring filters are pruned away the remainder of the network is fine tuned and is shown to give performance comparable to the original unpruned network. In this work, we report experiments which suggest that the comparable performance of the pruned network is not due to the specific criterion chosen but due to the inherent plasticity of deep neural networks which allows them to recover from the loss of pruned filters once the rest of the filters are fine-tuned. Specifically, we show counter-intuitive results wherein by randomly pruning 25-50% filters from deep CNNs we are able to obtain the same performance as obtained by using state of the art pruning methods. We empirically validate our claims by doing an exhaustive evaluation with VGG-16 and ResNet-50. Further, we also evaluate a real world scenario where a CNN trained on all 1000 ImageNet classes needs to be tested on only a small set of classes at test time (say, only animals). We create a new benchmark dataset from ImageNet to evaluate such class specific pruning and show that even here a random pruning strategy gives close to state of the art performance. Lastly, unlike existing approaches which mainly focus on the task of image classification, in this work we also report results on object detection. We show that using a simple random pruning strategy we can achieve significant speed up in object detection (74% improvement in fps) while retaining the same accuracy as that of the original Faster RCNN model. Deepak Mittal, Shweta Bhardwaj, Mitesh M. Khapra, Balaraman Ravindran |
WACV | 1 |