LIST 04 Submission Date: 04/05/2017; Cut-off: 14/05/2017. Part 1 Theory. Figure 1: horizontal profile of the R, G and B components.

Similar documents
Module 6 STILL IMAGE COMPRESSION STANDARDS

Assistant Lecturer Sama S. Samaan

Fig Color spectrum seen by passing white light through a prism.

CS4495/6495 Introduction to Computer Vision. 2C-L3 Aliasing

ENEE408G Multimedia Signal Processing

A Novel Approach of Compressing Images and Assessment on Quality with Scaling Factor

Information Hiding: Steganography & Steganalysis

Artifacts and Antiforensic Noise Removal in JPEG Compression Bismitha N 1 Anup Chandrahasan 2 Prof. Ramayan Pratap Singh 3

The Scientist and Engineer's Guide to Digital Signal Processing By Steven W. Smith, Ph.D.

ECE/OPTI533 Digital Image Processing class notes 288 Dr. Robert A. Schowengerdt 2003

PERFORMANCE EVALUATION OFADVANCED LOSSLESS IMAGE COMPRESSION TECHNIQUES

Digital Image Processing 3/e

Compression and Image Formats

CHAPTER 6: REGION OF INTEREST (ROI) BASED IMAGE COMPRESSION FOR RADIOGRAPHIC WELD IMAGES. Every image has a background and foreground detail.

A Secure Image Encryption Algorithm Based on Hill Cipher System

Figures from Embedded System Design: A Unified Hardware/Software Introduction, Frank Vahid and Tony Givargis, New York, John Wiley, 2002

2.3 BUILDING THE PERFECT SQUARE

B.E, Electronics and Telecommunication, Vishwatmak Om Gurudev College of Engineering, Aghai, Maharashtra, India

Multimedia Communications. Lossless Image Compression

APPLICATIONS OF DSP OBJECTIVES

1. (a) Explain the process of Image acquisition. (b) Discuss different elements used in digital image processing system. [8+8]

Solution Set #2

Comparison of Image Compression and Enhancement Techniques for Image Quality in Medical Images.

An Integrated Image Steganography System. with Improved Image Quality

Hybrid Coding (JPEG) Image Color Transform Preparation

Anna University, Chennai B.E./B.TECH DEGREE EXAMINATION, MAY/JUNE 2013 Seventh Semester

Digital Image Processing Question Bank UNIT -I

Imaging Process (review)

Lane Detection in Automotive

Computer Graphics. Si Lu. Fall er_graphics.htm 10/02/2015

Chapter 8. Representing Multimedia Digitally

3. Image Formats. Figure1:Example of bitmap and Vector representation images

Solution for Image & Video Processing

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

Image Compression Supported By Encryption Using Unitary Transform

JPEG Image Transmission over Rayleigh Fading Channel with Unequal Error Protection

Chapter 9 Image Compression Standards

CS 484, Fall 2018 Homework Assignment 1: Binary Image Analysis

A Modified Image Coder using HVS Characteristics

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad

REVIEW OF IMAGE COMPRESSION TECHNIQUES FOR MULTIMEDIA IMAGES

Ch. 3: Image Compression Multimedia Systems

Computers and Imaging

A COMPARATIVE ANALYSIS OF DCT AND DWT BASED FOR IMAGE COMPRESSION ON FPGA

Performance Evaluation of H.264 AVC Using CABAC Entropy Coding For Image Compression

Comparative Analysis of Lossless Image Compression techniques SPHIT, JPEG-LS and Data Folding

The figures and the logic used for the MATLAB are given below.

IMAGES AND COLOR. N. C. State University. CSC557 Multimedia Computing and Networking. Fall Lecture # 10

CS 445 HW#2 Solutions

Experimental Images Analysis with Linear Change Positive and Negative Degree of Brightness

Digital Image Processing. Lecture # 8 Color Processing

Fast Inverse Halftoning Algorithm for Ordered Dithered Images

Prof. Feng Liu. Fall /02/2018

Approximate Compression Enhancing compressibility through data approximation

BEng (Hons) Electronic Engineering. Examinations for / Semester 1

MULTIMEDIA SYSTEMS

Efficient Image Compression Technique using JPEG2000 with Adaptive Threshold

Lane Detection in Automotive

Images with (a) coding redundancy; (b) spatial redundancy; (c) irrelevant information

Image Compression Based on Multilevel Adaptive Thresholding using Meta-Data Heuristics

2. REVIEW OF LITERATURE

Introduction to More Advanced Steganography. John Ortiz. Crucial Security Inc. San Antonio

MAS.160 / MAS.510 / MAS.511 Signals, Systems and Information for Media Technology Fall 2007

