D
Debayan Ganguly
Researcher at Government College of Engineering and Leather Technology
Publications - 25
Citations - 83
Debayan Ganguly is an academic researcher from Government College of Engineering and Leather Technology. The author has contributed to research in topics: Quantum finite automata & Deterministic finite automaton. The author has an hindex of 5, co-authored 22 publications receiving 57 citations. Previous affiliations of Debayan Ganguly include Indian Statistical Institute & Government College of Engineering and Ceramic Technology.
Papers
More filters
Book ChapterDOI
Bengali Handwritten Character Classification Using Transfer Learning on Deep Convolutional Network
TL;DR: A modified state-of-the-art deep learning to tackle the problem of Bengali handwritten character recognition using Resnet-50 deep convolutional neural network model and shows the effectiveness of ResNet-50 for classification of Bangla HCR.
Journal ArticleDOI
State complexity of deterministic Watson---Crick automata and time varying Watson---Crick automata
TL;DR: This paper analyzes the state complexity of deterministic Watson–Crick automata with respect to non-deterministic block automata and non-Deterministic finite Automata and introduces new finite automata combining the properties of Watson-CrickAutomata and time varying automata.
Posted Content
Bengali Handwritten Character Classification using Transfer Learning on Deep Convolutional Neural Network
TL;DR: This paper uses Transfer Learning on ResNet 50, a state-of-the-art deep Convolutional Neural Network Model, pretrained on ImageNet dataset to tackle the problem of Bengali Handwritten Character Recognition.
Journal ArticleDOI
MTSE U-Net: an architecture for segmentation, and prediction of fetal brain and gestational age from MRI of brain
Tuhinangshu Gangopadhyay,Shinjini Halder,Paramik Dasgupta,Kingshuk Chatterjee,Debayan Ganguly,Surjadeep Sarkar,Sudipta Roy +6 more
Journal ArticleDOI
1-Way Multihead Quantum Finite State Automata
TL;DR: It is shown that newly introduced 1-way 2-head quantum finite state automaton (1QFA(2)) structure can accept all unary regular languages.