ELEN E4830 Digital Image Processing. Homework 3 Solution

Similar documents
Introduction to Digital Image Processing

ELEN E4830 Digital Image Processing. Homework 6 Solution

Basic Algorithms for Digital Image Analysis: a course

Algebra I Notes Absolute Value Functions Unit 04c

Digital Image Processing, 2nd ed. Digital Image Processing, 2nd ed. The principal objective of enhancement

Lecture 4. Digital Image Enhancement. 1. Principle of image enhancement 2. Spatial domain transformation. Histogram processing

Digital image processing

Image Enhancement in Spatial Domain. By Dr. Rajeev Srivastava

Section 1.6 & 1.7 Parent Functions and Transformations

Image Enhancement in Spatial Domain (Chapter 3)

Transformation of curve. a. reflect the portion of the curve that is below the x-axis about the x-axis

Digital Image Processing

Digital Image Processing

Comparative Study of Linear and Non-linear Contrast Enhancement Techniques

EEM 463 Introduction to Image Processing. Week 3: Intensity Transformations

Sampling and Reconstruction

Testing Random- Number Generators

Chapter 6: DESCRIPTIVE STATISTICS

IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN

Image Enhancement. Digital Image Processing, Pratt Chapter 10 (pages ) Part 1: pixel-based operations

Elementary Functions

Test Name: Chapter 3 Review

Probability and Statistics for Final Year Engineering Students

REVIEW, pages

Image Processing. Cosimo Distante. Lecture 6: Monochrome and Color processing

Graphs and Linear Functions

Generating random samples from user-defined distributions

UNIT - 5 IMAGE ENHANCEMENT IN SPATIAL DOMAIN

9.1: GRAPHING QUADRATICS ALGEBRA 1

Chapter 3: Intensity Transformations and Spatial Filtering

Intensity Transformations and Spatial Filtering

Section 2.4 Library of Functions; Piecewise-Defined Functions

Digital Image Processing ERRATA. Wilhelm Burger Mark J. Burge. An algorithmic introduction using Java. Second Edition. Springer

Applied Finite Mathematics. Collection Editor: Rupinder Sekhon

Algebra 1, 4th 4.5 weeks

/4 Directions: Graph the functions, then answer the following question.

Parameterization. Michael S. Floater. November 10, 2011

Analytical Techniques for Anomaly Detection Through Features, Signal-Noise Separation and Partial-Value Association

WHAT YOU SHOULD LEARN

GRAPHING WORKSHOP. A graph of an equation is an illustration of a set of points whose coordinates satisfy the equation.

AN ANALYTICAL APPROACH TREATING THREE-DIMENSIONAL GEOMETRICAL EFFECTS OF PARABOLIC TROUGH COLLECTORS

Probability Models.S4 Simulating Random Variables

Non-Parametric Modeling

Mixture Models and EM

Fathom Dynamic Data TM Version 2 Specifications

Definition 2 (Projective plane). A projective plane is a class of points, and a class of lines satisfying the axioms:

Max-Count Aggregation Estimation for Moving Points

Math Analysis Chapter 1 Notes: Functions and Graphs

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

Lecture 2.2 Cubic Splines

with slopes m 1 and m 2 ), if and only if its coordinates satisfy the equation y y 0 = 0 and Ax + By + C 2

Directionally Selective Fractional Wavelet Transform Using a 2-D Non-Separable Unbalanced Lifting Structure

OPTI 201R Homework 9 Solutions

11.3 The Tangent Line Problem

Automated image enhancement using power law transformations

Three-Dimensional Coordinate Systems

Math Analysis Chapter 1 Notes: Functions and Graphs

Achim J. Lilienthal Mobile Robotics and Olfaction Lab, AASS, Örebro University

Digital Image Analysis and Processing

Parameterization of triangular meshes

Parallel or Perpendicular? How Can You Tell? Teacher Notes Page 1 of 6

Geometry Pre AP Graphing Linear Equations

Functions 3.6. Fall Math (Math 1010) M / 13

Homework #4 Due Friday 10/27/06 at 5pm

Color Image Enhancement Using Optimal Linear Transform with Hue Preserving and Saturation Scaling

On the distribution of colors in natural images

In this lecture. Background. Background. Background. PAM3012 Digital Image Processing for Radiographers

The x-intercept can be found by setting y = 0 and solving for x: 16 3, 0

Lesson 19: The Graph of a Linear Equation in Two Variables is a Line

