Biprodip Pal

Mr. Biprodip Pal

Rajshahi University of Engineering & Technology
orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
7 May 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
BPBiprodip Pal
Biprodip Pal
Debashis GuptaDebashis Gupta
Debashis Gupta
RMRashed- Al- Mahfuz
Rashed- Al- Mahfuz
SASalem A. Alyami
Salem A. Alyami
MMMohammad Ali Moni
Mohammad Ali Moni
The COVID-19 pandemic requires the rapid isolation of infected patients. Thus, high-sensitivity radiology images could be a key technique to diagnose patients besides the polymerase chain reaction approach. Deep learning algorithms are proposed in several studies to detect COVID-19 symptoms due to the success in chest radiography image classification, cost efficiency, lack of expert radiologists, and the need for faster processing in the pandemic area. Most of the promising algorithms proposed in different studies are based on pre-trained deep learning models. Such open-source models and lack of variation in the radiology image-capturing environment make the diagnosis system vulnerable to adversarial attacks such as fast gradient sign method (FGSM) attack. This study therefore explored the potential vulnerability of pre-trained convolutional neural network algorithms to the FGSM attack in terms of two frequently used models, VGG16 and Inception-v3. Firstly, we developed two transfer learning models for X-ray and CT image-based COVID-19 classification and analyzed the performance extensively in terms of accuracy, precision, recall, and AUC. Secondly, our study illustrates that misclassification can occur with a very minor perturbation magnitude, such as 0.009 and 0.003 for the FGSM attack in these models for X-ray and CT images, respectively, without any effect on the visual perceptibility of the perturbation. In addition, we demonstrated that successful FGSM attack can decrease the classification performance to 16.67% and 55.56% for X-ray images, as well as 36% and 40% in the case of CT images for VGG16 and Inception-v3, respectively, without any human-recognizable perturbation effects in the adversarial images. Finally, we analyzed that correct class probability of any test image which is supposed to be 1, can drop for both considered models and with increased perturbation; it can drop to 0.24 and 0.17 for the VGG16 model in cases of X-ray and CT images, respectively. Thus, despite the need for data sharing and automated diagnosis, practical deployment of such program requires more robustness.

1 April 2014
Verified
Conference Paper
Closed access
FMFiroz Mahmud
Firoz Mahmud
EHEnamul Haque
Enamul Haque
SZSyed Tauhid Zuhori
Syed Tauhid Zuhori
BPBiprodip Pal
Biprodip Pal
This paper illustrates an approach to recognize a face using Principal Components Analysis based Genetic Algorithm in the area of computer vision. Facial image analysis plays an important role for human computer interaction, although automatic face recognition is still a big challenge for many applications. The PCA is applied to extract features from images with the help of covariance analysis to generate Eigen components of the images and reduce the dimensionality. Genetic Algorithm is an optimization technique which gives the optimal solutions from the generated large search space. For our experiment we used Japanese Female Facial Expression (JAFFE) face database with an encouraging result approximately 96%.

1 May 2015
Verified
Conference Paper
Closed access
FMFiroz Mahmud
Firoz Mahmud
MKMst. Taskia Khatun
Mst. Taskia Khatun
SZSyed Tauhid Zuhori
Syed Tauhid Zuhori
SAShyla Afroge
Shyla Afroge
MAMumu Aktar
Mumu Aktar
BPBiprodip Pal
Biprodip Pal
Face recognition is the process of identification of a person by their facial images. This technique makes it possible to use the facial image of a person to authenticate him into a secure system. Face is the main part of human being to be distinguished from one another. Face recognition system mainly takes an image as an input and compares this image with a number of images stored in database to identify whether the input image is in that database or not. There are many techniques used for face recognition. In this paper, we have discussed two techniques: Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA). Both of these techniques are linear. PCA applies linear projection to the original image space to achieve dimensionality reduction. LDA applies linear projection from the image space to a low dimensional space by maximizing the between class scatter and minimizing the within class scatter. These methods will be discussed here based on accuracy and percentage of correct recognition.

1 February 2017
Verified
Conference Paper
Closed access
BPBiprodip Pal
Biprodip Pal
MPMahit Kumar Paul
Mahit Kumar Paul
Dataset with imbalanced class distribution used to abate classification performance for most of the standard classifier learning algorithms. Moreover, some application area consists of scarcity of labeled training data where clustering is most prominent way to support classification process. Gaussian Mixture Model (GMM) being able to approximate arbitrary probability distribution, is a dominant tool for classification in such cases by means of clustering. An ensemble approach is presented in this paper considering GMM as a weak learner to boost the GMMs in a semi supervised manner via Adaptive Boosting technique. This paper, firstly investigates how much K-means and GMM suffers from uneven class distribution in data. Later experiment on benchmark imbalanced datasets with different imbalance ratio and over sampled datasets using Synthetic Minority Over-sampling Technique (SMOTE) has been carried out for proposed approach. For each case cluster forest has been used as an attribute selection technique. Efficacy of the proposed Boosted GMM approach compared to standard clustering approaches like K means and GMM is exhibited from empirical analysis.


1 April 2014
Verified
Conference Paper
Closed access
Shah Muhammad HamdiShah Muhammad Hamdi
Shah Muhammad Hamdi
SZSyed Tauhid Zuhori
Syed Tauhid Zuhori
FMFiroz Mahmud
Firoz Mahmud
BPBiprodip Pal
Biprodip Pal
Factoring large integers has been one of the most difficult problems in the history of mathematics and computer science. There was no efficient solution of this problem until Shor's algorithm emerged. Shor's algorithm is a polynomial time factoring algorithm which works on a quantum computer. Quantum computing is a new paradigm of computing that uses quantum mechanical phenomena in solving problems. The computers we are using right now are called classical computer. The most efficient classical factoring algorithm is General Number Field Sieve (GNFS). GNFS also cannot factor integers in polynomial time. In this paper, we compared these two algorithms in factoring integer in a standalone system.