Preferred Language
Articles
/
HRdAMI8BVTCNdQwC5F-0
Developed JPEG Algorithm Applied in Image Compression
...Show More Authors
Abstract<p>JPEG is most popular image compression and encoding, this technique is widely used in many applications (images, videos and 3D animations). Meanwhile, researchers are very interested to develop this massive technique to compress images at higher compression ratios with keeping image quality as much as possible. For this reason in this paper we introduce a developed JPEG based on fast DCT and removed most of zeros and keeps their positions in a transformed block. Additionally, arithmetic coding applied rather than Huffman coding. The results showed up, the proposed developed JPEG algorithm has better image quality than traditional JPEG techniques.</p>
Scopus Crossref
View Publication
Publication Date
Wed Jun 01 2011
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Blind Color Image Steganography in Spatial Domain
...Show More Authors

WA Shukur, FA Abdullatif, Ibn Al-Haitham Journal For Pure and Applied Sciences, 2011 With wide spread of internet, and increase the price of information, steganography become very important to communication. Over many years used different types of digital cover to hide information as a cover channel, image from important digital cover used in steganography because widely use in internet without suspicious.

View Publication
Publication Date
Sun Jan 01 2017
Journal Name
Pertanika Journal Of Science & Technology
Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring
...Show More Authors

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res

... Show More
Scopus (9)
Scopus
Publication Date
Fri Dec 01 2023
Journal Name
Bulletin Of Electrical Engineering And Informatics
A comparative study of Gaussian mixture algorithm and K-means algorithm for efficient energy clustering in MWSN
...Show More Authors

Wireless sensor networks (WSNs) represent one of the key technologies in internet of things (IoTs) networks. Since WSNs have finite energy sources, there is ongoing research work to develop new strategies for minimizing power consumption or enhancing traditional techniques. In this paper, a novel Gaussian mixture models (GMMs) algorithm is proposed for mobile wireless sensor networks (MWSNs) for energy saving. Performance evaluation of the clustering process with the GMM algorithm shows a remarkable energy saving in the network of up to 92%. In addition, a comparison with another clustering strategy that uses the K-means algorithm has been made, and the developed method has outperformed K-means with superior performance, saving ener

... Show More
View Publication
Scopus (5)
Crossref (4)
Scopus Crossref
Publication Date
Sat Oct 01 2011
Journal Name
Journal Of Engineering
INTERACTION EFFECTS OF HYDRODYNAMICALLY FULLY DEVELOPED PRIMARY FLOW AND SECONDARY FLOW IN THE THERMAL ENTRANCE REGION OF ANNULAR DUCT
...Show More Authors

Experiments have been conducted to study the local and average heat transfer by mixed
convection for hydrodynamically fully developed, thermally developing and fully developed
laminar upward air flow in an inclined annulus with adiabatic inner cast iron tube and uniform
heated outer aluminum tube with an aspect ratio ( Ω = 0.72) and (L/Dh≈40) for both calming and
test sections). A wide range of Reynolds number from 859 to 2024 has been covered, and heat
flux has been varied from 159 W/m2 to 812 W/m2 (these values of heat flux and Reynolds
number gave Richardson number range from 0.03 to 0.٣٨), with angles of annulus inclination
φ =0o (horizontal position), φ =60o (inclined position), and φ =90o (vertical posi

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Mar 01 2019
Journal Name
Neurocomputing
A survey on video compression fast block matching algorithms
...Show More Authors

View Publication
Scopus (16)
Crossref (15)
Scopus Clarivate Crossref
Publication Date
Fri May 17 2013
Journal Name
International Journal Of Computer Applications
Fast Lossless Compression of Medical Images based on Polynomial
...Show More Authors

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.

View Publication Preview PDF
Crossref (7)
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
Publication Date
Sun Aug 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Audio compression using transforms and high order entropy encoding
...Show More Authors

<span>Digital audio is required to transmit large sizes of audio information through the most common communication systems; in turn this leads to more challenges in both storage and archieving. In this paper, an efficient audio compressive scheme is proposed, it depends on combined transform coding scheme; it is consist of i) bi-orthogonal (tab 9/7) wavelet transform to decompose the audio signal into low &amp; multi high sub-bands, ii) then the produced sub-bands passed through DCT to de-correlate the signal, iii) the product of the combined transform stage is passed through progressive hierarchical quantization, then traditional run-length encoding (RLE), iv) and finally LZW coding to generate the output mate bitstream.

... Show More
View Publication Preview PDF
Scopus (11)
Crossref (4)
Scopus 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 (43)
Crossref (28)
Scopus Clarivate Crossref
Publication Date
Mon Jan 01 2018
Journal Name
Communications In Computer And Information Science
Automatically Recognizing Emotions in Text Using Prediction by Partial Matching (PPM) Text Compression Method
...Show More Authors

In this paper, we investigate the automatic recognition of emotion in text. We perform experiments with a new method of classification based on the PPM character-based text compression scheme. These experiments involve both coarse-grained classification (whether a text is emotional or not) and also fine-grained classification such as recognising Ekman’s six basic emotions (Anger, Disgust, Fear, Happiness, Sadness, Surprise). Experimental results with three datasets show that the new method significantly outperforms the traditional word-based text classification methods. The results show that the PPM compression based classification method is able to distinguish between emotional and nonemotional text with high accuracy, between texts invo

... Show More
View Publication
Scopus (2)
Crossref (3)
Scopus Clarivate Crossref