Image compression is one of the data compression types applied to digital images in order to reduce their high cost for storage and/or transmission. Image compression algorithms may take the benefit of visual sensitivity and statistical properties of image data to deliver superior results in comparison with generic data compression schemes, which are used for other digital data. In the first approach, the input image is divided into blocks, each of which is 16 x 16, 32 x 32, or 64 x 64 pixels. The blocks are converted first into a string; then, encoded by using a lossless and dictionary-based algorithm known as arithmetic coding. The more occurrence of the pixels values is codded in few bits compare with pixel values of less occurrence through the sub intervals between the range 0 and 1. Finally, the stream of compressed tables is reassembled for decompressing (image restoration). The results showed a compression gain of 10-12% and less time consumption when applying this type of coding to each block rather than the entire image. To improve the compression ratio, the second approach was used based on the YCbCr colour model. In this regard, images were decomposed into four sub-bands (low-low, high-low, low-high, and high-high) by using the discrete wavelet transform compression algorithm. Then, the low-low sub-band was transmuted to frequency components (low and high) via discrete wavelet transform. Next, these components were quantized by using scalar quantization and then scanning in a zigzag way. The compression ratio result is 15.1 to 27.5 for magnetic resonance imaging with a different peak signal to noise ratio and mean square error; 25 to 43 for X-ray images; 32 to 46 for computed tomography scan images; and 19 to 36 for magnetic resonance imaging brain images. The second approach showed an improved compression scheme compared to the first approach considering compression ratio, peak signal to noise ratio, and mean square error.
Recommendation systems are now being used to address the problem of excess information in several sectors such as entertainment, social networking, and e-commerce. Although conventional methods to recommendation systems have achieved significant success in providing item suggestions, they still face many challenges, including the cold start problem and data sparsity. Numerous recommendation models have been created in order to address these difficulties. Nevertheless, including user or item-specific information has the potential to enhance the performance of recommendations. The ConvFM model is a novel convolutional neural network architecture that combines the capabilities of deep learning for feature extraction with the effectiveness o
... Show MoreSemiconductor quantum dots (QDs) have attracted tremendous attentions for their unique characteristics for solid-state lighting and thin-film display applications. A simple chemical method was used to synthesis quantum dots (QDs) of zinc sulfide (ZnS) with low cost. The XRD) shows cubic phase of the prepared ZnS with an average particles size of (3-29) nm. In UV-Vis. spectra observed a large blue shift over 38 nm. The band gaps energy (Eg) was 3.8 eV and 3.37eV from the absorption and photoluminescence (PL) respectively which larger than the Eg for bulk. QDs-LED hybrid devices were fabricated using ITO/ PEDOT: PSS/ Poly-TPD/ ZnS-QDs/ with different electron transport layers and cathode of LiF/Al layers. The EL spectrum reveals a bro
... Show MoreEnsuring security, integrity, and reliability of the election process consider as the main challenges in the electronic voting system. This paper describes the e-voting system by integrating the biometric authentication, advanced encryption, and watermarking techniques towards meeting such challenges. The system employs the fingerprint authentication by utilizing the Scale-Invariant Feature Transform (SIFT) for verifying the identity of the voter to ensure genuineness and non-repudiation of the service. The vote will be encrypted with the AES-GCM technique to be employed in securing the voting process, thus ensuring both data privacy and integrity. Hybrid Blind Watermarking employs the technique of Discrete Wavelet Transform (DWT) a
... Show MoreA bolted–welded hybrid demountable shear connector for use in deconstructable steel–concrete composite buildings and bridges was proposed. The hybrid connector consisted of a partially threaded stud, which was welded on the flange of a steel section, and a machined steel tube with compatible geometry, which was bolted on the stud. Four standard pushout tests according to Eurocode 4 were carried out to assess the shear performance of the hybrid connector. The experimental results show that the initial stiffness, shear resistance, and slip capacity of the proposed connector were higher than those of traditional welded studs. The hybrid connector was a ductile connector, according to Eurocode 4, with slip capacity higher than 6 mm. A nonli
... Show MoreIn the present study a new synthesis method has been introduced for the decoration of platinum(Pt) on the functionalized graphene nanoplatelet (GNP) and also highlighted the preparation method of nanofluids. GNP–Pt uniform nanocomposite was produced from a simple chemical reaction procedure, which included acid treatment for functionalization of GNP. The surface characterization was performed by various techniques such as XRD, FESEMand TEM. The effective thermal conductivity, density, viscosity, specific heat capacity and stability of functionalized GNP–Pt water based nanofluids were investigated in different instruments. The GNP–Pt hybrid nanofluids were prepared by dispersing the nanocomposite in base fluid without adding any surfac
... Show MoreBP algorithm is the most widely used supervised training algorithms for multi-layered feedforward neural net works. However, BP takes long time to converge and quite sensitive to the initial weights of a network. In this paper, a modified cuckoo search algorithm is used to get the optimal set of initial weights that will be used by BP algorithm. And changing the value of BP learning rate to improve the error convergence. The performance of the proposed hybrid algorithm is compared with the stan dard BP using simple data sets. The simulation result show that the proposed algorithm has improved the BP training in terms of quick convergence of the solution depending on the slope of the error graph.