Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
4 results
Search Results
Item Deep structured residual encoder-decoder network with a novel loss function for nuclei segmentation of kidney and breast histopathology images(Springer, 2022) Chanchal, A.K.; Lal, S.; Kini, J.To improve the process of diagnosis and treatment of cancer disease, automatic segmentation of haematoxylin and eosin (H & E) stained cell nuclei from histopathology images is the first step in digital pathology. The proposed deep structured residual encoder-decoder network (DSREDN) focuses on two aspects: first, it effectively utilized residual connections throughout the network and provides a wide and deep encoder-decoder path, which results to capture relevant context and more localized features. Second, vanished boundary of detected nuclei is addressed by proposing an efficient loss function that better train our proposed model and reduces the false prediction which is undesirable especially in healthcare applications. The proposed architecture experimented on three different publicly available H&E stained histopathological datasets namely: (I) Kidney (RCC) (II) Triple Negative Breast Cancer (TNBC) (III) MoNuSeg-2018. We have considered F1-score, Aggregated Jaccard Index (AJI), the total number of parameters, and FLOPs (Floating point operations), which are mostly preferred performance measure metrics for comparison of nuclei segmentation. The evaluated score of nuclei segmentation indicated that the proposed architecture achieved a considerable margin over five state-of-the-art deep learning models on three different histopathology datasets. Visual segmentation results show that the proposed DSREDN model accurately segment the nuclear regions than those of the state-of-the-art methods. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.Item Channel Pruning of Transfer Learning Models Using Novel Techniques(Institute of Electrical and Electronics Engineers Inc., 2024) Pragnesh, P.; Mohan, B.R.This research paper delves into the challenges associated with deep learning models, specifically focusing on transfer learning. Despite the effectiveness of widely used models such as VGGNet, ResNet, and GoogLeNet, their deployment on resource-constrained devices is impeded by high memory bandwidth and computational costs, and to overcome these limitations, the study proposes pruning as a viable solution. Numerous parameters, particularly in fully connected layers, contribute minimally to computational costs, so we focus on convolution layers' pruning. The research explores and evaluates three innovative pruning methods: the Max3 Saliency pruning method, the K-Means clustering algorithm, and the Singular Value Decomposition (SVD) approach. The Max3 Saliency pruning method introduces a slight variation by using the three maximum values of the kernel instead of all nine to compute the saliency score. This method is the most effective, substantially reducing parameter and Floating Point Operations (FLOPs) for both VGG16 and ResNet56 models. Notably, VGG16 demonstrates a remarkable 46.19% reduction in parameters and a 61.91% reduction in FLOPs. Using the Max3 Saliency pruning method, ResNet56 shows a 35.15% reduction in parameters and FLOPs. The K-Means pruning algorithm is also successful, resulting in a 40.00% reduction in parameters for VGG16 and a 49.20% reduction in FLOPs. In the case of ResNet56, the K-Means algorithm achieved a 31.01% reduction in both parameters and FLOPs. While the Singular Value Decomposition (SVD) approach provides a new set of values for condensed channels, its overall pruning ratio is smaller than the Max3 Saliency and K-Means methods. The SVD pruning method prunes 20.07% parameter reduction and a 24.64% reduction in FLOPs achieved for VGG16, along with a 16.94% reduction in both FLOPs and parameters for ResNet56. Compared with the state-of-the-art methods, the Max3 Saliency and K-Means pruning methods performed better in Flops reduction metrics. © 2024 The Authors.Item Classification and grade prediction of kidney cancer histological images using deep learning(Springer, 2024) Chanchal, A.K.; N, S.; Lal, S.; Kumar, S.; Saxena, P.U.P.Renal Cell Carcinoma (RCC) is the most common malignant tumor (85%) of kidney cancer and has a complex histological pattern and nuclear structure. The manual diagnosis of kidney cancer or any other cancer from histopathology image depends on the knowledge and experience of pathologists, and the pathologist’s experience influences the results. According to studies, the kind of histology in kidney cancer is related to the prognosis and course of treatment. Since the kind of histology, molecular profile, and stage of the disease all affect how the disease is treated, there is an essential need to develop an automated system that can precisely analyze the histopathological images of the disease. This work demonstrates how a deep learning framework can be used to predict and classify associated grades of RCC from provided haematoxylin and eosin (H &E) images. The proposed model focuses on two important tasks- First to capture and extract associated features from the H &E images of five different grades. Second, to classify the new set of unseen H &E images into five separate grades using the obtained features. The proposed architecture has been tested and experimented on two independent datasets containing H &E stained histopathology images. The proposed architecture has been examined using the following performance metrics namely precision, recall, F1 - score, accuracy, Floating-point operations (FLOPs), and the total number of parameters. The obtained results show that the proposed architecture attains better results over seven state-of-the-art deep learning architectures on two different H &E stained histopathology image datasets. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.Item TReB: Task dependency aware-Resource allocation for Internet of Things using Binary offloading(Elsevier B.V., 2025) Soni, P.; Hajare, A.G.; Keerthan Kumar, K.K.; Addya, S.K.The rapid growth of Internet of Things (IoT) applications in domains such as healthcare, smart homes, and autonomous vehicles has led to an exponential increase in data generated by compute intensive tasks. Efficiently offloading these tasks to nearby computational resources in fog environments remains a significant challenge due to the inherent heterogeneity and constrained resources of Fog Nodes (FNs). Most of the existing approaches fail to address the trade-offs between latency, energy, and resource utilization, particularly when managing dependent and independent task workloads. Moreover, establishing an offloading strategy within a densely interconnected IoT network is known to be NP-hard. To overcome these limitations, in this work, we propose a Task dependency-Aware Resource allocation for IoT using Binary offloading (TReB) framework by considering both independent and dependent tasks of IoT applications. The TReB utilizes the Analytic Hierarchy Process (AHP) technique to generate the preferences of FNs and tasks by considering diverse attributes. With preferences established, a binary offloading is handled through a one-to-many matching procedure, utilizing a Deferred Acceptance Algorithm (DAA). It allows TReB to jointly minimize system energy consumption, latency, and the number of outages in an IoT network. We evaluated the effectiveness of TReB through simulation experiments, and results show that the proposed approach achieves a 49.1%, 62.4%, and 41.7% minimization in overall system latency, energy, and outages compared to the existing baselines. © 2025 Elsevier B.V.