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 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
| #include "mex.h"
void mexFunction( int nlhs, mxArray *plhs[],
int nrhs, const mxArray *prhs[]) {
# include <math.h>
# include <conio.h>
# include <stdlib.h>
# include <stdio.h>
# include <alloc.h>
# include <io.h>
float disco (char fichero[], int nfil, int ncol, int control,
char huge *a, int tipo);
void ordena ( float huge *mod, long huge *orden, long int nd );
void main(void)
{
char arch[30],arch0[30],arch1[30],archi[30];
float huge *i;
float huge *i1;
float huge *masque;
long huge *qq;
float pi, th, sumpos, sumneg, delta;
int dim, j;
long n2, n1, cont=0;
long int p1, p2, p3, p4;
/*pi=3.141592654;*/
clrscr();
gotoxy(2,2);
printf(" dimension du fichier: ");
scanf("%d",&dim);
gotoxy(2,4);
n2=(long)dim * (long)dim ;
p1 = 0L; p2 = (long)(dim/2);
p3 = (long)dim* p2;
p4 = p3 + p2;
i=farcalloc((unsigned)n2,4);
i1=farcalloc((unsigned)n2,4);
masque=farcalloc((unsigned)n2,4);
qq=farcalloc(n2,sizeof(long int));
if ( i== NULL || i1== NULL || qq==NULL || masque==NULL){
printf ( "\n\a\a no hay memoria ");
goto fin;
}
bik:
clrscr();
gotoxy(2,4);
printf(" la valeur seuille th: ");
scanf("%f",&th);
clrscr();
gotoxy(2,8);
printf(" donner le nom de la phase a analyser: ");
scanf("%s",&arch0);
j=disco(arch0,dim,dim,1,(char*)i,4);
if(j!=1) goto fin;
gotoxy(2,10);
printf(" donner l'amplitude de l'objet a discriminer: ");
scanf("%s",&arch1);
j=disco(arch1,dim,dim,1,(char*)i1,4);
if(j!=1) goto fin;
gotoxy(2,12);
printf(" donner le nom du masque optimal: ");
scanf("%s",&archi);
for( n1=0; n1<n2; n1++ ){
i1[n1] *= (float)cos( (double)i[n1] );
masque[n1] = 1;
}
masque[p1] = masque[p2] = masque[p3] = masque[p4] = 0;
i1[p1] = i1[p2] = i1[p3] = i1[p4] = 0;
ordena ( i1, qq, n2 );
n1=0; sumpos = sumneg = 0;
while (i1[ qq[n1] ] >0) {
sumpos += i1[ qq[n1] ];
n1++;
}
for(; n1<n2; n1++) sumneg += i1[ qq[n1] ];
delta = sumpos + sumneg;
if( delta < 0 && fabs((double)delta) > th ) {
n1=n2-1;
while ( delta < 0 && fabs((double)delta) > th ){
masque[ qq[n1] ] = 0;
delta -= i1[ qq[n1] ];
n1--; cont++;
delta -= i1[ qq[n1] ];
n1--; cont++;
}
} else if ( delta > th ){
n1=0;
while ( delta > th ){
masque[ qq[n1] ] = 0;
delta -= i1[ qq[n1] ];
n1++; cont++;
delta -= i1[ qq[n1] ];
n1++; cont++;
}
}
clrscr();
gotoxy(10, 10);
printf("Number of blocked pixels = %ld, %f",
cont+4L, (float)(cont+4L)/(float)n2);
gotoxy(10, 14);
printf("threshold = %f, delta = %f", th, delta);
j=disco(archi,dim,dim,2,(char*)masque,4);
if(j!=1) goto fin;
fin:
farfree((void far*)i);
farfree((void far *)i1);
farfree((void far *)masque);
farfree((void far *)qq);
}
/***************************************************/
/* ORDENA */
/* classés du plus grand au plus petit des éléments*/
/* vecteur mod[]. L'ordre des éléments*/
/* donnée dans la matrice orden[]. orden[0] nous donne*/
/* élément m maximum, orden[1] ce qui suit, ... */
/* orden[nd-1] l'élément m de petites*/
/***************************************************/
void ordena ( float huge *mod, long huge *orden, long int nd )
{
long kac, kfin, k, k1, o, p, p1;
kfin = nd-1;
do {
k = -1; kac = 0; k1 = 0;
do {
k++; k1++;
if ( mod[ orden[k] ] < mod[ orden[k1] ] ){
o = orden[k]; orden[k] = orden[k1]; orden[k1] = o;
kac = k1; p = k; p1 = k-1;
while ( p1>0 ) {
if( mod[orden[p]] > mod[orden[p1]] ){
o = orden[p]; orden[p] = orden[p1]; orden[p1] = o;
p--; p1--;
} else p1 =0;
};
}
} while ( k1 < kfin );
kfin = kac; printf("\n %ld", kfin);
} while ( kfin > 1 );
}
/*********************************************************************\
* *
* *
* DISCO.C *
* ======= *
* *
* Numéros, le transfert de routine de tout type de*
* mémoire variable sur un disque ou un disque*
* à une variable de la mémoire. *
* *
* --------- *
* *
* Paramètre: *
* *
* fichero - Nom du fichier disque. *
* nfil, ncol - Nombre de lignes et de colonnes. *
* control - 1 pour lire le fichier. *
* 2 d'enregistrer dans le fichier. *
* a - pointeur vers une variable. *
* tipo - nombre d'octets par élément variable. *
* *
* *
\*********************************************************************/
float disco (char fichero[], int nfil, int ncol, int control,
char huge *a, int tipo)
{
long int n, cont, ng;
int unidad, j, cociente, resto;
if (control == 1) {
if ((unidad = open (fichero,1)) == -1) {
return (-1);
}
cont = (long) nfil * (long) ncol * tipo;
resto = cont % 32768;
cociente = cont / 32768;
for (j = 0, n = 0; j < cociente; j++,n += 32768)
_read (unidad, (char*)&a[n], 32768);
_read (unidad, (char*)&a[n], resto);
close (unidad);
return (1);
}
if (control == 2) {
if ((unidad = creat (fichero, 200)) == -1) {
return (-1);
}
cont = (long) nfil * (long) ncol * tipo;
resto = cont % 32768;
cociente = cont / 32768;
ng = 0;
for (j = 0, n = 0; j < cociente; j++, n += 32768)
ng = ng + (unsigned) _write (unidad, (char*)&a[n], 32768);
ng = ng + (unsigned) _write (unidad, (char*)&a[n], resto);
if (ng != cont) {
return (0);
}
close (unidad);
return (1);
}
return (0);
}
} |
Partager