Communication has become a lot easier in this era of technology, development of highspeed computer networks, and the inexpensive uses of Internet. Therefore, data transmission has become vulnerable to and unsafe from different external attacks. Every communication body wants to secure their data while communicating over the Internet. The internet has various benefits but the main demerit is the privacy and security and the transmission of data over insecure network or channel may happen. Various techniques used for secure communication in order to address these issues, steganography plays an important role. Steganography is the process of obfuscation that makes something incomprehensible and unclear. Different image steganography research methods are proposed recently but each has their advantages and disadvantages and still have necessity to develop some better image steganography mechanisms to achieve the reliability between the basics criteria of image steganography. Therefore, the proposed work, in this paper, is based on the Least Significant Bit (LSB) substitution method. The LSB substitution method can minimize the error rate in embedding process and can achieve greater reliability in criteria, using novel algorithm based on value difference. In this paper, we proposed a novel technique in steganography within the digital images such is RGB, Gray Scale, Texture, Aerial images to achieve higher security, imperceptibility, capacity, and robustness as compared with existing methods. The experimental outcomes of the suggested approach prove further developed strength and justify the feasibility of our research. Through numerical simulations, we observed that the proposed strategy outperformed the next-best current methodology by 5.561 percent in terms of PSNR Correlation score. Additionally, the proposed approach achieved a 6.43 percent better score in PSNR with a variable measure of code inserted in similar images with distinct dimensions. Furthermore, encrypting the same amount of information in images of varying sizes resulted in approximately 6.77 percent improvements. Embedding different sizes of a particular secret message in a different image (such as Gray, Texture, Aerial and RGB images) came out with about 5.466 percent of better score.

Steganography surpasses other mechanisms of securing data from potential threats. The modern digital arena calls for robust information hiding techniques and, thus, it has always been a flash point for researchers and academicians. Nowadays, transmission is susceptible to numerous hacks while sharing secret information through typical correspondence channel. Accordingly, everybody needs the classification, respectability, and realness of his or her privileged information. Particularly, different techniques are used to take on these security issues like advanced declaration, computerized mark, and cryptography. Nevertheless, these strategies alone cannot be negotiated. Steganography is a revolution where current information compression, data hypothesis, spread range, and cryptography advancements are integrated to meet the requirements for protection of data over the Internet. This study investigates and critically analyses various existing cover steganography techniques and identifies the valuable region that everyone can be benefited. Moreover, we present a comprehensive overview of the fundamental concepts with in the domain of the steganographic methods and steganalysis. These systems have been depicted in numerous areas of the steganography such as spatial space, transform domain, and adaptive space. Moreover, each space has its particular traits. A few regularly involved techniques for improving the steganographic security and upgrading steganalysis capacity are elaborated, summed up; and conceivable examination patterns are talked about. We also systematically separate different methodologies in our review and show their pros and cons, qualities, challenges and significance.

Clustering a set of objects into homogeneous groups is a fundamental operation in data mining. Recently, many attentions have been put on categorical data clustering, where data objects are made up of non-numerical attributes. For categorical data clustering the rough set based approaches such as Maximum Dependency Attribute (MDA) and Maximum Significance Attribute (MSA) has outperformed their predecessor approaches like Bi-Clustering (BC), Total Roughness (TR) and Min-Min Roughness(MMR). This paper presents the limitations and issues of MDA and MSA techniques on special type of data sets where both techniques fails to select or faces difficulty in selecting their best clustering attribute. Therefore, this analysis motivates the need to come up with better and more generalize rough set theory approach that can cope the issues with MDA and MSA. Hence, an alternative technique named Maximum Indiscernible Attribute (MIA) for clustering categorical data using rough set indiscernible relations is proposed. The novelty of the proposed approach is that, unlike other rough set theory techniques, it uses the domain knowledge of the data set. It is based on the concept of indiscernibility relation combined with a number of clusters. To show the significance of proposed approach, the effect of number of clusters on rough accuracy, purity and entropy are described in the form of propositions. Moreover, ten different data sets from previously utilized research cases and UCI repository are used for experiments. The results produced in tabular and graphical forms shows that the proposed MIA technique provides better performance in selecting the clustering attribute in terms of purity, entropy, iterations, time, accuracy and rough accuracy.

The Internet and Big Data expansion have motivated the requirement for more generous stockpiling to hold and share information. Against the current era of information, guaranteeing protection and security to individuals sending data to each other is of utmost importance. The only file type that is instantly and widely used is the image. Therefore, to secure transmission, it is necessary to develop a mechanism to safeguard user data transmission. Considering this thought, it is necessary to analyze the best file type of image for essential criteria of image steganography, such as Payload, Robustness, Imperceptibility, etc., to challenge the weakness of the current algorithms. The widely used image formats are PNG, TIFF, JPEG, BMP, and GIF, which is the cause of existing methods. However, in this case, the critical softness is the credibility of the steganography, which plays a vital role in these format images to ensure the end users communicate. In this paper, a single algorithm provides several advantages for various types of images used as cover objects. However, after the critical and comparative analysis of different perspectives and some assessment metrics, the experimental results prove the importance, significance, and promising limits for these image formats by accomplishing a 4.4450% normal higher score for PSNR correlation than the next best existing methodology. Besides, in PSNR with a variable measure of code implanted in similar pictures of similar aspects, the proposed approach accomplished a 6.33% better score. Encrypting similar code sizes in pictures of various dimensions brought about a 4.23% better score. Embedding the same message size into the same dimension of different images resulted in a 3.222% better score.