Damanpreet Singh

dblp:42/10700 · DBLP profile ↗
← Back
10ranked-venue papers
0as first author
7since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 7 · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Well-formed partitional data clusters using hybrid opposition-based improved particle swarm optimization
Damanpreet Singh
J. Supercomput.2
2024 SubT-MRS Dataset: Pushing SLAM Towards All-weather Environments
abstract
Simultaneous localization and mapping (SLAM) is a fundamental task for numerous applications such as autonomous navigation and exploration. Despite many SLAM datasets have been released, current SLAM solutions still struggle to have sustained and resilient performance. One major issue is the absence of high-quality datasets including diverse all-weather conditions and a reliable metric for assessing robustness. This limitation significantly restricts the scalability and generalizability of SLAM technologies, impacting their development, validation, and deployment. To address this problem, we present SubT-MRS, an ex-tremely challenging real-world dataset designed to push SLAM towards all-weather environments to pursue the most robust SLAM performance. It contains multi-degraded en-vironments including over 30 diverse scenes such as structureless corridors, varying lighting conditions, and perceptual obscurants like smoke and dust; multimodal sensors such as LiDAR, fisheye camera, IMU, and thermal camera; and multiple locomotions like aerial, legged, and wheeled robots. We developed accuracy and robustness evaluation tracks for SLAM and introduced novel robustness metrics. Comprehensive studies are performed, revealing new obser-vations, challenges, and opportunities for future research.
Shibo Zhao, Yuanjun Gao, Damanpreet Singh, Rushan Jiang, Haoxiang Sun, Mansi Sarawata, Yuheng Qiu, Warren Whittaker, Ian Higgins, Yi Du 0001, Shaoshu Su, John Keller, Jay Karhade, Lucas Nogueira, Sourojit Saha, Ji Zhang 0003, Chen Wang 0033, Sebastian A. Scherer
CVPR4
2024 A comprehensive review of clustering techniques in artificial intelligence for knowledge discovery: Taxonomy, challenges, applications and future prospects
Damanpreet Singh
Adv. Eng. Informatics2
2024 Multi-chaotic maps and blockchain based image encryption
abstract
Summary The vast technological developments make data transmission more frequent over networks. So, the data needs to be secured and for that reason, there is a requirement to develop an effective encryption model. This article proposes a novel image encryption model using multi‐chaotic maps and blockchain (MCBE). Chaotic maps have been used in encryption models as chaotic maps have the properties of randomness, and non‐periodicity that get utilized in improving the efficiency of an encryption model. Logistic and tent maps have been employed as multi‐chaotic maps to make the encryption process effective in this work. A logistic map has a simple structure and is easily implementable but has some drawbacks like small keyspace. Keyspace and randomness are enhanced by using a tent map along with a logistic map. The proposed MCBE methodology applies to grayscale or colored images having different file formats and sizes. Initially, in the confusion phase, the permutation of the original image is performed based on a random permutation that changes the original image pixel's position. The encryption model applies multi‐chaotic maps, row‐wise and column‐wise in the diffusion phase to promote the efficiency of the encryption model. Finally, blockchain has been implemented using the SHA‐256 hash function to obtain the encrypted image that enhances the security by increasing the keyspace, to resist brute force attacks. The evaluation performance of the MCBE has been analyzed against various attacks namely statistical attacks, differential attacks, NIST randomness test, noise, and cropping attacks. The evaluated keyspace is which has high key sensitivity with a correlation of encrypted images close to 0. Maximum achieved entropy value of 7.9998, SSIM value between original and encrypted images nearby 0 confirms the dissimilarity. The Number of Pixels Change Rate (NPCR) value of 99.62%, and the value of Unified Average Changed Intensity (UACI) value of 33.54% are within the specified standard range. The calculated correlation coefficient, NPCR, and UACI values have been compared with the existing algorithms, and the results show that the proposed MCBE methodology has better performance than the other state‐of‐the‐art methods. The experimental results indicate that the chaotic ranges generated by multi‐chaotic maps and the SHA‐256 hash function improve the keyspace and security of the encryption model confirming the efficacy of the proposed model MCBE.
Twinkle Kumari, Damanpreet Singh, Birmohan Singh
Concurr. Comput. Pract. Exp.2
2022 Optimal virtual machine scheduling in virtualized cloud environment using VIKOR method
Neha Garg, Damanpreet Singh, Major Singh Goraya
J. Supercomput.2
2021 A comparative analysis of prominently used MCDM methods in cloud environment
Neeraj, Major Singh Goraya, Damanpreet Singh
J. Supercomput.3
2021 Hierarchical clustering and routing protocol to ensure scalability and reliability in large-scale wireless sensor networks
Harmanpreet Singh, Damanpreet Singh
J. Supercomput.2
2020 A survey and taxonomy on energy management schemes in wireless sensor networks
Ranjit Kaur, Damanpreet Singh
J. Syst. Archit.3
2019 Multi-level clustering protocol for load-balanced and scalable clustering in large-scale wireless sensor networks
Harmanpreet Singh, Damanpreet Singh
J. Supercomput.2
2011 Efficient cell segmentation and tracking of developing plant meristem
abstract
Analysis of Confocal Laser Scanning Microscopy (CLSM) images is gaining popularity in developmental biology for understanding growth dynamics. The automated analysis of such images is highly desirable for efficiency and accuracy. The first step in this process is segmentation and tracking leading to computation of cell lineages. In this paper, we present efficient, accurate, and robust segmentation and tracking algorithms for cells and detection of cell divisions in a 4D spatio-temporal image stack of a growing plant meristem. We show how to optimally choose the parameters in the watershed algorithm for high quality segmentation results. This yields high quality tracking results using cell correspondence evaluation functions. We show segmentation and tracking results on Confocal laser scanning microscopy data captured for 72 hours at every 3 hour intervals. Compared to recent results in this area, the proposed algorithms provide significantly longer cell lineages and more comprehensive identification of cell divisions.
Katya Mkrtchyan, Damanpreet Singh, Min Liu 0008, G. Venugopala Reddy, Amit K. Roy-Chowdhury, Meenakshisundaram Gopi
ICIP2