Separating groups of pixels



Dear all,
Here's the problem. I've got some pixels defined in a file, e.g. x,y =
RGB, stored in random order. These pixels represent two blobs of solid
colour, of unknown shape, at different locations in the bitmap image.
These two blobs are not connected by pixels of similar colour. I need
to write an algorithm that'll only display one of those two blobs, i.e.
only show x,y coordinatees that are adjacent to one another. Is there a
fast, standard algorithm for this? If not, I'll have to hack :)

Many thanks.

.



Relevant Pages

  • Re: Selecting two colours from an image
    ... segment the image to remove any unwanted pixels. ... white blobs that don't adjoin green blobs can be ... Once you find a non-green pixel, ... check and discard the region. ...
    (sci.image.processing)
  • Re: Remove speckles in bilevel (bw) image
    ... I suspect freeware with an appeal for contribution ... > pixels, that are not processed. ... To keep all 4 and higher count blobs, ... If you dont want to change the letters at all, ...
    (sci.image.processing)
  • Re: Remove speckles in bilevel (bw) image
    ... "ScanFilter" of Jens Dierke, that this thread has been fortunate ... Examples have recently led me to recommend elimination of a ... WHAT ARE 4-CONNECTIVITY BLOBS? ... the standard grid of square pixels. ...
    (sci.image.processing)
  • Re: Finding the largest blob in a binary image
    ... just prior to loosing all non-zero pixels. ... Those surviving pixels ... Yes if your blobs are of a similar shape. ... Then, if the blobs are guaranteed to be separated, two projections on X and Y axes would give ...
    (sci.image.processing)

Loading