Calculate the gray level value for all the pixels, Computer Graphics

Assignment Help:

An 8x8 image f[i,j] has gray levels given by the following equation:

f [i , j]= ? i-j ? ; i,j=0,1,2,3,4,5,6,7.

a. Calculate the gray level value for all the pixels in the 8x8 image based on the above formula. (You should obtain 64 gray level values).                                              

b. Find the output image obtained by applying 3x3 median filter on the whole image f[i,j] which was calculated from part (a); note that the border pixels remain unchanged.


Related Discussions:- Calculate the gray level value for all the pixels

Aspect ratio - display devices, Aspect ratio - Display Devices Ratio of...

Aspect ratio - Display Devices Ratio of vertical points to horizontal points necessary to produce equal length lines in both directions on the screen. For example, in a CRT mon

Scan line polygon fill algorithm - raster graphics, Scan Line Polygon Fill ...

Scan Line Polygon Fill Algorithm - Raster Graphics In such algorithm, the information for a solid body is stored in the frame buffer and utilizing that information each pixel

Light wave 3d - softwares for computer animation, Light Wave 3D - Softwares...

Light Wave 3D - Softwares for computer animation It is the other high end PC 3-D computer graphics software package. Originally established for the Amiga platform, it is now a

Avi codec format, AVI CODEC Formats: Various AVI file formats other than t...

AVI CODEC Formats: Various AVI file formats other than the DV Types 1 and 2 formats are there discussed earlier. All such the other formats involve the utilization of Compressor o

Line drawing algorithm, when dda line drawing algorithm is more efficient t...

when dda line drawing algorithm is more efficient than bresenhem line drawing algorithm?

Explain the advantage and disadvantage of raster crt, Explain the advantage...

Explain the advantage and disadvantage of Raster CRT Advantages Allows solids, not just wireframes Leverages low-cost CRT technology (i.e., TVs) Bright, i.e.

Vanishing point - viewing transformations, Vanishing Point - Viewing Transf...

Vanishing Point - Viewing Transformations This point is that point at those parallel lines shows to converge and vanish. A practical illustration is a long straight railroad

Bresenham rasterisation algorithm, 2. Describe how the Bresenham rasterisat...

2. Describe how the Bresenham rasterisation algorithm is advantageous when compared to any other existing method.

Approaches to area filling - output primitives, Approaches to Area Filling ...

Approaches to Area Filling  Some other approaches to area filling are   Scan line polygon fill algorithm Boundary fill algorithm Flood fill algorithm.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd