In this paper, a novel hybrid edge-detection steganography technique is proposed, which greatly increases the payload capacity without losing much of its invisibility. Conventional least significant bit (LSB) steganography has a low payload capacity and is sensitive to statistical analysis. Our approach combines Canny and Sobel edge-detection methods to find the optimal embedding regions and then performs Most Significant Bit (MSB) modifications in edge areas where the human visual system (HVS) is less sensitive to changes. Experimental results show that the performance of our proposed method outperforms conventional LSB-based steganographic methods by an average of 42.3% in payload capacity, while maintaining a PSNR greater than 38 dB and an SSIM above 0.95. The proposed method is also more robust against statistical attacks, such as chi-square analysis and RS steganalysis, which are critical challenges in secure data transmission.

This research examines file protection in cloud environments using the SHA-256 algorithm. It evaluates secure hash variants in file transfer systems, aiming to improve throughput while meeting security requirements. Data analysis involved gathering and cleaning datasets, measuring encryption times, and applying statistical and graphical methods. Results show SHA-256 as an effective base for encryption, with parallel processing increasing efficiency when real-time speed is essential. The study highlights the value of transformational techniques to boost performance and recommends hybrid systems that combine SHA-256 with other algorithms for stronger security. These outcomes support further work on cryptographic methods to strengthen the safety and reliability of cloud infrastructures.

Face recognition from non-identical face photos is a prominent area of research in pattern recognition and computer vision. Existing face recognition systems struggle with diverse changes like lighting conditions, expressions, and facial occlusions. This paper proposes a new Face Recognition (FR) approach that combines the Elastic Bunch Graph Matching (EBGM) approach with the greedy algorithm to automatically identify face landmarks. The proposed approach independently selects each optimal landmark of face image from different corresponding face images where the corresponding landmark of corresponding face image which achieves the best similarity is used rather than using one or at most two corresponding face images and computing the average between both. The locations of corresponding landmarks can be displaced to achieve maximum similarity with optimal landmarks. This proposed approach demonstrates improved recognition performance compared to contemporary face recognition methods. It effectively handles changing ratios of face parts and can recognize faces even with increasing occlusion sizes.