Image compression plays an important role in reducing the size and storage of data while increasing the speed of its transmission through the Internet significantly. Image compression is an important research topic for several decades and recently, with the great successes achieved by deep learning in many areas of image processing, especially image compression, and its use is increasing Gradually in the field of image compression. The deep learning neural network has also achieved great success in the field of processing and compressing various images of different sizes. In this paper, we present a structure for image compression based on the use of a Convolutional AutoEncoder (CAE) for deep learning, inspired by the diversity of human eyes' observation of the different colors and features of images. We propose a multi-layer hybrid system for deep learning using the unsupervised CAE architecture and using the color clustering of the K-mean algorithm to compress images and determine their size and color intensity. The system is implemented using Kodak and Challenge on Learned Image Compression (CLIC) dataset for deep learning. Experimental results show that our proposed method is superior to the traditional compression methods of the autoencoder, and the proposed work has better performance in terms of performance speed and quality measures Peak Signal To Noise Ratio (PSNR) and Structural Similarity Index (SSIM) where the results achieved better performance and high efficiency With high compression bit rates and low Mean Squared Error (MSE) rate the results recorded the highest compression ratios that ranged between (0.7117 to 0.8707) for the Kodak dataset and (0.7191 to 0.9930) for CLIC dataset. The system achieved high accuracy and quality in comparison to the error coefficient, which was recorded (0.0126 to reach 0.0003) below, and this system is onsidered the most quality and accurate compared to the methods of deep learning compared to the deep learning methods of the autoencoder
Refractive indices (nD), viscosities (η) and densities (ρ) were deliberated for the binary mixtures created by dipropyl amine with 1-octanol, 1-heptanol, 1-hexanol, 1-pentanol and tert-pentyl alcohol at temperature 298.15 K over the perfect installation extent. The function of Redlich-Kister were used to calculate and renovated of the refractive index deviations (∆nD), viscosity deviations (ηE), excess molar Gibbs free energy (∆G*E) and excess molar volumes (VmE) The standard errors and coefficients were respected by this function. The values of ∆nD, ηE, VmE and ∆G*E were plotted against mole fraction of dipropyl amine. In all cases the obtained ηE, ∆G*E, VmE and ∆nD values were negative at 298.15K. Effect of carbo
... Show More
(10)
(7)
(13)
(12)
In this research prepared two composite materials , the first prepared from unsaturated polyester resin (UP) , which is a matrix , and aluminum oxide (Al2O3) , and the second prepared from unsaturated polyester resin and aluminum oxide and copper oxide (CuO) , the two composites materials (Alone and Hybrid) of percentage weight (5,10,15)% . All samples were prepared by hand layup process, and study the electrical and thermal conductivity. The results showed decrease electrical conductivity from (10 - 2.39) ×10-15 for (Up+ Al2O3) and from (10 - 2.06)×10-15 for (Up+ Al2O3+ CuO) .But increase thermal conductivity from( 0.17 - 0.505) for (Up+ Al2O3) and from (0.17 - 0.489) for (Up+ Al2O3+ CuO).
(31)
(27)
As an important resource, entanglement light source has been used in developing quantum information technologies, such as quantum key distribution(QKD). There are few experiments implementing entanglement-based deterministic QKD protocols since the security of existing protocols may be compromised in lossy channels. In this work, we report on a loss-tolerant deterministic QKD experiment which follows a modified “Ping-Pong”(PP) protocol. The experiment results demonstrate for the first time that a secure deterministic QKD session can be fulfilled in a channel with an optical loss of 9 dB, based on a telecom-band entangled photon source. This exhibits a conceivable prospect of ultilizing entanglement light source in real-life fiber-based
... Show More
(17)
(16)
(12)
(8)
(1)
This paper presents a meta-heuristic swarm based optimization technique for solving robot path planning. The natural activities of actual ants inspire which named Ant Colony Optimization. (ACO) has been proposed in this work to find the shortest and safest path for a mobile robot in different static environments with different complexities. A nonzero size for the mobile robot has been considered in the project by taking a tolerance around the obstacle to account for the actual size of the mobile robot. A new concept was added to standard Ant Colony Optimization (ACO) for further modifications. Simulations results, which carried out using MATLAB 2015(a) environment, prove that the suggested algorithm outperforms the standard version of AC
... Show More
(22)
Machine learning models have recently provided great promise in diagnosis of several ophthalmic disorders, including keratoconus (KCN). Keratoconus, a noninflammatory ectatic corneal disorder characterized by progressive cornea thinning, is challenging to detect as signs may be subtle. Several machine learning models have been proposed to detect KCN, however most of the models are supervised and thus require large well-annotated data. This paper proposes a new unsupervised model to detect KCN, based on adapted flower pollination algorithm (FPA) and the k-means algorithm. We will evaluate the proposed models using corneal data collected from 5430 eyes at different stages of KCN severity (1520 healthy, 331 KCN1, 1319 KCN2, 1699 KCN3 a
... Show More
(4)
(5)
Abstract
For sparse system identification,recent suggested algorithms are 
-norm Least Mean Square ( -LMS), Zero-Attracting LMS (ZA-LMS), Reweighted Zero-Attracting LMS (RZA-LMS), and p-norm LMS (p-LMS) algorithms, that have modified the cost function of the conventional LMS algorithm by adding a constraint of coefficients sparsity. And so, the proposed algorithms are named -ZA-LMS,