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

    Multiple applications use offline handwritten signatures for human verification. This fact increases the need for building a computerized system for signature recognition and verification schemes to ensure the highest possible level of security from counterfeit signatures. This research is devoted to developing a system for offline signature verification based on a combination of local ridge features and other features obtained from applying two-level Haar wavelet transform. The proposed system involves many preprocessing steps that include a group of image processing techniques (including: many enhancement techniques, region of interest allocation, converting to a binary image, and Thinning). In feature extraction and

In computer vision, visual object tracking is a significant task for monitoring
applications. Tracking of object type is a matching trouble. In object tracking, one
main difficulty is to select features and build models which are convenient for
distinguishing and tracing the target. The suggested system for continuous features
descriptor and matching in video has three steps. Firstly, apply wavelet transform on
image using Haar filter. Secondly interest points were detected from wavelet image
using features from accelerated segment test (FAST) corner detection. Thirdly those
points were descripted using Speeded Up Robust Features (SURF). The algorithm
of Speeded Up Robust Features (SURF) has been employed and impl

        The secure data transmission over internet is achieved using Steganography. It is the art and science of concealing information in unremarkable cover media so as not to arouse an observer’s suspicion. In this paper the color cover image is divided into equally four parts, for each part select one channel from each part( Red, or Green, or  Blue), choosing one of these channel depending on the high color ratio in that part. The chosen part is decomposing into four parts {LL, HL, LH, HH} by using discrete wavelet transform. The hiding image is divided into four part n*n then apply DCT on each part. Finally the four DCT coefficient parts embedding in four high frequency sub-bands {HH} in

The digital multimedia systems become standard at this time because of their extremely sensory activity effects and also the advanced development in its corresponding technology. Recently, biological techniques applied to several varieties of applications such as authentication protocols, organic chemistry, and cryptography. Deoxyribonucleic Acid (DNA) is a tool to hide the key information in multimedia platforms.
In this paper, an embedding algorithm is introduced; first, the image is divided into equally sized blocks, these blocks checked for a small amount color in all the separated blocks. The selected blocks are used to localize the necessary image information. In the second stage, a comparison is between the initial image pixel

<p>In this paper, a simple color image compression system has been proposed using image signal decomposition. Where, the RGB image color band is converted to the less correlated YUV color model and the pixel value (magnitude) in each band is decomposed into 2-values; most and least significant. According to the importance of the most significant value (MSV) that influenced by any simply modification happened, an adaptive lossless image compression system is proposed using bit plane (BP) slicing, delta pulse code modulation (Delta PCM), adaptive quadtree (QT) partitioning followed by an adaptive shift encoder. On the other hand, a lossy compression system is introduced to handle the least significant value (LSV), it is based on

Currently no one can deny the importance of data protection, especially with the proliferation of hackers and theft of personal information in all parts of the world .for these reasons the encryption has become one of the important fields in the protection of digital information.
This paper adopts a new image encryption method to overcome the obstacles to previous image encryption methods, where our method will be used Duffing map to shuffled all image pixels ,after that the resulting image will be divided into a group of blocks for perform the shuffling process via Cross Chaotic Map.
Finally, an image called key image was created by using Quadratic number spirals which will be used to generate nu