Compressing an image and reconstructing it without degrading its original quality is one of the challenges that still exist now a day. A coding system that considers both quality and compression rate is implemented in this work. The implemented system applies a high synthetic entropy coding schema to store the compressed image at the smallest size as possible without affecting its original quality. This coding schema is applied with two transform-based techniques, one with Discrete Cosine Transform and the other with Discrete Wavelet Transform. The implemented system was tested with different standard color images and the obtained results with different evaluation metrics have been shown. A comparison was made with some previous rel

The mobile services are the most important media between many of telecommunication means such as the Internet and Telephone networks, And thatis be cause of its advantage represented by the high availability and independence of physical location and time,Therefore,  the need to protect the mobile information appeared against the changing and the misuse especially with the rapid and wide grow of  the mobile network and its wide usage through  different types  of information such as messages, images and videos. The proposed system uses the watermark as tool to protect images on a mobile device by registering them on a proposed watermarking server. This server allows the owner to protect his images by using invisible wat

Image Fusion is being used to gather important data from such an input image array and to place it in a single output picture to make it much more meaningful & usable than either of the input images. Image fusion boosts the quality and application of data. The accuracy of the image that has fused depending on the application. It is widely used in smart robotics, audio camera fusion, photonics, system control and output, construction and inspection of electronic circuits, complex computer, software diagnostics, also smart line assembling robots. In this paper provides a literature review of different image fusion techniques in the spatial domain and frequency domain, such as averaging, min-max, block substitution, Intensity-Hue-Saturation(IH

Human skin detection, which usually performed before image processing, is the method of discovering skin-colored pixels and regions that may be of human faces or limbs in videos or photos. Many computer vision approaches have been developed for skin detection. A skin detector usually transforms a given pixel into a suitable color space and then uses a skin classifier to mark the pixel as a skin or a non-skin pixel. A skin classifier explains the decision boundary of the class of a skin color in the color space based on skin-colored pixels. The purpose of this research is to build a skin detection system that will distinguish between skin and non-skin pixels in colored still pictures. This performed by introducing a metric that measu

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex

Convergence prop erties of Jackson polynomials have been considered by Zugmund
[1,ch.X] in (1959) and J.Szbados [2], (p =ï‚¥) while in (1983) V.A.Popov and J.Szabados [3]
(1 ï‚£p ï‚£ ï‚¥) have proved a direct inequality for Jackson polynomials in L
p-sp ace of 2-periodic bounded Riemann integrable functions (f R) in terms of some modulus of
continuity .
In 1991 S.K.Jassim proved direct and inverse inequality for Jackson polynomials in
locally global norms (L
,p) of 2-p eriodic bounded measurable functions (f L) in terms of
suitable Peetre K-functional [4].
Now the aim of our paper is to proved direct and inverse inequalities for Jackson
polynomials