Preferred Language
Articles
/
9RdhL48BVTCNdQwCRl1A
Lossless Compression of Medical Images using Multiresolution Polynomial Approximation Model
...Show More Authors

In this paper, a simple fast lossless image compression method is introduced for compressing medical images, it is based on integrates multiresolution coding along with polynomial approximation of linear based to decompose image signal followed by efficient coding. The test results indicate that the suggested method can lead to promising performance due to flexibility in overcoming the limitations or restrictions of the model order length and extra overhead information required compared to traditional predictive coding techniques.

Crossref
View Publication
Publication Date
Thu Feb 01 2018
Journal Name
Iet Signal Processing
Signal compression and enhancement using a new orthogonal‐polynomial‐based discrete transform
...Show More Authors

View Publication
Scopus (39)
Crossref (41)
Scopus Clarivate Crossref
Publication Date
Wed Dec 01 2021
Journal Name
Journal Of Physics: Conference Series
Art Image Compression Based on Lossless LZW Hashing Ciphering Algorithm
...Show More Authors
Abstract<p>Color image compression is a good way to encode digital images by decreasing the number of bits wanted to supply the image. The main objective is to reduce storage space, reduce transportation costs and maintain good quality. In current research work, a simple effective methodology is proposed for the purpose of compressing color art digital images and obtaining a low bit rate by compressing the matrix resulting from the scalar quantization process (reducing the number of bits from 24 to 8 bits) using displacement coding and then compressing the remainder using the Mabel ZF algorithm Welch LZW. The proposed methodology maintains the quality of the reconstructed image. Macroscopic and </p> ... Show More
View Publication
Scopus (5)
Crossref (2)
Scopus Crossref
Publication Date
Fri Aug 23 2013
Journal Name
International Journal Of Computer Applications
Image Compression based on Quadtree and Polynomial
...Show More Authors

View Publication
Crossref (3)
Crossref
Publication Date
Wed Jul 25 2018
Journal Name
International Journal Of Engineering Trends And Technology
Fixed Predictor Polynomial Coding for Image Compression
...Show More Authors

View Publication
Crossref (1)
Crossref
Publication Date
Wed Feb 01 2023
Journal Name
International Journal Of Engineering, Ije Transactions B: Applications
Adaptive Polynomial Coding of Multi-Base Hybrid Compression
...Show More Authors

Scopus (4)
Scopus
Publication Date
Sat Mar 11 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
On the Degree of Best Approximation of Unbounded Functions by Algebraic Polynomial
...Show More Authors

  In this paper we introduce a new class of degree of best algebraic approximation polynomial Α,, for unbounded functions in weighted space Lp,α(X), 1 ∞ .We shall prove direct and converse theorems for best algebraic approximation in terms modulus of smoothness in weighted space

View Publication Preview PDF
Publication Date
Fri May 16 2014
Journal Name
International Journal Of Computer Applications
Lossless Image Compression based on Predictive Coding and Bit Plane Slicing
...Show More Authors

View Publication
Crossref (4)
Crossref
Publication Date
Fri Jan 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Approximation Solution of Fuzzy Singular Volterra Integral Equation by Non-Polynomial Spline
...Show More Authors

A non-polynomial spline (NPS) is an approximation method that relies on the triangular and polynomial parts, so the method has infinite derivatives of the triangular part of the NPS to compensate for the loss of smoothness inherited by the polynomial. In this paper, we propose polynomial-free linear and quadratic spline types to solve fuzzy Volterra integral equations (FVIE) of the 2nd kind with the weakly singular kernel (FVIEWSK) and Abel's type kernel. The linear type algorithm gives four parameters to form a linear spline. In comparison, the quadratic type algorithm gives five parameters to create a quadratic spline, which is more of a credit for the exact solution. These algorithms process kernel singularities with a simple techniqu

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Mar 01 2013
Journal Name
Journal Of Economics And Administrative Sciences
Robust Two-Step Estimation and Approximation Local Polynomial Kernel For Time-Varying Coefficient Model With Balance Longitudinal Data
...Show More Authors

      In this research, the nonparametric technique has been presented to estimate the time-varying coefficients functions for the longitudinal balanced data that characterized by observations obtained through (n) from the independent subjects, each one of them is measured repeatedly by group of  specific time points (m). Although the measurements are independent among the different subjects; they are mostly connected within each subject and the applied techniques is the Local Linear kernel LLPK technique. To avoid the problems of dimensionality, and thick computation, the two-steps method has been used to estimate the coefficients functions by using the two former technique. Since, the two-

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Jan 01 2011
Journal Name
Communications In Computer And Information Science
The Use of Biorthogonal Wavelet, 2D Polynomial and Quadtree to Compress Color Images
...Show More Authors

In this paper, a compression system with high synthetic architect is introduced, it is based on wavelet transform, polynomial representation and quadtree coding. The bio-orthogonal (tap 9/7) wavelet transform is used to decompose the image signal, and 2D polynomial representation is utilized to prune the existing high scale variation of image signal. Quantization with quadtree coding are followed by shift coding are applied to compress the detail band and the residue part of approximation subband. The test results indicate that the introduced system is simple and fast and it leads to better compression gain in comparison with the case of using first order polynomial approximation.

View Publication
Scopus (1)
Crossref (1)
Scopus Crossref