VARVE MEASUREMENT AND ANALYSIS PROGRAMS OPERATION INSTRUCTIONS. USING THE COUPLET MEASUREMENT UTILITY (Varve300.itm)

A New Image Steganography Depending On Reference & LSB

from: Point Operations (Single Operands)

Identification of Bitmap Compression History: JPEG Detection and Quantizer Estimation

Basic concepts of Digital Watermarking. Prof. Mehul S Raval

Speech Coding in the Frequency Domain

Color. Used heavily in human vision. Color is a pixel property, making some recognition problems easy

INTRODUCTION TO IMAGE PROCESSING

Hello, welcome to the video lecture series on Digital image processing. (Refer Slide Time: 00:30)

SYLLABUS CHAPTER - 2 : INTENSITY TRANSFORMATIONS. Some Basic Intensity Transformation Functions, Histogram Processing.

Sect Linear Equations in Two Variables

Image Processing Final Test

DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK. Subject Name: Information Coding Techniques UNIT I INFORMATION ENTROPY FUNDAMENTALS

The Strengths and Weaknesses of Different Image Compression Methods. Samuel Teare and Brady Jacobson

International Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)

University of Maryland College Park. Digital Signal Processing: ENEE425. Fall Project#2: Image Compression. Ronak Shah & Franklin L Nouketcha

EE299 Midterm Winter 2007 Solutions

Digitizing Color. Place Value in a Decimal Number. Place Value in a Binary Number. Chapter 11: Light, Sound, Magic: Representing Multimedia Digitally

Question Score Max Cover Total 149

DIGITAL IMAGE PROCESSING Quiz exercises preparation for the midterm exam

Analysis and Improvement of Image Quality in De-Blocked Images

Digital Image Processing. Lecture # 6 Corner Detection & Color Processing

Towards Real-time Hardware Gamma Correction for Dynamic Contrast Enhancement

IMAGE PROCESSING: AREA OPERATIONS (FILTERING)

Images and Graphics. 4. Images and Graphics - Copyright Denis Hamelin - Ryerson University

5/17/2009. Digitizing Color. Place Value in a Binary Number. Place Value in a Decimal Number. Place Value in a Binary Number

An Enhanced Approach in Run Length Encoding Scheme (EARLE)

AN ERROR LIMITED AREA EFFICIENT TRUNCATED MULTIPLIER FOR IMAGE COMPRESSION

