Recently, digital communication has become a critical necessity and so the Internet has become the most used medium and most efficient for digital communication. At the same time, data transmitted through the Internet are becoming more vulnerable. Therefore, the issue of maintaining secrecy of data is very important, especially if the data is personal or confidential. Steganography has provided a reliable method for solving such problems. Steganography is an effective technique in secret communication in digital worlds where data sharing and transfer is increasing through the Internet, emails and other ways. The main challenges of steganography methods are the undetectability and the imperceptibility of confidential data. This paper presents a steganography method in frequency domain. Haar Wavelet Transform is applied for decomposition of gray level cover image into four sub-bands. The secret image is hidden in the high frequency HH sub-band after applying the histogram modification followed by scrambling process. A Histogram modification is adopted, to scale the secret image to normalize its values, that manipulates the secret image from bright image to dark. Thus the secret image becomes invisible so it can be hidden in the high frequency sub-band. Scrambling the positions can be for rows then columns, which will give strong security of the hiding process. The experimental results demonstrate the proposed method has achieved superior performance in terms of quantifiable measurement (PSNR and correlation) and in terms of visual quality. The proposed method propositions good imperceptible results and good response for against the various image attacks.
In this article, we define and study a family of modified Baskakov type operators based on a parameter . This family is a generalization of the classical Baskakov sequence. First, we prove that it converges to the function being approximated. Then, we find a Voronovsky-type formula and obtain that the order of approximation of this family is . This order is better than the order of the classical Baskakov sequence whenever . Finally, we apply our sequence to approximate two test functions and analyze the numerical results obtained.
Hand gestures are currently considered one of the most accurate ways to communicate in many applications, such as sign language, controlling robots, the virtual world, smart homes, and the field of video games. Several techniques are used to detect and classify hand gestures, for instance using gloves that contain several sensors or depending on computer vision. In this work, computer vision is utilized instead of using gloves to control the robot's movement. That is because gloves need complicated electrical connections that limit user mobility, sensors may be costly to replace, and gloves can spread skin illnesses between users. Based on computer vision, the MediaPipe (MP) method is used. This method is a modern method that is discover
... Show MoreThe economy is exceptionally reliant on agricultural productivity. Therefore, in domain of agriculture, plant infection discovery is a vital job because it gives promising advance towards the development of agricultural production. In this work, a framework for potato diseases classification based on feed foreword neural network is proposed. The objective of this work is presenting a system that can detect and classify four kinds of potato tubers diseases; black dot, common scab, potato virus Y and early blight based on their images. The presented PDCNN framework comprises three levels: the pre-processing is first level, which is based on K-means clustering algorithm to detect the infected area from potato image. The s
... Show MoreMetaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele
... Show MoreVarious speech enhancement Algorithms (SEA) have been developed in the last few decades. Each algorithm has its advantages and disadvantages because the speech signal is affected by environmental situations. Distortion of speech results in the loss of important features that make this signal challenging to understand. SEA aims to improve the intelligibility and quality of speech that different types of noise have degraded. In most applications, quality improvement is highly desirable as it can reduce listener fatigue, especially when the listener is exposed to high noise levels for extended periods (e.g., manufacturing). SEA reduces or suppresses the background noise to some degree, sometimes called noise suppression alg
... Show MoreFaces blurring is one of the important complex processes that is considered one of the advanced computer vision fields. The face blurring processes generally have two main steps to be done. The first step has detected the faces that appear in the frames while the second step is tracking the detected faces which based on the information extracted during the detection step. In the proposed method, an image is captured by the camera in real time, then the Viola Jones algorithm used for the purpose of detecting multiple faces in the captured image and for the purpose of reducing the time consumed to handle the entire captured image, the image background is removed and only the motion areas are processe
... Show MoreThe present work aims to study the effect of using an automatic thresholding technique to convert the features edges of the images to binary images in order to split the object from its background, where the features edges of the sampled images obtained from first-order edge detection operators (Roberts, Prewitt and Sobel) and second-order edge detection operators (Laplacian operators). The optimum automatic threshold are calculated using fast Otsu method. The study is applied on a personal image (Roben) and a satellite image to study the compatibility of this procedure with two different kinds of images. The obtained results are discussed.
This paper presents a proposed method for (CBIR) from using Discrete Cosine Transform with Kekre Wavelet Transform (DCT/KWT), and Daubechies Wavelet Transform with Kekre Wavelet Transform (D4/KWT) to extract features for Distributed Database system where clients/server as a Star topology, client send the query image and server (which has the database) make all the work and then send the retrieval images to the client. A comparison between these two approaches: first DCT compare with DCT/KWT and second D4 compare with D4/KWT are made. The work experimented over the image database of 200 images of 4 categories and the performance of image retrieval with respect to two similarity measures namely Euclidian distance (ED) and sum of absolute diff
... Show More