Madhuri Satish Joshi
Madhuri Satish Joshi has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- A. J. Umbarkar
Walchand College of Engineering
5 shared publications Arti Mohanpurkar
2 shared publications- Pranali D. Sheth
Department of Information Technology Walchand College of Engineering 416-416 Sangli India
2 shared publications - Savita Kulkarni
Maharashtra Institute of Technology, Kothrud, Pune - 411038
2 shared publications Sharvari C. Tamane
MGM's Jawaharlal Nehru Engineering College, India
2 shared publications- Wei-Chiang Hong
College of Shipbuilding Engineering, Harbin Engineering University, Harbin, P. R. China
2 shared publications
Latest Publications
- 1 January 2019
- Published by IGI Global Scientific Publishing
- p. 1-12
The Basics of Big Data and Security Concerns
The chapter is written on two important buildings, the basics of Big data and their security concern. The chapter is classifying in different sections. The chapter starts with the basic of big data and is concluded with security concern. The chapter is enriched with different category examples to make texts easy for author understanding. The chapter begins with the introduction of big data, their memory size followed by the examples. The chapter explains the category of big data in type of structured, semi-structured and unstructured data. The discussion on operational data service and big data application is also included to ensure the basic understanding to readers. The second portion of chapter which is based on security in big data. It's explaining the issues and challenges in big data. The section also focusing on the shift paradigm from cloud environment to big data environment changes and the problems encounter by organizations. The section discusses the framework issue and concluded with the necessity of understanding security in the big data, keeping in view of expansion of information technology infrastructure in the 21st century.
- 1 January 2019
- Published by IGI Global Scientific Publishing
- p. 1-12
The Basics of Big Data and Security Concerns
The chapter is written on two important buildings, the basics of Big data and their security concern. The chapter is classifying in different sections. The chapter starts with the basic of big data and is concluded with security concern. The chapter is enriched with different category examples to make texts easy for author understanding. The chapter begins with the introduction of big data, their memory size followed by the examples. The chapter explains the category of big data in type of structured, semi-structured and unstructured data. The discussion on operational data service and big data application is also included to ensure the basic understanding to readers. The second portion of chapter which is based on security in big data. It's explaining the issues and challenges in big data. The section also focusing on the shift paradigm from cloud environment to big data environment changes and the problems encounter by organizations. The section discusses the framework issue and concluded with the necessity of understanding security in the big data, keeping in view of expansion of information technology infrastructure in the 21st century.
- 20 March 2018
- Published by Springer Nature
- p. 697-705
Performance Enhancement for Detection of Myocardial Infarction from Multilead ECG
- 20 March 2018
- Published by Springer Nature
- p. 697-705
Performance Enhancement for Detection of Myocardial Infarction from Multilead ECG
- 1 January 2017
- Published by IGI Global Scientific Publishing
- p. 1-12
The Basics of Big Data and Security Concerns
The chapter is written on two important buildings, the basics of Big data and their security concern. The chapter is classifying in different sections. The chapter starts with the basic of big data and is concluded with security concern. The chapter is enriched with different category examples to make texts easy for author understanding. The chapter begins with the introduction of big data, their memory size followed by the examples. The chapter explains the category of big data in type of structured, semi-structured and unstructured data. The discussion on operational data service and big data application is also included to ensure the basic understanding to readers. The second portion of chapter which is based on security in big data. It's explaining the issues and challenges in big data. The section also focusing on the shift paradigm from cloud environment to big data environment changes and the problems encounter by organizations. The section discusses the framework issue and concluded with the necessity of understanding security in the big data, keeping in view of expansion of information technology infrastructure in the 21st century.
- 1 January 2017
- Published by IGI Global Scientific Publishing
- p. 1-12
The Basics of Big Data and Security Concerns
The chapter is written on two important buildings, the basics of Big data and their security concern. The chapter is classifying in different sections. The chapter starts with the basic of big data and is concluded with security concern. The chapter is enriched with different category examples to make texts easy for author understanding. The chapter begins with the introduction of big data, their memory size followed by the examples. The chapter explains the category of big data in type of structured, semi-structured and unstructured data. The discussion on operational data service and big data application is also included to ensure the basic understanding to readers. The second portion of chapter which is based on security in big data. It's explaining the issues and challenges in big data. The section also focusing on the shift paradigm from cloud environment to big data environment changes and the problems encounter by organizations. The section discusses the framework issue and concluded with the necessity of understanding security in the big data, keeping in view of expansion of information technology infrastructure in the 21st century.
- 1 July 2016
- Published by IGI Global Scientific Publishing in International Journal of Ambient Computing and Intelligence
- Vol. 7 (2) , 114-137
A Traitor Identification Technique for Numeric Relational Databases with Distortion Minimization and Collusion Avoidance
An enormous growth in internet usage has resulted into great amounts of digital data to handle. Data sharing has become significant and unavoidable. Data owners want the data to be secured and perennially available. Data protection and any violations thereby become crucial. This work proposes a traitor identification system which securely embeds the fingerprint to provide protection for numeric relational databases. Digital data of numeric nature calls for preservation of usability. It needs to be done so by achieving minimum distortion. The proposed insertion technique with reduced time complexity ensures that the fingerprint inserted in the form of an optimized error leads to minimum distortion. Collusion attack is an integral part of fingerprinting and a provision to mitigate by avoiding the same is suggested. Robustness of the system against several attacks like tuple insertion, tuple deletion etc. is also depicted.
- 1 July 2016
- Published by IGI Global Scientific Publishing in International Journal of Ambient Computing and Intelligence
- Vol. 7 (2) , 114-137
A Traitor Identification Technique for Numeric Relational Databases with Distortion Minimization and Collusion Avoidance
An enormous growth in internet usage has resulted into great amounts of digital data to handle. Data sharing has become significant and unavoidable. Data owners want the data to be secured and perennially available. Data protection and any violations thereby become crucial. This work proposes a traitor identification system which securely embeds the fingerprint to provide protection for numeric relational databases. Digital data of numeric nature calls for preservation of usability. It needs to be done so by achieving minimum distortion. The proposed insertion technique with reduced time complexity ensures that the fingerprint inserted in the form of an optimized error leads to minimum distortion. Collusion attack is an integral part of fingerprinting and a provision to mitigate by avoiding the same is suggested. Robustness of the system against several attacks like tuple insertion, tuple deletion etc. is also depicted.
- 1 January 2016
- Published by Inderscience Publishers in International Journal of Bio-Inspired Computation
- Vol. 8 (4) , 248-263
Comparative study of diversity based parallel dual population genetic algorithm for unconstrained function optimisations
The genetic algorithms (GAs) metaheuristic deals with large scale combinatorial optimisation problems. It is biologically inspired by the method, based on the principle of survival of the fittest. In GAs, the concept of multiple populations offers an advantage of diversity. However, as the population evolves, the GA loses its diversity and sometimes it cannot avoid the local optima problem (also known as premature convergence). The dual population genetic algorithm (DPGA) uses an extra population called the reserve population to provide additional diversity to the main population through crossbreeding. Crossbreeding solves the problem of premature convergence and helps to converge early. This paper is the empirical study of the Binary encoded parallel DPGA (PDPGA). It is compared with metaheuristics given in literature based on reliability, efficacy and efficiency. The performance of PDPGA is competitive over other nature-inspired optimisation methods like genetic algorithm (GA), particle swarm optimisation (PSO), differential evolution (DE), ANTS, bee colony, grenade explosion method (GEM) and bee colony optimisation (BCO), but not better than artificial bee colony (ABC) and teaching-learning-based optimisation (TLBO).
- 1 January 2016
- Published by Inderscience Publishers in International Journal of Bio-Inspired Computation
- Vol. 8 (4) , 248-263
Comparative study of diversity based parallel dual population genetic algorithm for unconstrained function optimisations
The genetic algorithms (GAs) metaheuristic deals with large scale combinatorial optimisation problems. It is biologically inspired by the method, based on the principle of survival of the fittest. In GAs, the concept of multiple populations offers an advantage of diversity. However, as the population evolves, the GA loses its diversity and sometimes it cannot avoid the local optima problem (also known as premature convergence). The dual population genetic algorithm (DPGA) uses an extra population called the reserve population to provide additional diversity to the main population through crossbreeding. Crossbreeding solves the problem of premature convergence and helps to converge early. This paper is the empirical study of the Binary encoded parallel DPGA (PDPGA). It is compared with metaheuristics given in literature based on reliability, efficacy and efficiency. The performance of PDPGA is competitive over other nature-inspired optimisation methods like genetic algorithm (GA), particle swarm optimisation (PSO), differential evolution (DE), ANTS, bee colony, grenade explosion method (GEM) and bee colony optimisation (BCO), but not better than artificial bee colony (ABC) and teaching-learning-based optimisation (TLBO).
- Open Access
- 17 November 2015
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 130 (5) , 13-18
Fingerprinting Numeric Databases with Information Preservation and Collusion Avoidance
- 17 November 2015
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 130 (5) , 13-18
Open AccessFingerprinting Numeric Databases with Information Preservation and Collusion Avoidance
- Open Access
- 15 October 2015
- Published by International Scientific Research Publications in Journal of Mathematics and Computer Science
- Vol. 15 (03) , 240-251
An Image Steganography Method Resistive To Fall Off Boundary Value Problem With Five Pixel Pair Differencing
- 15 October 2015
- Published by International Scientific Research Publications in Journal of Mathematics and Computer Science
- Vol. 15 (03) , 240-251
Open AccessAn Image Steganography Method Resistive To Fall Off Boundary Value Problem With Five Pixel Pair Differencing
- 15 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Microwave Theory and Techniques
- Vol. 63 (8) , 2411-2417
Design and Analysis of Shielded Vertically Stacked Ring Resonator as Complex Permittivity Sensor for Petroleum Oils
Novel design of a shielded vertically stacked ring resonator (VSRR) is presented in this paper. The use of a shielded VSRR with a layer of the low-loss liquid that fills the partial space between the fed patch and the parasitic patch have been investigated. Dependencies of the resonating frequency and input impedance of the shielded VSRR on structure size and material properties of the test liquid layer are discussed. The method, of finding the complex permittivity (CP), particularly of petroleum liquids, is verified using electromagnetic modeling with full wave simulation software ANSYS HFSS-15 and confirmed experimentally. The proposed new design of the resonator will improve the sensitivity of single ring boxed resonator in terms of the quality factor, and in turn, increase the CP measurement sensitivity.
- 15 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Microwave Theory and Techniques
- Vol. 63 (8) , 2411-2417
Design and Analysis of Shielded Vertically Stacked Ring Resonator as Complex Permittivity Sensor for Petroleum Oils
Novel design of a shielded vertically stacked ring resonator (VSRR) is presented in this paper. The use of a shielded VSRR with a layer of the low-loss liquid that fills the partial space between the fed patch and the parasitic patch have been investigated. Dependencies of the resonating frequency and input impedance of the shielded VSRR on structure size and material properties of the test liquid layer are discussed. The method, of finding the complex permittivity (CP), particularly of petroleum liquids, is verified using electromagnetic modeling with full wave simulation software ANSYS HFSS-15 and confirmed experimentally. The proposed new design of the resonator will improve the sensitivity of single ring boxed resonator in terms of the quality factor, and in turn, increase the CP measurement sensitivity.
- Open Access
- 8 April 2015
- Published by MECS Publisher in International Journal of Image, Graphics and Signal Processing
- Vol. 7 (5) , 66-74
A High Capacity Secured Image Steganography Method with Five Pixel Pair Differencing and LSB Substitution
Most of the steganography techniques, based on pixel value difference, use the difference between the pixel values to hide the information. In this paper, an algorithm is proposed which combines the LSB and PVD steganography techniques to provide high data hiding capacity with acceptable stego image quality. Instead of using the original difference to hide the information, the difference is revised before it is used for hiding the information. This introduces an additional layer of security for the secret information. The algorithm divides the cover image in the blocks of 2 3 pixels. One of the pixels in the block is used as common pixel, which forms five pixel pairs with remaining five pixels in the block. The algorithm hides three secret bits in the common pixel using the LSB substitution method and then use the PVD based approach to hide data in five pixel pairs in each block. The algorithm determines the average (N) of the number of bits that can be hidden in the block. If the difference value allows M-bits to be hidden in the pair, then bits ≤ N are hidden in that pair. The result shows that the algorithm provides higher hiding capacity with better PSNR values as compared to other methods investigated in this study.
- 8 April 2015
- Published by MECS Publisher in International Journal of Image, Graphics and Signal Processing
- Vol. 7 (5) , 66-74
Open AccessA High Capacity Secured Image Steganography Method with Five Pixel Pair Differencing and LSB Substitution
Most of the steganography techniques, based on pixel value difference, use the difference between the pixel values to hide the information. In this paper, an algorithm is proposed which combines the LSB and PVD steganography techniques to provide high data hiding capacity with acceptable stego image quality. Instead of using the original difference to hide the information, the difference is revised before it is used for hiding the information. This introduces an additional layer of security for the secret information. The algorithm divides the cover image in the blocks of 2 3 pixels. One of the pixels in the block is used as common pixel, which forms five pixel pairs with remaining five pixels in the block. The algorithm hides three secret bits in the common pixel using the LSB substitution method and then use the PVD based approach to hide data in five pixel pairs in each block. The algorithm determines the average (N) of the number of bits that can be hidden in the block. If the difference value allows M-bits to be hidden in the pair, then bits ≤ N are hidden in that pair. The result shows that the algorithm provides higher hiding capacity with better PSNR values as compared to other methods investigated in this study.
- Open Access
- 12 February 2015
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2015, 1-11
An Image Steganography Method Hiding Secret Data into Coefficients of Integer Wavelet Transform Using Pixel Value Differencing Approach
The image steganography systems use either the spatial domain or the frequency domain to hide the secret information. The proposed technique uses spatial domain technique to hide secret information in the frequency domain. The cover image is transformed using integer wavelet transform to obtain four subbands: LL, LH, HL, and HH. Then, the PVD approach is used to hide the secret information in the wavelet coefficients of all the four subbands. For improving the security of the hidden information, the proposed method first modifies the difference between two wavelet coefficients of a pair and then uses the modified difference to hide the information. This makes extraction of secret data from the stego image difficult even if the steganography method fails. The result shows that the proposed technique outperforms other PVD based techniques in terms of security of secret information and hiding capacity of cover image. The image steganography systems use either the spatial domain or the frequency domain to hide the secret information. The proposed technique uses spatial domain technique to hide secret information in the frequency domain. The cover image is transformed using integer wavelet transform to obtain four subbands: LL, LH, HL, and HH. Then, the PVD approach is used to hide the secret information in the wavelet coefficients of all the four subbands. For improving the security of the hidden information, the proposed method first modifies the difference between two wavelet coefficients of a pair and then uses the modified difference to hide the information. This makes extraction of secret data from the stego image difficult even if the steganography method fails. The result shows that the proposed technique outperforms other PVD based techniques in terms of security of secret information and hiding capacity of cover image.
- 12 February 2015
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2015, 1-11
Open AccessAn Image Steganography Method Hiding Secret Data into Coefficients of Integer Wavelet Transform Using Pixel Value Differencing Approach
The image steganography systems use either the spatial domain or the frequency domain to hide the secret information. The proposed technique uses spatial domain technique to hide secret information in the frequency domain. The cover image is transformed using integer wavelet transform to obtain four subbands: LL, LH, HL, and HH. Then, the PVD approach is used to hide the secret information in the wavelet coefficients of all the four subbands. For improving the security of the hidden information, the proposed method first modifies the difference between two wavelet coefficients of a pair and then uses the modified difference to hide the information. This makes extraction of secret data from the stego image difficult even if the steganography method fails. The result shows that the proposed technique outperforms other PVD based techniques in terms of security of secret information and hiding capacity of cover image. The image steganography systems use either the spatial domain or the frequency domain to hide the secret information. The proposed technique uses spatial domain technique to hide secret information in the frequency domain. The cover image is transformed using integer wavelet transform to obtain four subbands: LL, LH, HL, and HH. Then, the PVD approach is used to hide the secret information in the wavelet coefficients of all the four subbands. For improving the security of the hidden information, the proposed method first modifies the difference between two wavelet coefficients of a pair and then uses the modified difference to hide the information. This makes extraction of secret data from the stego image difficult even if the steganography method fails. The result shows that the proposed technique outperforms other PVD based techniques in terms of security of secret information and hiding capacity of cover image.