[Srivastava* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

An Efficient Color Image Segmentation using Edge Detection and Thresholding Methods

Iterative Joint Source/Channel Decoding for JPEG2000

An Enhanced Least Significant Bit Steganography Technique

IMAGE PROCESSING: POINT PROCESSES

Course Developer: Ranjan Bose, IIT Delhi

Compression. Encryption. Decryption. Decompression. Presentation of Information to client site

Color Image Processing. Gonzales & Woods: Chapter 6

UNEQUAL POWER ALLOCATION FOR JPEG TRANSMISSION OVER MIMO SYSTEMS. Muhammad F. Sabir, Robert W. Heath Jr. and Alan C. Bovik

Transcription:

Universidade de Brasília (UnB) Faculdade de Tecnologia (FT) Departamento de Engenharia Elétrica (ENE) Course: Image Processing Prof. Mylène C.Q. de Farias Semester: 2017.1 LIST 04 Submission Date: 04/05/2017; Cut-off: 14/05/2017 Part 1 Theory do livro texto Question 1.1: How many gray levels are there in the RGB color system, taking into account that an image has 8 bits? In an RGB image, the R, G, and B components have a horizontal profile of intensities, as presented in the diagram in Figure 1. What is the color of the middle column of this image? What are the color of the borders of the image? Figure 1: horizontal profile of the R, G and B components. Question 1.2: Draw a surface in the RGB space for the points that satisfy the following equation: D(z, a) = [(z a) T C 1 (z a)] 1/2 = D 0, where D0 is a specific constant that has a value different from zero. Consider that a = 0 and 8 0 0 C = 0 1 0. 0 0 1 1

Question 1.3: Consider the image in Figure 2. All colors have a maximum value of saturation and intensity. Draw the RGB components of Figure 2, depicting how they would look in a monocromatic (gray scale or black-and-white) monitor. Draw the HSI components of Figure 2, depicting how they would look in a monocromatic (gray scale or black-and-white) monitor. Figure 2: Color Bars Question 1.4: Consider the color image of size 500 500 shown in Figure 3. The squares in this image correspond to the pure colors blue, red, and green. Consider that we convert an RGB image to HSI. Next, we filter the H component of the HSI image using an arithmetic mean filter of size 25 25. Then, convert the HSI image back to RGB. What is the appearance of the resulting image? Repeat, filtering the S component (instead of the H component). What is the appearance of the resulting image? Figure 3: Image in Figure 6.16 of the text book. 2

Question 1.5: (c) (d) (e) Compute the entropy of a source with a probability of symbols given in Table 1 (Table 8.1 from text book). Build a Huffman code for the symbols from this source and explain the differences between this code and the binary code (Code 1) in Table 1. Build a shift binary code for this source. Split the symbols in two groups and build another code using a shifted Huffman. Compute the word average lengths for each code and compare these values with the source entropy value calculated in. r k p r (r k ) Code 1 l 1 (r k ) Code 2 l 2 (r k ) r 87 = 87 0,25 01010111 8 01 2 r 128 = 128 0,47 10000000 8 1 1 r 186 = 186 0,25 11000100 8 000 3 r 255 = 255 0,03 11111111 8 001 3 r k para k 87, 128, 186, 155 0-8 - 0 Table 1: Probabilities of the source in Question 1.5. Question 1.6 Decode the message 0.23355, which was coded using a arithmetic code with symbols probabilities depicted in Table 2. Consider that the message has 5 symbols. Símbolo Probabilidade a 0,3 e 0,2 b 0,2 c 0,1 d 0,1 f 0,1 Table 2: Probabilities of the symbols of the source in Question 1.6. Question 1.7 Explain in details the JPEG algorithm. Include a block diagram in your explanation. Explain in details the MPEG algorithm. Include a block diagram in your explanation. 3

Part 2 Practice Question 2.1: Write a program that converts a color RGB image to a color RGB-safe image. Download the image in Figure 4 from the course homepage and convert this image to RGB-safe. Figure 4: Cube in RBG space. Question 2.2: Implement a color processing algorithm that generates false colors (pseudo-colors), similarly to what was presented in class. In this system, you must specify two intervals of gray scale levels in the input image. The algorithm must generate a color image (RGB) with pixels with a specific color for each interval of gray scale levels of the input image. The remaining pixels of the input image (outside the two intervals) should keep the original gray scale levels. Download the image in Figure 5 from the course homepage (Figure 1.10 (4) of the text book). Using the algorithm developed in, process the image in a way that the river in the center of the image appears yellow, while the rest of the image maintains the original gray scale levels. It is acceptable to have a small number of isolated yellow pixels in the output image. Figure 5: Figure 1.10 (4) of the text book. 4

Question 2.3: a) Pick a gray scale image of your choice, with a minimum size of 256 256 and save in an uncompressed format. b) Read and visualize the chosen image. c) Apply a 2D-DCT to each of the 8 8 blocks of the image. Normalize the result, dividing all resulting matrix elements by 8. Visualize the result. d) The quality parameter in compression (JPEG) varies from 1 to 100. This value controls the quantization compression scale: { 50 quality, quality < 50 scale quant = 2 quality 2. 100, otherwise The standard quantization table is given by: 16 11 10 16 24 40 51 61 12 12 14 19 26 58 60 55 14 13 16 24 40 57 69 56 Q = 14 17 22 29 51 87 80 62 18 22 37 56 68 109 103 77. 24 35 55 64 81 104 113 92 49 64 78 87 103 121 120 101 72 92 95 98 112 100 103 99 The quantization matrix for the desired quality level can be obtained using the following function in Matlab: QuantT = max(ones(size(q)), round(escala_quant * Q)); e) Set the quality level to 50. Divide the elements in each one of the 8 8 blocks of DCT coefficients by the corresponding element in the quantization matrix, rounding the result to the next integer. Notice that QuantT has 8 lines and 8 columns, similarly to the DCT coefficient blocks.you have just performed a simplified JPEG. f) Compute the original image entropy. Compute the entropy of the image obtained in the last step. How do these 2 numbers compare? What can you conclude from this result? g) To recover the image, multiply each of the blocks obtained in (e) by the same QuantT element. Next, compute the IDCT of the 8 8 blocks and multiply the result by 8. Visualize the recovered image. What type of distortions can be visualized? h) Compute the mean squared error between the original (Io) and recovered (Ir) images: [l,c]=size(io); MSE=sum((Io-Ir)ˆ2)/l*c;. i) Repeat (c)-(h) for quality levels 100, 90, 80, 70, and 60. Compare the MSE values for each of these values. Plot a graph of MSE versus quality level (100-50). j) Do the same test in (i) for 3 different images. Are the MSE results still consistent? Can you compare the MSE results among the different images? Plot a graph with the 4 MSE curves (versus quality levels). k) Download the SSIM metric from the link below. Repeat the same tests performed in (i) and (j) using SSIM, instead of MSE? Plot a graph of SSIM versus quality level (100-50). Compare the results obtained with SSIM with the results obtained with MSE. https://ece.uwaterloo.ca/ z70wang/research/ssim/ 5