Preferred Language
Articles
/
1BcCMI8BVTCNdQwCx165
Image Compression based on Fixed Predictor Multiresolution Thresholding of Linear Polynomial Nearlossless Techniques
...Show More Authors

Image compression is a serious issue in computer storage and transmission,  that simply makes efficient use of redundancy embedded within an image itself; in addition, it may exploit human vision or perception limitations to reduce the imperceivable information Polynomial coding is a modern image compression technique based on modelling concept to remove the spatial redundancy embedded within the image effectively that composed of two parts, the  mathematical model and the residual. In this paper, two stages proposed technqies adopted, that starts by utilizing the lossy predictor model along with multiresolution base and thresholding techniques corresponding to first stage. Latter by incorporating the near lossless compression scheme of first stage that corresponding to second stage. The tested results shown are promising  in both two stages, that implicilty enhanced the performance of traditional polynomial model in terms of compression ratio , and preresving image quality.

Crossref
View Publication
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
Image Steganography using Dynamic Threshold based on Discrete Cosine Transform
...Show More Authors

The art of preventing the detection of hidden information messages is the way that steganography work. Several algorithms have been proposed for steganographic techniques. A major portion of these algorithms is specified for image steganography because the image has a high level of redundancy. This paper proposed an image steganography technique using a dynamic threshold produced by the discrete cosine coefficient. After dividing the green and blue channel of the cover image into 1*3-pixel blocks, check if any bits of green channel block less or equal to threshold then start to store the secret bits in blue channel block, and to increase the security not all bits in the chosen block used to store the secret bits. Firstly, store in the cente

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (6)
Scopus Crossref
Publication Date
Tue Aug 14 2018
Journal Name
International Journal Of Engineering & Technology
Hybrid DWT-DCT compression algorithm & a new flipping block with an adaptive RLE method for high medical image compression ratio
...Show More Authors

Huge number of medical images are generated and needs for more storage capacity and bandwidth for transferring over the networks. Hybrid DWT-DCT compression algorithm is applied to compress the medical images by exploiting the features of both techniques. Discrete Wavelet Transform (DWT) coding is applied to image YCbCr color model which decompose image bands into four subbands (LL, HL, LH and HH). The LL subband is transformed into low and high frequency components using Discrete Cosine Transform (DCT) to be quantize by scalar quantization that was applied on all image bands, the quantization parameters where reduced by half for the luminance band while it is the same for the chrominance bands to preserve the image quality, the zig

... Show More
View Publication
Crossref
Publication Date
Fri Apr 15 2016
Journal Name
International Journal Of Computer Applications
Hybrid Techniques based Speech Recognition
...Show More Authors

Information processing has an important application which is speech recognition. In this paper, a two hybrid techniques have been presented. The first one is a 3-level hybrid of Stationary Wavelet Transform (S) and Discrete Wavelet Transform (W) and the second one is a 3-level hybrid of Discrete Wavelet Transform (W) and Multi-wavelet Transforms (M). To choose the best 3-level hybrid in each technique, a comparison according to five factors has been implemented and the best results are WWS, WWW, and MWM. Speech recognition is performed on WWS, WWW, and MWM using Euclidean distance (Ecl) and Dynamic Time Warping (DTW). The match performance is (98%) using DTW in MWM, while in the WWS and WWW are (74%) and (78%) respectively, but when using (

... Show More
View Publication
Crossref
Publication Date
Mon Oct 02 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Image Encryption Techniques Using Dynamic Approach: An Article Review
...Show More Authors

In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the production of the inverted S-box with the S-box. Compared to the methods in the literature, the need to store the S-box is eliminated. Also, the fabr

... Show More
View Publication
Publication Date
Fri Sep 01 2017
Journal Name
International Journal Of Engineering Research And Advanced Technology
. Medical Image Compression using Hybrid Technique of Wavelet Transformation and Seed Selective Predictive Method
...Show More Authors

Publication Date
Thu Sep 15 2022
Journal Name
Knowledge And Information Systems
Multiresolution hierarchical support vector machine for classification of large datasets
...Show More Authors

Support vector machine (SVM) is a popular supervised learning algorithm based on margin maximization. It has a high training cost and does not scale well to a large number of data points. We propose a multiresolution algorithm MRH-SVM that trains SVM on a hierarchical data aggregation structure, which also serves as a common data input to other learning algorithms. The proposed algorithm learns SVM models using high-level data aggregates and only visits data aggregates at more detailed levels where support vectors reside. In addition to performance improvements, the algorithm has advantages such as the ability to handle data streams and datasets with imbalanced classes. Experimental results show significant performance improvements in compa

... Show More
View Publication
Scopus (6)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Wed Mar 10 2021
Journal Name
Baghdad Science Journal
Compression-based Data Reduction Technique for IoT Sensor Networks
...Show More Authors

Energy savings are very common in IoT sensor networks because IoT sensor nodes operate with their own limited battery. The data transmission in the IoT sensor nodes is very costly and consume much of the energy while the energy usage for data processing is considerably lower. There are several energy-saving strategies and principles, mainly dedicated to reducing the transmission of data. Therefore, with minimizing data transfers in IoT sensor networks, can conserve a considerable amount of energy. In this research, a Compression-Based Data Reduction (CBDR) technique was suggested which works in the level of IoT sensor nodes. The CBDR includes two stages of compression, a lossy SAX Quantization stage which reduces the dynamic range of the

... Show More
View Publication Preview PDF
Scopus (41)
Crossref (28)
Scopus Clarivate Crossref
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
Tue Mar 01 2016
Journal Name
International Journal Of Computer Science And Mobile Computing
Content-Based Cartoon Image Retrieval
...Show More Authors

Publication Date
Sun Mar 02 2014
Journal Name
Baghdad Science Journal
On Solving Hyperbolic Trajectory Using New Predictor-Corrector Quadrature Algorithms
...Show More Authors

In this Paper, we proposed two new predictor corrector methods for solving Kepler's equation in hyperbolic case using quadrature formula which plays an important and significant rule in the evaluation of the integrals. The two procedures are developed that, in two or three iterations, solve the hyperbolic orbit equation in a very efficient manner, and to an accuracy that proves to be always better than 10-15. The solution is examined with and with grid size , using the first guesses hyperbolic eccentric anomaly is and , where is the eccentricity and is the hyperbolic mean anomaly.

View Publication Preview PDF
Crossref