00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021 #include <stdlib.h>
00022 #include <math.h>
00023 #include <limits.h>
00024 #include <complex.h>
00025
00026 #include "nfft3.h"
00027 #include "nfft3util.h"
00028
00035 void reconstruct(char* filename,int N,int M,int iteration , int weight)
00036 {
00037 int j,k,l;
00038 double time,min_time,max_time,min_inh,max_inh;
00039 double t,real,imag;
00040 double w,epsilon=0.0000003;
00041 ;
00042 mri_inh_3d_plan my_plan;
00043 solver_plan_complex my_iplan;
00044 FILE* fp,*fw,*fout_real,*fout_imag,*finh,*ftime;
00045 int my_N[3],my_n[3];
00046 int flags = PRE_PHI_HUT| PRE_PSI |MALLOC_X| MALLOC_F_HAT|
00047 MALLOC_F| FFTW_INIT| FFT_OUT_OF_PLACE;
00048 unsigned infft_flags = CGNR | PRECOMPUTE_DAMP;
00049
00050 double Ts;
00051 double W;
00052 int N3;
00053 int m=2;
00054 double sigma = 1.25;
00055
00056 ftime=fopen("readout_time.dat","r");
00057 finh=fopen("inh.dat","r");
00058
00059 min_time=INT_MAX; max_time=INT_MIN;
00060 for(j=0;j<M;j++)
00061 {
00062 fscanf(ftime,"%le ",&time);
00063 if(time<min_time)
00064 min_time = time;
00065 if(time>max_time)
00066 max_time = time;
00067 }
00068
00069 fclose(ftime);
00070
00071 Ts=(min_time+max_time)/2.0;
00072
00073
00074 min_inh=INT_MAX; max_inh=INT_MIN;
00075 for(j=0;j<N*N;j++)
00076 {
00077 fscanf(finh,"%le ",&w);
00078 if(w<min_inh)
00079 min_inh = w;
00080 if(w>max_inh)
00081 max_inh = w;
00082 }
00083 fclose(finh);
00084
00085 N3=ceil((NFFT_MAX(fabs(min_inh),fabs(max_inh))*(max_time-min_time)/2.0+m/(2*sigma))*4*sigma);
00086
00087 if(N3%2!=0)
00088 N3++;
00089
00090 W= NFFT_MAX(fabs(min_inh),fabs(max_inh))/(0.5-((double) m)/N3);
00091
00092 my_N[0]=N;my_n[0]=ceil(N*sigma);
00093 my_N[1]=N; my_n[1]=ceil(N*sigma);
00094 my_N[2]=N3; my_n[2]=ceil(N3*sigma);
00095
00096
00097 mri_inh_3d_init_guru(&my_plan, my_N, M, my_n, m, sigma, flags,
00098 FFTW_MEASURE| FFTW_DESTROY_INPUT);
00099
00100 if (weight)
00101 infft_flags = infft_flags | PRECOMPUTE_WEIGHT;
00102
00103
00104 solver_init_advanced_complex(&my_iplan,(mv_plan_complex*)(&my_plan), infft_flags );
00105
00106
00107 if(my_iplan.flags & PRECOMPUTE_WEIGHT)
00108 {
00109 fw=fopen("weights.dat","r");
00110 for(j=0;j<my_plan.M_total;j++)
00111 {
00112 fscanf(fw,"%le ",&my_iplan.w[j]);
00113 }
00114 fclose(fw);
00115 }
00116
00117
00118 if(my_iplan.flags & PRECOMPUTE_DAMP)
00119 {
00120 for(j=0;j<N;j++){
00121 for(k=0;k<N;k++) {
00122 int j2= j-N/2;
00123 int k2= k-N/2;
00124 double r=sqrt(j2*j2+k2*k2);
00125 if(r>(double) N/2)
00126 my_iplan.w_hat[j*N+k]=0.0;
00127 else
00128 my_iplan.w_hat[j*N+k]=1.0;
00129 }
00130 }
00131 }
00132
00133 fp=fopen(filename,"r");
00134 ftime=fopen("readout_time.dat","r");
00135
00136 for(j=0;j<my_plan.M_total;j++)
00137 {
00138 fscanf(fp,"%le %le %le %le",&my_plan.plan.x[3*j+0],&my_plan.plan.x[3*j+1],&real,&imag);
00139 my_iplan.y[j]=real+ _Complex_I*imag;
00140 fscanf(ftime,"%le ",&my_plan.plan.x[3*j+2]);
00141
00142 my_plan.plan.x[3*j+2] = (my_plan.plan.x[3*j+2]-Ts)*W/N3;
00143 }
00144 fclose(fp);
00145 fclose(ftime);
00146
00147
00148 finh=fopen("inh.dat","r");
00149 for(j=0;j<N*N;j++)
00150 {
00151 fscanf(finh,"%le ",&my_plan.w[j]);
00152 my_plan.w[j]/=W;
00153 }
00154 fclose(finh);
00155
00156
00157 if(my_plan.plan.nfft_flags & PRE_PSI) {
00158 nfft_precompute_psi(&my_plan.plan);
00159 }
00160 if(my_plan.plan.nfft_flags & PRE_FULL_PSI) {
00161 nfft_precompute_full_psi(&my_plan.plan);
00162 }
00163
00164
00165 for(j=0;j<my_plan.N_total;j++)
00166 {
00167 my_iplan.f_hat_iter[j]=0.0;
00168 }
00169
00170 t=nfft_second();
00171
00172
00173 solver_before_loop_complex(&my_iplan);
00174 for(l=0;l<iteration;l++)
00175 {
00176
00177 if(my_iplan.dot_r_iter<epsilon)
00178 break;
00179 fprintf(stderr,"%e, %i of %i\n",sqrt(my_iplan.dot_r_iter),
00180 l+1,iteration);
00181 solver_loop_one_step_complex(&my_iplan);
00182 }
00183
00184
00185 t=nfft_second()-t;
00186 #ifdef HAVE_TOTAL_USED_MEMORY
00187 fprintf(stderr,"time: %e seconds mem: %i \n",t,nfft_total_used_memory());
00188 #else
00189 fprintf(stderr,"time: %e seconds mem: mallinfo not available\n",t);
00190 #endif
00191
00192 fout_real=fopen("output_real.dat","w");
00193 fout_imag=fopen("output_imag.dat","w");
00194
00195 for (j=0;j<N*N;j++) {
00196
00197 my_iplan.f_hat_iter[j]*=cexp(-2.0*_Complex_I*PI*Ts*my_plan.w[j]*W);
00198
00199 fprintf(fout_real,"%le ",creal(my_iplan.f_hat_iter[j]));
00200 fprintf(fout_imag,"%le ",cimag(my_iplan.f_hat_iter[j]));
00201 }
00202
00203 fclose(fout_real);
00204 fclose(fout_imag);
00205 solver_finalize_complex(&my_iplan);
00206 mri_inh_3d_finalize(&my_plan);
00207 }
00208
00209
00210 int main(int argc, char **argv)
00211 {
00212 if (argc <= 5) {
00213
00214 printf("usage: ./reconstruct_data_inh_3d FILENAME N M ITER WEIGHTS\n");
00215 return 1;
00216 }
00217
00218 reconstruct(argv[1],atoi(argv[2]),atoi(argv[3]),atoi(argv[4]),atoi(argv[5]));
00219
00220 return 1;
00221 }
00222