Parag S. Deshpande
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Parag S. Deshpande has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Meera M. Dhabu
Visvesvaraya National Institute of Technology
4 shared publications - Narasimha Reddy Soora
Computer Science and Engineering, Visvesvaraya National Institute of Technology, Nagpur, India
2 shared publications - Anita Bai
Department of Computer Science and Engineering, Koneru Lakshmaiah Education Foundation, Deemed to be University, Hyderabad, India
1 shared publication - Ankush D. Sawarkar
Shri Guru Gobind Singhji Institute of Engineering and Technology (SGGSIE&T)
1 shared publication - Anup Kelkar1 shared publication
- Anurag Agrahari
Department of Computer Science and Engineering, Visvesvaraya National Institute of Technology (VNIT), Nagpur, India
1 shared publication
Latest Publications
- Open Access
- 6 May 2026
- Published by Elsevier in SSRN Electronic Journal
Enhancing Camera-Captured Devanagari Documents via Geometric Filtering for Improved Vision-Language Model Text Extraction
Despite significant advances, modern Vision-Language Model (VLM) platforms remain constrained by the scarcity of training data in non-English languages, limiting their global applicability in Text extraction for regional languages written in Devanagari scripts. Recognizing Devanagari text, particularly in literary materials, poses significant challenges in achieving high accuracy and efficient execution. Effective Text extraction in current VLM platforms must perform several pre-processing steps to retain crucial information while preserving sentence structure and meaning. This study proposes an image enhancement method for Devanagari text based on geometric filters and clustering algorithms.By leveraging the unique geometrical characteristics of Devanagari characters, the technique accurately detects Devanagari sentences in various font sizes, orientations, and degraded hand-held camera-captured images. It is robust to variations in document rotation, size, and color.The method was tested on a dataset of images from books, papers, brochures, and pamphlets, demonstrating superior performance over existing OCR pre-processing techniques for current VLM platforms. The proposed approach achieved a success rate of 95.23% in locating Devanagari sentences, improving the accuracy of current VLM platforms Text extraction.
- 6 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessEnhancing Camera-Captured Devanagari Documents via Geometric Filtering for Improved Vision-Language Model Text Extraction
Despite significant advances, modern Vision-Language Model (VLM) platforms remain constrained by the scarcity of training data in non-English languages, limiting their global applicability in Text extraction for regional languages written in Devanagari scripts. Recognizing Devanagari text, particularly in literary materials, poses significant challenges in achieving high accuracy and efficient execution. Effective Text extraction in current VLM platforms must perform several pre-processing steps to retain crucial information while preserving sentence structure and meaning. This study proposes an image enhancement method for Devanagari text based on geometric filters and clustering algorithms.By leveraging the unique geometrical characteristics of Devanagari characters, the technique accurately detects Devanagari sentences in various font sizes, orientations, and degraded hand-held camera-captured images. It is robust to variations in document rotation, size, and color.The method was tested on a dataset of images from books, papers, brochures, and pamphlets, demonstrating superior performance over existing OCR pre-processing techniques for current VLM platforms. The proposed approach achieved a success rate of 95.23% in locating Devanagari sentences, improving the accuracy of current VLM platforms Text extraction.
- Top Cited PapersOpen Access
- 30 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (19) , 3875
Artificial Intelligence-Based Adaptive Traffic Signal Control System: A Comprehensive Review
The exponential increase in vehicles, quick urbanization, and rising demand for transportation are straining the world’s road infrastructure today. To have a sustainable transportation system with dynamic traffic volume, an Adaptive Traffic Signal Control system (ATSC) should be contemplated to reduce urban traffic congestion and, thus, help reduce the carbon footprints/emissions of greenhouse gases. With dynamic cleave, the ATSC system can adapt the signal timing settings in real-time according to seasonal and short-term variations in traffic demand, enhancing the effectiveness of traffic operations on urban road networks. This paper provides a comprehensive study on the insights, technical lineaments, and status of various research work in ATSC. In this paper, the ATSC is categorized based on several road intersections (RIs), viz., single-intersection (SI) and multiple-intersection (MI) techniques, viz., Fuzzy Logic (FL), Metaheuristic (MH), Dynamic Programming (DP), Reinforcement Learning (RL), Deep Reinforcement Learning (DRL), and hybrids used for developing Traffic Signal Control (TSC) systems. The findings from this review demonstrate that modern ATSC systems designed using various techniques offer substantial improvements in managing the dynamic density of the traffic flow. There is still a lot of scope to research by increasing the number of RIs while designing the ATSC system to suit real-life applications.
- 30 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (19) , 3875
Top Cited PapersOpen AccessArtificial Intelligence-Based Adaptive Traffic Signal Control System: A Comprehensive Review
The exponential increase in vehicles, quick urbanization, and rising demand for transportation are straining the world’s road infrastructure today. To have a sustainable transportation system with dynamic traffic volume, an Adaptive Traffic Signal Control system (ATSC) should be contemplated to reduce urban traffic congestion and, thus, help reduce the carbon footprints/emissions of greenhouse gases. With dynamic cleave, the ATSC system can adapt the signal timing settings in real-time according to seasonal and short-term variations in traffic demand, enhancing the effectiveness of traffic operations on urban road networks. This paper provides a comprehensive study on the insights, technical lineaments, and status of various research work in ATSC. In this paper, the ATSC is categorized based on several road intersections (RIs), viz., single-intersection (SI) and multiple-intersection (MI) techniques, viz., Fuzzy Logic (FL), Metaheuristic (MH), Dynamic Programming (DP), Reinforcement Learning (RL), Deep Reinforcement Learning (DRL), and hybrids used for developing Traffic Signal Control (TSC) systems. The findings from this review demonstrate that modern ATSC systems designed using various techniques offer substantial improvements in managing the dynamic density of the traffic flow. There is still a lot of scope to research by increasing the number of RIs while designing the ATSC system to suit real-life applications.
- 21 February 2022
- Published by Taylor & Francis in IETE Journal of Research
- Vol. 69 (11) , 1-13
License Plate Characters Recognition Using Color, Scale, and Rotation Independent Features
This paper proposes a color, scale, and rotation independent approach for recognizing License Plate (LP) characters written in English. We extract features based on geometrical properties of an LP character, like the number of perimeters, perimeter angles, different characteristics points on the perimeter, etc. These features are next used to generate a characteristic encoding of the character. The generated encoding based on color, scale, and rotation independent geometrical properties is then used to identify an LP character independent of its color, scale, and rotational angle. We have evaluated our proposed approach using images from the publicly available Media Lab LP dataset, and a recognition rate of 98.29% was obtained. The processing time for an input image of size pixel was found to be 0.3 ms. The recognition rate and low processing time compare favorably with results published in the literature by other LP characters recognition techniques. Further, unlike other published techniques, our approach places no restriction on the size, color, or the number of characters in LP, nor is our method restricted to any particular LP design or the LP of any specific country or region.- 21 February 2022
- Published by Taylor & Francis in IETE Journal of Research
- Vol. 69 (11) , 1-13
License Plate Characters Recognition Using Color, Scale, and Rotation Independent Features
This paper proposes a color, scale, and rotation independent approach for recognizing License Plate (LP) characters written in English. We extract features based on geometrical properties of an LP character, like the number of perimeters, perimeter angles, different characteristics points on the perimeter, etc. These features are next used to generate a characteristic encoding of the character. The generated encoding based on color, scale, and rotation independent geometrical properties is then used to identify an LP character independent of its color, scale, and rotational angle. We have evaluated our proposed approach using images from the publicly available Media Lab LP dataset, and a recognition rate of 98.29% was obtained. The processing time for an input image of size pixel was found to be 0.3 ms. The recognition rate and low processing time compare favorably with results published in the literature by other LP characters recognition techniques. Further, unlike other published techniques, our approach places no restriction on the size, color, or the number of characters in LP, nor is our method restricted to any particular LP design or the LP of any specific country or region.- 6 February 2020
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 11 (11) , 4765-4783
CLOES: cross-layer optimal energy scheduling mechanism in a smart distributed multi-microgrid system
- 6 February 2020
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 11 (11) , 4765-4783
CLOES: cross-layer optimal energy scheduling mechanism in a smart distributed multi-microgrid system
- 17 July 2019
- Published by Springer Nature in Sādhanā
- Vol. 44 (8) , 1-22
An efficient approach based on selective partitioning for maximal frequent itemsets mining
- 17 July 2019
- Published by Springer Nature in Sādhanā
- Vol. 44 (8) , 1-22
An efficient approach based on selective partitioning for maximal frequent itemsets mining
- 28 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 14 (11) , 4873-4883
SF-OEAP: Starvation-Free Optimal Energy Allocation Policy in a Smart Distributed Multimicrogrid System
The advancements in the smart grid involves high penetration of renewable energy resources into distribution system by building a microgrid. However, the intermittent nature of the nondispatchable generation leads to the issue of demand supply mismatch in the microgrid system. It will be sensible for microgrids to trade energy with one another. This requires a smart distributor, which collects data regarding superfluous energy from providers and takes fair decision of microgrid-generated energy allocation among consumers. This paper presents a starvation-free optimal microgrid-generated energy allocation policy (SF-OEAP) in a smart distributed multimicrogrid system. A novel optimal energy allocation policy is proposed wherein, prediction accuracy of net load forecast and revenue index of consumer microgrid are considered as vital parameters. In a prioritized energy distribution mechanism, it may happen that the consumer microgrid can be starved of microgrid-generated energy. Therefore, in addition to vital parameters, starvation parameter is considered in designing energy allocation policy for sustaining the consumers in the smart distributed multimicrogrid system. Furthermore, the proposed scheme uses weights to control the importance of each of the parameters in the energy allocation policy. The proposed SF-OEAP is simulated and justified so that it is stable enough to apply in a real-time electricity market.
- 28 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 14 (11) , 4873-4883
SF-OEAP: Starvation-Free Optimal Energy Allocation Policy in a Smart Distributed Multimicrogrid System
The advancements in the smart grid involves high penetration of renewable energy resources into distribution system by building a microgrid. However, the intermittent nature of the nondispatchable generation leads to the issue of demand supply mismatch in the microgrid system. It will be sensible for microgrids to trade energy with one another. This requires a smart distributor, which collects data regarding superfluous energy from providers and takes fair decision of microgrid-generated energy allocation among consumers. This paper presents a starvation-free optimal microgrid-generated energy allocation policy (SF-OEAP) in a smart distributed multimicrogrid system. A novel optimal energy allocation policy is proposed wherein, prediction accuracy of net load forecast and revenue index of consumer microgrid are considered as vital parameters. In a prioritized energy distribution mechanism, it may happen that the consumer microgrid can be starved of microgrid-generated energy. Therefore, in addition to vital parameters, starvation parameter is considered in designing energy allocation policy for sustaining the consumers in the smart distributed multimicrogrid system. Furthermore, the proposed scheme uses weights to control the importance of each of the parameters in the energy allocation policy. The proposed SF-OEAP is simulated and justified so that it is stable enough to apply in a real-time electricity market.
- Open Access
- 1 January 2018
- Published by AGH University Press in Computer Science
- Vol. 19 (4) , 433-455
EFFICIENT APPROACH FOR VIEW SELECTION FOR DATA WAREHOUSE USING TREE MINING AND EVOLUTIONARY COMPUTATION
EFFICIENT APPROACH FOR VIEW SELECTION FOR DATA WAREHOUSE USING TREE MINING AND EVOLUTIONARY COMPUTATION
- 1 January 2018
- Published by AGH University Press in Computer Science
- Vol. 19 (4) , 433-455
Open AccessEFFICIENT APPROACH FOR VIEW SELECTION FOR DATA WAREHOUSE USING TREE MINING AND EVOLUTIONARY COMPUTATION
EFFICIENT APPROACH FOR VIEW SELECTION FOR DATA WAREHOUSE USING TREE MINING AND EVOLUTIONARY COMPUTATION
- 21 October 2016
- Published by Taylor & Francis in IETE Technical Review
- Vol. 34 (6) , 612-621
Novel Geometrical Shape Feature Extraction Techniques for Multilingual Character Recognition
Multilingual character recognition from the images of aged Indian documents is challenging because of the complex character grapheme of the Indian language scripts. Feature extraction plays the most important role in recognition of such images. In this paper, we have proposed a set of feature vectors (FVs) which are based on shape geometry (SG) decoding of the input character. The first FV is based on SG decoding of the input character using triangular area (TA) calculation. The second FV, namely, SG using perpendicular distance is extracted by dividing the input image into individual components and the shape of the individual component is decoded into shape symbols by comparing the normalized perpendicular distances of the individual pixels of the component onto the line joining the end points of the component. Apart from the proposed FVs, we have used crossing count features. These FVs are represented as the string of shape operators; hence, we have used minimum edit distance classifier to recognize the input character. The proposed character recognition technique is evaluated using the characters extracted from printed aged multilingual Indian documents having English, Devanagari, and Marathi scripts and achieved encouraging results. To further assess the performance of the proposed system, we have considered publicly available media-lab license plate benchmark database and achieved significant performance.
- 21 October 2016
- Published by Taylor & Francis in IETE Technical Review
- Vol. 34 (6) , 612-621
Novel Geometrical Shape Feature Extraction Techniques for Multilingual Character Recognition
Multilingual character recognition from the images of aged Indian documents is challenging because of the complex character grapheme of the Indian language scripts. Feature extraction plays the most important role in recognition of such images. In this paper, we have proposed a set of feature vectors (FVs) which are based on shape geometry (SG) decoding of the input character. The first FV is based on SG decoding of the input character using triangular area (TA) calculation. The second FV, namely, SG using perpendicular distance is extracted by dividing the input image into individual components and the shape of the individual component is decoded into shape symbols by comparing the normalized perpendicular distances of the individual pixels of the component onto the line joining the end points of the component. Apart from the proposed FVs, we have used crossing count features. These FVs are represented as the string of shape operators; hence, we have used minimum edit distance classifier to recognize the input character. The proposed character recognition technique is evaluated using the characters extracted from printed aged multilingual Indian documents having English, Devanagari, and Marathi scripts and achieved encouraging results. To further assess the performance of the proposed system, we have considered publicly available media-lab license plate benchmark database and achieved significant performance.
- Open Access
- 21 September 2016
- Published by Springer Nature in SpringerPlus
- Vol. 5 (1) , 1625
Mining precise cause and effect rules in large time series data of socio-economic indicators
Discovery of cause–effect relationships, particularly in large databases of time-series is challenging because of continuous data of different characteristics and complex lagged relationships. In this paper, we have proposed a novel approach, to extract cause–effect relationships in large time series data set of socioeconomic indicators. The method enhances the scope of relationship discovery to cause–effect relationships by identifying multiple causal structures such as binary, transitive, many to one and cyclic. We use temporal association and temporal odds ratio to exclude noncausal association and to ensure the high reliability of discovered causal rules. We assess the method with both synthetic and real-world datasets. Our proposed method will help to build quantitative models to analyze socioeconomic processes by generating a precise cause–effect relationship between different economic indicators. The outcome shows that the proposed method can effectively discover existing causality structure in large time series databases.
- 21 September 2016
- Published by Springer Nature in SpringerPlus
- Vol. 5 (1) , 1625
Open AccessMining precise cause and effect rules in large time series data of socio-economic indicators
Discovery of cause–effect relationships, particularly in large databases of time-series is challenging because of continuous data of different characteristics and complex lagged relationships. In this paper, we have proposed a novel approach, to extract cause–effect relationships in large time series data set of socioeconomic indicators. The method enhances the scope of relationship discovery to cause–effect relationships by identifying multiple causal structures such as binary, transitive, many to one and cyclic. We use temporal association and temporal odds ratio to exclude noncausal association and to ensure the high reliability of discovered causal rules. We assess the method with both synthetic and real-world datasets. Our proposed method will help to build quantitative models to analyze socioeconomic processes by generating a precise cause–effect relationship between different economic indicators. The outcome shows that the proposed method can effectively discover existing causality structure in large time series databases.
- 8 December 2014
- Published by Taylor & Francis in IETE Journal of Research
- Vol. 61 (1) , 72-79
Robust Feature Extraction Technique for License Plate Characters Recognition
This paper presents two novel geometrical feature extraction techniques for license plate (LP) characters recognition, written in English alphabets and numerals. A robust character recognition technique has to recognize different format, broken, and distorted characters by extracting invariant and discriminative character features. In this paper, we have extracted two types of geometrical features and a statistical crossing count feature with the help of horizontal, vertical, right diagonal, and left diagonal scan lines and centroid of the character to be recognized. For character recognition, we have used edit distance metric. The proposed technique can be enhanced to recognize any language scripts and is tested for Indian scripts. The proposed LP characters recognition technique is evaluated using 741 images of media-lab benchmark database, 49 images of Israeli vehicle LPs, and 110 images of proprietary Indian vehicle LPs having different environmental conditions and plate variations. The proposed technique achieved success rate of 98.8% for LP characters recognition which outperforms many LP character recognition techniques in the literature.
- 8 December 2014
- Published by Taylor & Francis in IETE Journal of Research
- Vol. 61 (1) , 72-79
Robust Feature Extraction Technique for License Plate Characters Recognition
This paper presents two novel geometrical feature extraction techniques for license plate (LP) characters recognition, written in English alphabets and numerals. A robust character recognition technique has to recognize different format, broken, and distorted characters by extracting invariant and discriminative character features. In this paper, we have extracted two types of geometrical features and a statistical crossing count feature with the help of horizontal, vertical, right diagonal, and left diagonal scan lines and centroid of the character to be recognized. For character recognition, we have used edit distance metric. The proposed technique can be enhanced to recognize any language scripts and is tested for Indian scripts. The proposed LP characters recognition technique is evaluated using 741 images of media-lab benchmark database, 49 images of Israeli vehicle LPs, and 110 images of proprietary Indian vehicle LPs having different environmental conditions and plate variations. The proposed technique achieved success rate of 98.8% for LP characters recognition which outperforms many LP character recognition techniques in the literature.