A Topography-Preserving Latent Variable Model with Learning Metrics

A function: A mathematical relationship between two variables (x and y), where every input value (usually x) has one output value (usually y)

TRANSFORMATIONS OF GRAPHS

Sampling random numbers from a uniform p.d.f.

Graphing Linear Equations

An introduction to interpolation and splines

Lesson 8.1 Exercises, pages

Chapter 11 Representation & Description

Precalculus Chapter 2A Practice Guide Name

Fountain Codes Based on Zigzag Decodable Coding

Important!!! First homework is due on Monday, September 26 at 8:00 am.

1 Solution of Homework

GAMES Webinar: Rendering Tutorial 2. Monte Carlo Methods. Shuang Zhao

11 1. Introductory part In order to follow the contents of this book with full understanding, certain prerequisites from high school mathematics will

1.4. Comparing Graphs of Linear Motion. Acceleration Time Graphs

UNIT 1: NUMBER LINES, INTERVALS, AND SETS

Rate Distortion Optimization in Video Compression

2.4. A LIBRARY OF PARENT FUNCTIONS

The shortest distance from point K to line is the length of a segment perpendicular to from point K. Draw a perpendicular segment from K to.

Scientific Visualization Example exam questions with commented answers

Problem 1 (10 Points)

Points and lines. x x 1 + y 1. y = mx + b

Probabilistic Asymptotic Decider for Topological Ambiguity Resolution in Level-Set Extraction for Uncertain 2D Data

Lecture 8: Jointly distributed random variables

Intensity Transformation and Spatial Filtering

Chapter - 2 : IMAGE ENHANCEMENT

Final Exam 1:15-3:15 pm Thursday, December 13, 2018

Image restoration. Restoration: Enhancement:

Regression III: Advanced Methods

Image Enhancement 3-1

Transcription:

ELEN E48 Digital Image Processing Homework Solution Chuxiang Li cxli@ee.columbia.edu Department of Electrical Engineering, Columbia University February 4, 6 Image Histogram Stretching. Histogram of Gray-image Figure : The original gray image coin.bmp : 5 pixels; 8-bit/pixel. Fig. shows the original gray image coin.bmp, which has a spatial resolution of 5 pixels with 8 bits per pixel. To generate the histogram of a gray image which is equivalent

to an D color image, the approach is the same as that employed for each single color channel of a D color image. Please see the solution of Homework for more details. Fig. shows the histograms of the original gray image coin.bmp in the cases of n = 8 and n = 56 bins. It is seen from Fig. that the distribution of the pixel values is far from an even distribution over the entire region. In other words, most of the pixels fall in a relatively small region.. Histogram Stretching The piecewise mapping function for the stretching operation can be analytically derived as follows. Denote β, β and β as the intercepts for the three lines corresponding to the three regions [, stin ), [stin, stin max ], and (stin max, M], respectively. Denote α, α and α as the slopes for the three lines corresponding to the three regions [, stin ), [stin, stin max ], and (stin max, M], respectively. The slopes can be simply written as α = stout stin, () α = stout max stout stin max stin, () α = M stout max M stin max. () Note that the intercepts satisfy the following equations in geometry: from which the intercepts can be derived β =, stin max = stout max β, stin stout β M M β =, stin max stout max β β =, (4) β = stin stout max stin max stout stin max stin, (5) β = M stout max stin max M stin max. (6)

x 4 Histgram of the original image: n=8.5.5 4 5 6 7 8 9 Histgram of the original image: n=56 x 4.5.5 5 5 75 5 5 75 5 5 Figure : Histograms of the original gray image coin.bmp : n = 8 and n = 56.

Hence, the piecewise stretching operations can be analytically expressed by Out = α i In + β i, i =,,, (7) where α i and β i are defined in () () and (4) (6), respectively; the four parameters stin, stin max, stout, and stout max will be further detailed in Section... Parameters of Histogram Stretching The parameters of the histogram input, stin and stin max, depends on the histogram of the original gray image coin.bmp which is shown in the bottom of Fig.. It is seen from Fig. that in the case of n = 56, the gray values of most of the pixels fall in the region [, ]. Meanwhile, to transform the histogram into the one as spreadly distributed as possible, the parameters of the histogram output, stout and stout max, should be as small as possible and as large as possible, respectively. In the simulations to be demonstrated in Section.4, for n = 56 and M = 56, we choose the values of the above parameters as follows: input parameters : stin =, stin max = ; (8) output parameters : stout =, stout max = 5. (9) Note that, to gain more insight into the role of the output parameters, we choose another set of values as a comparison: stout = 5, stout max = 4. ().4 Simulation Results Fig. shows the histogram comparison between the original image and the stretched image using (9). It is seen from Fig. that the histogram is more spread over the entire region after the stretching operation (7). Similarly, Fig. 4 shows the same comparison between the 4

