Preferred Language
Articles
/
nRc9Po4BVTCNdQwCND5r
Art Image Compression Based on Lossless LZW Hashing Ciphering Algorithm
...Show More Authors
Abstract<p>Color image compression is a good way to encode digital images by decreasing the number of bits wanted to supply the image. The main objective is to reduce storage space, reduce transportation costs and maintain good quality. In current research work, a simple effective methodology is proposed for the purpose of compressing color art digital images and obtaining a low bit rate by compressing the matrix resulting from the scalar quantization process (reducing the number of bits from 24 to 8 bits) using displacement coding and then compressing the remainder using the Mabel ZF algorithm Welch LZW. The proposed methodology maintains the quality of the reconstructed image. Macroscopic and quantitative experimental results on technical color images show that the proposed methodology gives reconstructed images with a high PSNR value compared to standard image compression techniques.</p>
Scopus Crossref
View Publication
Publication Date
Sat Jun 01 2019
Journal Name
Journal Of Engineering And Applied Sciences
Enhancing LSB algorithm against brute-force attack using ASCII mapping technique
...Show More Authors

Publication Date
Thu Apr 30 2026
Journal Name
International Journal On Advanced Science Engineering Information Technology
Improving SVR Horse Herd Optimization Algorithm for Forecasting Daily Gold Prices
...Show More Authors

Accurate and correct price prediction of gold is significant to maintain the stability and fair operation of gold markets as well as the efficiency and proper functioning of financial markets related to gold trading. Gold prices have a long history of non-linear and non-stationary behavior that generates highly complex datasets which are very difficult to forecast with high accuracy and reliability. At the same time Support Vector Regression (SVR) has been utilized as a robust information for prediction not only gold prices but also overall metal price movements. First, the predictive capability of SVR is highly sensitive to hyperparameter selection which needs to be thoroughly tuned and optimized for potentially optimal performance. Theref

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm
...Show More Authors

View Publication
Crossref (23)
Crossref
Publication Date
Mon Aug 01 2011
Journal Name
Journal Of Engineering
IMPLEMENTATION OF ROOT FINDING ALGORITHM OF MINIMUM PHASE FILTER USING VHDL
...Show More Authors

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Oct 03 2025
Journal Name
Mesopotamian Journal Of Computer Science
Enhanced TEA Algorithm Performance using Affine Transformation and Chaotic Arnold Map
...Show More Authors

In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Fri May 05 2017
Journal Name
International Journal Of Science And Research (ijsr)
Automatic brain tumor segmentation from MRI images using region growing algorithm
...Show More Authors

LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2

View Publication
Publication Date
Tue Oct 16 2018
Journal Name
Springer Science And Business Media Llc
MOGSABAT: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems
...Show More Authors

Scopus (70)
Crossref (52)
Scopus Clarivate Crossref
Publication Date
Wed Oct 12 2022
Journal Name
Axioms
Razy: A String Matching Algorithm for Automatic Analysis of Pathological Reports
...Show More Authors

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

... Show More
View Publication
Scopus (3)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Tue Oct 01 2019
Journal Name
2019 International Conference On Electrical Engineering And Computer Science (icecos)
An Evolutionary Algorithm for Community Detection Using an Improved Mutation Operator
...Show More Authors

View Publication
Scopus (6)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (2)
Crossref