Question

I am currently implementing a method that accepts two bitmap objects. We can assume that said objects are of equal dimensions etc. The return of the method is a list of Pixel changes (this is stored in a self-made object). This is being developed in an iterative manner so the current implementation was a basic one… simply work through each pixel and compare it to its counterpart. This method for generating changes is slower than acceptable (500ms or so), as such I am looking for a faster process.

Ideas that have crossed my mind are to break down the image into strips and run each comparison on a new thread or to compare zones of the screen as objects first then only examine in detail as required.

current code for your understanding…

   for (int x = 0; x < screenShotBMP.Width; x++)
   {
       for (int y = 0; y < screenShotBMP.Height; y++)
       {
           if (screenShotBMP.GetPixel(x, y) != _PreviousFrame.GetPixel(x, y))
           { 
             _pixelChanges.Add(new PixelChangeJob(screenShotBMP.GetPixel(x,y), x, y));
           }
       }
   }

As you will deduct from the code the concept of the class in question is to take a screenshot and generate a list of pixel changes from the previously taken screenshot.

Answer 1

You should definitely look at the Lockbits method of manipulating bitmap data.

It is orders of magnitude faster than GetPixel/SetPixel.

EDIT:
Check this link for some code (albeit in VB, but you should get the drift) that almost does what you want. It is simply checking two bitmaps for equality and returning true or false. You could change the function so each pixel check adds to your _pixelChanges list if necessary, and return this list instead of a boolean.

Also, it may be faster if you swap round the iterator loops. i.e. have the inner loop iterating over X, and the outer loop iterating over Y.