Bio: Shouvik Chakraborty is an academic researcher from Kalyani Government Engineering College. The author has contributed to research in topics: Encryption & Image segmentation. The author has an hindex of 17, co-authored 51 publications receiving 720 citations.
TL;DR: A novel method for cell segmentation and identification has been proposed that incorporated marking cells in cuckoo search (CS) algorithm and experimental results established that the Kapur's entropy segmentation method based on the modified CS required the least computational time.
Abstract: Microscopic image analysis is one of the challenging tasks due to the presence of weak correlation and different segments of interest that may lead to ambiguity It is also valuable in foremost meadows of technology and medicine Identification and counting of cells play a vital role in features extraction to diagnose particular diseases precisely Different segments should be identified accurately in order to identify and to count cells in a microscope image Consequently, in the current work, a novel method for cell segmentation and identification has been proposed that incorporated marking cells Thus, a novel method based on cuckoo search after pre-processing step is employed The method is developed and evaluated on light microscope images of rats' hippocampus which used as a sample for the brain cells The proposed method can be applied on the color images directly The proposed approach incorporates the McCulloch's method for levy flight production in cuckoo search (CS) algorithm Several objective functions, namely Otsu's method, Kapur entropy and Tsallis entropy are used for segmentation In the cuckoo search process, the Otsu's between class variance, Kapur's entropy and Tsallis entropy are employed as the objective functions to be optimized Experimental results are validated by different metrics, namely the peak signal to noise ratio (PSNR), mean square error, feature similarity index and CPU running time for all the test cases The experimental results established that the Kapur's entropy segmentation method based on the modified CS required the least computational time compared to Otsu's between-class variance segmentation method and the Tsallis entropy segmentation method Nevertheless, Tsallis entropy method with optimized multi-threshold levels achieved superior performance compared to the other two segmentation methods in terms of the PSNR
01 Jan 2018
TL;DR: DNA algorithm based substitution is used for spatial domain bit permutation for generating a pseudorandom bit sequence and a final layer of security is imposed to make this process more fault tolerant.
Abstract: Presently, there is a growth in the transmission of image and video data. Security becomes a main issue. Very strong image cryptographic techniques are a solution to this problem. There is a use of a randomly generated public key and based on that there is an application of DNA algorithm. In the proposed method DNA algorithm based substitution is used for spatial domain bit permutation. Here the chaotic logistic map is used for generating a pseudorandom bit sequence. We have generated 48bit length sequences for every pixel. After the substitution operation, a final layer of security is imposed to make this process more fault tolerant. The For checking the strength of the work a series of tests are performed and various parameters are checked like Correlation Coefficient Analysis, analysis of NPCR and UACI values etc.
TL;DR: A novel method is proposed in this work to segment the Radiological images for the better explication of the COVID-19 radiological images, known as SuFMoFPA (Superpixel based Fuzzy Modified Flower Pollination Algorithm).
Abstract: Coronavirus disease 2019 or COVID-19 is one of the biggest challenges which are being faced by mankind. Researchers are continuously trying to discover a vaccine or medicine for this highly infectious disease but, proper success is not achieved to date. Many countries are suffering from this disease and trying to find some solution that can prevent the dramatic spread of this virus. Although the mortality rate is not very high, the highly infectious nature of this virus makes it a global threat. RT-PCR test is the only means to confirm the presence of this virus to date. Only precautionary measures like early screening, frequent hand wash, social distancing use of masks, and other protective equipment can prevent us from this virus. Some researches show that the radiological images can be quite helpful for the early screening purpose because some features of the radiological images indicate the presence of the COVID-19 virus and therefore, it can serve as an effective screening tool. Automated analysis of these radiological images can help the physicians and other domain experts to study and screen the suspected patients easily and reliably within the stipulated amount of time. This method may not replace the traditional RT-PCR method for detection but, it can be helpful to filter the suspected patients from the rest of the community that can effectively reduce the spread in the of this virus. A novel method is proposed in this work to segment the radiological images for the better explication of the COVID-19 radiological images. The proposed method will be known as SuFMoFPA (Superpixel based Fuzzy Modified Flower Pollination Algorithm). The type 2 fuzzy clustering system is blended with this proposed approach to get the better-segmented outcome. Obtained results are quite promising and outperforming some of the standard approaches which are encouraging for the practical uses of the proposed approach to screening the COVID-19 patients.
••01 Jan 2015
TL;DR: In this article, the authors presented an algorithm based on simulated annealing method to solve the job shop scheduling problem, which is an approximation algorithm for finding the minimum makespan in a job shop.
Abstract: The Job Shop Scheduling Problem (known as JSSP) is a wellknown and one of the difficult combinatorial optimization problems and treated as a member of NP-complete problem class. This paper presents an algorithm based on Simulated Annealing method to solve the Job Shop Scheduling problem. It is an approximation algorithm for finding the minimum makespan in a job shop. The proposed algorithm is based on Roulette wheel selection and simulated annealing, a generalization of the well known and effective iterative improvement approach for combinatorial optimization problems. The generalization involves the acceptance of cost-increasing transitions with a nonzero probability to avoid getting stuck in local minima. The problem studied in this research focuses on the sequencing of operations and allocation of operation to the machine under some sequence constraint.
01 Jan 2017
TL;DR: A novel intelligent multiple watermarking techniques are proposed that has reduced the amount of data to be embedded and consequently improved perceptual quality of the watermarked image.
Abstract: Most of the past document image watermarking schemes focus on providing same level of integrity and copyright protection for information present in the source document image. However, in a document image the information contents possess various levels of sensitivity. Each level of sensitivity needs different type of protection and this demands multiple watermarking techniques. In this paper, a novel intelligent multiple watermarking techniques are proposed. The sensitivity of the information content of a block is based on the homogeneity and relative energy contribution parameters. Appropriate watermarking scheme is applied based on sensitivity classification of the block. Experiments are conducted exhaustively on documents. Experimental results reveal the accurate identification of the sensitivity of information content in the block. The results reveal that multiple watermarking schemes has reduced the amount of data to be embedded and consequently improved perceptual quality of the watermarked image.
TL;DR: In this article , a comprehensive survey based on artificial intelligence techniques to diagnose numerous diseases such as Alzheimer, cancer, diabetes, chronic heart disease, tuberculosis, stroke and cerebrovascular, hypertension, skin, and liver disease is presented.
Abstract: Artificial intelligence can assist providers in a variety of patient care and intelligent health systems. Artificial intelligence techniques ranging from machine learning to deep learning are prevalent in healthcare for disease diagnosis, drug discovery, and patient risk identification. Numerous medical data sources are required to perfectly diagnose diseases using artificial intelligence techniques, such as ultrasound, magnetic resonance imaging, mammography, genomics, computed tomography scan, etc. Furthermore, artificial intelligence primarily enhanced the infirmary experience and sped up preparing patients to continue their rehabilitation at home. This article covers the comprehensive survey based on artificial intelligence techniques to diagnose numerous diseases such as Alzheimer, cancer, diabetes, chronic heart disease, tuberculosis, stroke and cerebrovascular, hypertension, skin, and liver disease. We conducted an extensive survey including the used medical imaging dataset and their feature extraction and classification process for predictions. Preferred reporting items for systematic reviews and Meta-Analysis guidelines are used to select the articles published up to October 2020 on the Web of Science, Scopus, Google Scholar, PubMed, Excerpta Medical Database, and Psychology Information for early prediction of distinct kinds of diseases using artificial intelligence-based techniques. Based on the study of different articles on disease diagnosis, the results are also compared using various quality parameters such as prediction rate, accuracy, sensitivity, specificity, the area under curve precision, recall, and F1-score.
TL;DR: This paper proposes a semi-automated tool to investigate the medical MRI captured with contrast improved T1 modality (T1C), which considers the integration of Bat algorithm and Tsallis based thresholding along with region growing (RG) segmentation.
Abstract: In medical domain, diseases in critical internal organs are generally inspected using invasive/non-invasive imaging techniques. Magnetic resonance imaging (MRI) is one of the commonly considered imaging approaches to confirm the abnormality in various internal organs. After recording the MRI, an appropriate image processing exercise is to be implemented to investigate and infer the severity of the disease and its location. This paper proposes a semi-automated tool to investigate the medical MRI captured with contrast improved T1 modality (T1C). This technique considers the integration of Bat algorithm (BA) and Tsallis based thresholding along with region growing (RG) segmentation. Proposed approach is tested on RGB/gray scale images of brain and breast MRI recorded along with a contrast agent. After mining the infected region, its texture features are extracted with Haralick function to assess the surface details of abnormal section. Performance of RG is confirmed against other segmentation methods, such as level set (LS), principal component analysis (PCA) and watershed. The clinical significance of the proposed technique is also validated using the brain images of BRATS recorded using T1C modality. The experiment outcome confirms that, the implemented procedure provides better values of Jaccard (87.41%), Dice (90.36%), sensitivity (98.27%), specificity (97.72%), accuracy (97.53%) and precision (95.85%) for the considered BRATS brain MRI.
TL;DR: In this article, the authors combined the decision-making trial and evaluation laboratory (DEMATEL) method with intuitionistic fuzzy sets (IFS) to explore the key challenges of the COVID-19 vaccine supply chain.
TL;DR: This article describes how howSequences areﻷ attributedﻴtemporal�characteristicsﻵeitherﻰ�explicitlyﻡ�orﻢimplicitly Â£2.5m Cybersecurity.
Abstract: This article describes how sequential data modeling is a relevant task in Cybersecurity. Sequences are attributed temporal characteristics either explicitly or implicitly. Recurrent neural networks (RNNs) are a subset of artificial neural networks (ANNs) which have appeared as a powerful, principle approach to learn dynamic temporal behaviors in an arbitrary length of large-scale sequence data. Furthermore, stacked recurrent neural networks (S-RNNs) have the potential to learn complex temporal behaviors quickly, including sparse representations. To leverage this, the authors model network traffic as a time series, particularly transmission control protocol / internet protocol (TCP/IP) packets in a predefined time range with a supervised learning method, using millions of known good and bad network connections. To find out the best architecture, the authors complete a comprehensive review of various RNN architectures with its network parameters and network structures. Ideally, as a test bed, they use the existing benchmark Defense Advanced Research Projects Agency / Knowledge Discovery and Data Mining (DARPA) / (KDD) Cup ‘99’ intrusion detection (ID) contest data set to show the efficacy of these various RNN architectures. All the experiments of deep learning architectures are run up to 1000 epochs with a learning rate in the range [0.01-0.5] on a GPU-enabled TensorFlow and experiments of traditional machine learning algorithms are done using Scikit-learn. Experiments of families of RNN architecture achieved a low false positive rate in comparison to the traditional machine learning classifiers. The primary reason is that RNN architectures are able to store information for long-term dependencies over time-lags and to adjust with successive connection sequence information. In addition, the effectiveness of RNN architectures are shown for the UNSW-NB15 data set. KEywoRDS Deep Learning (DL) Approaches, Gated Recurrent Unit (GRU), Intrusion Detection (ID) Data Sets, KDDCup ’99’, Long Short-Term Memory (LSTM), Machine Learning (ML), Recurrent Neural Network (RNN), UNSW-NB15