Some problems want to be solved in image compression to make the process workable and more efficient. Much work had been done in the field of lossy image compression based on wavelet and Discrete Cosine Transform (DCT). In this paper, an efficient image compression scheme is proposed, based on a common encoding transform scheme; It consists of the following steps: 1) bi-orthogonal (tab 9/7) wavelet transform to split the image data into sub-bands, 2) DCT to de-correlate the data, 3) the combined transform stage's output is subjected to scalar quantization before being mapped to positive, 4) and LZW encoding to produce the compressed data. The peak signal-to-noise (PSNR), compression ratio (CR), and compression gain (CG) measures were used t

many painters tried to mix colors with Music by direct employment through colorful musical pieces or the use of multiple instruments and techniques , or vice versa, including the French artist )Robert Stroben(, he transferred the piece of music to be depicted on the painting and worked on the tones of music (Johann Sebastian Bach) by dropping the color on the lines of the musical scale, for example (the C tone) ranging from brown to red ( Tone La A) from gray to orange, and so on, the presence of links and similarity factors between the world of music and the world of colors facilitated the process of linking musical notes with colors, the most famous of which was presented by the world (Newton) in the circle of basic colors and linking

     The widespread use of images, especially color images and rapid advancement of computer science, have led to an emphasis on securing these images and defending them against intruders. One of the most popular ways to protect images is to use encryption algorithms that convert data in a way that is not recognized by someone other than the intended user. The Advanced Encryption Standard algorithm (AES) is one of the most protected encryption algorithms. However, due to various types of theoretical and practical assaults, like a statistical attack, differential analysis, and brute force attack, its security is under attack.

In this paper, a modified AES coined as (M-AES) is proposed to improve the efficiency

Background: Coated aesthetic archwires are currently the existing solutions for the esthetic problem, but the color of these archwires tends to change overtime. This study was aimed to evaluate the color stability of different types of esthetic archwires from four different companies at different time periods after immersion of two different staining drinks which are tea and Pepsi cola. Materials and methods: 48 specimens were prepared, each specimen contains 10 aesthetic archwires; and were divided according to type of solution into two groups: A (tea) &B (Pepsi cola); each group contained 24 specimens (12 specimens were immersed in the staining solution as 4 specimens for each time intervals and 12 specimens were immersed in distilled wa

A total of 13 samples of domestic cat Felis cattus (Linnaeus, 1758 ) and 9 samples of wild cat Felis chaus furax (de Winton, 1898) of the Felidae Family were trapped and examined to detect the hard ticks. The areas of the collection were: Baghdad, Al-Rashidiya, Tharthar, Nahrawan, AL-Mahmoudiya (middle of Iraq) and AL-Haretha (south of Iraq), Mosul (north of Iraq). The results of the current study revealed that four species belong to two genera of hard ticks: Haemaphysalis sp. (Koch, 1844), Rhipicephalus turanicus (Morel, 1969), Rhipicephalus sanguineus (Neumann, 1904) and Rhipicephalus appendiculatus (Santos, 1955). The rates and the density of infestation were discussed. The current study aimed to clarify the infestation differe

In this paper, a fast lossless image compression method is introduced for compressing medical images, it is based on splitting the image blocks according to its nature along with using the polynomial approximation to decompose image signal followed by applying run length coding on the residue part of the image, which represents the error caused by applying polynomial approximation. Then, Huffman coding is applied as a last stage to encode the polynomial coefficients and run length coding. The test results indicate that the suggested method can lead to promising performance.