Soulib Ghosh

Mr. Soulib Ghosh


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
19 April 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Soumyajit SahaSoumyajit Saha
Soumyajit Saha
MGManosij Ghosh
Manosij Ghosh
SGSoulib Ghosh
Soulib Ghosh
SSShibaprasad Sen
Shibaprasad Sen
PSPawan Kumar Singh
Pawan Kumar Singh
RSRam Sarkar
Ram Sarkar
Nowadays, researchers aim to enhance man-to-machine interactions by making advancements in several domains. Facial emotion recognition (FER) is one such domain in which researchers have made significant progresses. Features for FER can be extracted using several popular methods. However, there may be some redundant/irrelevant features in feature sets. In order to remove those redundant/irrelevant features that do not have any significant impact on classification process, we propose a feature selection (FS) technique called the supervised filter harmony search algorithm (SFHSA) based on cosine similarity and minimal-redundancy maximal-relevance (mRMR). Cosine similarity aims to remove similar features from feature vectors, whereas mRMR was used to determine the feasibility of the optimal feature subsets using Pearson’s correlation coefficient (PCC), which favors the features that have lower correlation values with other features—as well as higher correlation values with the facial expression classes. The algorithm was evaluated on two benchmark FER datasets, namely the Radboud faces database (RaFD) and the Japanese female facial expression (JAFFE). Five different state-of-the-art feature descriptors including uniform local binary pattern (uLBP), horizontal–vertical neighborhood local binary pattern (hvnLBP), Gabor filters, histogram of oriented gradients (HOG) and pyramidal HOG (PHOG) were considered for FS. Obtained results signify that our technique effectively optimized the feature vectors and made notable improvements in overall classification accuracy.

30 October 2020 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
SBSuman Kumar Bera
Suman Kumar Bera
SGSoulib Ghosh
Soulib Ghosh
SBShowmik Bhowmik
Showmik Bhowmik
RSRam Sarkar
Ram Sarkar
MNMita Nasipuri
Mita Nasipuri

4 August 2020 in The Visual Computer
Verified
Journal Article
Closed access
PDF file
SGSoulib Ghosh
Soulib Ghosh
ACAgneet Chatterjee
Agneet Chatterjee
PSPawan Kumar Singh
Pawan Kumar Singh
SBShowmik Bhowmik
Showmik Bhowmik
RSRam Sarkar
Ram Sarkar

1 December 2017
Verified
Conference Paper
Closed access
PJPrithwish Jana
Prithwish Jana
SGSoulib Ghosh
Soulib Ghosh
SBSuman Kumar Bera
Suman Kumar Bera
RSRam Sarkar
Ram Sarkar
Degraded historical document images face many challenges in the process of optical character recognizing or word spotting, even after applying the traditional binarization techniques. In this paper, we propose a K-means based clustering technique for adaptive binarization of degraded document images. For validation of test results, we have used the recent dataset of Handwritten counterpart of Document Image Binarization Contest (H-DIBCO'16) comprising of highly degraded handwritten document images and computed detailed results of each image. In order to corroborate verification and validation, the experimental results are compared with three top winning ones in the contest and other prominent techniques in the literature. Experimental results reveal outstanding performance in the four evaluation measures compared with the top winners of the competition, claiming its effectiveness and validity conformance.

3 November 2021 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
BRBiswarup Ray
Biswarup Ray
SGSoulib Ghosh
Soulib Ghosh
SAShameem Ahmed
Shameem Ahmed
RSRam Sarkar
Ram Sarkar
MNMita Nasipuri
Mita Nasipuri