1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
|
/* pgmminkowsky.c - read a portable graymap and calculate the Minkowski
** Integrals as a function of the threshold.
**
** Copyright (C) 2000 by Luuk van Dijk/Mind over Matter
**
** Based on pgmhist.c,
** Copyright (C) 1989 by Jef Poskanzer.
**
** Permission to use, copy, modify, and distribute this software and its
** documentation for any purpose and without fee is hereby granted, provided
** that the above copyright notice appear in all copies and that both that
** copyright notice and this permission notice appear in supporting
** documentation. This software is provided "as is" without express or
** implied warranty.
*/
#include "pgm.h"
#include "mallocvar.h"
#define MAX2(a,b) ( ( (a)>(b) ) ? (a) : (b) )
#define MAX4(a,b,c,d) MAX2( MAX2((a),(b)), MAX2((c),(d)) )
int main( int argc, char** argv ){
FILE *ifp;
gray maxval;
int cols, rows, format;
gray* prevrow;
gray* thisrow;
gray* tmprow;
int* countTile;
int* countEdgeX;
int* countEdgeY;
int* countVertex;
int i, col, row;
int maxtiles, maxedgex, maxedgey, maxvertex;
int area, perimeter, eulerchi;
double l2inv, linv;
/*
* parse arg and initialize
*/
pgm_init( &argc, argv );
if ( argc > 2 ) pm_usage( "[pgmfile]" );
if ( argc == 2 )
ifp = pm_openr( argv[1] );
else
ifp = stdin;
/*
* initialize
*/
pgm_readpgminit( ifp, &cols, &rows, &maxval, &format );
prevrow = pgm_allocrow( cols );
thisrow = pgm_allocrow( cols );
MALLOCARRAY(countTile , maxval + 1 );
MALLOCARRAY(countEdgeX , maxval + 1 );
MALLOCARRAY(countEdgeY , maxval + 1 );
MALLOCARRAY(countVertex , maxval + 1 );
if (countTile == NULL || countEdgeX == NULL || countEdgeY == NULL ||
countVertex == NULL)
pm_error( "out of memory" );
for ( i = 0; i <= maxval; i++ ) countTile[i] = 0;
for ( i = 0; i <= maxval; i++ ) countEdgeX[i] = 0;
for ( i = 0; i <= maxval; i++ ) countEdgeY[i] = 0;
for ( i = 0; i <= maxval; i++ ) countVertex[i] = 0;
/* first row */
pgm_readpgmrow( ifp, thisrow, cols, maxval, format );
/* tiles */
for ( col = 0; col < cols; ++col ) ++countTile[thisrow[col]];
/* y-edges */
for ( col = 0; col < cols; ++col ) ++countEdgeY[thisrow[col]];
/* x-edges */
++countEdgeX[thisrow[0]];
for ( col = 0; col < cols-1; ++col )
++countEdgeX[ MAX2(thisrow[col], thisrow[col+1]) ];
++countEdgeX[thisrow[cols-1]];
/* shortcut: for the first row, countVertex == countEdgeX */
++countVertex[thisrow[0]];
for ( col = 0; col < cols-1; ++col )
++countVertex[ MAX2(thisrow[col], thisrow[col+1]) ];
++countVertex[thisrow[cols-1]];
for ( row = 1; row < rows; ++row ){
tmprow = prevrow;
prevrow = thisrow;
thisrow = tmprow;
pgm_readpgmrow( ifp, thisrow, cols, maxval, format );
/* tiles */
for ( col = 0; col < cols; ++col ) ++countTile[thisrow[col]];
/* y-edges */
for ( col = 0; col < cols; ++col )
++countEdgeY[ MAX2(thisrow[col], prevrow[col]) ];
/* x-edges */
++countEdgeX[thisrow[0]];
for ( col = 0; col < cols-1; ++col )
++countEdgeX[ MAX2(thisrow[col], thisrow[col+1]) ];
++countEdgeX[thisrow[cols-1]];
/* vertices */
++countVertex[ MAX2(thisrow[0],prevrow[0]) ];
for ( col = 0; col < cols-1; ++col )
++countVertex[
MAX4(thisrow[col], thisrow[col+1], prevrow[col], prevrow[col+1])
];
++countVertex[ MAX2(thisrow[cols-1],prevrow[cols-1]) ];
} /* for row */
/* now thisrow contains the top row*/
/* tiles and x-edges have been counted, now upper
y-edges and top vertices remain */
/* y-edges */
for ( col = 0; col < cols; ++col ) ++countEdgeY[ thisrow[col] ];
/* vertices */
++countVertex[thisrow[0]];
for ( col = 0; col < cols-1; ++col )
++countVertex[ MAX2(thisrow[col],thisrow[col+1]) ];
++countVertex[ thisrow[cols-1] ];
/* cleanup */
maxtiles = rows * cols;
maxedgex = rows * (cols+1);
maxedgey = (rows+1) * cols;
maxvertex= (rows+1) * (cols+1);
l2inv = 1.0/maxtiles;
linv = 0.5/(rows+cols);
/* And print it. */
printf( "#threshold\t tiles\tx-edges\ty-edges\tvertices\n" );
printf( "#---------\t -----\t-------\t-------\t--------\n" );
for ( i = 0; i <= maxval; i++ ){
if( !(countTile[i] || countEdgeX[i] || countEdgeY[i] || countVertex[i] ) )
continue; /* skip empty slots */
area = maxtiles;
perimeter = 2*maxedgex + 2*maxedgey - 4*maxtiles;
eulerchi = maxtiles - maxedgex - maxedgey + maxvertex;
printf( "%f\t%6d\t%7d\t%7d\t%8d\t%g\t%g\t%6d\n", (float) i/(1.0*maxval),
maxtiles, maxedgex, maxedgey, maxvertex,
area*l2inv, perimeter*linv, eulerchi
);
maxtiles -= countTile[i];
maxedgex -= countEdgeX[i];
maxedgey -= countEdgeY[i];
maxvertex-= countVertex[i];
/* i, countTile[i], countEdgeX[i], countEdgeY[i], countVertex[i] */
}
/* these should be zero: */
printf( "# check:\t%6d\t%7d\t%7d\t%8d\n",
maxtiles, maxedgex, maxedgey, maxvertex );
pm_close( ifp );
exit( 0 );
} /*main*/
|
