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
NGC 6946 have been observed with BVRI filters, on October 15-18,
2012, with the Newtonian focus of the 1.88m telescope, Kottamia
observatory, of the National Research Institute of Astronomy and
Geophysics, Egypt (NRIAG), then we combine the BVRI filters to
obtain an astronomical image to the spiral galaxy NGC 6946 which
is regarded main source of information to discover the components of
this galaxy, where galaxies are considered the essential element of
the universe. To know the components of NGC 6946, we studied it
with the Variable Precision Rough Sets technique to determine the
contribution of the Bulge, disk, and arms of NGC 6946 according to
different color in the image. From image we can determined th
(1)
An experiment was carried out in the vegetables field of Horticulture Department / College of Agriculture / Baghdad University , for the three seasons : spring and Autumn of 2005 , and spring of 2007 , to study the type of gene action in some traits of vegetative and flowery growth in summer squash crosses (4 x 3 = cross 1 , 3 x 7 = cross 2 , 3 x 4 = cross 3 , 3 x 5 = cross 4 , 5 x 1 = cross 5 , 5 x 2 = cross 6). The study followed generation mean analysis method which included to each cross (P1 , P2 , F1 , F2 , Bc1P1 , Bc1P2) , and those populations obtained by hybridization during the first and second seasons. Experimental comparison was performed in the second (Two crosses only) and third seasons , (four crosses) by using RCBD with three
... Show More
The great scientific progress has led to widespread Information as information accumulates in large databases is important in trying to revise and compile this vast amount of data and, where its purpose to extract hidden information or classified data under their relations with each other in order to take advantage of them for technical purposes.
And work with data mining (DM) is appropriate in this area because of the importance of research in the (K-Means) algorithm for clustering data in fact applied with effect can be observed in variables by changing the sample size (n) and the number of clusters (K)
... Show More
Background: Calcaneus is a spongy cancellous bone with rich blood supply , its fracture heals more rapidly providing no occurrence of infection and soft tissue injury around ,no gross malposition of fragments. The associated pain leads to a major impairment in life quality. The aim of treatment for calcaneal fractures is the decrease of pain and rebuilding of walking ability for patients with normal foot shape and the ability to wear normal foot wear. To reduce complications, a minimally invasive technique for the treatment of displaced intra-articular fractures of the calcaneus was preferred to use.
The purpose of this study was to determine whether the closed reduction and percutaneous K. wire fixation of displ
... Show More
(1)
Cloth simulation and animation has been the topic of research since the mid-80's in the field of computer graphics. Enforcing incompressible is very important in real time simulation. Although, there are great achievements in this regard, it still suffers from unnecessary time consumption in certain steps that is common in real time applications. This research develops a real-time cloth simulator for a virtual human character (VHC) with wearable clothing. This research achieves success in cloth simulation on the VHC through enhancing the position-based dynamics (PBD) framework by computing a series of positional constraints which implement constant densities. Also, the self-collision and collision wit
... Show More
(24)
(21)
(5)
(3)
The effect of using three different interpolation methods (nearest neighbour, linear and non-linear) on a 3D sinogram to restore the missing data due to using angular difference greater than 1° (considered as optimum 3D sinogram) is presented. Two reconstruction methods are adopted in this study, the back-projection method and Fourier slice theorem method, from the results the second reconstruction proven to be a promising reconstruction with the linear interpolation method when the angular difference is less than 20°.
(2)
(2)