The necessities of steganography methods for hiding secret message into images have been ascend. Thereby, this study is to generate a practical steganography procedure to hide text into image. This operation allows the user to provide the system with both text and cover image, and to find a resulting image that comprises the hidden text inside. The suggested technique is to hide a text inside the header formats of a digital image. Least Significant Bit (LSB) method to hide the message or text, in order to keep the features and characteristics of the original image are used. A new method is applied via using the whole image (header formats) to hide the image. From the experimental results, suggested technique that gives a higher embe

Accurate detection of Electro Cardio Graphic (ECG) features is an important demand for medical purposes, therefore an accurate algorithm is required to detect these features. This paper proposes an approach to classify the cardiac arrhythmia from a normal ECG signal based on wavelet decomposition and ID3 classification algorithm. First, ECG signals are denoised using the Discrete Wavelet Transform (DWT) and the second step is extract the ECG features from the processed signal. Interactive Dichotomizer 3 (ID3) algorithm is applied to classify the different arrhythmias including normal case. Massachusetts Institute of Technology-Beth Israel Hospital (MIT-BIH) Arrhythmia Database is used to evaluate the ID3 algorithm. The experimental resul

Image steganography is undoubtedly significant in the field of secure multimedia communication. The undetectability and high payload capacity are two of the important characteristics of any form of steganography. In this paper, the level of image security is improved by combining the steganography and cryptography techniques in order to produce the secured image. The proposed method depends on using LSBs as an indicator for hiding encrypted bits in dual tree complex wavelet coefficient DT-CWT. The cover image is divided into non overlapping blocks of size (3*3). After that, a Key is produced by extracting the center pixel (pc) from each block to encrypt each character in the secret text. The cover image is converted using DT-CWT, then the p

     Let  be any connected graph with vertices set  and edges set .  For any two distinct vertices  and , the detour distance between  and  which is denoted by  is a longest path between  and  in a graph . The detour polynomial of a connected graph  is denoted by ;  and is defined by . In this paper, the detour polynomial of the theta graph and the uniform theta graph will be computed.

The approach given in this paper leads to numerical methods to find the approximate solution of volterra integro –diff. equ.1st kind. First, we reduce it from integro VIDEs to integral VIEs of the 2nd kind by using the reducing theory, then we use two types of Non-polynomial spline function (linear, and quadratic). Finally, programs for each method are written in MATLAB language and a comparison between these two types of Non-polynomial spline function is made depending on the least square errors and running time. Some test examples and the exact solution are also given.

A super pixel can be defined as a group of pixels, which have similar characteristics, which can be very helpful for image segmentation. It is generally color based segmentation as well as other features like texture, statistics…etc .There are many algorithms available to segment super pixels like Simple Linear Iterative Clustering (SLIC) super pixels and Density-Based Spatial Clustering of Application with Noise (DBSCAN). SLIC algorithm essentially relay on choosing N random or regular seeds points covering the used image for segmentation. In this paper Split and Merge algorithm was used instead to overcome determination the seed point's location and numbers as well as other used parameters. The overall results were better from the SL

    When images are customized to identify changes that have occurred using techniques such as spectral signature, which can be used to extract features, they can be of great value. In this paper, it was proposed to use the spectral signature to extract information from satellite images and then classify them into four categories. Here it is based on a set of data from the Kaggle satellite imagery website that represents different categories such as clouds, deserts, water, and green areas. After preprocessing these images, the data is transformed into a spectral signature using the Fast Fourier Transform (FFT) algorithm. Then the data of each image is reduced by selecting the top 20 features and transforming them from a two-dimensiona

The Hartley transform generalizes to the fractional Hartley transform (FRHT) which gives various uses in different fields of image encryption. Unfortunately, the available literature of fractional Hartley transform is unable to provide its inversion theorem. So accordingly original function cannot retrieve directly, which restrict its applications. The intension of this paper is to propose inversion theorem of fractional Hartley transform to overcome this drawback. Moreover, some properties of fractional Hartley transform are discussed in this paper.

Compression of speech signal is an essential field in signal processing. Speech compression is very important in today’s world, due to the limited bandwidth transmission and storage capacity. This paper explores a Contourlet transformation based methodology for the compression of the speech signal. In this methodology, the speech signal is analysed using Contourlet transformation coefficients with statistic methods as threshold values, such as Interquartile Filter (IQR), Average Absolute Deviation (AAD), Median Absolute Deviation (MAD) and standard deviation (STD), followed by the application of (Run length encoding) They are exploited for recording speech in different times (5, 30, and 120 seconds). A comparative study of performance