Aakarsh Malhotra

Aakarsh Malhotra

Auto-generated profile, based on publicly available information

Aakarsh Malhotra

IIIT-Delhi

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 May 2023 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
AMAakarsh Malhotra
Aakarsh Malhotra
MVMayank Vatsa
Mayank Vatsa
RSRicha Singh
Richa Singh
KMKeith B. Morris
Keith B. Morris
ANAfzel Noore
Afzel Noore
Latent fingerprint recognition involves acquisition and comparison of latent fingerprints with an exemplar gallery of fingerprints. The diversity in the type of surface leads to different procedures to recover the latent fingerprint. The appearance of latent fingerprints vary significantly due to the development techniques, leading to large intra-class variation. Due to lack of large datasets acquired using multiple mechanisms and surfaces, existing algorithms for latent fingerprint enhancement and comparison may perform poorly. In this study, we propose a Multi-Surface Multi-Technique (MUST) Latent Fingerprint Database. The database consists of more than 16,000 latent fingerprint impressions from 120 unique classes (120 fingers from 12 participants). Including corresponding exemplar fingerprints (livescan and rolled) and extended gallery, the dataset has nearly 21,000 impressions. It has latent fingerprints acquired under 35 different scenarios and additional four subsets of exemplar prints captured using live scan sensor and inked-rolled prints. With 39 different subsets, the database illustrates intra-class variations in latent fingerprints. The database has a potential usage towards building robust algorithms for latent fingerprint enhancement, segmentation, comparison, and multi-task learning. We also provide annotations for manually marked minutiae, acquisition Pixel Per Inch (PPI), and semantic segmentation masks. We also present the experimental protocol and the baseline results for the proposed dataset. The availability of the proposed database can encourage research in handling intra-class variation in latent fingerprint recognition.

21 October 2024
Verified
Conference Paper
Open access
RPRajat Patel
Rajat Patel
AMAakarsh Malhotra
Aakarsh Malhotra
SMSudipta Modak
Sudipta Modak
SYSiddharth Yeramsetty
Siddharth Yeramsetty
Many existing Graph Neural Networks (GNN) methods assume that labels are reliable and sufficient, which may not be the case in real-world scenarios. This paper addresses one such problem of Partial Label Learning (PLL) on graph-structured data. In the PLL for graphs, each node is represented by a candidate set of labels, where only one is true while the others are inaccurate. Despite advancements with PLL in tabular and vision domains, the graph-structured data still needs to be explored. In this work, we first define PLL for graphs. Subsequently, we propose a new PLD-Graph algorithm for PLL in homogeneous graphs with scarce labels. We utilize graph augmentation to reduce the effects of inexact labels and provide additional supervision from unlabeled nodes. Progressive label disambiguation is performed based on the model's ability to predict correct classes. Furthermore, an additional loss estimates the label corruption matrix to capture associations between correct and incorrect labels. We show the effectiveness of the proposed algorithm on multiple graph datasets, with two types of noise and varying levels of ambiguous labels. Overall, the proposed PLD-Graph algorithm outperforms state-of-the-art PLL methods.

10 May 2025
Verified
Book Chapter
Closed access
PDF file
AMAakarsh Malhotra
Aakarsh Malhotra
MVMayank Vatsa
Mayank Vatsa
RSRicha Singh
Richa Singh

3 August 2025
Verified
Conference Paper
Open access
RVRam Ganesh V
Ram Ganesh V
ASAyush Singh
Ayush Singh
ARAditi Rai
Aditi Rai
HPHarsh Pal
Harsh Pal
DBDeepanshu Bagotia
Deepanshu Bagotia
SRSayan Ranu
Sayan Ranu

9 January 2021
Verified
Book Chapter
Closed access
PDF file
AMAakarsh Malhotra
Aakarsh Malhotra
MVMayank Vatsa
Mayank Vatsa
RSRicha Singh
Richa Singh

4 December 2023
Verified
Conference Paper
Closed access
ASAnil Surisetty
Anil Surisetty
AMAakarsh Malhotra
Aakarsh Malhotra
DCDeepak Chaurasiya
Deepak Chaurasiya
SMSudipta Modak
Sudipta Modak
SYSiddharth Yerramsetty
Siddharth Yerramsetty
Esam Abdel-RaheemEsam Abdel-Raheem
Esam Abdel-Raheem
Graph neural networks (GNN) have recently been integrated into knowledge graph representation learning. The efficient message-passing functions in GNNs capture latent relationships between entities within these semantic networks, which aids in various downstream tasks such as link prediction, node classification, and entity alignment. However, there is a general deficiency in representation learning on graphs with loops (cycles) and self-loops 1 . Traditional message-passing functions induce biased learning on knowledge graphs, leading to skewed predictions. This work presents a detailed analysis of representation bias generated by these functions on knowledge graphs containing short and self-loops. We demonstrate the variance in performance on knowledge graphs with varying topology over two downstream: link prediction and entity alignment. The experiments show that the representations from popular learning algorithms are prone to capturing biases in the graphs’ structures. These biases, however, have different effects on the formulated downstream tasks, motivating research in the domain of topology-invariant representation algorithms for knowledge graphs.