original image and the stretched image using (), and the similar conclusion can be drawn as from Fig.. Moreover, Fig. 5 shows the comparison between the stretched histograms using different output parameters (9) and (). It is seen from Fig. 5 that the larger the stout max is and the smaller the stout is, the histogram after stretching operation (7) is more spread. Moreover, Fig. 6 shows the subjective performance comparison between the original image and the stretched ones using (9) and (). It is seen from Fig. 6 that the images after the stretching operation (7) can offer a better subjective performance than the original one; and consistent with what Fig. 5 has demonstrated, (9) can achieve a better subjective performance than (). 5

Histgram of the original image: n=56 x 4.5.5 5 5 75 5 5 75 5 5 Histgram of the stretched image: n=56 x 4.5.5 5 5 5 Figure : Comparison between the original histogram and the stretched histogram of the gray image coin.bmp : M = 56; stin = and stin max = (i.e., (8)); stout = and stout max = 5 (i.e., (9)). 6

Histgram of the original image: n=56 x 4.5.5 5 5 75 5 5 75 5 5 Histgram of the stretched image: n=56 x 4.5.5 5 5 5 Figure 4: Comparison between the original histogram and the stretched histogram of the gray image coin.bmp : M = 56; stin = and stin max = (i.e., (8)); stout = 5 and stout max = 4 (i.e., ()). 7

x 4 n=56; stout =; stout max =5.5.5 5 5 5 x 4 n=56; stout =5; stout max =4.5.5 5 5 5 Figure 5: Comparison between the stretched histograms using different output parameters (9) and (). 8

Figure 6: Subjective performance comparison between the original image and the stretched images: M = 56; the bottom image the original one; the upper-left image the stretched one using (9); the upper-right image the stretched one using (). 9

Histogram Transformation Denote U and V as two random variables representing the input and the output of the histogram transformation, respectively. Denote p U (u) and F U (u) = u p U(u)du as the probability density function (pdf) and the cumulative probability density functions (cdf) of U, respectively. Similarly, p V (v) and F V (v) = v p V (v)dv denote the pdf and the cdf of V, respectively. The histogram transformation has the following constraint F U (u) = F V (v). () Obviously, the mapping function v = T (u) corresponding to the histogram transformation () depends on the specific distributions of both U and V.. Mapping Function: Cube-root Hyperbolically Distributed V Assume that V is a random variable with a cube-root hyperbolic distribution, i.e., v / (v p V (v) = max v / / ), if v v v max,, otherwise. Then the cdf of V can be further written as, v > v max, v F V (v) = p V (v)dv = v v p V (v)dv, v v v max,, v < v. () Note that in (), only the region v [v, v max ] is treated in the histogram transformation, and the corresponding cdf of V is given by F V (v) = v/ v /, v [v vmax / v /, v max ]. Inserting () into (), we then have the following mapping function corresponding to the cube-root hyperbolic distribution of V F U (u) = F V (v) = v/ v /, vmax / v /

[ = v = T (u) = (vmax / v / )F U(u) + vmax] /. (). Mapping Function: Uniformly Distributed U It is observed from () that u is involved in the mapping function v = T (u) by F U (u) which has no closed-form expression as long as the pdf of U is unknown. Now assume that U is a random variable with a uniform distribution over [, ], i.e.,, u, p U (u) =, otherwise. Then the cdf of U can be further written as, u >, u F U (u) = p U (u)du = u p U(u)du = u, u,, u <. (4) Similarly as revealed in (), only the region u [, ] in (4) is treated in the histogram transformation. Inserting (4) into the mapping function () obtained in Section., we find the mapping function corresponding to the cube-root hyperbolic distribution of V and the uniform distribution of U: v = T (u) = [ (v / max v / )u + v/ max]. (5) Fig. 7 shows the plot of the mapping function v = T (u) in (5) where v = and v max =, i.e., v = T (u) = u.

Mapping function: v =; v max =.9.8.7 v=t(u).6.4.......4.6.7.8.9 u Figure 7: Mapping function v = T (u) in (5): v = and v max =.