Sudipta Modak
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sudipta Modak has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Esam Abdel-Raheem
Department of Electrical and Computer Engineering, University of Windsor, Windsor, Canada
6 shared publications - Aakarsh Malhotra
Mastercard, Gurugram, India
2 shared publications - Luay Yassin Taha
Penn State Altoona, Division of Business, Engineering, and Information Sciences & Technology, Pennsylvania, 3000 Ivyside Park, Altoona, PA 16601,United States
2 shared publications - Luis Rueda
University of Windsor
2 shared publications - Abir Hussain
Department of Electrical Engineering, University of Sharjah, Sharjah, UAE
1 shared publication - Alok Kumar Singh
Department of Chemistry, Deen Dayal Upadhyaya Gorakhpur University, Gorakhpur, India
1 shared publication
Latest Publications
- Open Access
- 23 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 154933-154948
GPD-Nodule: A Lightweight Lung Nodule Detection and Segmentation Framework on Computed Tomography Images Using Uniform Superpixel Generation
Lung nodule detection is key in early diagnosis of lung cancer. To detect such nodules manually, expert radiologists dedicate a significant amount of time and effort by going through computed tomography scan images slice by slice. This endeavor results in the slow processing of radiological images and possible misdiagnosis due to nodules being tiny by nature. In this paper, we introduce a two-step automatic computer-aided nodule detection method that encompasses a novel uniform superpixel generation algorithm, namely, equivalent patchwise iterative agglomerative clustering. This superpixel generation algorithm can generate the same number of superpixels for every image making it suitable for training neural networks. This method is then coupled with a novel variant of graph neural networks, namely, the curtailed residual nested superpixel propagation network, and an unsupervised region proposal method, namely, pixel nesting region proposal mechanism to detect nodules with high accuracy. The results show an accelerated training process compared to state-of-the-art convolutional neural networks and good generalization capability. Furthermore, the proposed method displays a significant reduction in trainable parameters while achieving high performance in the detection and segmentation of nodules on the Lung Image Database Consortium and Image Database Resource Initiative dataset.
- 23 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 154933-154948
Open AccessGPD-Nodule: A Lightweight Lung Nodule Detection and Segmentation Framework on Computed Tomography Images Using Uniform Superpixel Generation
Lung nodule detection is key in early diagnosis of lung cancer. To detect such nodules manually, expert radiologists dedicate a significant amount of time and effort by going through computed tomography scan images slice by slice. This endeavor results in the slow processing of radiological images and possible misdiagnosis due to nodules being tiny by nature. In this paper, we introduce a two-step automatic computer-aided nodule detection method that encompasses a novel uniform superpixel generation algorithm, namely, equivalent patchwise iterative agglomerative clustering. This superpixel generation algorithm can generate the same number of superpixels for every image making it suitable for training neural networks. This method is then coupled with a novel variant of graph neural networks, namely, the curtailed residual nested superpixel propagation network, and an unsupervised region proposal method, namely, pixel nesting region proposal mechanism to detect nodules with high accuracy. The results show an accelerated training process compared to state-of-the-art convolutional neural networks and good generalization capability. Furthermore, the proposed method displays a significant reduction in trainable parameters while achieving high performance in the detection and segmentation of nodules on the Lung Image Database Consortium and Image Database Resource Initiative dataset.
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 3969-3973
Progressive Label Disambiguation for Partial Label Learning in Homogeneous Graphs
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.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 3969-3973
Open AccessProgressive Label Disambiguation for Partial Label Learning in Homogeneous Graphs
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.
- 25 July 2024
- Published by Springer Nature
- p. 70-80
Harnessing the Power of Graph Propagation in Lung Nodule Detection
- 25 July 2024
- Published by Springer Nature
- p. 70-80
Harnessing the Power of Graph Propagation in Lung Nodule Detection
- Top Cited PapersOpen Access
- 17 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 84785-84802
Deep Learning in Automatic Diabetic Retinopathy Detection and Grading Systems: A Comprehensive Survey and Comparison of Methods
Diabetic Retinopathy is one of the leading global causes of vision impairment and blindness in humans. It has seen a rise in prevalence, necessitating the development of advanced automatic detection methods. This paper presents a survey of the evolution in deep learning techniques for diabetic retinopathy detection, emphasizing the transition from traditional machine learning to sophisticated deep learning architectures such as convolutional neural networks. It discusses the role of transfer learning, end-to-end learning, and hybrid models in overcoming medical detection challenges while highlighting the need for artificial intelligence interpretability and real-time screening integration in clinical workflows. Building on this survey, the paper introduces a focused study on cross-dataset deployment of transfer learning for diabetic retinopathy detection and grading. Consequently, this paper evaluates 26 pre-trained models from various convolutional neural network families to provide a comprehensive comparison between the state-of-the-art CNN architectures in the field. Additionally, this study also employs Grad-CAM visualization to interpret the model’s decision-making, bridging advanced artificial intelligence techniques with practical healthcare applications for diabetic retinopathy.
- 17 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 84785-84802
Top Cited PapersOpen AccessDeep Learning in Automatic Diabetic Retinopathy Detection and Grading Systems: A Comprehensive Survey and Comparison of Methods
Diabetic Retinopathy is one of the leading global causes of vision impairment and blindness in humans. It has seen a rise in prevalence, necessitating the development of advanced automatic detection methods. This paper presents a survey of the evolution in deep learning techniques for diabetic retinopathy detection, emphasizing the transition from traditional machine learning to sophisticated deep learning architectures such as convolutional neural networks. It discusses the role of transfer learning, end-to-end learning, and hybrid models in overcoming medical detection challenges while highlighting the need for artificial intelligence interpretability and real-time screening integration in clinical workflows. Building on this survey, the paper introduces a focused study on cross-dataset deployment of transfer learning for diabetic retinopathy detection and grading. Consequently, this paper evaluates 26 pre-trained models from various convolutional neural network families to provide a comprehensive comparison between the state-of-the-art CNN architectures in the field. Additionally, this study also employs Grad-CAM visualization to interpret the model’s decision-making, bridging advanced artificial intelligence techniques with practical healthcare applications for diabetic retinopathy.
- 4 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1149-1156
Study of Topology Bias in GNN-based Knowledge Graphs Algorithms
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.
- 4 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1149-1156
Study of Topology Bias in GNN-based Knowledge Graphs Algorithms
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.
- Open Access
- 2 February 2023
- Published by Elsevier in Biomedical Engineering Advances
- Vol. 5
Applications of deep learning in disease diagnosis of chest radiographs: A survey on materials and methods
- 2 February 2023
- Published by Elsevier in Biomedical Engineering Advances
- Vol. 5
Open AccessApplications of deep learning in disease diagnosis of chest radiographs: A survey on materials and methods
- Open Access
- 1 December 2021
- Published by Elsevier in Biomedical Engineering Advances
- Vol. 2, 100016
A novel adaptive multilevel thresholding based algorithm for QRS detection
- 1 December 2021
- Published by Elsevier in Biomedical Engineering Advances
- Vol. 2, 100016
Open AccessA novel adaptive multilevel thresholding based algorithm for QRS detection
- Open Access
- 18 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 46079-46092
A Novel Method of QRS Detection Using Time and Amplitude Thresholds With Statistical False Peak Elimination
Heartbeats are important aspects for the study of heart diseases in medical sciences as they provide vital information on heart disorders and abnormalities in heart rhythms. Each heartbeat provides a QRS complex in the electrocardiogram (ECG) which is centered at the R-peak. The analysis of ECG is hindered by low-frequency noise, high-frequency noise, interference from P and T waves, and changes in QRS morphology. This paper presents a new peak detection algorithm that can suppress the noise and adapt to changes in ECG signal morphology for better detection performance. The proposed algorithm is based on median and moving average (MA) filtering, segmentation, time and amplitude thresholds, and statistical false peak elimination (SFPE). The filters are first used in preprocessing to reduce unwanted noise and interference. The data is then divided into smaller segments and each segment is then analyzed using two distinct thresholds, a time axis (x-axis) threshold and an amplitude (y-axis) threshold. Next, the false peaks are eliminated resulting from any residue of noise using an average value of peak-to-peak interval. A post-processing stage is added to eliminate any peak that is detected twice and to search for missed low-amplitude peaks. The proposed method is tested on MIT-BIH arrhythmia and Fantasia databases and provides better results in comparison to several state-of-the-art methods in the field. The mean sensitivity, positive predictivity, and detection error rates for the proposed method are 99.82%, 99.88%, and 0.31%, respectively, for the MIT-BIH arrhythmia database and 99.92%, 99.90%, and 0.18%, respectively, for the Fantasia database.
- 18 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 46079-46092
Open AccessA Novel Method of QRS Detection Using Time and Amplitude Thresholds With Statistical False Peak Elimination
Heartbeats are important aspects for the study of heart diseases in medical sciences as they provide vital information on heart disorders and abnormalities in heart rhythms. Each heartbeat provides a QRS complex in the electrocardiogram (ECG) which is centered at the R-peak. The analysis of ECG is hindered by low-frequency noise, high-frequency noise, interference from P and T waves, and changes in QRS morphology. This paper presents a new peak detection algorithm that can suppress the noise and adapt to changes in ECG signal morphology for better detection performance. The proposed algorithm is based on median and moving average (MA) filtering, segmentation, time and amplitude thresholds, and statistical false peak elimination (SFPE). The filters are first used in preprocessing to reduce unwanted noise and interference. The data is then divided into smaller segments and each segment is then analyzed using two distinct thresholds, a time axis (x-axis) threshold and an amplitude (y-axis) threshold. Next, the false peaks are eliminated resulting from any residue of noise using an average value of peak-to-peak interval. A post-processing stage is added to eliminate any peak that is detected twice and to search for missed low-amplitude peaks. The proposed method is tested on MIT-BIH arrhythmia and Fantasia databases and provides better results in comparison to several state-of-the-art methods in the field. The mean sensitivity, positive predictivity, and detection error rates for the proposed method are 99.82%, 99.88%, and 0.31%, respectively, for the MIT-BIH arrhythmia database and 99.92%, 99.90%, and 0.18%, respectively, for the Fantasia database.