In Visual Cryptography Schemes (VCSs), for message n transparencies are generated, such that the original message is visible if any k of them are stacked. VCS especially for large values of k and n, the pixel expansion’s reduction and enhancement of the recovered images’ display quality continue to be critical issues. In addition to this, it is challenging to develop a practical and systematic approach to threshold VCSs. An optimization-based pixel-expansion-free threshold VCSs approach has been proposed for binary secret images’ encryption. Along with contrast, blackness is also treated as a performance metric for assessing the recovered images’ display quality. An ideally secure technique for a secret image’s protection through its partition into shadow images (known as shadows) is the Visual Secret Sharing (VSS) scheme. Acquirement of a smaller shadow size or a higher contrast is the VSS schemes’ latest focus. The white pixels’ frequency has been utilized to demonstrate the recovered image’s contrast in this work. While the Probabilistic VSS (ProbVSS) scheme is non-expansible, it can also be readily deployed depending upon the traditional VSS scheme. Initially, this work has defined the problem as a mathematical optimization model such that, while contingent on blackness and density-balance constraints, there is the maximization of the recovered images’ contrast. Afterward, an algorithm dependent on the Tabu Search (TS) is devised in this work for this problem’s resolution. Multiple complicated combinatorial problems have been successfully resolved with the powerful TS algorithm. Moreover, this work has attempted to bolster the contrast through the density-balance constraint’s slight relaxation. Compared to the older techniques, the proposed optimization-based approach is superior regarding the recovered images’ display quality and the pixel expansion factor from the experimental outcomes.

The current era is mainly focused on secured data transmission and every organization takes preventive measures to protect network’s private data. Among different techniques visual cryptography is a prominent one that that encrypts the visual information and decrypts secret using mechanical operations without any computation, but each share need pixel expansion. In the current work, we propose an Image encryption technique using (n, n) Visual cryptography based on simple operations without pixel expansion. The proposed novel technique gives an image encryption using visual cryptography based on Least significant bit (LSB) technique in spatial domain and parity mechanism using Exclusive-OR(XOR) operation. developed for encrypting grey scale image. Image encryption and decryption uses simple Boolean operations. The technique provides better quality of shares and recovers without any loss.

Several deep models were proposed in image processing, data interpretation, speech recognition, and video analysis. Most of these architectures need a massive proportion of training samples and use arbitrary configuration. This paper constructs a deep learning architecture with feature learning. Graph convolution networks (GCNs), semi-supervised learning and graph data representation, have become increasingly popular as cost-effective and efficient methods. Most existing merging node descriptions for node distribution on the graph use stabilised neighbourhood knowledge, typically requiring a significant amount of variables and a high degree of computational complexity. To address these concerns, this research presents DLM-SSC, a unique method semi-supervised node classification tasks that can combine knowledge from multiple neighbourhoods at the same time by integrating high-order convolution and feature learning. This paper employs two function learning techniques for reducing the number of parameters and hidden layers: modified marginal fisher analysis (MMFA) and kernel principal component analysis (KPCA). The MMFA and KPCA weight matrices are modified layer by layer when implementing the DLM, a supervised pretraining technique that doesn't require a lot of information. Free measuring on citation datasets (Citeseer, Pubmed, and Cora) and other data sets demonstrate that the suggested approaches outperform similar algorithms.

With the proliferation of information available in the internet and databases, the privacy-preserving data mining is extensively used to maintain the privacy of the underlying data. Various methods of the state art are available in the literature for privacy-preserving. Evolutionary Algorithms (EAs) provide effective solutions for various real-world optimization problems. Evolutionary Algorithms are efficiently employed in business practice. In privacy-preserving domain, the existing EA solutions are restricted to specific problems such as cost function evaluation. In this work, it is proposed to implement a Hybrid Evolutionary Algorithm using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Both GA and PSO in the proposed system work with the same population. In the proposed framework, k-anonymity is accomplished by generalization of the original dataset. The hybrid optimization is used to search for optimal generalized feature set

No abstract

No abstract

No abstract

No abstract