A new (lossless)‎ method of images compression by decomposing the tree of Huffman technique

العناوين الأخرى

طريقة جديدة لضغط الصور (دون فقدان البيانات)‎ باستخدام التوزيع لتقنية هوفمان

مقدم أطروحة جامعية

al-Khalayilah, Mahmud Abd M.

مشرف أطروحة جامعية

Utair, Muhammad

أعضاء اللجنة

al-Shatnawi, Muhammad
Kanan, Ghassan

الجامعة

جامعة عمان العربية

الكلية

كلية العلوم الحاسوبية و المعلوماتية

القسم الأكاديمي

قسم علم الحاسوب

دولة الجامعة

الأردن

الدرجة العلمية

ماجستير

تاريخ الدرجة العلمية

2014

الملخص الإنجليزي

The size of the data storages is exponentially increasing.

To store such data including images to make them obtainable over network, efficient compression techniques are necessary, because the original images need large amount of disk space.

Consequently, the transmission bandwidth and time can be considered a serious trouble if the compression does not implement.

Generally, the main purpose for image compression is to decrease the amount of data required for representing digital images.

Therefore, most of troubles can be resolved.

Image compression techniques can be categorized into lossless and lossy compression techniques.

The well known lossless technique is a Huffman coding which will be used in the presented method.

Great efforts have been achieved to enhance image compression ratio (CR) using Huffman coding.

This thesis has presented a New Lossless Method of Images Compression by Decomposing the Tree of Huffman Technique (LM-DH).

It focuses on producing good compression ratio (CR) better than classical Huffman coding technique.

It also achieves greater speed in implementation compared with regular Huffman coding especially the greater size of images.

LM-DH has two phases exactly as the Huffman technique: compress and decompress the original grey scale image.

These phases have been developed and implemented in MATLAB platform.

The results depict that the performance of classical Huffman coding technique can be enhanced by the proposed technique.

LM-DH achieves up to 23% compression ratio more than the classical Huffman technique.

Moreover in some images the speed of LM-DH method is better than regular Huffman coding technique up to 85%.

التخصصات الرئيسية

تكنولوجيا المعلومات وعلم الحاسوب

الموضوعات

عدد الصفحات

67

قائمة المحتويات

Table of contents.

Abstract.

Abstract in Arabic.

Chapter One : Introduction.

Chapter Two : Background.

Chapter Three : Literature reviews.

Chapter Four : New lossless method of images compression by decomposing the tree of Huffman technique (LM-DH).

Chapter Five : Experiments.

Chapter Six : Discussion and conclusion.

References.

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

al-Khalayilah, Mahmud Abd M.. (2014). A new (lossless) method of images compression by decomposing the tree of Huffman technique. (Master's theses Theses and Dissertations Master). Amman Arab University, Jordan
https://search.emarefa.net/detail/BIM-562100

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

al-Khalayilah, Mahmud Abd M.. A new (lossless) method of images compression by decomposing the tree of Huffman technique. (Master's theses Theses and Dissertations Master). Amman Arab University. (2014).
https://search.emarefa.net/detail/BIM-562100

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

al-Khalayilah, Mahmud Abd M.. (2014). A new (lossless) method of images compression by decomposing the tree of Huffman technique. (Master's theses Theses and Dissertations Master). Amman Arab University, Jordan
https://search.emarefa.net/detail/BIM-562100

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-562100