Shailesh D. Kamble
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shailesh D. Kamble has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Sandeep Kakde
Y C College of Engineering, Nagpur, India
5 shared publications - Nileshsingh V. Thakur
Yeshwantrao Chavan College of Engineering
4 shared publications - Dilip Kumar Jang Bahadur Saini
Department of Computer Science and Engineering (Cyber Security), School of Engineering, Dayananda Sagar University, Bangalore, Karnataka, 562112, India
2 shared publications - Latesh Malik
Department of Computer Science and Engineering, Government College of Engineering, Nagpur, Maharashtra, India
2 shared publications - Nilesh U. Sambhe
Yeshwantrao Chavan College of Engineering
2 shared publications - Preeti Bajaj
G. H. Raisoni College of Engineering, Nagpur, India
2 shared publications
Latest Publications
- 30 June 2026
- Published by Springer Nature
- p. 358-370
Structured Retrieval for Sustainable Decision-Making: Enhancing Domain-Specific RAG in Insurance and Legal Context
- 30 June 2026
- Published by Springer Nature
- p. 358-370
Structured Retrieval for Sustainable Decision-Making: Enhancing Domain-Specific RAG in Insurance and Legal Context
- 1 January 2023
- Published by Taru Publications in Journal of Interdisciplinary Mathematics
- Vol. 26 (3) , 341-350
A novel approach of surveillance video indexing and retrieval using object detection and tracking
The problem of searching videos in large databases i.e. multimedia applications is a major challenge. Therefore, video indexing is used to search the location of the particular video in a large database quickly. Quickly locating the video in the large database is the good quality of indexing. Still, there is a scope of improvement in quickly searching a video in a large database in terms of assigning labels to video. In computer vision, real-time object detection and tracking is a gigantic, vibrant yet indecisive and intricate area. You only look once (YOLO) algorithm is used to detect the object and background subtraction is used to track the object. In this paper, video indexing using object detection / tracking can be performed on single object in a video. In future, video indexing can be performed on multiple objects in a video.
- 1 January 2023
- Published by Taru Publications in Journal of Interdisciplinary Mathematics
- Vol. 26 (3) , 341-350
A novel approach of surveillance video indexing and retrieval using object detection and tracking
The problem of searching videos in large databases i.e. multimedia applications is a major challenge. Therefore, video indexing is used to search the location of the particular video in a large database quickly. Quickly locating the video in the large database is the good quality of indexing. Still, there is a scope of improvement in quickly searching a video in a large database in terms of assigning labels to video. In computer vision, real-time object detection and tracking is a gigantic, vibrant yet indecisive and intricate area. You only look once (YOLO) algorithm is used to detect the object and background subtraction is used to track the object. In this paper, video indexing using object detection / tracking can be performed on single object in a video. In future, video indexing can be performed on multiple objects in a video.
- Retracted
- 16 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 1-8
Retracted: Face Mask Detection and Recognition System
As today a disease called COVID-19 is causing health crisis and deaths, it became most essential to wear a mask for protecting ourselves from Corona virus. Even in public areas, where is more rush we should wear mask as no virus can spread from person to person if any one of person from public is Corona positive. This paper introduces face mask detection that can be used by the authorities to make mitigation, evaluation, prevention, and action planning against COVID19. So basically in this project we are going to use Python, Keras, OpenCV alongwith MobileNet for this Face Mask Detection System. This includes some steps like data preprocessing, training and testing the model, run and view the accuracy and applying model in the camera. The inputs has provided here are 1000+ images of people with mask and without mask. First the data get processed and then by checking features of each image it will train all the models and the persons with and without mask get separated to two categories: with mask and without mask. If person is wearing mask with 90 or more percent of accuracy, then he will get added to with mask category and person not wearing mask get added to without mask category, so that we can permit with mask person to public areas.
- 16 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 1-8
RetractedRetracted: Face Mask Detection and Recognition System
As today a disease called COVID-19 is causing health crisis and deaths, it became most essential to wear a mask for protecting ourselves from Corona virus. Even in public areas, where is more rush we should wear mask as no virus can spread from person to person if any one of person from public is Corona positive. This paper introduces face mask detection that can be used by the authorities to make mitigation, evaluation, prevention, and action planning against COVID19. So basically in this project we are going to use Python, Keras, OpenCV alongwith MobileNet for this Face Mask Detection System. This includes some steps like data preprocessing, training and testing the model, run and view the accuracy and applying model in the camera. The inputs has provided here are 1000+ images of people with mask and without mask. First the data get processed and then by checking features of each image it will train all the models and the persons with and without mask get separated to two categories: with mask and without mask. If person is wearing mask with 90 or more percent of accuracy, then he will get added to with mask category and person not wearing mask get added to without mask category, so that we can permit with mask person to public areas.
- 19 May 2022
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (4) , 1083-1092
Detection and tracking of moving cloud services from video using saliency map model
In cloud computing, the services are observed in the video stream and clustering their pixels is the initial task in service detection. Tracking is the practice to observe or tracking the moments of a given item in each frame. Numerous false positives are included in the frame. Using the Saliency Map Model and the Extended Kalman Filter, the proposed approach can recognize and track moving objects in video. The item is tracked using an Extended Kalman Filter. In the proposed research the evaluation is based on the delay and accuracy of the evaluation parameter. Finally, the suggested method is compared to existing object tracking methods, with an accuracy of greater than 90% attained.
- 19 May 2022
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (4) , 1083-1092
Detection and tracking of moving cloud services from video using saliency map model
In cloud computing, the services are observed in the video stream and clustering their pixels is the initial task in service detection. Tracking is the practice to observe or tracking the moments of a given item in each frame. Numerous false positives are included in the frame. Using the Saliency Map Model and the Extended Kalman Filter, the proposed approach can recognize and track moving objects in video. The item is tracked using an Extended Kalman Filter. In the proposed research the evaluation is based on the delay and accuracy of the evaluation parameter. Finally, the suggested method is compared to existing object tracking methods, with an accuracy of greater than 90% attained.
- 4 December 2019
- Published by Springer Nature
- p. 463-470
An Overview on Privacy Preservation and Public Auditing on Outsourced Cloud Data
- 4 December 2019
- Published by Springer Nature
- p. 463-470
An Overview on Privacy Preservation and Public Auditing on Outsourced Cloud Data
- 15 December 2018
- Published by Springer Nature in Smart Innovation, Systems and Technologies
- p. 105-114
Review of EEG Signal Classification
- 15 December 2018
- Published by Springer Nature in Smart Innovation, Systems and Technologies
- p. 105-114
Review of EEG Signal Classification
- 1 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Review on Improving Lifetime of Network Using Energy And Density Control Cluster Algorithm
Wireless sensor networks comprise of an expansive number of distributed sensor gadgets, which are associated and composed through multi-hop steering. Because of the presence of related data and excess in measuring data, data messages can be joined and converged by performing data aggregation work in the steering procedure. To diminish energy utilization is a noteworthy enhancement target of data aggregation approaches, which can be accomplished by diminishing the mandatory correspondence load of steering. To improvise the network lifetime as much as possible in Wireless Sensor Networks (WSNs) the ways for data move are picked in a way that the aggregate energy used along the way is limited. To help high adaptability and better data aggregation, sensor nodes are routinely collected into disjoint, non-covering subsets called clusters. Clusters make various leveled WSNs which consolidate proficient use of constrained assets of sensor nodes and in this manner broadens network lifetime. The objective of this paper is to demonstrate a forefront survey on clustering calculations announced in the writing of WSNs. This paper presents different energy effective clustering calculations in WSNs. From the hypothetical level, an energy show is proposed to approve the advantages of data aggregation on energy utilization. The key parameters which may affect the aggregation execution are additionally examined.
- 1 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Review on Improving Lifetime of Network Using Energy And Density Control Cluster Algorithm
Wireless sensor networks comprise of an expansive number of distributed sensor gadgets, which are associated and composed through multi-hop steering. Because of the presence of related data and excess in measuring data, data messages can be joined and converged by performing data aggregation work in the steering procedure. To diminish energy utilization is a noteworthy enhancement target of data aggregation approaches, which can be accomplished by diminishing the mandatory correspondence load of steering. To improvise the network lifetime as much as possible in Wireless Sensor Networks (WSNs) the ways for data move are picked in a way that the aggregate energy used along the way is limited. To help high adaptability and better data aggregation, sensor nodes are routinely collected into disjoint, non-covering subsets called clusters. Clusters make various leveled WSNs which consolidate proficient use of constrained assets of sensor nodes and in this manner broadens network lifetime. The objective of this paper is to demonstrate a forefront survey on clustering calculations announced in the writing of WSNs. This paper presents different energy effective clustering calculations in WSNs. From the hypothetical level, an energy show is proposed to approve the advantages of data aggregation on energy utilization. The key parameters which may affect the aggregation execution are additionally examined.
- 1 January 2018
- Published by IGI Global Scientific Publishing in International Journal of Ambient Computing and Intelligence
- Vol. 9 (1) , 115-133
Fractal Coding Based Video Compression Using Weighted Finite Automata
Main objective of the proposed work is to develop an approach for video coding based on Fractal coding using the weighted finite automata (WFA). The proposed work only focuses on reducing the encoding time as this is the basic limitation why the Fractal coding not becomes the practical reality. WFA is used for the coding as it behaves like the Fractal Coding (FC). WFA represents an image based on the idea of fractal that the image has self-similarity in itself. The plane WFA (applied on every frame), and Plane FC (applied on every frame) coding approaches are compared with each other. The experimentations are carried out on the standard uncompressed video databases, namely, Traffic, Paris, Bus, Akiyo, Mobile, Suzie etc. and on the recorded video, namely, Geometry and Circle. Developed approaches are compared on the basis of performance evaluation parameters, namely, encoding time, decoding time, compression ratio, compression percentage, bits per pixel and Peak Signal to Noise Ratio (PSNR). Though the initial number of states is 256 for every frame of all the types of videos, but we got the different number of states for different frames and it is quite obvious due to minimality of constructed WFA for respective frame. Based on the obtained results, it is observed that the number of states is more in videos namely, Traffic, Bus, Paris, Mobile, and Akiyo, therefore the reconstructed video quality is good in comparison with other videos namely, Circle, Suzie, and Geometry.
- 1 January 2018
- Published by IGI Global Scientific Publishing in International Journal of Ambient Computing and Intelligence
- Vol. 9 (1) , 115-133
Fractal Coding Based Video Compression Using Weighted Finite Automata
Main objective of the proposed work is to develop an approach for video coding based on Fractal coding using the weighted finite automata (WFA). The proposed work only focuses on reducing the encoding time as this is the basic limitation why the Fractal coding not becomes the practical reality. WFA is used for the coding as it behaves like the Fractal Coding (FC). WFA represents an image based on the idea of fractal that the image has self-similarity in itself. The plane WFA (applied on every frame), and Plane FC (applied on every frame) coding approaches are compared with each other. The experimentations are carried out on the standard uncompressed video databases, namely, Traffic, Paris, Bus, Akiyo, Mobile, Suzie etc. and on the recorded video, namely, Geometry and Circle. Developed approaches are compared on the basis of performance evaluation parameters, namely, encoding time, decoding time, compression ratio, compression percentage, bits per pixel and Peak Signal to Noise Ratio (PSNR). Though the initial number of states is 256 for every frame of all the types of videos, but we got the different number of states for different frames and it is quite obvious due to minimality of constructed WFA for respective frame. Based on the obtained results, it is observed that the number of states is more in videos namely, Traffic, Bus, Paris, Mobile, and Akiyo, therefore the reconstructed video quality is good in comparison with other videos namely, Circle, Suzie, and Geometry.
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 0467-0471
Design and implementation of low power test pattern generator using low transitions LFSR
The testing of VLSI circuits entitles many challenges in term of area overhead, power and latency. The Low transition test pattern generation is a very crucial technique for testing of a complex architecture of VLSI design. In this paper, 32-bit test pattern generator has been proposed for testing the VLSI design. This 32-bit test pattern generator is implemented with efficient LFSR and with extra combinational circuitry which achieved Low power consumption. This paper is implemented using Xilinx 13.1 ISE design suite in Verilog HDL. The switching activity between the tests vector are reduced, this results in low power consumption. The design of test pattern generation which yield a power of 23 mW with a latency of 5.194ns. The switching activity required for 32-bit test pattern generation has been improved and presented in this paper. The experimental result shows that the total power in low transition linear feedback shift register is 50.06% less than the conventional LFSR.
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 0467-0471
Design and implementation of low power test pattern generator using low transitions LFSR
The testing of VLSI circuits entitles many challenges in term of area overhead, power and latency. The Low transition test pattern generation is a very crucial technique for testing of a complex architecture of VLSI design. In this paper, 32-bit test pattern generator has been proposed for testing the VLSI design. This 32-bit test pattern generator is implemented with efficient LFSR and with extra combinational circuitry which achieved Low power consumption. This paper is implemented using Xilinx 13.1 ISE design suite in Verilog HDL. The switching activity between the tests vector are reduced, this results in low power consumption. The design of test pattern generation which yield a power of 23 mW with a latency of 5.194ns. The switching activity required for 32-bit test pattern generation has been improved and presented in this paper. The experimental result shows that the total power in low transition linear feedback shift register is 50.06% less than the conventional LFSR.
- 6 February 2016
- Published by Springer Nature
- p. 559-567
High Performance DFT Architectures Using Winograd Fast Fourier Transform Algorithm
- 6 February 2016
- Published by Springer Nature
- p. 559-567
High Performance DFT Architectures Using Winograd Fast Fourier Transform Algorithm