Preferred Language
Articles
/
ijs-6353
Image Signal Decomposition Using Polynomial Representation with Hybrid Lossy and Non-Lossy Coding Scheme

This article presents a polynomial-based image compression scheme, which consists of using the color model (YUV) to represent color contents and using two-dimensional polynomial coding (first-order) with variable block size according to correlation between neighbor pixels. The residual part of the polynomial for all bands is analyzed into two parts, most important (big) part, and least important (small) parts. Due to the significant subjective importance of the big group; lossless compression (based on Run-Length spatial coding) is used to represent it. Furthermore, a lossy compression system scheme is utilized to approximately represent the small group; it is based on an error-limited adaptive coding system and using the transform coding scheme (discrete cosine transform or bi-orthogonal transform). Experimentally, the developed system has achieved high compression ratios with acceptable quality for color images. The performance results are comparable to those introduced in recent studies; the accomplishment of the introduced image compression system was analyzed and compared with the performance of the JPEG standard. The results of the developed system show better performance than that of the JPEG standard.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Fri Jan 01 2021
Journal Name
Communications In Computer And Information Science
Audio Compression Using Transform Coding with LZW and Double Shift Coding

Home New Trends in Information and Communications Technology Applications Conference paper Audio Compression Using Transform Coding with LZW and Double Shift Coding Zainab J. Ahmed & Loay E. George Conference paper First Online: 11 January 2022 126 Accesses Part of the Communications in Computer and Information Science book series (CCIS,volume 1511) Abstract The need for audio compression is still a vital issue, because of its significance in reducing the data size of one of the most common digital media that is exchanged between distant parties. In this paper, the efficiencies of two audio compression modules were investigated; the first module is based on discrete cosine transform and the second module is based on discrete wavelet tr

... Show More
Crossref (2)
Crossref
View Publication Preview PDF
Publication Date
Sun Jun 01 2014
Journal Name
Baghdad Science Journal
Solution of Second Kind Volterra Integral Equations Using Non-Polynomial Spline Functions

In this paper we use non-polynomial spline functions to develop numerical methods to approximate the solution of 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of these method, and to compare the computed results with other known methods.

Crossref
View Publication Preview PDF
Publication Date
Sat Dec 01 2018
Journal Name
Indian Journal Of Ecology
Scopus (1)
Scopus
Publication Date
Wed Sep 01 2021
Journal Name
Baghdad Science Journal
An Efficient Image Encryption Using a Dynamic, Nonlinear and Secret Diffusion Scheme

The growing use of tele

This paper presents a new secret diffusion scheme called Round Key Permutation (RKP) based on the nonlinear, dynamic and pseudorandom permutation for encrypting images by block, since images are considered particular data because of their size and their information, which are two-dimensional nature and characterized by high redundancy and strong correlation. Firstly, the permutation table is calculated according to the master key and sub-keys. Secondly, scrambling pixels for each block to be encrypted will be done according the permutation table. Thereafter the AES encryption algorithm is used in the proposed cryptosystem by replacing the linear permutation of ShiftRows step with the nonlinear and secret pe

... Show More
Scopus (1)
Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Fri Aug 23 2013
Journal Name
International Journal Of Computer Applications
Crossref (3)
Crossref
View Publication
Publication Date
Mon Apr 15 2019
Journal Name
Proceedings Of The International Conference On Information And Communication Technology
Scopus (24)
Crossref (22)
Scopus Clarivate Crossref
View Publication
Publication Date
Sun Jan 01 2023
Journal Name
2nd International Conference On Mathematical Techniques And Applications: Icmta2021
Scopus Crossref
View Publication
Publication Date
Sun May 01 2016
Journal Name
International Journal Of Computer Applications
Publication Date
Tue Jan 01 2013
Journal Name
International Journal Of Computer Applications
Content-based Image Retrieval (CBIR) using Hybrid Technique

Image retrieval is used in searching for images from images database. In this paper, content – based image retrieval (CBIR) using four feature extraction techniques has been achieved. The four techniques are colored histogram features technique, properties features technique, gray level co- occurrence matrix (GLCM) statistical features technique and hybrid technique. The features are extracted from the data base images and query (test) images in order to find the similarity measure. The similarity-based matching is very important in CBIR, so, three types of similarity measure are used, normalized Mahalanobis distance, Euclidean distance and Manhattan distance. A comparison between them has been implemented. From the results, it is conclud

... Show More
View Publication
Publication Date
Sun May 17 2020
Journal Name
Iraqi Journal Of Science
Numerical Treatment of First Order Volterra Integro-Differential Equation Using Non-Polynomial Spline Functions

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.

View Publication Preview PDF