35
440
APPENDIX F. SOURCE CODE LISTINGS
/* four corners */
for(i=w; i>0; i--){
im[i-1][i-1] = im[i][i];
im[i-1][cols-(i-1)] = im[i][cols-1-(i-1)];
im[rows-(i-1)][i-1] = im[rows-1-(i-1)][i];
im[rows-(i-1)][cols-(i-1)] = im[rows-1-(i-1)][cols-1-(i-1)];
} /* ends four corners loop */
for(i=0; i<rows; i++){
for(j=w; j>0; j--){
im[i][j-1] = im[i][j];
im[i][cols-j] = im[i][cols-j-1];
}
}
for(j=0; j<cols; j++){
for(i=w; i>0; i--){
im[i-1][j] = im[i][j];
im[rows-i][j] = im[rows-i-1][j];
}
}
} /* ends fix_edges */
Listing 5.1 - The Edge Detector Subroutines
F.6 Code Listings for Chapter 6
#include "cips.h"
short g7[7][7] = {
{ 0, 0, -1, -1, -1, 0, 0},
{ 0, -2, -3, -3, -3, -2, 0},
{ -1, -3, 5, 5, 5, -3, -1},
{ -1, -3, 5, 16, 5, -3, -1},
{ -1, -3, 5, 5, 5, -3, -1},
{ 0, -2, -3, -3, -3, -2, 0},
{ 0, 0, -1, -1, -1, 0, 0}};
short g9[9][9] = {
{ 0, 0, 0, -1, -1, -1, 0, 0, 0},
48
F.6. CODE LISTINGS FOR CHAPTER 6
441
{ 0, -2, -3, -3, -3, -3, -3, -2, 0},
{ 0, -3, -2, -1, -1, -1, -2, -3, 0},
{ -1, -3, -1,
9, 9, 9, -1, -3, -1},
{ -1, -3, -1,
9, 19, 9, -1, -3, -1},
{ -1, -3, -1,
9, 9, 9, -1, -3, -1},
{ 0, -3, -2, -1, -1, -1, -2, -3, 0},
{ 0, -2, -3, -3, -3, -3, -3, -2, 0},
{ 0, 0, 0, -1, -1, -1, 0, 0, 0}};
short e_mask[3][3] = {
{-9, 0, -9},
{ 0, 36, 0},
{-9, 0, -9} };
short contrast[3][3] = {
{ 1, 1, 1},
{ 1, 1, 1},
{ 1, 1, 1}};
short enhance_mask[3][3] = {
{-1, 0, -1},
{ 0, 4, 0},
{-1, 0, -1} };
/**************************************************
*
*
homogeneity(...
*
*
This function performs edge detection by looking
*
for the absence of an edge. The center of a
*
3x3 area is replaced by the absolute value of
*
the max difference between the center point
*
and its 8 neighbors.
*
***************************************************/
homogeneity(the_image, out_image,
rows, cols, bits_per_pixel,
threshold, high)
int
high, threshold;
short **the_image, **out_image;
37
442
APPENDIX F. SOURCE CODE LISTINGS
long
rows, cols, bits_per_pixel;
{
int a, b, absdiff, absmax, diff, i, j,
length, max, max_diff, new_hi, new_low, width;
new_hi = 250;
new_low = 16;
if(bits_per_pixel == 4){
new_hi = 10;
new_low = 3;
}
max = 255;
if(bits_per_pixel == 4)
max = 16;
for(i=0; i<rows; i++){
for(j=0; j<cols; j++){
out_image[i][j] = 0;
}
}
for(i=1; i<rows-1; i++){
if( (i%10) == 0) printf("%4d", i);
for(j=1; j<cols-1; j++){
max_diff = 0;
for(a=-1; a<=1; a++){
for(b=-1; b<=1; b++){
diff = the_image[i][j] -
the_image[i+a][j+b];
absdiff = abs(diff);
if(absdiff > max_diff)
max_diff = absdiff;
} /* ends loop over b */
} /* ends loop over a */
out_image[i][j] = max_diff;
} /* ends loop over j */
} /* ends loop over i */
53
F.6. CODE LISTINGS FOR CHAPTER 6
443
/* if desired, threshold the output image */
if(threshold == 1){
for(i=0; i<rows; i++){
for(j=0; j<cols; j++){
if(out_image[i][j] > high){
out_image[i][j] = new_hi;
}
else{
out_image[i][j] = new_low;
}
}
}
} /* ends if threshold == 1 */
} /* ends homogeneity */
/**************************************************
*
*
difference_edge(...
*
*
This function performs edge detection by looking
*
at the differences in the pixels that surround
*
the center point of a 3x3 area. It replaces the
*
center point with the absolute value of the
*
max difference of:
*
upper left - lower right
*
upper right - lower left
*
left - right
*
top - bottom
*
***************************************************/
difference_edge(the_image, out_image,
rows, cols, bits_per_pixel,
threshold, high)
int
high, threshold;
short **the_image, **out_image;
long
rows, cols, bits_per_pixel;
{
int a, b, absdiff, absmax, diff, i, j,
length, max, max_diff, new_hi, new_low, width;
new_hi = 250;
34
444
APPENDIX F. SOURCE CODE LISTINGS
new_low = 16;
if(bits_per_pixel == 4){
new_hi = 10;
new_low = 3;
}
max = 255;
if(bits_per_pixel == 4)
max = 16;
for(i=0; i<rows; i++)
for(j=0; j<cols; j++)
out_image[i][j] = 0;
for(i=1; i<rows-1; i++){
if( (i%10) == 0) printf("%4d", i);
for(j=1; j<cols-1; j++){
max_diff = 0;
absdiff = abs(the_image[i-1][j-1] -
the_image[i+1][j+1]);
if(absdiff > max_diff) max_diff = absdiff;
absdiff = abs(the_image[i-1][j+1] -
the_image[i+1][j-1]);
if(absdiff > max_diff) max_diff = absdiff;
absdiff = abs(the_image[i][j-1] -
the_image[i][j+1]);
if(absdiff > max_diff) max_diff = absdiff;
absdiff = abs(the_image[i-1][j] -
the_image[i+1][j]);
if(absdiff > max_diff) max_diff = absdiff;
out_image[i][j] = max_diff;
} /* ends loop over j */
} /* ends loop over i */
/* if desired, threshold the output image */
if(threshold == 1){
41
F.6. CODE LISTINGS FOR CHAPTER 6
445
for(i=0; i<rows; i++){
for(j=0; j<cols; j++){
if(out_image[i][j] > high){
out_image[i][j] = new_hi;
}
else{
out_image[i][j] = new_low;
}
}
}
} /* ends if threshold == 1 */
} /* ends difference_edge */
/************************************************
*
*
gaussian_edge(...
*
*
*************************************************/
gaussian_edge(the_image, out_image,
rows, cols, bits_per_pixel,
size, threshold, high)
int
high, size, threshold;
short **the_image,
**out_image;
long
rows, cols, bits_per_pixel;
{
char response[80];
long sum;
int a, b, absdiff, absmax, diff, i, j,
length, lower, max, new_hi, new_low,
scale, starti, stopi, startj, stopj,
upper, width;
new_hi = 250;
new_low = 16;
if(bits_per_pixel == 4){
new_hi = 10;
37
446
APPENDIX F. SOURCE CODE LISTINGS
new_low = 3;
}
max = 255;
if(bits_per_pixel == 4)
max = 16;
if(size == 7){
lower = -3;
upper = 4;
starti = 3;
startj = 3;
stopi = rows-3;
stopj = cols-3;
scale = 2;
}
if(size == 9){
lower = -4;
upper = 5;
starti = 4;
startj = 4;
stopi = rows-4;
stopj = cols-4;
scale = 2;
}
for(i=0; i<rows; i++)
for(j=0; j<cols; j++)
out_image[i][j] = 0;
for(i=starti; i<stopi; i++){
if ( (i%10) == 0) printf(" i=%d", i);
for(j=startj; j<stopj; j++){
sum = 0;
for(a=lower; a<upper; a++){
for(b=lower; b<upper; b++){
if(size == 7)
sum = sum + the_image[i+a][j+b] *
g7[a+3][b+3];
43
F.6. CODE LISTINGS FOR CHAPTER 6
447
if(size == 9)
sum = sum + the_image[i+a][j+b] *
g9[a+4][b+4];
} /* ends loop over a */
} /* ends loop over b */
if(sum < 0) sum = 0;
if(sum > max) sum = max;
out_image[i][j] = sum;
} /* ends loop over j */
} /* ends loop over i */
/* if desired, threshold the output image */
if(threshold == 1){
for(i=0; i<rows; i++){
for(j=0; j<cols; j++){
if(out_image[i][j] > high){
out_image[i][j] = new_hi;
}
else{
out_image[i][j] = new_low;
}
}
}
} /* ends if threshold == 1 */
} /* ends gaussian_edge */
/**************************************************
*
*
contrast_edge(...
*
*
The edge detector uses the basic quick edge
*
detector mask and then divides the result
*
by a contrast smooth mask. This implements
*
Johnson’s contrast based edge detector.
*
***************************************************/
contrast_edge(the_image, out_image,
rows, cols, bits_per_pixel,
41
448
APPENDIX F. SOURCE CODE LISTINGS
threshold, high)
int
high, threshold;
short **the_image, **out_image;
long
rows, cols, bits_per_pixel;
{
int ad, d;
int a, b, absdiff, absmax, diff, i, j,
length, max, new_hi, new_low,
sum_d, sum_n, width;
new_hi = 250;
new_low = 16;
if(bits_per_pixel == 4){
new_hi = 10;
new_low = 3;
}
max = 255;
if(bits_per_pixel == 4)
max = 16;
for(i=0; i<rows; i++)
for(j=0; j<cols; j++)
out_image[i][j] = 0;
for(i=1; i<rows-1; i++){
if( (i%10) == 0) printf("%4d", i);
for(j=1; j<cols-1; j++){
sum_n = 0;
sum_d = 0;
for(a=-1; a<2; a++){
for(b=-1; b<2; b++){
sum_n = sum_n + the_image[i+a][j+b] *
e_mask[a+1][b+1];
sum_d = sum_d + the_image[i+a][j+b] *
contrast[a+1][b+1];
}
}
d = sum_d / 9;
if(d == 0)
d = 1;
Documents you may be interested
Documents you may be interested