![[count pixels]](http://www.csharphelper.com/howto_count_black_pixels.png){kind=tracking}
The following CountPixels method counts pixels in an image that match a target color.
// Return the number of matching pixels.
private int CountPixels(Bitmap bm, Color target_color)
{
// Loop through the pixels.
int matches = 0;
for (int y = 0; y < bm.Height; y++)
{
for (int x = 0; x < bm.Width; x++)
{
if (bm.GetPixel(x, y) == target_color) matches++;
}
}
return matches;
}
This code is reasonably straightforward. It loops through the pixels calling the GetPixels method to get each pixel’s color. It then compares the pixel’s returned value to the target color.
The only strangeness here is that the Color class’s Equals method, which is used by == to determine equality, treats named colors differently from those obtained in other ways, including colors obtained with the GetPixel method. That means this method won’t work if you pass it a named color such as Color.Black. If you used such a color, the method would find no matching pixels.
The following code shows how this program uses the CountPixels method to count pixels that are black or white in the image.
// Count the black and white pixels.
private void btnCount_Click(object sender, EventArgs e)
{
Bitmap bm = new Bitmap(picImage.Image);
int black_pixels =
CountPixels(bm, Color.FromArgb(255, 0, 0, 0));
int white_pixels =
CountPixels(bm, Color.FromArgb(255, 255, 255, 255));
lblBlack.Text = black_pixels + " black pixels";
lblWhite.Text = white_pixels + " white pixels";
lblTotal.Text = white_pixels + black_pixels + " total pixels";
}
The code is also reasonably straightforward. The only thing to note is that it uses the colors returned by Color.FromArgb(255, 0, 0, 0) and Color.FromArgb(255, 255, 255, 255) instead of the named colors Color.Black and Color.White.
![[Essential Algorithms, Second Edition]](http://www.csharphelper.com/essential_algs_2e_158_200.jpg)
![[WPF 3d, Three-Dimensional Graphics with WPF and C#]](http://www.csharphelper.com/wpf3d_160_200.png)
![[The C# Helper Top 100]](http://www.csharphelper.com/top100_161_200.png)
![[Interview Puzzles Dissected]](http://www.csharphelper.com/interview_puzzles_161_200.jpg)
Lots of other posts show how to do this. The steps are:
– Add a OpenFileDialog to the form.
– Add something to let the user tell the program to open a file. For example, add a button or a File > Open menu item.
– When the user wants to open a file, call the OpenFileDialog’s ShowDialog method. If ShowDialog returns OK, then open the file given by the dialog’s FileName property.
For example, see today’s post Pixellate parts of an image in C#. It lets you open (save save) an image file.
Sorry but if you’re asking a question I don’t understand what it is.
Do you mean you want to calculate the area of the non-transparent pixels? You can use this same technique. Just look for pixels where the alpha component is 0. Those are the transparent ones. In other words:
This won’t work with pixels that are translucent (i.e. only partly transparent). Although you could do something like the following, which looks for pixels that are mostly transparent.
Welldone
How to count similar pixel blacks
For example : Count these color : RGB(6,4,7) RGB(3,9,11) RGB(4,6,2) …v.v
Because these color is very similar with RGB(0,0,0) . How to count for all the pixel like that.
You need to decide how to tell if a pixel is close enough. For example, you could calculate the squares of the differences between the red, green, and blue color components and count the pixel if the result is within a certain distance.
int dr = target_r - pixel.R; int dg = target_g - pixel.G; int db = target_b - pixel.B; if (dr * dr + dg * dg + db * db < difff_squared) matches++;Hello RodStephens, i’ve a question. How you have gotten this definition?
What definition?
This example was for a very specific problem. It’s not very generalizable.
Ok, is a Euclidian method ?.
Thanks
Yes. It’s the Euclidean distance formula in three dimensions. The dimensions are basically the red, green, and blue values.
The code compares the square of the distance to diff_squared so it doesn’t need to take the square root and that saves a little time. A program like this one performs a LOT of calculations for a large image, so the savings is worthwhile.
Sorry I didn’t make this clearer in the original post.
@RodStephens .. thanks a lot about your time and help
Can you use scanline to do this? How?
I’m not sure what you mean. This program loops through the pixels in the image by scanline, more or less.
This example is really only for small images. If you have a larger image, it will be slow. To make it faster, see this post:
Use the Bitmap32 class to manipulate image pixels very quickly in C#