Preferred Language
Articles
/
jxdFLZIBVTCNdQwC5qfl
Enhanced Computation Time for Fast Block Matching Algorithm
...Show More Authors

Scopus Crossref
View Publication
Publication Date
Wed Sep 15 2021
Journal Name
2021 International Conference On Computing And Communications Applications And Technologies (i3cat)
Parallel Hybrid String Matching Algorithm Using CUDA API Function
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Engineering
Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks
...Show More Authors

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

... Show More
View Publication Preview PDF
Publication Date
Sat Nov 05 2022
Journal Name
Sensors
Enhancement of the CAST Block Algorithm Based on Novel S-Box for Image Encryption
...Show More Authors

Background and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using si

... Show More
View Publication
Crossref (20)
Crossref
Publication Date
Mon Apr 26 2021
Journal Name
Journal Of Real-time Image Processing
Fast and efficient recursive algorithm of Meixner polynomials
...Show More Authors

View Publication
Scopus (34)
Crossref (31)
Scopus Clarivate Crossref
Publication Date
Tue Mar 26 2024
Journal Name
World Electric Vehicle Journal
Fast Finite-Time Composite Controller for Vehicle Steer-by-Wire Systems with Communication Delays
...Show More Authors

The modern steer-by-wire (SBW) systems represent a revolutionary departure from traditional automotive designs, replacing mechanical linkages with electronic control mechanisms. However, the integration of such cutting-edge technologies is not without its challenges, and one critical aspect that demands thorough consideration is the presence of nonlinear dynamics and communication network time delays. Therefore, to handle the tracking error caused by the challenge of time delays and to overcome the parameter uncertainties and external perturbations, a robust fast finite-time composite controller (FFTCC) is proposed for improving the performance and safety of the SBW systems in the present article. By lumping the uncertainties, parameter var

... Show More
View Publication
Scopus (24)
Crossref (22)
Scopus Clarivate Crossref
Publication Date
Mon Sep 30 2013
Journal Name
International Journal Of Network Security & Its Applications
Evaluating the Performance of the Secure Block Permutation Image Steganography Algorithm
...Show More Authors

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Nov 01 2020
Journal Name
2020 2nd Annual International Conference On Information And Sciences (aicis)
An Enhanced Multi-Objective Evolutionary Algorithm with Decomposition for Signed Community Detection Problem
...Show More Authors

View Publication
Scopus (8)
Crossref (2)
Scopus Crossref
Publication Date
Sun Sep 03 2017
Journal Name
Baghdad Science Journal
Scale-Invariant Feature Transform Algorithm with Fast Approximate Nearest Neighbor
...Show More Authors

There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (3)
Scopus Crossref
Publication Date
Mon May 01 2017
Journal Name
Australian Journal Of Basic And Applied Sciences
Sprite Region Allocation Using Fast Static Sprite Area Detection Algorithm
...Show More Authors

Background: Sprite coding is a very effective technique for clarifying the background video object. The sprite generation is an open issue because of the foreground objects which prevent the precision of camera motion estimation and blurs the created sprite. Objective: In this paper, a quick and basic static method for sprite area detection in video data is presented. Two statistical methods are applied; the mean and standard deviation of every pixel (over all group of video frame) to determine whether the pixel is a piece of the selected static sprite range or not. A binary map array is built for demonstrating the allocated sprite (as 1) while the non-sprite (as 0) pixels valued. Likewise, holes and gaps filling strategy was utilized to re

... Show More
View Publication Preview PDF
Publication Date
Wed Mar 23 2011
Journal Name
Ibn Al- Haitham J. For Pure & Appl. Sci.
Image Compression Using Proposed Enhanced Run Length Encoding Algorithm
...Show More Authors

In this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.

Preview PDF