The main aim of image compression is to reduce the its size to be able for transforming and storage, therefore many methods appeared to compress the image, one of these methods is "Multilayer Perceptron ". Multilayer Perceptron (MLP) method which is artificial neural network based on the Back-Propagation algorithm for compressing the image. In case this algorithm depends upon the number of neurons in the hidden layer only the above mentioned will not be quite enough to reach the desired results, then we have to take into consideration the standards which the compression process depend on to get the best results. We have trained a group of TIFF images with the size of (256*256) in our research, compressed them by using MLP for each compression process the number of neurons in the hidden layer was changing and calculating the compression ratio, mean square error and peak signal-to-noise ratio to compare the results to get the value of original image. The findings of the research was the desired results as the compression ratio was less than five and a few mean square error thus a large value of peak signal-to-noise ratio had been recorded.
The focus of this paper is the presentation of a new type of mapping called projection Jungck zn- Suzuki generalized and also defining new algorithms of various types (one-step and two-step algorithms) (projection Jungck-normal N algorithm, projection Jungck-Picard algorithm, projection Jungck-Krasnoselskii algorithm, and projection Jungck-Thianwan algorithm). The convergence of these algorithms has been studied, and it was discovered that they all converge to a fixed point. Furthermore, using the previous three conditions for the lemma, we demonstrated that the difference between any two sequences is zero. These algorithms' stability was demonstrated using projection Jungck Suzuki generalized mapping. In contrast, the rate of convergenc
... Show MoreFinding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith
... Show MoreThis paper proposes a new method to tune a fractional order PID controller. This method utilizes both the analytic and numeric approach to determine the controller parameters. The control design specifications that must be achieved by the control system are gain crossover frequency, phase margin, and peak magnitude at the resonant frequency, where the latter is a new design specification suggested by this paper. These specifications results in three equations in five unknown variables. Assuming that certain relations exist between two variables and discretizing one of them, a performance index can be evaluated and the optimal controller parameters that minimize this performance index are selected. As a case study, a thir
... Show MoreApplying 4K, (Ultra HD) Real-time video streaming via the internet network, with low bitrate and low latency, is the challenge this paper addresses. Compression technology and transfer links are the important elements that influence video quality. So, to deliver video over the internet or another fixed capacity medium, it is essential to compress the video to more controllable bitrates (customarily in the 1-20 Mbps range). In this study, the video quality is examined using the H.265/HEVC compression standard, and the relationship between quality of video and bitrate flow is investigated using various constant rate factors, GOP patterns, quantization parameters, RC-lookahead, and other types of video motion sequences. The ultra
... Show MoreIn this research two algorithms are applied, the first is Fuzzy C Means (FCM) algorithm and the second is hard K means (HKM) algorithm to know which of them is better than the others these two algorithms are applied on a set of data collected from the Ministry of Planning on the water turbidity of five areas in Baghdad to know which of these areas are less turbid in clear water to see which months during the year are less turbid in clear water in the specified area.
In this paper, method of steganography in Audio is introduced for hiding secret data in audio media file (WAV). Hiding in audio becomes a challenging discipline, since the Human Auditory System is extremely sensitive. The proposed method is to embed the secret text message in frequency domain of audio file. The proposed method contained two stages: the first embedding phase and the second extraction phase. In embedding phase the audio file transformed from time domain to frequency domain using 1-level linear wavelet decomposition technique and only high frequency is used for hiding secreted message. The text message encrypted using Data Encryption Standard (DES) algorithm. Finally; the Least Significant bit (LSB) algorithm used to hide secr
... Show MoreIn this article, the boundary value problem of convection propagation through the permeable fin in a natural convection environment is solved by the Haar wavelet collocation method (HWCM). We also compare the solutions with the application of a semi-analytical method , namely the Temimi and Ansari (TAM), that is characterized by accuracy and efficiency.The proposed method is also characterized by simplicity and efficiency. The possibility of applying the proposed method to many types of linear or nonlinear ordinary and partial differential equations.
Kidney tumors are of different types having different characteristics and also remain challenging in the field of biomedicine. It becomes very important to detect the tumor and classify it at the early stage so that appropriate treatment can be planned. The main objective of this research is to use the Computer-Aided Diagnosis (CAD) algorithms to help the early detection of kidney tumors. In this paper, tried to implement an automated segmentation methods of gray level CT images is used to provide information such as anatomical structure and identifying the Region of Interest (ROI) i.e. locate tumor, lesion and other in kidney.
A CT image has inhomogeneity, noise which affects the continuity and accuracy of the images segmentation. In
This paper reports a numerical study of flow behaviors and natural convection heat transfer characteristics in an inclined open-ended square cavity filled with air. The cavity is formed by adiabatic top and bottom walls and partially heated vertical wall facing the opening. Governing equations in vorticity-stream function form are discretized via finite-difference method and are solved numerically by iterative successive under relaxation (SUR) technique. A computer program to solve mathematical model has been developed and written as a code for MATLAB software. Results in the form of streamlines, isotherms, and average Nusselt number, are obtained for a wide range of Rayleigh numbers 103-106 with Prandtl number 0.71
... Show MoreGypseous soils are considered one of the most problematic soils. The skirted foundation is an alternative technology that works to improve the bearing capacity and reduce settlement. This paper investigates the use of square skirted foundations resting on gypseous soil subjected to concentric and eccentric vertical load with eccentricity values of 4, 8, and 17 mm in 16 experimental model tests. To obtain the results by using this type of foundation, a small-scale physical model was designed to obtain the load–settlement behavior of the square skirted foundation; the dimension of the square footing is 100 mm × 100 mm with 1 mm thickness, the skirt depth (