Detecting skin in colour images, Computer Graphics

Assignment Help:

In this lab you will learn how to use chrominance1 to segment coloured images. Here you be detecting skin, however, you could use this method to detect other coloured regions in images.

Firstly you will build a model describing the likelihood that any pair of chrominance values belongs to a piece of skin. Secondly you will test images and identify likely skin regions.

Getting Started

1. Download the following files from the course web site

  • the image 'face.jpg'.
  • the incomplete file 'Lab2.m', and
  • the file 'RGB2Lab.m'

Save these in the directory you are using for this lab.

Deliverable:

To gain the marks for this lab you will need to show me your completed Lab2 function running during the lab. Complete the function Lab2 by writing the two sub-functions

make_chroma_model, and

find_chroma

The specifications of these functions can be found in the downloadable file Lab2.m

What to do

Firstly have a look at the Lab3 file. Run it and see what it does. First it defines some constants num_bins and gsize. Then it loads an image and converts it to double in the range [0,1], but leaves it in RGB format. It then crops a region defined by the user.

While you write and debugging this program it is convenient not to have to select a region each time you run the program. Comment out the lines that display the prompt to the user and interactively crop the image, we'll enable them again later once the code's working. For the meantime crop the image automatically like this:

sample_colour = im_RGB(130:150,90:138,:);

This takes rows 130 to 150, columns 90 to 138, and all 3 colour channels. Notice that the

':' is used to mean 'everything inbetween' when it's between two indexes, or 'everything' when it's on it's own.

1 Colour has 3 channels, eg RGB, HSV. Chrominance is a two channel derivative of a colour that is independent of intensity. See lecture on Colour theory.

2 Now let's start on the function make_chroma_model. Firstly we need to convert from RGB colour space to CIE Lab colour space using RGB2Lab.m,

[L,a_chroma,b_chroma] = RGB2Lab(sample_colour);

RGB2Lab returns real a,b chrominance values in the range [-120,120] . We want to use these as indexes to an accumulator array, so we need to convert them to integers in the range [0, num_bins], where num_bins is a constant defining the size of each dimension of our accumulator array. To do this we will write a very short sub-function.

Write a sub-function ab2ind that is passed 2 parameters ab_chroma and num_bins and returns an index ind. This will only take two lines. Firstly convert ab_chroma from the range [-120,120] to [0,1].

ab_01 = ((ab_chroma)+120)/240;

Secondly discretise this into an integer index ind in the range [1,num_bins].

ind = round(ab_01*(num_bins-1)) + 1;

round rounds to the nearest integer. Note the minus 1 and plus 1 that are necessary to firstly scale to the range [0, num_bins-1] then increase this to [1, num_bins].

Getting back to make_chroma_model, we can now call our new sub-function to convert our a,b chrominance values to indexes for the accumulator array, e.g. for

a_chroma

a_ind = ab2ind(a_chroma, num_bins);

Now we are ready to start building the skin chrominance model. Create an accumulator array, this will be a num_bins × num_bins matrix of zeroes, use the zeros function to do this, call this matrix accum_array. We will use this for counting the occurrences of different chroma pairs and it will form the basis of our skin chrominance model.

Now we need to count the number of occurrences of each chroma pair. To do this you will need to use for loops to consider every pixel in the image. Look at the a find and b find values of each pixel and increment the appropriate cell in the accumulator array.

Done that? Have a look at your result using imagesc as follows, figure;

imagesc(accum_array); axis image;

xlabel('a'); ylabel('b'); title('Points in ab space');

 


Related Discussions:- Detecting skin in colour images

Phong shading algorithm, Q. Describe briefly phong shading algorithm.   ...

Q. Describe briefly phong shading algorithm.   OR                Write short note on phong shading.    Phong shading   Phong shading or normal vector interpo

Film recorders - graphics hardware, Film Recorders - graphics hardware ...

Film Recorders - graphics hardware It is a graphical output device for transferring digital images to photographic films. The easiest film recorders classically work through

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

Animation, name some of the standard motion in key frames

name some of the standard motion in key frames

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:

Medicine-applications for computer animation, Medicine: this is very tough...

Medicine: this is very tough for a doctor to get inside a living human body and to observe what is occurrence. Computer animation once again comes in very helpful. Every particula

Derive the common transformation of parallel projection, Derive the common ...

Derive the common transformation of parallel projection into the xy-plane in the direction of projection d=aI+bJ+cK. Solution: The common transformation of parallel projection

Rotation about z-axis - transformation for 3-d rotation, Rotation about z-a...

Rotation about z-axis - Transformation for 3-d rotation Rotation about z-axis is explained by the xy-plane. Suppose a 3-D point P(x,y,z) be rotated to P'(x',y',z') along with

Vecgen algorithm and bresenham line, what is vecgen algorithm and bresenha...

what is vecgen algorithm and bresenham linequestion..

Ellipse generating algorithm, Ellipse generating algorithm: Algorithm ...

Ellipse generating algorithm: Algorithm is similar to circle algorithm. We divide the ellipse on the positive quadrant into two regions. Region 1 where the slope > -1, and Reg

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