Preferred Language
Articles
/
Vhg2WZQBVTCNdQwCvAVr
Image Cryptography Based on Chebyshev Polynomials and Transposition- Substitution Transformations
...Show More Authors

The confirming of security and confidentiality of multimedia data is a serious challenge through the growing dependence on digital communication. This paper offers a new image cryptography based on the Chebyshev chaos polynomials map, via employing the randomness characteristic of chaos concept to improve security. The suggested method includes block shuffling, dynamic offset chaos key production, inter-layer XOR, and block 90 degree rotations to disorder the correlations intrinsic in image. The method is aimed for efficiency and scalability, accomplishing  complexity order for n-pixels over specific cipher rounds. The experiment outcomes depict great resistant to cryptanalysis attacks, containing statistical, differential and brute-force attacks, due to its big key space size and sensitivity to initial values. This algorithm be responsible for a forceful and flexible solution for acquiring secure images, appropriate for high resolution data and real time applications.

Crossref
View Publication
Publication Date
Sun Dec 31 2023
Journal Name
Iraqi Journal Of Information And Communication Technology
EEG Signal Classification Based on Orthogonal Polynomials, Sparse Filter and SVM Classifier
...Show More Authors

This work implements an Electroencephalogram (EEG) signal classifier. The implemented method uses Orthogonal Polynomials (OP) to convert the EEG signal samples to moments. A Sparse Filter (SF) reduces the number of converted moments to increase the classification accuracy. A Support Vector Machine (SVM) is used to classify the reduced moments between two classes. The proposed method’s performance is tested and compared with two methods by using two datasets. The datasets are divided into 80% for training and 20% for testing, with 5 -fold used for cross-validation. The results show that this method overcomes the accuracy of other methods. The proposed method’s best accuracy is 95.6% and 99.5%, respectively. Finally, from the results, it

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Mon Mar 01 2021
Journal Name
Iop Conference Series: Materials Science And Engineering
An efficient multistage CBIR based on Squared Krawtchouk-Tchebichef polynomials
...Show More Authors
Abstract<p>Image databases are increasing exponentially because of rapid developments in social networking and digital technologies. To search these databases, an efficient search technique is required. CBIR is considered one of these techniques. This paper presents a multistage CBIR to address the computational cost issues while reasonably preserving accuracy. In the presented work, the first stage acts as a filter that passes images to the next stage based on SKTP, which is the first time used in the CBIR domain. While in the second stage, LBP and Canny edge detectors are employed for extracting texture and shape features from the query image and images in the newly constructed database. The p</p> ... Show More
View Publication
Crossref (4)
Crossref
Publication Date
Tue Jun 04 2024
Journal Name
Computation
High-Performance Krawtchouk Polynomials of High Order Based on Multithreading
...Show More Authors

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

... Show More
View Publication
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Fri Aug 23 2013
Journal Name
International Journal Of Computer Applications
Image Compression based on Quadtree and Polynomial
...Show More Authors

View Publication
Crossref (3)
Crossref
Publication Date
Fri Mar 01 2019
Journal Name
Al-khwarizmi Engineering Journal
A New Fractal Printed Dipole Antenna Based on Tent Transformations for Wireless Communication Applications
...Show More Authors

In this paper, a compact multiband printed dipole antenna is presented as a candidate for use in wireless communication applications. The proposed fractal antenna design is based on the second level tent transformation. The space-filling property of this fractal geometry permits producing longer lengths in a more compact size. Theoretical performance of this antenna has been calculated using the commercially available software IE3D from Zeland Software Inc. This electromagnetic simulator is based on the method of moments (MoM). The proposed dipole antenna has been found to possess a considerable size reduction compared with the conventional printed or wire dipole antenna designed at the same design frequency and using the same substrate

... Show More
View Publication Preview PDF
Publication Date
Thu Dec 01 2022
Journal Name
Baghdad Science Journal
Steganography and Cryptography Techniques Based Secure Data Transferring Through Public Network Channel
...Show More Authors

Attacking a transferred data over a network is frequently happened millions time a day. To address this problem, a secure scheme is proposed which is securing a transferred data over a network. The proposed scheme uses two techniques to guarantee a secure transferring for a message. The message is encrypted as a first step, and then it is hided in a video cover.  The proposed encrypting technique is RC4 stream cipher algorithm in order to increase the message's confidentiality, as well as improving the least significant bit embedding algorithm (LSB) by adding an additional layer of security. The improvement of the LSB method comes by replacing the adopted sequential selection by a random selection manner of the frames and the pixels wit

... Show More
View Publication Preview PDF
Scopus (8)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Tue Dec 07 2021
Journal Name
2021 14th International Conference On Developments In Esystems Engineering (dese)
Content Based Image Retrieval Based on Feature Fusion and Support Vector Machine
...Show More Authors

View Publication
Scopus (6)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sat Feb 25 2017
Journal Name
International Journal On Advanced Science, Engineering And Information Technology
A Novel DNA Sequence Approach for Network Intrusion Detection System Based on Cryptography Encoding Method
...Show More Authors

A novel method for Network Intrusion Detection System (NIDS) has been proposed, based on the concept of how DNA sequence detects disease as both domains have similar conceptual method of detection. Three important steps have been proposed to apply DNA sequence for NIDS: convert the network traffic data into a form of DNA sequence using Cryptography encoding method; discover patterns of Short Tandem Repeats (STR) sequence for each network traffic attack using Teiresias algorithm; and conduct classification process depends upon STR sequence based on Horspool algorithm. 10% KDD Cup 1999 data set is used for training phase. Correct KDD Cup 1999 data set is used for testing phase to evaluate the proposed method. The current experiment results sh

... Show More
View Publication
Scopus (9)
Crossref (5)
Scopus Crossref
Publication Date
Mon Feb 04 2019
Journal Name
Journal Of The College Of Education For Women
Image Watermarking based on Huffman Coding and Laplace Sharpening
...Show More Authors

In this paper, an algorithm through which we can embed more data than the
regular methods under spatial domain is introduced. We compressed the secret data
using Huffman coding and then this compressed data is embedded using laplacian
sharpening method.
We used Laplace filters to determine the effective hiding places, then based on
threshold value we found the places with the highest values acquired from these filters
for embedding the watermark. In this work our aim is increasing the capacity of
information which is to be embedded by using Huffman code and at the same time
increasing the security of the algorithm by hiding data in the places that have highest
values of edges and less noticeable.
The perform

... Show More
View Publication Preview PDF
Publication Date
Mon Jan 20 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Image Steganography Based on Wavelet Transform and Histogram Modification
...Show More Authors

      Recently, digital communication has become a critical necessity and so the Internet has become the most used medium and most efficient for digital communication. At the same time, data transmitted through the Internet are becoming more vulnerable. Therefore, the issue of maintaining secrecy of data is very important, especially if the data is personal or confidential. Steganography has provided a reliable method for solving such problems. Steganography is an effective technique in secret communication in digital worlds where data sharing and transfer is increasing through the Internet, emails and other ways. The main challenges of steganography methods are the undetectability and the imperceptibility of con

... Show More
View Publication Preview PDF
Crossref