Image Compression Terminology

Image Compression Terminology
Slide Note
Embed
Share

The terminology between original images, image compression, compression ratio, bits per pixel, uncompressed file size, storage savings, transmission data, and more in the context of multimedia data and real-time playback challenges. Delve into the goal of image compression and the JPEG compression standard methods.

  • Image Compression
  • Multimedia Data
  • Transmission
  • Compression Ratio
  • JPEG Standard

Uploaded on Feb 18, 2025 | 0 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.

E N D

Presentation Transcript


  1. The terminology between original image and image compression Compression Ratio Bit per pixel 2

  2. Uncompress ed File Size = = Compressio n Ratio C R Compressed File Size Example: Original Image Size = 256X256(pixels) X 1(byte/pixel) = 65536 bytes Image 256X256 pixels, 256 level grayscale can be compressed file size 6554 byte. 65536 = 10 compressio n Ratio 6554 3

  3. Number of Bits = Bits per Pixel Number of Pixels Example: Original Image Size = 256X256(pixels) X 1(byte/pixel) = 65536 bytes Image 256X256 pixels, 256 level grayscale can be compressed file size 6554 byte. Compressed file = 6554(bytes)X8(bits/pixel) = 52432 bits 52432 = 8 . 0 Bits per Pixel 65536 4

  4. Savings in storage and transmission data multimedia data (example: image and video) memiliki ukuran data yang besar. difficult to send real-time uncompressed video over current network relatif lambat perangkat penyimpanan mereka dan tidak memungkinkan play back multimedia data secara real time. Perangkat penyimpanan relatif lambat Tidak memungkinkannya playing back uncompressed multimedia data in real time 1x CD-ROM transfer rate ~ 150 kB/s 320 x 240 x 24 fps color video bit rate ~ 5.5MB/s => 36 seconds needed to transfer 1-sec uncompressed video from CD

  5. Transmission To transmit an RGB 512X512, 24 bit image via modem 28.8 kilobits/second 512 ( 512 )( bits 24 / ) pixels bits pixel = 213 second ( 28 8 . 1024 / second ) 6

  6. The goal of image compression is to reduce the amount of data required to represent a digital image. Important for reducing storage requirements and improving transmission rates.

  7. Dalam sistem pengkodean atau compression berdasarkan JPEG, pengkodean menggunakan discrete cosine transform, merupakan metode yang paling populer untuk image compression. Metode tersebut dapat dilakukan dalam empat langkah secara berurutan sebagai berikut:

  8. JPEG (Joint Photographic Experts Group) adalah standar internasional untuk image compression, baik grayscale dan color. The JPEG standard have two basic compression methods. Lossy Compression Lossless compression

  9. Encoder encoder mengambil digital source image data dan table spesification (quantization), dan melalui serangkaian prosedur tertentu untuk menghasilkan compressed image data. Decoder decoder mengambil compressed image data, dan table specification (dequantization) dan melalui serangkaian prosedur tertentu untuk menghasilkan digital reconstructed image data.

  10. JPEG memiliki mode operasi sebagai berikut: Sequential mode: mengkompress image dengan menscan dari kiri-ke-kanan, atas ke bawah untuk scaning. Progressive mode: Mengkompress image dalam beberapa scanning. Ketika waktu transmisi atau proses lama, gambar akan ditampilkan dari tidak jelas menjadi sempurna tampilannya.

  11. Untuk modus DCT berbasis sequential, 8x8 blok sampel dari image merupakan blok input yang akan diproses dari kiri ke kanan, dari blok baris ke blok baris selanjutnya dari atas ke bawah. Setelah blok telah diubah oleh metode DCT, kemudian akan menghasilkan 64 koeficient setiap blok tersebut, 64 coeficient tersebut diquantisasi, yang kemudian dikodekan dengan metode entropy. Hasil dari compressed image data adalah meminimalkan koefisien-koefisien data sebuah image dalam penyimpanan.

  12. Untuk modus DCT berbasis progressive, 8x8 blok juga biasanya dikodekan dalam urutan yang sama, tetapi dalam beberapa scan melalui image. Hal ini dicapai dengan menambah buffer memori image antara quantizer dan encoder entropi. Setiap blok diubah oleh DCT dan diquantisasi, yang kemudian koefficiennya disimpan dalam buffer. DCT coefficient tersebut dalam buffer kemudian sebagian dikodekan dengan beberapa scan.

  13. In the encoding process the input components samples are grouped into 8 x8 blocks, and each block is transformed by the forward DCT (FDCT). The result of forward DCT is a set of 64 values referred to as DCT coefficients. One of these values is referred to as the DC coefficient and the other 63 as the AC coefficients.

  14. 2D DCT Quantization Entropy Quantization Table Huffman Table Image 8x8 blocks Compressed Image The 2-Dimensional DCT is performed on the 8x8 blocks of the image data in the general JPEG framework. Baseline Coding in JPEG consists of 2-Dimensional DCT Processing

  15. 2D DCT Quantization Entropy Quantization Table Huffman Table Image 8x8 blocks Compressed Image For each layers, the DCT coefficients shall be quantized separately. The quantization process has the key role in the JPEG compression. It is the process which removes the high frequencies present in the original image. This is done due to the fact that the eye is much more sensitive to lower spatial frequencies than to higher frequencies.

  16. Huffman Table AC Zig-zag reordering Huffman coding Color 8x8 components (Y, U or V) Quantizer Bit-stream Transform Difference Encoding Huffman coding DC Huffman Table Quantization Table

  17. Dalam rangka mencapai kinerja kompresi yang baik, korelasi antara komponen-komponen dikurangi dengan mengkonversi warna RGB ke warna YCbCr. RGB harus dipisahkan menjadi bagian luminance (Y) dan bagian chrominance 2 (Cb dan Cr) seperti yang direkomendasikan dalam standard JPEG. warna

  18. The value Y = 0.299R + 0.587G + 0.114B is called the luminance. It is the value used by monochrome monitors to represent an RGB colour. The values Cb and Cr are called chromimance values and represent 2 coordinates in a system which measures the nuance and saturation of the color. These values indicate how much blue and how much red are in that color, respectively.

  19. The advantage of converting the image into luminance- chrominance color space is that the luminance and chrominance components are very much decorrelated between each other. Moreover, the chrominance channels contain much redundant information and can easily be sub-sampled without any visual quality for the reconstructed image.

  20. The transformation from RGB to YUV is based on the following mathematical expression: . 0 299 . 0 587 . 0 114 0 Y R = + . 0 1687 . 0 3313 5 . 0 128 Cb G 5 . 0 . 0 4187 . 0 0813 128 Cr B Y: the luminance represents the brightness Cb: the difference between the gray and blue Cr: the difference between the gray and red

  21. The 88 blocks are processed from left-to-right and from top-to-bottom. The purpose of the DCT is to transform the value of pixels to the spatial frequencies. These spatial frequencies are very related to the level of detail present in an image. High spatial frequencies corresponds to high levels of detail, while lower frequencies corresponds to lower levels of detail.

  22. The DCT of a signal f(x,y) are given as follows: The inverse DCT of coefficient F(u,v) are given by: Where

  23. The mathematical definition of FDCT-2D with sub block 8x8 as follow : + + 1 4 (2 1) (2 1) 7 7 x u y v = ( , ) F u v ( ) ( ) C u C v ( , )cos f x y cos 16 16 = = 0 0 x y = = for 0,...,7 and 0,...,7 u v = 1/ 2 for 1 otherwise 0 k = where ( ) C k

  24. u 0 1 2 3 4 5 6 7 v 0 1 2 3 4 5 6 7

  25. DCT-based image compression relies on two techniques to reduce the data required to represent the image. The first is quantization of the image's DCT coefficients; the second is entropy coding of the quantized coefficients. Quantization is the process of reducing the number of possible values of a quantity. Entropy coding is a technique for representing the quantized data as compactly as possible, thereby reducing the number of bits needed to represent it.

  26. Quantization refers to the process of approximating the continuous set of values in the image data with finite set of values. The input to be quantized is always the original data, and the output is always one in the middle of a finite number of levels. The quantizer is a function whose set of output values are discrete and usually finite. This is the process of estimation, and a good process is one which can present the original with minimum loss or deformation.

  27. Each of the 64 DCT coefficients are uniformly quantized. Each element in the quantization matrix is an integer between 1 and 255. Each DCT coefficient F(u,v) is divided by the corresponding quantizer step-size parameter Q(u,v)in the quantization matrix and rounded to the nearest integer as : ( , ) ( , ) Q u v F u v = ( , ) F u v Round q

  28. The standard JPEG luminance and chrominance quantization tables QL and QR are given below: 17 18 24 47 99 99 99 99 16 11 10 16 24 40 51 61 18 21 26 66 99 99 99 99 12 12 14 19 26 58 60 55 24 26 56 99 99 99 99 99 14 13 16 24 40 57 69 56 47 66 99 99 99 99 99 99 14 17 22 29 51 87 80 62 = Q = Q R 99 99 99 99 99 99 99 99 L 18 22 37 56 68 109 103 77 99 99 99 99 99 99 99 99 24 35 55 64 81 104 113 92 99 99 99 99 99 99 99 99 49 64 78 87 103 121 120 101 99 99 99 99 99 99 99 99 72 92 95 98 112 100 103 99

  29. The quantization process has the key role in the image compression. It is the process which removes the high frequencies present in the original image. This is done due to the fact that the eye is much more sensitive to lower spatial frequencies than to higher frequencies. This is done by dividing values at high indexes in the vector (the amplitudes of higher frequencies) with larger values than the values by which are divided the amplitudes of lower frequencies.

Related


More Related Content