Convert the rgb values for the colours, Computer Graphics

Assignment Help:

In computers, colours are created by blending different combinations of red, green and blue. These colours are normally specified as three two-digit hexadecimal numbers in html, photoshop, gimp etc. For example, Brown is specified as A62929 to indicate the proportions of red, green and blue required. For grey shades the three proportions will always be equal. Moreover FF indicates that the colour is fully saturated. Thus red is FF0000, green is 00FF00, and blue is 0000FF. This colour system is called RGB.

Other applications, such as MATLAB require the RGB colours to be specified in terms of the fraction of each colour required. In this case, the colour is specified by three numbers between 0 and 1, with 1 representing full colour saturation. For example, Brown in this system is given as (0.65, 0.16, 0.16); while red is (1, 0, 0); green is (0, 1, 0) and blue is (0, 0, 1). This representation is referred as the RGB colour fraction.

Given that different systems are used in different applications, it is important to be able to convert between the two representations. The largest number that can be represented by a two-digit hexadecimal number is 16 FF so we know that there are 255 possible shades that can be represented.  Hence, to convert the hexadecimal colour representation to a colour fraction, the following has to be done:

1.  Convert each hexadecimal colour number to its decimal equivalent.

2.  Divide each decimal by 255.

3.  Record each fraction as the colour fraction required for that colour. Converting from a colour fraction to the hexadecimal version is the reverse of the above.

To illustrate, let us consider Brown. Its shade of red is 16 A6. As a decimal this corresponds to 166. Hence, the fraction amount of red required is 166 255 0.65. Similarly for green the decimal equivalent of 16 29 is 41. Therefore, the green colour fraction is 41 255 0.16
. The blue colour fraction for Brown is also 0.16.

(a) Convert the RGB values for the colours below to their equivalent RGB colour fractions. Round your answers to two decimal places.

389_Convert the RGB values for the colours.png


Related Discussions:- Convert the rgb values for the colours

Scan line polygon fill and seed fill or flood fill algorithm, 1.   Distingu...

1.   Distinguish among Scan line polygon fill and Seed fill or Flood fill algorithm? Scan Line Polygon Flood Fill Algorithms ?1. This

Characteristics of digital video, Digital video can be characterized by a f...

Digital video can be characterized by a few variables: Frame rate : various frames displayed per second. The illusion of motion may be experienced on frame rates as low as 12 f

Improving gif compression, Improving GIF Compression: Features of LZW comp...

Improving GIF Compression: Features of LZW compression can be used to enhance its efficiency and thereby decrease the size of your graphic interchange format graphics. The strateg

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.

Points and lines - graphic primitives, Points and Lines - Graphic primitive...

Points and Lines - Graphic primitives In the previous section, we have seen to draw primitive objects; one has to firstly scan convert the objects. This concern to the operat

Implement the scan line polygon fill algorithm, Implement the Scan line pol...

Implement the Scan line polygon fill algorithm for any arbitrary polygon in C-language and then use your code to fill each of the following type of polygon. i)  Convex polygon

Modify the dda algorithm for negative sloped lines, 1. Modify the DDA algo...

1. Modify the DDA algorithm for negative sloped lines; discuss both the cases i.e., slope > 1 and 0   Ans. For the generation of lines along with negative slopes as:

Important point about the de casteljeau algorithm, Important point about th...

Important point about the De casteljeau algorithm 1)      Bezier Curve: P (u) =    ................     (1) Here B n,i (u) = n c i u i (1 - u) n-i        ..

Steps of cohen sutherland line clipping algorithm, Cohen Sutherland line cl...

Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries

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