Connected Components not quite working

philmetz 0 Light Poster

14 Years Ago

Ok see the attachments(note i have converted the images to gif as pgm is not allowed to be uploaded)

I am trying to do Connected Components Labeling in an image (Gaus.gif) and output the result (smallOut.gif)

It almost works except for one little part in the smallOut.gif. The first object from the left the top left of that object you will notice a dfferent color. Not sure why its doing that.
The link here http://www.sendspace.com/file/yc0h9x has all the files used to run the program, just run make and ./process

Could someone help please?

process.c (5.11 KB)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

#include "pgmfile.h"
#include "malloc_image.h"

#define BLACK 0
#define WHITE 255
#define FALSE 0
#define TRUE !FALSE
#define DEFAULT_SIZE 512

void process_image(int, char *, char *, int, int);

int main(int argc, char *argv[])
{ 
	int set_file_in, set_file_out;
	int width, height, bkPx=0;
	char file_out[255] = "smallOUT.pgm";
	
	int pgmfile;
 	width = DEFAULT_SIZE;
	height = DEFAULT_SIZE; 
	set_file_in = FALSE;
	set_file_out = FALSE;

	pgmfile = FALSE;

        set_file_in = TRUE;
        pgmfile = TRUE;

        set_file_out = TRUE; 

	unsigned char **image_out;  /* specify image array - char image */
	struct pgmfile pg;
		
	char file_in[255];
	sprintf( file_in, "Gaus.pgm");
	int i, j;
	unsigned char **image_in;  /* specify image array - char image */

	get_pgm_header(file_in,&pg);
    	height = pg.pgm_height;
    	width = pg.pgm_width;	
	
	image_in = malloc_char_image(width,height);

	read_pgm_image(image_in,file_in,&pg);
	  
	image_out = malloc_char_image(width,height);

	
	int array2[height][width];
	int h, w;
	for (h=0;h<height;h++) 
	{
	    	for (w=0;w<width;w++) 
		{
			array2[h][w] = 0;
		}
	}
	for (j=0;j<height;j++) 
	{
	    	for (i=0;i<width;i++) 
		{
	      		array2[j][i] = image_in[j][i];
	    	}
	}
		

	//LINKED LIST
	struct list 
	{
		int one, two;
        	struct list * next;
	};
	typedef struct list item;
	//END OF LINKED LIST

	//CONNECTED COMPONENT LABELING***************************************************************
	item * cur, * head;
	int label=0, cont=0, b, labelCount=0;
	int sort[4], objects[20], add=0, listi, count=0;
	head = NULL;
	printf("height %d, width %d\n", height, width);
	for (j=0;j<height;j++) 
	{
	    	for (i=0;i<width;i++) 
		{
			if(array2[j][i] != bkPx)
			{
				if(j-1 >= 0 && i-1 >= 0 && array2[j-1][i-1] != bkPx) // TL //Deal with boundaries
				{
					sort[add++] = array2[j-1][i-1];
				}				
				if(j-1 >= 0 && array2[j-1][i] != bkPx) // TT
				{ 
					sort[add++] = array2[j-1][i];
				}				
				if(j-1 >= 0 && i+1 < width && array2[j-1][i+1] != bkPx) // TR 
				{
					sort[add++] = array2[j-1][i+1];
				}
				if(i-1 >= 0 && array2[j][i-1] != bkPx) // LL
				{
					sort[add++] = array2[j][i-1];
				}
			
			
				if(add == 0)
				{
					array2[j][i] = label;
					label++;
				}
				else if(add == 1) 				
				{
					array2[j][i] = sort[0];
				}																																																																																																																																																																																																																																																																																																																																																																																																																																																							
				else
				{
					//BUBBLE SORT***********************************************	
					int bubbleI, bubbleJ, temp;

					for (bubbleI = (add - 1); bubbleI >= 0; bubbleI--)
					{
						for (bubbleJ = 1; bubbleJ <= bubbleI; bubbleJ++)
						{
							if (sort[bubbleJ-1] > sort[bubbleJ])
							{
								temp = sort[bubbleJ-1];
								sort[bubbleJ-1] = sort[bubbleJ];
								sort[bubbleJ] = temp;
							}
						}
					}
					int addList = add;
					for(b=1; b<add; b++)
					{					
						if(sort[i] == sort[0])
							addList--;	
					}
					//END OF BUBBLE SORT****************************************

					array2[j][i] = sort[0];

					//ADD EQUIVALENCES******************************************
					for(listi=1;listi<addList;listi++) 
					{
						if(sort[listi] != sort[0])
						{
							cur = (item *)malloc(sizeof(item));
							cur->one = sort[0];
							cur->two = sort[listi];
							cur->next  = head;
							head = cur;
							count++;
						}
					}
					cur = head;
					//END OF EQUIVALENCES***************************************
				}
			}
			add=0;
	    	}
	}
	printf("LABEL %d and count %d\n", label, count);

	//DEAL WITH EQUIVALENCES*********************************************************************
	
	for(listi=0; listi<count; listi++)
	{
		for (j=0;j<height;j++) 
		{
	    		for (i=0;i<width;i++) 
			{
				if(array2[j][i] == cur->two && array2[j][i] != bkPx)
				{
					array2[j][i] = cur->one;			
				}	
			}
		}
		cur = cur->next;			
	}

	for (j=0;j<height;j++) 
	{
	    	for (i=0;i<width;i++) 
		{
	      		image_out[j][i] = array2[j][i]*50;
	    	}
	}
	write_pgm_image(image_out, file_out, &pg);

	//HOW MANY OBJECTS
	int current=0, lab;
	for (j=0;j<height;j++) 
	{
		for (i=0;i<width;i++) 
		{
			if(array2[j][i] != bkPx && array2[j][i] > labelCount && array2[j][i] > lab)
			{
				objects[current++] = array2[j][i];
				lab = array2[j][i];
			}
		}
	}
	
	//END OF DEAL WITH EQUIVALENCES*************************************************************
	printf("LABEL %d and count %d cont %d\n", current-1, count, cont);	
	
	//END OF CONNECTED COMPONENT LABELING********************************************************
	
	int jj, ii;
	for (jj=0;jj<current;jj++) 
	{
		//for (ii=0;ii<current;ii++) 
		//{
			printf("Object %d: %d\n", jj, objects[jj]);
		//}
	}
}

1 Contributor
0 Replies
97 Views

Be the first to reply

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.