膨胀与腐蚀算法C语言代码

膨胀和腐蚀C语言代码，头文件在之前上传的资源中。

#include <math.h>
#include <iostream> 
#include <string.h>
#include "matrix.h"
#include <time.h>
#include <float.h>
#include <stdio.h>
#include <stdlib.h>
#include "imageBase.h"
#include "image.h"


void getStructuringElement(MORPH_TYPE_t shape, unsigned char *elem,SIZE_t ksize)
{
    int i, j;
    int r = 0, c = 0;
    double inv_r2 = 0;
	vect2i anchor;
	
    if( shape != MORPH_RECT && shape != MORPH_CROSS && shape != MORPH_ELLIPSE )
    {
		return;
    }

    anchor.x  = ksize.width >> 1;
	anchor.y  = ksize.height >> 1;
	
	if( ksize.area == 1 )
        shape = MORPH_RECT;

    if( shape == MORPH_ELLIPSE )
    {
        r = ksize.height/2;
        c = ksize.width/2;
        inv_r2 = r ? 1./((double)r*r) : 0;
    }

    for( i = 0; i < ksize.height; i++ )
    {
        unsigned char* ptr = &elem[i * ksize.width];
        int j1 = 0, j2 = 0;

        if( shape == MORPH_RECT || (shape == MORPH_CROSS && i == anchor.y) )
            j2 = ksize.width;
        else if( shape == MORPH_CROSS )
            j1 = anchor.x, j2 = j1 + 1;
        else
        {
            int dy = i - r;
            if( abs(dy) <= r )
            {
                int dx = (int)((float)c*sqrt((r*r - dy*dy)*inv_r2));
                j1 = MAX( c - dx, 0 );
                j2 = MIN( c + dx + 1, ksize.width );
            }
        }

        for( j = 0; j < j1; j++ )
            ptr[j] = 0;
        for( ; j < j2; j++ )
            ptr[j] = 1;
        for( ; j < ksize.width; j++ )
            ptr[j] = 0;
    }
}
unsigned char maxPix(unsigned char * src,int n)
{
	unsigned char max = 0;

	for(int i = 0;i < n;i++)
	{
		if(max < src[i])
			max = src[i];
	}
	return max;
}
unsigned char minPix(unsigned char * src,int n)
{
	unsigned char min = 255u;

	for(int i = 0;i < n;i++)
	{
		if(min > src[i])
			min = src[i];
	}
	return min;
}

void mvDilate(IMAGE_t * src,IMAGE_t *dst,unsigned char *elem,SIZE_t ksize)
{
	int i,j,p,q;
	unsigned char *elemTempData = (unsigned char *)malloc(ksize.area);

	memcpy(dst->imageData,src->imageData,src->imageSize);
	
	for(i = ksize.height >> 1;i < src->height - (ksize.height >> 1);i++)
	{
		for(j = ksize.width >> 1;j < src->width - (ksize.width >> 1);j++)
		{
			unsigned char *tmp = &src->imageData[i * src->width + j];
			for(p = -ksize.height >> 1;p < ksize.height >> 1;p++)
			{
				for(q = -ksize.width >> 1;q < ksize.width >> 1;q++)
				{
					short val = tmp[p * src->width + q] + elem[p * ksize.width + q];
					if(val > 255u)
					{
						val = 255u;
					}
					if(elem[p * ksize.width + q] == 0)
						val = 0;
					elemTempData[p * ksize.width + q] = (unsigned char)val;
				}
			}
			dst->imageData[i * src->width + j] = maxPix(elemTempData,ksize.area);
		}
	}
}
void mvErode(IMAGE_t * src,IMAGE_t *dst,unsigned char *elem,SIZE_t ksize)
{
	
	int i,j,p,q;
	unsigned char *elemTempData = (unsigned char *)malloc(ksize.area);

	memcpy(dst->imageData,src->imageData,src->imageSize);
	
	for(i = ksize.height >> 1;i < src->height - (ksize.height >> 1);i++)
	{
		for(j = ksize.width >> 1;j < src->width - (ksize.width >> 1);j++)
		{
			unsigned char *tmp = &src->imageData[i * src->width + j];
			for(p = -ksize.height >> 1;p < ksize.height >> 1;p++)
			{
				for(q = -ksize.width >> 1;q < ksize.width >> 1;q++)
				{
					short val = tmp[p * src->width + q] - elem[p * ksize.width + q];
					if(val < 0)
					{
						val = 0;
					}
					if(elem[p * ksize.width + q] == 0)
						val = 255u;
					elemTempData[p * ksize.width + q] = (unsigned char)val;
				}
			}
			dst->imageData[i * src->width + j] = minPix(elemTempData,ksize.area);
		}
	}
}