Preferred Language
Articles
/
wRcPPo8BVTCNdQwComRb
Lossless Image Compression based on Predictive Coding and Bit Plane Slicing
...Show More Authors

Crossref
View Publication
Publication Date
Sun Jun 01 2014
Journal Name
International Journal Of Advanced Research In Computer Science And Software Engineering
Medical Image Compression using Wavelet Quadrants of Polynomial Prediction Coding & Bit Plane Slicing
...Show More Authors

Publication Date
Sun May 01 2016
Journal Name
International Journal Of Computer Applications
Lossless Image Compression using Adaptive Predictive Coding of Selected Seed Values
...Show More Authors

Publication Date
Mon Jun 01 2015
Journal Name
. International Journal Of Computer Science And Mobile Computing
A Hybrid Lossy Image Compression based on Wavelet Transform, Polynomial Approximation Model, Bit Plane Slicing and Absolute Moment Block Truncation
...Show More Authors

Publication Date
Sat Jun 01 2019
Journal Name
International Journal Of Computer Science And Mobile Computing
Hierarchal Polynomial Coding of Grayscale Lossless Image Compression
...Show More Authors

Publication Date
Mon Mar 20 2023
Journal Name
2023 International Conference On Information Technology, Applied Mathematics And Statistics (icitams)
Hybrid Color Image Compression Using Signals Decomposition with Lossy and Lossless Coding Schemes
...Show More Authors

View Publication
Scopus (1)
Scopus 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 (4)
Crossref (2)
Scopus Crossref
Publication Date
Mon Sep 16 2019
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
New Techniques of Watermark Images using Bit Plane Slicing and Cubic-spline Interpolation
...Show More Authors

A watermark is a pattern or image defined in a paper that seems as different shades of light/darkness when viewed by the transmitted light which used for improving the robustness and security. There are many ways to work Watermark, including the addition of an image or text to the original image, but in this paper was proposed another type of watermark is add curves, line or forms have been drawn by interpolation, which produces watermark difficult to falsify and manipulate it. Our work suggests new techniques of watermark images which is embedding Cubic-spline interpolation inside the image using Bit Plane Slicing. The Peak to Signal Noise Ratio (PSNR) and Mean Square Error (MSE) value is calculated so that the quality of the original i

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Apr 01 2016
Journal Name
Iosr Journal Of Computer Engineering
Lossless and Lossy Polynomial Image Compression
...Show More Authors

Crossref (1)
Crossref
Publication Date
Fri Apr 01 2016
Journal Name
Iosr Journal Of Computer Engineering
Lossless and Lossy Polynomial Image Compression
...Show More Authors

View Publication
Crossref (1)
Crossref
Publication Date
Sat Dec 02 2017
Journal Name
Al-khwarizmi Engineering Journal
Speech Signal Compression Using Wavelet And Linear Predictive Coding
...Show More Authors

A new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th

... Show More
View Publication Preview PDF