void *Seg_NI_read_file(char *fname) {
static char FuncName[]={"Seg_NI_read_file"};
char *niname = NULL;
NI_stream ns = NULL;
void *nel=NULL;
SUMA_ENTRY;
niname = (char *)SUMA_malloc(sizeof(char)*(strlen(fname)+10));
sprintf(niname,"file:%s",fname);
if (!(ns = NI_stream_open(niname, "r"))) {
SUMA_S_Errv("Failed to open steam %s\n", niname);
SUMA_free(niname);
SUMA_RETURN(nel);
}
nel = NI_read_element(ns,1);
NI_stream_close( ns ) ; ns = NULL;
SUMA_free(niname);
SUMA_RETURN(nel);
}
int main (int argc,char *argv[])
{
static char FuncName[]= {"SUMA_inflate_compare"};
SUMA_SurfSpecFile Spec;
char *specfilename = NULL;
int kar, id;
SUMA_Boolean brk;
SUMA_Boolean SurfIn = NOPE;
SUMA_SurfaceObject *Surf1 = NULL, *Surf2=NULL;
char *Surf1_FileName = NULL;
char *Surf2_FileName = NULL;
char *Vol1Parent_FileName=NULL;
char *Vol2Parent_FileName=NULL;
/* for SureFit surface */
SUMA_SFname *Surf1_SFName = NULL, *Surf2_SFName = NULL;
/* other variables */
int i;
int num_nodes1;
int num_nodes2;
float P0[3];
float delta_t;
float P1[3];
float N0[3];
float maxdistance, mindistance;
float *distance;
float Points[2][3]= { {0.0, 0.0, 0.0}, {0.0, 0.0, 0.0}}, p1[3]= {0.0, 0.0, 0.0}, p2[3]= {0.0, 0.0, 0.0};
SUMA_COLOR_MAP *MyColMap;
SUMA_SCALE_TO_MAP_OPT *MyOpt;
SUMA_COLOR_SCALED_VECT * MySV;
SUMA_MT_INTERSECT_TRIANGLE *triangle;
SUMA_SURF_NORM SN1;
SUMA_SURF_NORM SN2;
SUMA_SurfaceObject *SO1, *SO2;
struct timeval tt;
FILE *colorfile;
FILE *distancefile;
char colorfilename[1000];
char distancefilename[1000];
char *tag1 = NULL;
char *tag2 = NULL;
char *state1 = NULL;
char *state2 = NULL;
char *hemi = NULL;
float B_dim[3];
SUMA_ISINBOX isin;
SUMA_PATCH *Patch=NULL;
SUMA_Boolean TryFull = NOPE, FullOnly;
SUMA_MEMBER_FACE_SETS *Memb = NULL;
int *FaceSet_tmp;
int N_FaceSet_tmp;
char *fout = NULL;
int inflation = 10; /* inflation in mm */
/* allocate space for CommonFields structure */
SUMAg_CF = SUMA_Create_CommonFields ();
if (SUMAg_CF == NULL) {
fprintf(SUMA_STDERR,"Error %s: Failed in SUMA_Create_CommonFields\n", FuncName);
exit(1);
}
if (argc < 5) {
cmp_surf_usage();
exit (1);
}
/* read in the surfaces */
kar = 1;
brk = NOPE;
SurfIn = NOPE;
FullOnly = YUP;
while (kar < argc) {
/* loop accross command line options */
if ((strcmp(argv[kar], "-h") == 0) || (strcmp(argv[kar], "-help") == 0)) {
cmp_surf_usage ();
exit (1);
}
if (!brk && (strcmp(argv[kar], "-hemi")) == 0) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -hemi");
exit (1);
}
hemi = argv[kar];
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-prefix")) == 0) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -prefix");
exit (1);
}
fout = argv[kar];
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-spec")) == 0) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -spec ");
exit (1);
}
specfilename = argv[kar];
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-box")) == 0) {
kar ++;
if (kar+2 >= argc) {
fprintf (SUMA_STDERR, "need 3 arguments after -box");
exit (1);
}
B_dim[0] = atof(argv[kar]);
kar ++;
B_dim[1] = atof(argv[kar]);
kar ++;
B_dim[2] = atof(argv[kar]);
FullOnly = NOPE;
brk = YUP;
}
if (!brk) {
fprintf (SUMA_STDERR,"Error %s: Option %s not understood. Try -help for usage\n", FuncName, argv[kar]);
exit (1);
}
else {
brk = NOPE;
kar ++;
}
}/* loop across command line options */
if (specfilename == NULL) {
fprintf (SUMA_STDERR,"Error %s: No spec filename specified.\n", FuncName);
exit(1);
}
if (!SUMA_AllocSpecFields(&Spec)) {
SUMA_S_Err("Failed to allocate spec fields");
exit(1);
}
if (!SUMA_Read_SpecFile (specfilename, &Spec)) {
fprintf(SUMA_STDERR,"Error %s: Error in SUMA_Read_SpecFile\n", FuncName);
exit(1);
}
/**** loading the first surface *****/
if (SUMA_iswordin(Spec.SurfaceType[0], "FreeSurfer") == 1) {
Surf1_FileName = Spec.SurfaceFile[0];
Surf1 = SUMA_Load_Surface_Object(Surf1_FileName, SUMA_FREE_SURFER, SUMA_ASCII, Vol1Parent_FileName);
tag1 = "FS";
}
else if (SUMA_iswordin(Spec.SurfaceType[0], "SureFit") == 1) {
Surf1_SFName = SUMA_malloc(sizeof(SUMA_SFname));
strcpy(Surf1_SFName->name_coord,Spec.CoordFile[0]);
strcpy(Surf1_SFName->name_topo, Spec.TopoFile[0]);
strcpy(Surf1_SFName->name_param, Spec.SureFitVolParam[0]);
Surf1 = SUMA_Load_Surface_Object(Surf1_SFName, SUMA_SUREFIT, SUMA_ASCII,Vol1Parent_FileName);
tag1 = "SF";
}
state1 = Spec.State[0];
/**** loading the second surface *****/
if (SUMA_iswordin(Spec.SurfaceType[0], "FreeSurfer") == 1) {
Surf2_FileName = Spec.SurfaceFile[0];
Surf2 = SUMA_Load_Surface_Object(Surf1_FileName, SUMA_FREE_SURFER, SUMA_ASCII, Vol1Parent_FileName);
tag2 = "FS";
}
else if (SUMA_iswordin(Spec.SurfaceType[0], "SureFit") == 1) {
Surf2_SFName = SUMA_malloc(sizeof(SUMA_SFname));
strcpy(Surf2_SFName->name_coord,Spec.CoordFile[0]);
strcpy(Surf2_SFName->name_topo, Spec.TopoFile[0]);
strcpy(Surf2_SFName->name_param, Spec.SureFitVolParam[0]);
Surf2 = SUMA_Load_Surface_Object(Surf1_SFName, SUMA_SUREFIT, SUMA_ASCII,Vol1Parent_FileName);
tag2 = "SF";
}
state2 = Spec.State[0];
if (fout == NULL) { /* form default name */
sprintf(distancefilename, "dist_%s_%s_%s_%dmm.txt",hemi,tag1,state1,inflation);
sprintf(colorfilename, "dist_%s_%s_%s_%dmm.col",hemi,tag1,state1,inflation);
}
else {
sprintf (colorfilename, "%s.col", fout);
sprintf (distancefilename, "%s.txt", fout);
}
if (SUMA_filexists(colorfilename) || SUMA_filexists(distancefilename)) {
fprintf (SUMA_STDERR,"Error %s: One or both of output files %s, %s exists.\nWill not overwrite.\n", \
FuncName, distancefilename, colorfilename);
exit(1);
}
/***********************************************************************************************/
SO1 = Surf1;
SO2 = Surf2;
/*SUMA_Print_Surface_Object ( SO1, NULL);
SUMA_Print_Surface_Object ( SO2, NULL);*/
num_nodes1 = SO1->N_Node;
num_nodes2 = SO2->N_Node;
fprintf(SUMA_STDERR, "Number of nodes in surface 1: %d \n", num_nodes1);
fprintf(SUMA_STDERR, "Number of nodes in surface 2: %d \n", num_nodes2);
SN1 = SUMA_SurfNorm(SO1->NodeList, SO1->N_Node, SO1->FaceSetList, SO1->N_FaceSet);
/* Take each node in the SO1-> Nodelist and its corresponding SN1->NodeNormList. This is the normalized normal vector to the node on the first surface.
So each node is P0. P1 is computed as some point along the normal vector to that node. Lets say P1 is P0 + 10 mm along the normal.
Write out P1 as a surface */
/* for each node on the first surface do the following */
SUMA_etime (&tt, 0);
for (i = 0; i < num_nodes1; i++) {
id = SO1->NodeDim * i;
P0[0] = SO1->NodeList[id];
P0[1] = SO1->NodeList[id+1];
P0[2] = SO1->NodeList[id+2];
N0[0] = SN1.NodeNormList[id];
N0[1] = SN1.NodeNormList[id+1];
N0[2] = SN1.NodeNormList[id+2];
SUMA_POINT_AT_DISTANCE(N0, P0, 10, Points);
P1[0] = Points[0][0];
P1[1] = Points[0][1];
P1[2] = Points[0][2];
// fprintf(SUMA_STDERR,"P0 values: %f\t%f\t%f, P1 values: %f\t%f\t%f\n", P0[0],P0[1],P0[2],P1[0],P1[1],P1[2]);
/* Saving the new surfaces */
SO2->NodeList[id] = P1[0];
SO2->NodeList[id+1] = P1[1];
SO2->NodeList[id+2] = P1[2];
}
/* Now use SO1 and SO2 as the two surfaces and compute the distance */
SN1 = SUMA_SurfNorm(SO1->NodeList, SO1->N_Node, SO1->FaceSetList, SO1->N_FaceSet);
SN2 = SUMA_SurfNorm(SO2->NodeList, SO2->N_Node, SO2->FaceSetList, SO2->N_FaceSet);
if (!FullOnly) {
/* get the Node member structure */
fprintf(SUMA_STDOUT, "%s: Computing MemberFaceSets... \n", FuncName);
Memb = SUMA_MemberFaceSets (SO2->N_Node, SO2->FaceSetList, SO2->N_FaceSet, 3, SO2->idcode_str);
if (Memb->NodeMemberOfFaceSet == NULL) {
fprintf(SUMA_STDERR, "Error %s: Failed in SUMA_MemberFaceSets. \n", FuncName);
exit(1);
}
}
/* Take each node in the SO1-> Nodelist and its corresponding SN1->NodeNormList. This is the normalized normal vector to the node on the first surface.
So each node is P0. P1 is computed as some point along the normal vector to that node. Lets say P1 is P0 + 10 mm along the normal. */
/* for each node on the first surface do the following */
SUMA_etime (&tt, 0);
distance = SUMA_malloc(num_nodes1*sizeof(float));
for (i = 0; i < num_nodes1; i++) {
//for (i = 0; i < 10; i++) {
id = SO1->NodeDim * i;
P0[0] = SO1->NodeList[id];
P0[1] = SO1->NodeList[id+1];
P0[2] = SO1->NodeList[id+2];
N0[0] = SN1.NodeNormList[id];
N0[1] = SN1.NodeNormList[id+1];
N0[2] = SN1.NodeNormList[id+2];
SUMA_POINT_AT_DISTANCE(N0, P0, 1000, Points);
P1[0] = Points[0][0];
P1[1] = Points[0][1];
P1[2] = Points[0][2];
if (!FullOnly) {
/* trying to speed up intersection computations
by restricting it to nodes within a box */
TryFull = NOPE;
/* search for nodes on surface 2 within xx mm of P0 */
isin = SUMA_isinbox (SO2->NodeList, SO2->N_Node, P0, B_dim, 0);
if (isin.nIsIn) {
/* find the patch of surface 2 that is formed by those intersection nodes */
Patch = SUMA_getPatch ( isin.IsIn, isin.nIsIn,
SO2->N_Node, SO2->FaceSetList, SO2->N_FaceSet,
Memb, 1, 0, 1);
if (Patch == NULL) {
fprintf(SUMA_STDERR,
"Error %s: Null returned from SUMA_getPatch.\n", FuncName);
exit (1);
}
/* Perform the intersection based on that patch using Shruti's version */
FaceSet_tmp = Patch->FaceSetList;
N_FaceSet_tmp = Patch->N_FaceSet;
} else {
fprintf (SUMA_STDOUT,
"%s: No nodes in box about node %d. \n"
"Trying for full surface intersection.\n", FuncName, i);
TryFull = YUP; /* flag to send it to full intersection */
}
}
if (FullOnly || TryFull) {
Patch = NULL;
FaceSet_tmp = SO2->FaceSetList;
N_FaceSet_tmp = SO2->N_FaceSet;
}
/*now try with the segment from Points[0] to Points[1] returned above. */
p1[0] = Points[0][0];
p1[1] = Points[0][1];
p1[2] = Points[0][2];
p2[0] = Points[1][0];
p2[1] = Points[1][1];
p2[2] = Points[1][2];
triangle = SUMA_MT_intersect_triangle(p1,p2, SO2->NodeList, SO2->N_Node, SO2->FaceSetList, SO2->N_FaceSet, NULL, 0);
//SUMA_Show_MT_intersect_triangle(triangle, NULL);
if (triangle->N_hits ==0) {
distance[i] = -1;
// fprintf(SUMA_STDERR, "Could not find hit for node %d in either direction.\n", i);
}
else {
distance[i] = sqrtf( pow(triangle->P[0]-P0[0],2)+
pow(triangle->P[1]-P0[1],2)+
pow(triangle->P[2]-P0[2],2) );
/* fprintf(SUMA_STDERR, "distance is : %f\n", distance[i]); */
}
SUMA_Free_MT_intersect_triangle(triangle);
if (Patch) SUMA_freePatch(Patch);
/* calculating the time elapsed and remaining */
if (!(i%100)) {
delta_t = SUMA_etime(&tt, 1);
fprintf (SUMA_STDERR,
" [%d]/[%d] %.2f/100%% completed. "
"Dt = %.2f min done of %.2f min total\r" ,
i, num_nodes1, (float)i / num_nodes1 * 100,
delta_t/60, delta_t/i * num_nodes1/60);
}
}
/* write out the distance file */
if((distancefile = fopen(distancefilename, "w"))==NULL) {
fprintf(SUMA_STDERR, "Could not open file distance.txt.\n");
exit(1);
}
else {
for (i=0; i < num_nodes1; ++i) {
fprintf (distancefile,"%d\t%f\n", i, distance[i]);
}
fclose (distancefile);
}
/* output this distance as a color file */
MyColMap = SUMA_FindNamedColMap("byr64");
MyOpt = SUMA_ScaleToMapOptInit();
MySV = SUMA_Create_ColorScaledVect(num_nodes1, 0);
mindistance = minimum(num_nodes1, distance);
maxdistance = maximum(num_nodes1, distance);
SUMA_ScaleToMap(distance,num_nodes1,mindistance, maxdistance,
MyColMap,MyOpt,MySV);
/* write out the distance color file */
if((colorfile = fopen(colorfilename, "w"))==NULL) {
fprintf(SUMA_STDERR, "Could not open file distance.col.\n");
exit(1);
}
else {
for (i=0; i < num_nodes1; ++i) {
fprintf (colorfile,
"%d\t%f\t%f\t%f\n",
i, MySV->cV[3*i ], MySV->cV[3*i+1], MySV->cV[3*i+2]);
}
fclose (colorfile);
}
if (!SUMA_FreeSpecFields(&Spec)) {
SUMA_S_Err("Failed to free spec fields");
}
if (!SUMA_Free_CommonFields(SUMAg_CF)) SUMA_error_message(FuncName,"SUMAg_CF Cleanup Failed!",1);
return 1;
}
int main (int argc,char *argv[])
{/* Main */
static char FuncName[]={"SUMA_TestDsetIO"};
int *NodeDef=NULL;
byte *maskrow, *maskcol;
int i, i3, N_NodeDef, N_Alloc, flg;
float *r=NULL, *g=NULL, *b=NULL, *rgb=NULL;
char stmp[500], idcode[50], **s, *si, *OutName = NULL;
NI_element *nel=NULL;
NI_stream ns;
int found = 0, NoStride = 0;
byte *bt=NULL;
SUMA_DSET * dset = NULL, *ndset=NULL;
SUMA_Boolean LocalHead = NOPE;
SUMA_STANDALONE_INIT;
SUMA_mainENTRY;
LocalHead = YUP; /* turn on debugging */
SUMA_LH("Creating Data ...");
/* Create some sample data*/
/* let us create some colors to go on each node */
N_Alloc = 50;
NodeDef = (int *)SUMA_malloc(N_Alloc * sizeof(int));
r = (float *)SUMA_malloc(N_Alloc * sizeof(float));
g = (float *)SUMA_malloc(N_Alloc * sizeof(float));
b = (float *)SUMA_malloc(N_Alloc * sizeof(float));
bt = (byte *)SUMA_malloc(N_Alloc * sizeof(byte));
s = (char **)SUMA_malloc(N_Alloc * sizeof(char *));
maskrow = (byte *)SUMA_malloc(N_Alloc * sizeof(byte));
maskcol = (byte *)SUMA_malloc(10*sizeof(byte));
for (i=0; i<10; ++i) {
if (i==1 || i == 3) maskcol[i]=0;
else maskcol[i] = 1;
}
N_NodeDef = N_Alloc;
for (i=0; i<N_NodeDef; ++i) {
NodeDef[i] = i;
r[i] = sin((float)i/N_NodeDef*5);
g[i] = sin((float)i/N_NodeDef*10);
b[i] = cos((float)i/N_NodeDef*7);
bt[i] = (byte)(4*b[i]);
sprintf(stmp,"teststr_%d", i);
s[i] = SUMA_copy_string(stmp);
if (i==3 || i== 7 || i==33) maskrow[i] = 1; else maskrow[i]=0;
}
/* what if you had a vector of say, triplets */
rgb = (float *)SUMA_malloc(3 * N_Alloc * sizeof(float));
for (i=0; i<N_NodeDef; ++i) {
i3 = 3*i;
rgb[i3] = r[i];
rgb[i3+1] = g[i];
rgb[i3+2] = b[i];
}
{
float *xc, *de, *amp;
int dof;
float par[3];
/* store some statistics */
xc = (float *)SUMA_malloc(N_Alloc * sizeof(float));
de = (float *)SUMA_malloc(N_Alloc * sizeof(float));
amp = (float *)SUMA_malloc(N_Alloc * sizeof(float));
for (i=0; i<N_NodeDef; ++i) {
xc[i] = rand()%1000/1000.0 * 1.0;
de[i] = rand()%1000/1000.0 * 30;
amp[i] = rand()%1000/1000.0 * 5.0;
}
SUMA_LH("Creating dset pointer");
dset = SUMA_CreateDsetPointer(
"ExpandingRing_ResponseDelay", /* some label */
SUMA_NODE_BUCKET, /* mix and match */
NULL, /* no idcode, let the function create one from the filename*/
NULL, /* no domain str specified */
N_Alloc /* Number of nodes allocated for */
); /* DO NOT free dset, if it is stored in DsetList */
#ifdef SUMA_COMPILED
SUMA_LH("inserting dset pointer into list");
if (!SUMA_InsertDsetPointer(&dset, SUMAg_CF->DsetList,0)) {
SUMA_SL_Err("Failed to insert dset into list");
exit(1);
}
#endif
/* form the dataset */
SUMA_LH("Adding stat NodeDef column ...");
if (!SUMA_AddDsetNelCol ( dset, /* the famed nel */
"Node Indices",
SUMA_NODE_INDEX, /* the column's type (description),
one of SUMA_COL_TYPE */
(void *)NodeDef, /* column pointer p, here it is
the list of node indices */
NULL /* that's an optional structure containing
attributes of the added column.
Not used at the moment */
,1 /* stride, useful when you need to copy a column
from a multiplexed vector. Say you have in p
[rgb rgb rgb rgb], to set the g column you
send in p+1 for the column pointer and a stride
of 3 */
)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
SUMA_LH("Adding stat other columns...");
par[0] = 120; par[1] = 2; par[2] = 2;
if (!SUMA_AddDsetNelCol (dset, "XcorrCoef",
SUMA_NODE_XCORR, (void *)xc, (void *)par ,1)) {
fprintf (stderr,
"Error %s:\nFailed in SUMA_AddDsetNelCol", FuncName);
exit(1);
}
if (!SUMA_AddDsetNelCol (dset, "Delay",
SUMA_NODE_FLOAT, (void *)de, NULL ,1)) {
fprintf (stderr,
"Error %s:\nFailed in SUMA_AddDsetNelCol", FuncName);
exit(1);
}
if (!SUMA_AddDsetNelCol (dset, "Amplitude", SUMA_NODE_FLOAT, (void *)amp, NULL ,1)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddDsetNelCol", FuncName);
exit(1);
}
SUMA_LH("History note");
if (!SUMA_AddNgrHist(dset->ngr, FuncName, argc, argv)) {
SUMA_SL_Err("History addition failed.");
exit(1);
}
#ifdef SUMA_COMPILED
OutName = SUMA_WriteDset_s ("SampleDset", dset, SUMA_ASCII_NIML, 1, 1);
#else
OutName = SUMA_WriteDset_ns ("SampleDset", dset, SUMA_ASCII_NIML, 1, 1);
#endif
if (!OutName) {
SUMA_SL_Err("Write Failed.");
} else { fprintf (stderr,"%s:\nDset written to %s\n", FuncName, OutName);
SUMA_free(OutName); OutName = NULL;
}
#ifdef SUMA_COMPILED
/* Now create a new dataset nel
no need to worry about loosing previous dset because it is in
SUMAg_CF->DsetList*/
#else
/* free dset by hand */
SUMA_LH("Freeing datasets ...");
if (dset) SUMA_FreeDset((void *)dset);
dset = NULL;
#endif
}
SUMA_LH("Creating dset pointer");
dset = SUMA_CreateDsetPointer(
"SomethingLikeFileName", /* usually the filename */
SUMA_NODE_BUCKET, /* mix and match */
NULL, /* no idcode, let the function create one from the filename*/
NULL, /* no domain str specified */
N_Alloc /* Number of nodes allocated for */
); /* DO NOT free dset, it is store in DsetList */
#ifdef SUMA_COMPILED
SUMA_LH("inserting dset pointer into list");
if (!SUMA_InsertDsetPointer(&dset, SUMAg_CF->DsetList,0)) {
SUMA_SL_Err("Failed to insert dset into list");
exit(1);
}
#endif
/* form the dataset */
SUMA_LH("Adding NodeDef column ...");
if (!SUMA_AddDsetNelCol ( dset, /* the famed nel */
"le Node Def",
SUMA_NODE_INDEX, /* the column's type (description),
one of SUMA_COL_TYPE */
(void *)NodeDef, /* column pointer p, here it is
the list of node indices */
NULL /* that's an optional structure containing
attributes of the added column.
Not used at the moment */
,1 /* stride, useful when you need to copy a column
from a multiplexed vector. Say you have in p
[rgb rgb rgb rgb], to set the g column you
send in p+1 for the column pointer and a stride
of 3 */
)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
SUMA_LH("Adding other columns...");
NoStride = 0;
if (NoStride) {
/* insert separate r, g and b column */
if (!SUMA_AddDsetNelCol (dset, "Le R", SUMA_NODE_R, (void *)r, NULL ,1)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
if (!SUMA_AddDsetNelCol (dset, "Le G", SUMA_NODE_G, (void *)g, NULL ,1)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
if (!SUMA_AddDsetNelCol (dset, "Le B", SUMA_NODE_B, (void *)b, NULL ,1)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
} else {
/* insert from multiplexed rgb vector */
if (!SUMA_AddDsetNelCol (dset, "le R", SUMA_NODE_R, (void *)rgb, NULL ,3 )) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
if (!SUMA_AddDsetNelCol (dset, "Le G", SUMA_NODE_G, (void *)(rgb+1), NULL ,3)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
if (!SUMA_AddDsetNelCol (dset, "Le B", SUMA_NODE_B, (void *)(rgb+2), NULL ,3)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
#if 0
SUMA_LH("Testing insert column ...");
/* Test NI_inset_column_stride here please */
if (!SUMA_InsertDsetNelCol (dset, "Le G2", SUMA_NODE_G, (void *)(rgb+1), NULL ,3, 0)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
#endif
}
{ int suc; SUMA_LH("Where are the attributes?"); NEL_WRITE_TX(dset->ngr,"fd:1",suc); }
/* add the byte column, just to check multi type nightmares */
if (!SUMA_AddDsetNelCol (dset, "Le byte moi", SUMA_NODE_BYTE, (void *)bt, NULL ,1)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
SUMA_LH("Testing write ops before adding string columns ...");
/* before adding a string column ... */
#ifdef SUMA_COMPILED
OutName = SUMA_WriteDset_s ("Test_write_all_num", dset, SUMA_1D, 1, 1);
#else
OutName = SUMA_WriteDset_ns ("Test_write_all_num", dset, SUMA_1D, 1, 1);
#endif
if (!OutName) {
SUMA_SL_Err("Write Failed.");
} else { fprintf (stderr,"%s:\nDset written to %s\n", FuncName, OutName);
SUMA_free(OutName); OutName = NULL;
}
#ifdef SUMA_COMPILED
OutName = SUMA_WriteDset_s ("Test_writebi_all_num", dset, SUMA_BINARY_NIML, 1, 1);
#else
OutName = SUMA_WriteDset_ns ("Test_writebi_all_num", dset, SUMA_BINARY_NIML, 1, 1);
#endif
if (!OutName) {
SUMA_SL_Err("Write Failed.");
} else { fprintf (stderr,"%s:\nDset written to %s\n", FuncName, OutName);
SUMA_free(OutName); OutName = NULL;
}
#ifdef SUMA_COMPILED
OutName = SUMA_WriteDset_s ("Test_writeas_all_num", dset, SUMA_ASCII_NIML, 1, 1);
#else
OutName = SUMA_WriteDset_ns ("Test_writeas_all_num", dset, SUMA_ASCII_NIML, 1, 1);
#endif
if (!OutName) {
SUMA_SL_Err("Write Failed.");
} else { fprintf (stderr,"%s:\nDset written to %s\n", FuncName, OutName);
SUMA_free(OutName); OutName = NULL;
}
/* Now shuffle some columns (then put them back) */
SUMA_S_Note("NOTE THAT SHUFFLING here does not take care of attributes inside dset, but only dnel");
NI_move_column(dset->dnel, -1, 2);
SUMA_ShowNel(dset->dnel);
#ifdef SUMA_COMPILED
OutName = SUMA_WriteDset_s ("Test_writeas_all_shuff_num", dset, SUMA_ASCII_NIML, 1, 1);
#else
OutName = SUMA_WriteDset_ns ("Test_writeas_all_shuff_num", dset, SUMA_ASCII_NIML, 1, 1);
#endif
NI_move_column(dset->dnel, 2, -1);
SUMA_ShowNel(dset->dnel);
/* zero out some columns and test operations */
SUMA_LH("Trying masking operations");
ndset = SUMA_MaskedCopyofDset(dset, maskrow, maskcol, 1, 0);
SUMA_LH("Done");
/* try also:
ndset = SUMA_MaskedCopyofDset(dset, maskrow, maskcol, 0, 1);
ndset = SUMA_MaskedCopyofDset(dset, maskrow, maskcol, 0, 0);
ndset = SUMA_MaskedCopyofDset(dset, maskrow, NULL, 1, 0);
ndset = SUMA_MaskedCopyofDset(dset, NULL, NULL, 1, 0);
ndset = SUMA_MaskedCopyofDset(dset, maskrow, maskcol, 1, 0);
*/
if (!ndset) {
SUMA_SL_Err("Failed in SUMA_MaskedCopyofDset");
} else {
#ifdef SUMA_COMPILED
OutName = SUMA_WriteDset_s ("Test_writeas_MaskedCopy_num", ndset, SUMA_ASCII_NIML, 1, 1);
#else
OutName = SUMA_WriteDset_ns ("Test_writeas_MaskedCopy_num", ndset, SUMA_ASCII_NIML, 1, 1);
#endif
if (!OutName) {
SUMA_SL_Err("Write Failed.");
} else { fprintf (stderr,"%s:\nDset written to %s\n", FuncName, OutName);
SUMA_free(OutName); OutName = NULL;
}
SUMA_free(ndset); ndset = NULL;
}
SUMA_LH("Adding a string column");
/* add a string column, just for kicks ..*/
if (!SUMA_AddDsetNelCol (dset, "la string", SUMA_NODE_STRING, (void *)s, NULL, 1)) {
fprintf (stderr,"Error %s:\nFailed in SUMA_AddNelCol", FuncName);
exit(1);
}
/* now try to create a masked copy, this should fail */
fprintf (stderr,"%s: Attempting to mask a not all numeric dset, this should fail\n", FuncName);
ndset = SUMA_MaskedCopyofDset(dset, maskrow, maskcol, 1, 0);
if (ndset) {
fprintf (stderr,"Error %s:\nWhat the hell? This should not be supported.", FuncName);
exit(1);
}else{
fprintf (stderr,"%s: Good, failed.\n", FuncName);
}
/* after adding a string column ... */
SUMA_LH("Writing datasets ...");
#ifdef SUMA_COMPILED
OutName = SUMA_WriteDset_s ("Test_writeas", dset, SUMA_ASCII_NIML, 1, 1);
#else
OutName = SUMA_WriteDset_ns ("Test_writeas", dset, SUMA_ASCII_NIML, 1, 1);
#endif
if (!OutName) {
SUMA_SL_Err("Write Failed.");
} else { fprintf (stderr,"%s:\nDset written to %s\n", FuncName, OutName);
SUMA_free(OutName); OutName = NULL;
}
#ifdef SUMA_COMPILED
OutName = SUMA_WriteDset_s ("Test_writebi", dset, SUMA_BINARY_NIML, 1, 1);
#else
OutName = SUMA_WriteDset_ns ("Test_writebi", dset, SUMA_BINARY_NIML, 1, 1);
#endif
if (!OutName) {
SUMA_SL_Err("Write Failed.");
} else { fprintf (stderr,"%s:\nDset written to %s\n", FuncName, OutName);
SUMA_free(OutName); OutName = NULL;
}
SUMA_LH("Writing to 1D a dataset that is not all numbers.\nThis should fail.\n");
#ifdef SUMA_COMPILED
OutName = SUMA_WriteDset_s ("Test_write", dset, SUMA_1D, 1, 1);
#else
OutName = SUMA_WriteDset_ns ("Test_write", dset, SUMA_1D, 1, 1);
#endif
if (!OutName) {
SUMA_SL_Err("Write Failed.");
} else { fprintf (stderr,"%s:\nDset written to %s\n", FuncName, OutName);
SUMA_free(OutName); OutName = NULL;
}
/* How about loading some data */
#ifdef SUMA_COMPILED
/* Now create a new dataset nel
no need to worry about loosing previous dset because it is in
SUMAg_CF->DsetList*/
#else
/* free dset by hand */
SUMA_LH("Freeing datasets ...");
if (dset) SUMA_FreeDset((void *)dset);
dset = NULL;
#endif
SUMA_LH("Fresh dataset ...");
dset = SUMA_NewDsetPointer();
SUMA_LH("Reading dataset ...");
DSET_READ(dset, "file:Test_writebi.niml.dset"); if (!dset->ngr) exit(1);
/* insert the baby into the list */
#ifdef SUMA_COMPILED
SUMA_LH("Inserting newly read element into list\n");
if (!SUMA_InsertDsetPointer(&dset, SUMAg_CF->DsetList, 0)) {
char *newid = NULL;
SUMA_SL_Err("Failed to insert dset into list");
/* Now change the idcode of that baby */
newid = UNIQ_hashcode(SDSET_ID(dset));
NI_set_attribute(dset->dnel, "self_idcode", newid); SUMA_free(newid);
SUMA_LH("Trying to insert dset with a new id ");
if (!SUMA_InsertDsetPointer(&dset, SUMAg_CF->DsetList, 0)) {
SUMA_SL_Err("Failed to insert dset into list\nI failed to succeed, snif.");
exit(1);
}
SUMA_LH("Lovely, that worked...");
}
#endif
/* show me the whole thing. Don't do this for an enormous nel */
/* SUMA_ShowNel((void*)dset->nel); */
/* I want the pointer to the green column but do not know its index */
{
int j, *iv, N_i;
float *fp;
fprintf (stderr,"---Looking for green column ---\n");
iv = SUMA_GetDsetColIndex (dset, SUMA_NODE_G, &N_i);
if (!iv) {
fprintf (stderr,"Error %s: Failed to find column.\n"
, FuncName);
} else {
fprintf (stderr,"\t%d columns of type SUMA_NODE_G found.\n",
N_i);
if (N_i) {
fprintf (stderr,"\tReporting values at index %d\n", iv[0]);
fp = (float *)dset->dnel->vec[iv[0]]; /* I know we only have one
such col. here */
for (j=0; j < SDSET_VECLEN(dset); ++j) {
fprintf (stderr,"%f, ", fp[j]);
}
SUMA_free(iv); iv = NULL;
}
}
}
/* Now show me that baby,*/
SUMA_LH("I wanna Show You Some Info");
si = SUMA_DsetInfo (dset, 0);
fprintf (SUMA_STDERR,"Output of DsetInfo:\n%s\n", si); SUMA_free(si); si=NULL;
if (LocalHead) fprintf(stderr," %s:-\nFrenching ...\n", FuncName);
/* free other stuff */
if (r) SUMA_free(r); r = NULL;
if (g) SUMA_free(g); g = NULL;
if (b) SUMA_free(b); b = NULL;
if (rgb) SUMA_free(rgb); rgb = NULL;
if (maskrow) SUMA_free(maskrow); maskrow = NULL;
if (maskcol) SUMA_free(maskcol); maskcol = NULL;
if (NodeDef) SUMA_free(NodeDef); NodeDef = NULL;
if (s) {
for (i=0; i<N_NodeDef; ++i) {
if (s[i]) SUMA_free(s[i]);
}
SUMA_free(s);
}
#ifdef SUMA_COMPILED
/* dset and its contents are freed in SUMA_Free_CommonFields */
if (!SUMA_Free_CommonFields(SUMAg_CF)) SUMA_error_message(FuncName,"SUMAg_CF Cleanup Failed!",1);
#else
/* free dset by hand */
if (dset) SUMA_FreeDset((void *)dset);
#endif
SUMA_RETURN (0);
}/* Main */
int main (int argc,char *argv[])
{/* Main */
static char FuncName[]={"SpharmReco"};
SUMA_GENERIC_PROG_OPTIONS_STRUCT *Opt;
SUMA_GENERIC_ARGV_PARSE *ps=NULL;
SUMA_SurfSpecFile *Spec = NULL;
int *isin=NULL;
int i = -1, ii, jj, kk, il, N_Spec=0, i3, OK,
l, lc, ncol=0, nrow=0, dims[20], N_dims=0, N_surfs=0, j, j_l;
SUMA_Boolean exists=NOPE;
float *far=NULL, *xbuf=NULL, *ybuf=NULL, *zbuf=NULL;
double *dv=NULL, fac = 0.0;
complex *cv=NULL;
SUMA_FORM_AFNI_DSET_STRUCT *OptDs = NULL;
SUMA_SurfaceObject *SO = NULL, *SOt=NULL;
SUMA_VOLPAR *vp = NULL;
SUMA_MX_VEC *y_l=NULL, *y_l_t=NULL;
SUMA_MX_VEC *betal=NULL;
SUMA_MX_VEC *xe=NULL, *sm=NULL, *yc=NULL;
SUMA_MX_VEC **axe=NULL, **abeta=NULL;
char *oname=NULL, stmp[100], *pref=NULL;
SUMA_SO_File_Format form=SUMA_FF_NOT_SPECIFIED;
SUMA_SO_File_Type tp=SUMA_FT_NOT_SPECIFIED;
SUMA_OPT_SPHERICAL_BASES optb;
void *SO_name=NULL;
struct timeval tt;
int oform= SUMA_NO_DSET_FORMAT;
char *ooo=NULL;
float *fbuf=NULL;
SUMA_DSET *out_dset = NULL;
SUMA_Boolean do_surf_xyz = NOPE;
SUMA_Boolean LocalHead = NOPE;
SUMA_STANDALONE_INIT;
SUMA_mainENTRY;
/* Allocate space for DO structure */
SUMAg_DOv = SUMA_Alloc_DisplayObject_Struct (SUMA_MAX_DISPLAYABLE_OBJECTS);
ps = SUMA_Parse_IO_Args(argc, argv, "-i;-spec;-talk;-o;");
if (argc < 2) {
usage_SpharmReco(ps);
exit (1);
}
Opt = SUMA_SpharmReco_ParseInput (argv, argc, ps);
if (Opt->debug) LocalHead = YUP;
if (Opt->n_in_namev < 1) {
SUMA_S_Err("No Coef!");
exit (1);
}
if (ps->o_N_surfnames) do_surf_xyz = YUP;
if (!ps->o_N_surfnames && !Opt->out_prefix) {
SUMA_S_Notev("Using default prefix of %s\n", "spharm_sm");
Opt->out_prefix = SUMA_copy_string("spharm_sm");
}
if ((Opt->n_in_namev % 3) && do_surf_xyz) {
SUMA_S_Errv("Number of coefficient options (%d) must be\n"
"a multiple of three if output is \n"
"to be treated as x, y, z coordinates\n", Opt->n_in_namev);
exit(1);
}
/* decide on output form */
if (Opt->out_prefix) {
oform = SUMA_GuessFormatFromExtension(Opt->out_prefix,"something.1D.dset");
}
if (Opt->debug > 2) LocalHead = YUP;
/* check on inputs */
optb.SOu=NULL;
optb.BasesFileRoot=Opt->bases_prefix;
optb.SaveBases=Opt->bases_prefix;
optb.debug = Opt->debug;
N_surfs = ps->s_N_surfnames + ps->i_N_surfnames + ps->t_N_surfnames;
if (( N_surfs != 1)) {
SUMA_S_Errv("You must provide only one surface.\n"
"Have %d on command line.\n", N_surfs);
exit(1);
}
Spec = SUMA_IO_args_2_spec(ps, &N_Spec);
if (N_Spec == 0) {
SUMA_S_Err("No surfaces found.");
exit(1);
}
if (N_Spec != 1) {
SUMA_S_Err("Multiple spec at input.");
exit(1);
}
for (i=0; i<N_surfs; ++i) {
SO = SUMA_Load_Spec_Surf(Spec, i, ps->sv[i], 0);
if (!SO) {
fprintf (SUMA_STDERR,"Error %s:\n"
"Failed to find surface\n"
"in spec file. \n",
FuncName );
exit(1);
}
if (Opt->debug > 2) SUMA_Print_Surface_Object(SO, SUMA_STDERR);
if (!SO->normdir) SO->normdir = 1; /* set it to something */
SOt = SUMA_CreateChildSO( SO, NULL, -1, NULL, -1, 0);
if (!SOt->State) {SOt->State = SUMA_copy_string("spharm_domain"); }
if (!SOt->Group) {SOt->Group = SUMA_copy_string("spharm_domain"); }
}
/* see if SUMA talk is turned on */
if (ps->cs->talk_suma) {
ps->cs->istream = SUMA_GEOMCOMP_LINE;
if (!SUMA_SendToSuma (SO, ps->cs, NULL, SUMA_NO_DSET_TYPE, 0)) {
SUMA_SL_Err("Failed to initialize SUMA_SendToSuma");
ps->cs->Send = NOPE;
ps->cs->talk_suma = NOPE;
}
SUMA_SendSumaNewSurface(SO, ps->cs);
}
/* Number of coefficients */
axe = (SUMA_MX_VEC **)SUMA_calloc(Opt->n_in_namev, sizeof(SUMA_MX_VEC*));
abeta = (SUMA_MX_VEC **)SUMA_calloc(Opt->n_in_namev, sizeof(SUMA_MX_VEC*));
/* initialize output variables */
for (i=0; i<Opt->n_in_namev; ++i) {
dims[0] = SO->N_Node; dims[1] = 1; N_dims = 2;
axe[i] = SUMA_NewMxVec(SUMA_double, 2, dims, 1);
if (Opt->debug > 1) SUMA_ShowMxVec(axe[i], 1, NULL, "\naxe[i]\n");
N_dims = -1; /* take whatever is in file, otherwise,
should setup dims[0] and dims[1] */
abeta[i] = SUMA_Read1DMxVec(SUMA_double, Opt->in_namev[i], dims, &N_dims);
if (Opt->debug > 1) SUMA_ShowMxVec(abeta[i], 1, NULL, "\nabeta[i]\n");
}
SUMA_Spherical_Bases(&l, NULL); /* init SUMA_Spherical_Bases */
/* start timer*/
SUMA_etime2(FuncName, NULL, NULL);
/* A record of matrices and processes to follow for spharm reconstruction
Here y_l, for each l, and beta are loaded from files created by SpharmDeco
N_Node : Number of points in parametrization of sphere
sigma : the smoothing kernel 0 == No smoothing, 0.01
(quite a bit of smoothing).
the higher the sigma the more the attenuation of higher
degree harmonics.
for l = 0;
y_l : l th degree harmonic complex l+1 x N_Node
turned to real since
imaginary is all 0
y_l_t : y_l' double N_Node x l+1
XX vt : y_l * y_l_t double l+1 x l+1
XX vt2 : inv(vt) double l+1 x l+1
XX Ycommon : vt2 * y_l double l+1 x N_Node
XX betal : Ycommon * x double l+1 x 1
betal : filled from beta(l,0:2l) double l+1 x 1
(beta(0,0), really)
xe : y_l_t * betal double N_Node x 1
for l > 0;
y_l : l th degree harmonic complex l+1 x N_Node
turned to real of dimensions: double 2*l+1 x N_Node
where the imaginary part of y_l
is appended below the real part
y_l_t : y_l' double N_Node x 2*l+1
XX vt : y_l * y_l_t double 2*l+1 x 2*l+1
XX vt2 : inv(vt) double 2*l+1 x 2*l+1
XX Ycommon : vt2 * y_l double 2*l+1 x N_Node
XX dif_vec_x: x - xe double N_Node x 1
betal : filled from beta(l,0:2l) double 2*l+1 x 1
sm : y_l_t * betal double N_Node x 1
fac : exp((-l*(l+1))*sigma) double 1 x 1
xe : xe + fac * sm double N_Node x 1
xe is the estimate of x up to order l harmonics
beta : lower triangular matrix where betal double l+1 x 2l+1
are stored for all l degrees
*/
l=0;
do {
lc = l;
y_l = SUMA_Spherical_Bases(&lc, &optb);
/* y_l is equal to Y' in Moo's SPHARsmooth.m function */
if (lc < l) {
/* The function will read in the bases from disk */
Opt->iopt = lc; /* y_l is a (l+1 x N_Node) complex matrix. */
SUMA_S_Notev("Cannot go for order higher than %d\n.", lc);
goto NEXT_L;
}
do {
if (SO) {
if ((LocalHead && l == 0) || Opt->debug > 1)
SUMA_S_Notev("Using the mesh from %s for \n"
"a reconstruction of degree %d.\n", SO->Label, l);
if (Opt->debug > 2) SUMA_Print_Surface_Object (SO, SUMA_STDERR);
} else {
SUMA_S_Err("NULL SO!!!");
exit(1);
}
if (LocalHead || Opt->debug > 1) {
fprintf(SUMA_STDERR,"%s: Doing l = %d\n", FuncName, l);
SUMA_etime2(FuncName, "Entering loop", FuncName);
}
if (l==0) {
yc = SUMA_CoerceMxVec(y_l, SUMA_double, 0, NULL);
/* for l == 0, all imaginary comp. are 0 */
y_l = SUMA_FreeMxVec(y_l); y_l = yc; yc = NULL;
y_l_t = SUMA_MxVecTranspose(y_l, NULL);
/* y_l is equal to Y' in Moo's SPHARsmooth.m function*/
if (Opt->debug > 1)
SUMA_ShowMxVec(y_l_t, 1, NULL, "\ny_l_t matrix\n");
dims[0] = 2*l+1; dims[1] = 1;
betal = SUMA_NewMxVec(SUMA_double, 2, dims, 1);
for (jj=0; jj<Opt->n_in_namev; ++jj) {
for (i=0;i<=2*l;++i) { mxvd2(betal,i,0) = mxvd2(abeta[jj],l, i); }
if (Opt->debug > 1)
SUMA_ShowMxVec(betal, 1, NULL, "\nbetal matrix\n");
xe = SUMA_MxVecMult(y_l_t, betal, NULL, 0);
if (Opt->debug > 1) {
SUMA_ShowMxVec(xe, 1, NULL, "\nxe vector\n");
if (Opt->debug > 2)
SUMA_WriteMxVec(xe, "xe_l0.1D", "#xe vector");
}
axe[jj] = xe; xe = NULL;
}
} else { /* higher order, need to deal with real and imaginary parts*/
/* Catenate the columns of y_l with the real columns first
(negative harmonics), followed by imaginary ones (positive harms.)*/
sprintf(stmp, "Starting with order l=%d", l);
if (Opt->debug) SUMA_etime2(FuncName, stmp, FuncName);
y_l = SUMA_YLcomp_to_YLdoub(&y_l, Opt->debug); /* Now y_l is real */
if (Opt->debug ) SUMA_etime2(FuncName, "Created y_l", FuncName);
if (Opt->debug > 2) {
SUMA_WriteMxVec(y_l, "y_l.1D.dset", "#y_l real matrix\n");
}
y_l_t = SUMA_MxVecTranspose(y_l, NULL);
/* y_l is equal to Y' in Moo's SPHARsmooth.m function*/
if (Opt->debug > 1)
SUMA_ShowMxVec(y_l_t, 1, NULL, "\ny_l_t matrix\n");
if (Opt->debug ) SUMA_etime2(FuncName, "Trasnposed y_l", FuncName);
fac = exp((double)(-l*(l+1))*Opt->v0);
dims[0] = 2*l+1; dims[1] = 1;
betal = SUMA_NewMxVec(SUMA_double, 2, dims, 1);
for (jj=0; jj<Opt->n_in_namev; ++jj) {
xe = axe[jj];
for (i=0;i<=2*l;++i) { mxvd2(betal,i,0) = mxvd2(abeta[jj],l, i); }
if (Opt->debug > 1)
SUMA_ShowMxVec(betal, 1, NULL, "\nbetal matrix\n");
sm = SUMA_MxVecMult(y_l_t, betal, sm, 0);
if (Opt->debug > 1) {
sprintf(stmp,"\nsm_%d vector\n", jj);
SUMA_ShowMxVec(sm , 1, NULL, stmp);
}
for (i=0;i<xe->N_vals;++i) {
mxvd1(xe,i) += fac * mxvd1(sm,i);
}
if (Opt->debug > 1) {
sprintf(stmp,"\n%d_estimate vector\n", jj);
SUMA_ShowMxVec(xe, 1, NULL, stmp);
sprintf(stmp,"%d_estimate_l%d.1D.dset", jj, l);
if (Opt->debug > 2)
SUMA_WriteMxVec(xe, stmp, "#estimate at last l\n");
}
}
if (Opt->debug) SUMA_etime2(FuncName, "Refit residual", FuncName);
}
/* store new coordinates, in a temp surface, fun to update as we're
progressing in case want to feed suma at some point*/
if (do_surf_xyz) {
if (l==0 && ps->cs->Send && Opt->debug) {
SUMA_S_Warn("Assuming coefficients are XYZ of surfaces !\n"
"Only the 1st three data columns will be used\n"
"in talk_suma mode.\n"
"Warnings muted for l > 0\n");
}
for (i=0; i<SO->N_Node; ++i) {
i3 = 3*i;
SOt->NodeList[i3 ] = mxvd1(axe[0], i);
SOt->NodeList[i3+1] = mxvd1(axe[1], i);
SOt->NodeList[i3+2] = mxvd1(axe[2], i);
}
}
if (ps->cs->Send) { /* send the smoothed coords */
if (do_surf_xyz) { /* surface coordinates */
if (l > 0) {
if (Opt->debug) {
SUMA_S_Notev("[%f %f %f]\n",
SOt->NodeList[0],
SOt->NodeList[1], SOt->NodeList[2]);
}
if (!SUMA_SendToSuma ( SO, ps->cs, (void *)SOt->NodeList,
SUMA_NODE_XYZ, 1)) {
SUMA_SL_Warn( "Failed in SUMA_SendToSuma\n"
"Communication halted.");
}
}
} else {
if (l > 0) {
if (!fbuf) fbuf = (float *)SUMA_malloc(SO->N_Node*
sizeof(float));
for (i=0; i<SO->N_Node; ++i) fbuf[i] = mxvd1(axe[0], i);
if (!SUMA_SendToSuma ( SO, ps->cs,
(void *)fbuf,
SUMA_NODE_RGBAb, 1)) {
SUMA_SL_Warn( "Failed in SUMA_SendToSuma\n"
"Communication halted.");
}
}
}
}
/* Done with order l */
if (y_l) y_l = SUMA_FreeMxVec(y_l);
if (y_l_t) y_l_t = SUMA_FreeMxVec(y_l_t);
if (betal) betal = SUMA_FreeMxVec(betal);
if (Opt->debug ) {
SUMA_S_Note("MemCheck:");
MCHECK;
}
} while (0);
NEXT_L:
++l;
} while (l <= Opt->iopt);
--l; /* back to where you stopped, kid */
/* Now create an output data set for the reconstructed data */
out_dset = SUMA_CreateDsetPointer(
Opt->out_prefix ? Opt->out_prefix:"spharm_reco",
SUMA_NODE_BUCKET, /* mix and match */
NULL, /* no idcode, let the function create one from the filename*/
NULL, /* no domain str specified */
SO->N_Node /* Number of nodes allocated for */
);
/* add results */
for (jj=0; jj<Opt->n_in_namev; ++jj) {
if (!fbuf) fbuf = (float *)SUMA_malloc(SO->N_Node*sizeof(float));
for (i=0; i<SO->N_Node; ++i) fbuf[i] = mxvd1(axe[jj], i);
if (!SUMA_AddDsetNelCol( out_dset, "sp_reco", SUMA_NODE_FLOAT,
fbuf, NULL, 1)) {
SUMA_S_Err("Failed to update output.");
exit(1);
}
axe[jj] = SUMA_FreeMxVec(axe[jj]);
}
if (Opt->out_prefix) {
/* write out the data */
ooo = SUMA_WriteDset_s( Opt->out_prefix, out_dset,
oform, THD_ok_overwrite(), 0);
if (Opt->debug) SUMA_S_Notev("Wrote %s\n", ooo);
SUMA_free(ooo); ooo=NULL;
}
/* do we need to write out surfaces? */
if (do_surf_xyz && ps->o_N_surfnames) {
for (i=0; i<Opt->n_in_namev/3; ++i) {
if (ps->o_N_surfnames == Opt->n_in_namev/3) {
pref = SUMA_copy_string(ps->o_surfnames[i]);
tp = ps->o_FT[i];
form = ps->o_FF[i];
} else {
sprintf(stmp, "s%02d", i);
pref = SUMA_append_string(ps->o_surfnames[0], stmp);
tp = ps->o_FT[0];
form = ps->o_FF[0];
}
if (Opt->debug) {
SUMA_S_Notev("Prepping to write surface %s\n"
"with X Y Z from cols. %d %d %d\n"
, pref, i*3, 1+i*3, 2+i*3);
}
xbuf = (float*)out_dset->dnel->vec[0+i*3];
ybuf = (float*)out_dset->dnel->vec[1+i*3];
zbuf = (float*)out_dset->dnel->vec[2+i*3];
for (ii=0; ii<SO->N_Node; ++ii) {
i3 = 3*ii;
SO->NodeList[i3 ] = xbuf[ii];
SO->NodeList[i3+1] = ybuf[ii];
SO->NodeList[i3+2] = zbuf[ii];
}
/* write the surface */
SO_name = SUMA_Prefix2SurfaceName(pref, NULL, NULL, tp, &exists);
if (!THD_ok_overwrite() && exists) {
fprintf(SUMA_STDERR,"Warning %s:\nOutput surface %s* on disk.\n"
"Will not overwrite.\n", FuncName, pref);
exit(1);
}
if (Opt->debug) {
SUMA_S_Notev("Saving surface under prefix %s\n", pref);
}
if (!SUMA_Save_Surface_Object (SO_name, SO, tp, form, NULL)) {
SUMA_S_Err("Failed to write reconstructed surface!");
exit(1);
}
}
}
/* clean and quit */
if (fbuf) SUMA_free(fbuf);
for (i=0; i<Opt->n_in_namev; ++i) {
SUMA_FreeMxVec(abeta[i]);
}
SUMA_free(axe); axe = NULL;
SUMA_free(abeta); abeta = NULL;
if (sm) sm = SUMA_FreeMxVec(sm);
SUMA_Spherical_Bases(&l, NULL); /* clean SUMA_Spherical_Bases */
/* you don't want to exit rapidly because the
SUMA might not be done processing the last elements*/
if (ps->cs->Send && !ps->cs->GoneBad) {
/* cleanup and close connections */
if (!SUMA_SendToSuma (SO, ps->cs, NULL, SUMA_NODE_XYZ, 2)) {
SUMA_SL_Warn("Failed in SUMA_SendToSuma\nCleanup failed");
}
}
if (N_Spec) {
int k=0;
for (k=0; k<N_Spec; ++k) {
if (!SUMA_FreeSpecFields(&(Spec[k]))) {
SUMA_S_Err("Failed to free spec fields"); }
}
SUMA_free(Spec); Spec = NULL; N_Spec = 0;
}
if (out_dset) SUMA_FreeDset(out_dset); out_dset = NULL;
if (ps) SUMA_FreeGenericArgParse(ps); ps = NULL;
if (Opt) Opt = SUMA_Free_Generic_Prog_Options_Struct(Opt);
if (!SUMA_Free_CommonFields(SUMAg_CF))
SUMA_error_message(FuncName,"SUMAg_CF Cleanup Failed!",1);
exit(0);
}
/*!
A function version of the program mc by Thomas Lewiner
see main.c in ./MarchingCubes
*/
SUMA_SurfaceObject *SUMA_MarchingCubesSurface(
SUMA_GENERIC_PROG_OPTIONS_STRUCT * Opt)
{
static char FuncName[]={"SUMA_MarchingCubesSurface"};
SUMA_SurfaceObject *SO=NULL;
int nxx, nyy, nzz, cnt, i, j, k, *FaceSetList=NULL;
float *NodeList=NULL;
SUMA_NEW_SO_OPT *nsoopt = NULL;
THD_fvec3 fv, iv;
MCB *mcp ;
SUMA_ENTRY;
if (Opt->obj_type < 0) {
nxx = DSET_NX(Opt->in_vol);
nyy = DSET_NY(Opt->in_vol);
nzz = DSET_NZ(Opt->in_vol);
if (Opt->debug) {
fprintf(SUMA_STDERR,
"%s:\nNxx=%d\tNyy=%d\tNzz=%d\n", FuncName, nxx, nyy, nzz);
}
mcp = MarchingCubes(-1, -1, -1);
set_resolution( mcp, nxx, nyy, nzz ) ;
init_all(mcp) ;
if (Opt->debug) fprintf(SUMA_STDERR,"%s:\nSetting data...\n", FuncName);
cnt = 0;
for( k = 0 ; k < mcp->size_z ; k++ ) {
for( j = 0 ; j < mcp->size_y ; j++ ) {
for( i = 0 ; i < mcp->size_x ; i++ ) {
SUMA_SET_MC_DATA ( mcp, Opt->mcdatav[cnt], i, j, k);
++cnt;
}
}
}
} else {
/* built in */
nxx = nyy = nzz = Opt->obj_type_res;
mcp = MarchingCubes(-1, -1, -1);
set_resolution( mcp, nxx, nyy, nzz) ;
init_all(mcp) ;
compute_data( *mcp , Opt->obj_type) ;
}
if (Opt->debug)
fprintf(SUMA_STDERR,"%s:\nrunning MarchingCubes...\n", FuncName);
run(mcp) ;
clean_temps(mcp) ;
if (Opt->debug > 1) {
fprintf(SUMA_STDERR,"%s:\nwriting out NodeList and FaceSetList...\n",
FuncName);
write1Dmcb(mcp);
}
if (Opt->debug) {
fprintf(SUMA_STDERR,"%s:\nNow creating SO...\n", FuncName);
}
NodeList = (float *)SUMA_malloc(sizeof(float)*3*mcp->nverts);
FaceSetList = (int *)SUMA_malloc(sizeof(int)*3*mcp->ntrigs);
if (!NodeList || !FaceSetList) {
SUMA_SL_Crit("Failed to allocate!");
SUMA_RETURN(SO);
}
nsoopt = SUMA_NewNewSOOpt();
if (Opt->obj_type < 0) {
nsoopt->LargestBoxSize = -1;
if (Opt->debug) {
fprintf(SUMA_STDERR,
"%s:\nCopying vertices, changing to DICOM \n"
"Orig:(%f %f %f) \nD:(%f %f %f)...\n",
FuncName,
DSET_XORG(Opt->in_vol),
DSET_YORG(Opt->in_vol), DSET_ZORG(Opt->in_vol),
DSET_DX(Opt->in_vol),
DSET_DY(Opt->in_vol), DSET_DZ(Opt->in_vol));
}
for ( i = 0; i < mcp->nverts; i++ ) {
j = 3*i; /* change from index coordinates to mm DICOM, next three lines are equivalent of SUMA_THD_3dfind_to_3dmm*/
fv.xyz[0] = DSET_XORG(Opt->in_vol) + mcp->vertices[i].x * DSET_DX(Opt->in_vol);
fv.xyz[1] = DSET_YORG(Opt->in_vol) + mcp->vertices[i].y * DSET_DY(Opt->in_vol);
fv.xyz[2] = DSET_ZORG(Opt->in_vol) + mcp->vertices[i].z * DSET_DZ(Opt->in_vol);
/* change mm to RAI coords */
iv = SUMA_THD_3dmm_to_dicomm( Opt->in_vol->daxes->xxorient, Opt->in_vol->daxes->yyorient, Opt->in_vol->daxes->zzorient, fv );
NodeList[j ] = iv.xyz[0];
NodeList[j+1] = iv.xyz[1];
NodeList[j+2] = iv.xyz[2];
}
for ( i = 0; i < mcp->ntrigs; i++ ) {
j = 3*i;
FaceSetList[j ] = mcp->triangles[i].v3;
FaceSetList[j+1] = mcp->triangles[i].v2;
FaceSetList[j+2] = mcp->triangles[i].v1;
}
} else {
nsoopt->LargestBoxSize = 100;
/* built in */
for ( i = 0; i < mcp->nverts; i++ ) {
j = 3*i;
NodeList[j ] = mcp->vertices[i].x;
NodeList[j+1] = mcp->vertices[i].y;
NodeList[j+2] = mcp->vertices[i].z;
}
for ( i = 0; i < mcp->ntrigs; i++ ) {
j = 3*i;
FaceSetList[j ] = mcp->triangles[i].v3;
FaceSetList[j+1] = mcp->triangles[i].v2;
FaceSetList[j+2] = mcp->triangles[i].v1;
}
}
SO = SUMA_NewSO(&NodeList, mcp->nverts, &FaceSetList, mcp->ntrigs, nsoopt);
if (Opt->obj_type < 0) {
/* not sure if anything needs to be done here ...*/
} else {
if (Opt->obj_type == 0) SO->normdir = 1;
else SO->normdir = -1;
}
if (Opt->debug) {
fprintf(SUMA_STDERR,"%s:\nCleaning mcp...\n", FuncName);
}
clean_all(mcp) ;
free(mcp);
nsoopt=SUMA_FreeNewSOOpt(nsoopt);
SUMA_RETURN(SO);
}
/*!
contains code shamelessly stolen from Rick who stole it from Bob.
*/
SUMA_Boolean SUMA_Get_isosurface_datasets (
SUMA_GENERIC_PROG_OPTIONS_STRUCT * Opt)
{
static char FuncName[]={"SUMA_Get_isosurface_datasets"};
int i;
SUMA_Boolean LocalHead = NOPE;
SUMA_ENTRY;
if (!Opt->in_vol && !Opt->in_name) {
SUMA_S_Err("NULL input");
SUMA_RETURN(NOPE);
}
if (!Opt->in_vol) { /* open it */
Opt->in_vol = THD_open_dataset( Opt->in_name );
}
if (!Opt->in_vol) {
SUMA_S_Err("No volume could be had");
SUMA_RETURN(NOPE);
}
if (!ISVALID_DSET(Opt->in_vol)) {
if (!Opt->in_name) {
SUMA_SL_Err("NULL input volume.");
SUMA_RETURN(NOPE);
} else {
SUMA_SL_Err("invalid volume.");
SUMA_RETURN(NOPE);
}
} else if ( DSET_BRICK_TYPE(Opt->in_vol, 0) == MRI_complex) {
SUMA_SL_Err("Can't do complex data.");
SUMA_RETURN(NOPE);
}
Opt->nvox = DSET_NVOX( Opt->in_vol );
if (DSET_NVALS( Opt->in_vol) != 1) {
SUMA_SL_Err("Input volume can only have one sub-brick in it.\n"
"Use [.] selectors to choose sub-brick needed.");
SUMA_RETURN(NOPE);
}
Opt->mcdatav = (double *)SUMA_malloc(sizeof(double)*Opt->nvox);
if (!Opt->mcdatav) {
SUMA_SL_Crit("Failed to allocate for maskv");
SUMA_RETURN(NOPE);
}
if (Opt->xform == SUMA_ISO_XFORM_MASK) {
SUMA_LH("SUMA_ISO_XFORM_MASK");
switch (Opt->MaskMode) {
case SUMA_ISO_CMASK:
SUMA_LH("SUMA_ISO_CMASK");
if (Opt->cmask) {
/* here's the second order grand theft */
int clen = strlen( Opt->cmask );
char * cmd;
byte *bmask;
cmd = (char *)malloc((clen + 1) * sizeof(char));
strcpy( cmd, Opt->cmask);
bmask = EDT_calcmask( cmd, &Opt->ninmask, 0 );
SUMA_LHv("Have %d\n", Opt->ninmask);
free( cmd ); /* free EDT_calcmask() string */
if ( bmask == NULL ) {
SUMA_SL_Err("Failed to compute mask from -cmask option");
SUMA_free(Opt->mcdatav); Opt->mcdatav=NULL;
SUMA_RETURN(NOPE);
}
if ( Opt->ninmask != Opt->nvox ) {
SUMA_SL_Err("Input and cmask datasets do not have "
"the same dimensions\n" );
SUMA_free(Opt->mcdatav); Opt->mcdatav=NULL;
SUMA_RETURN(NOPE);
}
Opt->ninmask = THD_countmask( Opt->ninmask, bmask );
SUMA_LHv("Have %d\n", Opt->ninmask);
for (i=0; i<Opt->nvox; ++i)
if (bmask[i]) Opt->mcdatav[i] = (double)bmask[i];
else Opt->mcdatav[i] = -1;
free(bmask);bmask=NULL;
} else {
SUMA_SL_Err("NULL cmask"); SUMA_RETURN(NOPE);
}
break;
case SUMA_ISO_VAL:
case SUMA_ISO_RANGE:
SUMA_LH("SUMA_ISO_VAL, SUMA_ISO_RANGE");
/* load the dset */
DSET_load(Opt->in_vol);
Opt->dvec = (double *)SUMA_malloc(sizeof(double) * Opt->nvox);
if (!Opt->dvec) {
SUMA_SL_Crit("Faile to allocate for dvec.\nOh misery.");
SUMA_RETURN(NOPE);
}
EDIT_coerce_scale_type(
Opt->nvox , DSET_BRICK_FACTOR(Opt->in_vol,0) ,
DSET_BRICK_TYPE(Opt->in_vol,0), DSET_ARRAY(Opt->in_vol, 0) ,
MRI_double , Opt->dvec ) ;
/* no need for data in input volume anymore */
PURGE_DSET(Opt->in_vol);
Opt->ninmask = 0;
if (Opt->MaskMode == SUMA_ISO_VAL) {
for (i=0; i<Opt->nvox; ++i) {
if (Opt->dvec[i] == Opt->v0) {
Opt->mcdatav[i] = 1; ++ Opt->ninmask;
} else Opt->mcdatav[i] = -1;
}
} else if (Opt->MaskMode == SUMA_ISO_RANGE) {
for (i=0; i<Opt->nvox; ++i) {
if (Opt->dvec[i] >= Opt->v0 && Opt->dvec[i] < Opt->v1) {
Opt->mcdatav[i] = 1; ++ Opt->ninmask;
} else Opt->mcdatav[i] = -1;
}
} else {
SUMA_SL_Err("Bad Miracle.");
SUMA_RETURN(NOPE);
}
SUMA_free(Opt->dvec); Opt->dvec = NULL;
/* this vector is not even created in SUMA_ISO_CMASK mode ...*/
break;
default:
SUMA_SL_Err("Unexpected value of MaskMode");
SUMA_RETURN(NOPE);
break;
}
} else if (Opt->xform == SUMA_ISO_XFORM_SHIFT) {
/* load the dset */
DSET_load(Opt->in_vol);
Opt->dvec = (double *)SUMA_malloc(sizeof(double) * Opt->nvox);
if (!Opt->dvec) {
SUMA_SL_Crit("Failed to allocate for dvec.\nOh misery.");
SUMA_RETURN(NOPE);
}
EDIT_coerce_scale_type(
Opt->nvox , DSET_BRICK_FACTOR(Opt->in_vol,0) ,
DSET_BRICK_TYPE(Opt->in_vol,0), DSET_ARRAY(Opt->in_vol, 0) ,
MRI_double , Opt->dvec ) ;
/* no need for data in input volume anymore */
PURGE_DSET(Opt->in_vol);
Opt->ninmask = Opt->nvox;
for (i=0; i<Opt->nvox; ++i) {
Opt->mcdatav[i] = Opt->dvec[i] - Opt->v0;
}
SUMA_free(Opt->dvec); Opt->dvec = NULL;
} else if (Opt->xform == SUMA_ISO_XFORM_NONE) {
/* load the dset */
DSET_load(Opt->in_vol);
Opt->dvec = (double *)SUMA_malloc(sizeof(double) * Opt->nvox);
if (!Opt->dvec) {
SUMA_SL_Crit("Faile to allocate for dvec.\nOh misery.");
SUMA_RETURN(NOPE);
}
EDIT_coerce_scale_type(
Opt->nvox , DSET_BRICK_FACTOR(Opt->in_vol,0) ,
DSET_BRICK_TYPE(Opt->in_vol,0), DSET_ARRAY(Opt->in_vol, 0) ,
MRI_double , Opt->dvec ) ;
/* no need for data in input volume anymore */
PURGE_DSET(Opt->in_vol);
Opt->ninmask = Opt->nvox;
for (i=0; i<Opt->nvox; ++i) {
Opt->mcdatav[i] = Opt->dvec[i];
}
SUMA_free(Opt->dvec); Opt->dvec = NULL;
} else {
SUMA_SL_Err("Bad Opt->xform.");
SUMA_RETURN(NOPE);
}
if ( Opt->ninmask <= 0 ) {
if (Opt->ninmask == 0) {
SUMA_SL_Err("A negative value!\nNothing to do." );
} else {
SUMA_SL_Err("An empty mask!\n Nothing to do." );
}
SUMA_RETURN(NOPE);
}
if (Opt->debug > 0) {
fprintf( SUMA_STDERR,
"%s:\nInput dset %s has nvox = %d, nvals = %d",
FuncName, SUMA_CHECK_NULL_STR(Opt->in_name),
Opt->nvox, DSET_NVALS(Opt->in_vol) );
fprintf( SUMA_STDERR, " (%d voxels in mask)\n", Opt->ninmask );
}
SUMA_RETURN(YUP);
}
int main (int argc,char *argv[])
{/* Main */
static char FuncName[]={"SurfClust"};
int kar, SO_read, *ni=NULL, N_ni, cnt, i, *nip=NULL, N_Spec = 0;
float *data_old = NULL, *far = NULL, *nv=NULL, *nt = NULL;
void *SO_name = NULL;
SUMA_SurfaceObject *SO = NULL, *SOnew = NULL;
MRI_IMAGE *im = NULL;
SUMA_DSET_FORMAT iform;
SUMA_SURFCLUST_OPTIONS *Opt;
SUMA_SurfSpecFile *Spec=NULL;
DList *list = NULL;
SUMA_DSET *dset = NULL;
float *NodeArea = NULL;
FILE *clustout=NULL;
char *ClustOutName = NULL, *params=NULL, stmp[200];
char sapa[32]={""}, sapd[32]={""}, sapn[32]={""}, sap[100]={""};
SUMA_GENERIC_ARGV_PARSE *ps=NULL;
SUMA_Boolean LocalHead = NOPE;
SUMA_STANDALONE_INIT;
SUMA_mainENTRY;
/* Allocate space for DO structure */
SUMAg_DOv = SUMA_Alloc_DisplayObject_Struct (SUMA_MAX_DISPLAYABLE_OBJECTS);
ps = SUMA_Parse_IO_Args(argc, argv, "-spec;-i;-t;-sv;-s;");
Opt = SUMA_SurfClust_ParseInput (argv, argc, ps);
if (argc < 6)
{
SUMA_S_Err("Too few options");
usage_SUMA_SurfClust(0);
exit (1);
}
if (Opt->DistLim >= 0.0) {
sprintf(sapd, "_r%.1f", Opt->DistLim);
} else {
sprintf(sapd, "_e%d", -(int)Opt->DistLim);
}
if (Opt->AreaLim < 0) {
sapa[0]='\0';
} else {
sprintf(sapa, "_a%.1f", Opt->AreaLim);
}
if (Opt->NodeLim < 0) {
sapn[0]='\0';
} else {
sprintf(sapn, "_n%d", Opt->NodeLim);
}
sprintf(sap, "%s%s%s", sapd, sapa, sapn);
if (Opt->WriteFile) {
sprintf(stmp,"_ClstTable%s.1D", sap);
ClustOutName = SUMA_append_string(Opt->out_prefix, stmp);
if (SUMA_filexists(ClustOutName) && !THD_ok_overwrite()) {
fprintf (SUMA_STDERR,
"Error %s:\n"
"Output file %s exists, will not overwrite.\n",
FuncName, ClustOutName);
exit(1);
}
}
Spec = SUMA_IO_args_2_spec(ps, &N_Spec);
if (N_Spec == 0) {
SUMA_S_Err("No surfaces found.");
exit(1);
}
if (N_Spec != 1) {
SUMA_S_Err("Multiple spec at input.");
exit(1);
}
if (Spec->N_Surfs != 1) {
SUMA_S_Err("1 and only 1 surface expected at input");
exit(1);
}
SUMA_LH("Loading surface...");
SO = SUMA_Load_Spec_Surf(Spec, 0, ps->sv[0], 0);
if (!SO) {
fprintf (SUMA_STDERR,"Error %s:\n"
"Failed to find surface\n"
"in spec file. \n",
FuncName );
exit(1);
}
if (!SUMA_SurfaceMetrics(SO, "EdgeList", NULL)) {
SUMA_S_Err("Failed to compute edgelist");
exit(1);
}
NodeArea = SUMA_CalculateNodeAreas(SO, NULL);
if (!NodeArea) {
SUMA_S_Err("Failed to calculate Node Areas.\n");
exit(1);
}
/* load the data */
iform = SUMA_NO_DSET_FORMAT;
dset = SUMA_LoadDset_s (Opt->in_name, &iform, 0);
if (LocalHead) SUMA_ShowDset(dset, 0, NULL);
if (!dset) { SUMA_S_Err( "Failed to load dataset.\n"
"Make sure file exists\n"
"and is of the specified\n"
"format.");
exit(1); }
if (!SUMA_OKassign(dset, SO)) {
SUMA_SL_Err("Failed to assign data set to surface.");
exit(1);
}
/* get the node index column */
nip = SUMA_GetNodeDef(dset);
N_ni = SDSET_VECLEN(dset);
if (!nip) {
SUMA_S_Err("Failed to find node index column");
exit(1);
}
/* copy nip's contents because you will be modifying in the
thresholding below */
ni = (int *)SUMA_malloc(N_ni*sizeof(int));
memcpy (ni, nip, N_ni*sizeof(int));
nv = SUMA_DsetCol2Float(dset, Opt->labelcol, 0);
if (!nv) {
SUMA_S_Err("Failed to find node value column");
exit(1);
}
/* any thresholding ? */
if (Opt->DoThreshold > SUMA_NO_THRESH) {
nt = SUMA_DsetCol2Float(dset, Opt->tind, 0);
if (!nt) {
SUMA_S_Err("Failed to find threshold column");
exit(1);
}
cnt = 0;
if (Opt->DoThreshold == SUMA_LESS_THAN) {
if (Opt->update)
fprintf( SUMA_STDERR,
"%s: Thresholding at %f...\n", FuncName, Opt->ThreshR[0]);
for (i=0;i<N_ni; ++i) {
if (nt[i] >= Opt->ThreshR[0]) {
ni[cnt] = ni[i];
nv[cnt] = nv[i];
++cnt;
}
}
} else if (Opt->DoThreshold == SUMA_ABS_LESS_THAN) {
SUMA_LH("ABS Thresholding at %f...", Opt->ThreshR[0]);
for (i=0;i<N_ni; ++i) {
if (fabs(nt[i]) >= Opt->ThreshR[0]) {
ni[cnt] = ni[i];
nv[cnt] = nv[i];
++cnt;
}
}
} else if (Opt->DoThreshold == SUMA_THRESH_INSIDE_RANGE) {
SUMA_LH("Range Thresholding at %f %f...",
Opt->ThreshR[0], Opt->ThreshR[1]);
for (i=0;i<N_ni; ++i) {
if (nt[i] >= Opt->ThreshR[0] && nt[i] <= Opt->ThreshR[1]) {
ni[cnt] = ni[i];
nv[cnt] = nv[i];
++cnt;
}
}
} else if (Opt->DoThreshold == SUMA_THRESH_OUTSIDE_RANGE) {
SUMA_LH("Ex Range Thresholding at %f %f...",
Opt->ThreshR[0], Opt->ThreshR[1]);
for (i=0;i<N_ni; ++i) {
if (nt[i] < Opt->ThreshR[0] || nt[i] > Opt->ThreshR[1]) {
ni[cnt] = ni[i];
nv[cnt] = nv[i];
++cnt;
}
}
} else {
SUMA_S_Err("Not ready for threshold mode of %d", Opt->DoThreshold);
}
N_ni = cnt;
}
if (Opt->update) {
Opt->update = -(N_ni * Opt->update / 100); /* make it negative
before you begin a
clustering operation */
if (LocalHead) {
fprintf( SUMA_STDERR,
"Update parameter, once every %d nodes\n"
"%d nodes to work with.\n",
-(int)Opt->update, N_ni);
}
}
/* make the call */
list = SUMA_FindClusters (SO, ni, nv, N_ni, -1, Opt, NodeArea);
if (!list) {
SUMA_S_Err("Failed in SUMA_FindClusters");
exit(1);
}
if (list->size) {
/* sort the list */
if (!SUMA_Sort_ClustersList (list, Opt->SortMode)) {
SUMA_S_Err("Failed to sort cluster list");
exit(1);
}
}
/* Show the results */
params = SUMA_HistString(FuncName, argc, argv, NULL);
if (Opt->WriteFile) {
if (0) {
/* You can also write a NIML formatted cluster table with */
NI_element *nel=NULL;
int suc; char sbuf[512]={""};
nel = SUMA_SurfClust_list_2_nel(list, 0, params, NULL);
snprintf(sbuf, 510, "file:%s%s.niml.clstbl", Opt->out_prefix, sap);
NEL_WRITE_TXH(nel, sbuf, suc);
NI_free_element(nel); nel=NULL;
}
clustout = fopen(ClustOutName, "w");
if (!clustout) {
fprintf (SUMA_STDERR,
"Error %s:\n"
"Failed to open %s for writing.\n"
"Check permissions.\n",
FuncName, ClustOutName);
exit(1);
}
SUMA_Show_SurfClust_list(list, clustout, 0, params, NULL);
fclose(clustout);clustout = NULL;
} else SUMA_Show_SurfClust_list(list, NULL, 0, params, NULL);
if (!list->size) {
/* nothing left to do, quit */
exit(0);
}
if (Opt->OutROI) {
SUMA_DSET *dset_roi = NULL;
char *ROIprefix = NULL;
char *NameOut = NULL;
sprintf(stmp,"_ClstMsk%s", sap);
ROIprefix = SUMA_append_string(Opt->out_prefix, stmp);
/* Call this function, write out the resultant dset to disk
then cleanup */
dset_roi =
SUMA_SurfClust_list_2_DsetMask(SO, list, Opt->FullROIList, ROIprefix);
if (!dset_roi) {
SUMA_S_Err("NULL dset_roi");
exit(1);
}
if (Opt->prepend_node_index) {/* prepend node index? */
if (!SUMA_InsertDsetNelCol (
dset_roi, "Node Index Copy", SUMA_NODE_INT,
(void *)(dset_roi->inel->vec[0]), NULL ,1, 0)) {
SUMA_S_Err("Failed to insert column");
}
if (LocalHead) SUMA_ShowDset(dset_roi,0, NULL);
}
NameOut = SUMA_WriteDset_s ( ROIprefix, dset_roi, Opt->oform,
THD_ok_overwrite(), 0);
if (!NameOut) { SUMA_SL_Err("Failed to write dataset."); exit(1); }
SUMA_FreeDset((void *)dset_roi); dset_roi = NULL;
if (NameOut) SUMA_free(NameOut); NameOut = NULL;
if (ROIprefix) SUMA_free(ROIprefix); ROIprefix = NULL;
}
if (Opt->OutClustDset) {
SUMA_DSET *dset_clust = NULL;
char *Clustprefix = NULL;
char *NameOut = NULL;
sprintf(stmp,"_Clustered%s", sap);
Clustprefix = SUMA_append_string(Opt->out_prefix, stmp);
/* Call this function, write out the resultant dset to disk
then cleanup */
dset_clust =
SUMA_MaskDsetByClustList( dset, SO, list,
Opt->FullROIList, Clustprefix);
if (!dset_clust) {
SUMA_S_Err("NULL dset_clust");
exit(1);
}
NameOut = SUMA_WriteDset_s ( Clustprefix, dset_clust, Opt->oform,
THD_ok_overwrite(), 0);
if (!NameOut) { SUMA_SL_Err("Failed to write dataset."); exit(1); }
SUMA_FreeDset((void *)dset_clust); dset_clust = NULL;
if (NameOut) SUMA_free(NameOut); NameOut = NULL;
if (Clustprefix) SUMA_free(Clustprefix); Clustprefix = NULL;
}
if (ClustOutName) SUMA_free(ClustOutName); ClustOutName = NULL;
if (list) dlist_destroy(list); SUMA_free(list); list = NULL;
if (ni) SUMA_free(ni); ni = NULL;
if (nv) SUMA_free(nv); nv = NULL;
if (nt) SUMA_free(nt); nt = NULL;
if (Opt->out_prefix) SUMA_free(Opt->out_prefix); Opt->out_prefix = NULL;
if (Opt) SUMA_free_SurfClust_Opt(Opt);
if (ps) SUMA_FreeGenericArgParse(ps); ps = NULL;
if (dset) SUMA_FreeDset((void *)dset); dset = NULL;
if (!SUMA_Free_Displayable_Object_Vect (SUMAg_DOv, SUMAg_N_DOv)) {
SUMA_SL_Err("DO Cleanup Failed!");
}
exit(0);
}
/*!
\brief parse the arguments for SurfQual program
\param argv (char *)
\param argc (int)
\return Opt (SUMA_SURFQUAL_OPTIONS *) options structure.
To free it, use
SUMA_free(Opt->out_prefix);
SUMA_free(Opt);
*/
SUMA_SURFQUAL_OPTIONS *SUMA_SurfQual_ParseInput (char *argv[], int argc,
SUMA_GENERIC_ARGV_PARSE *ps)
{
static char FuncName[]= {"SUMA_SurfQual_ParseInput"};
SUMA_SURFQUAL_OPTIONS *Opt=NULL;
int kar, i, ind;
char *outprefix;
SUMA_Boolean brk = NOPE;
SUMA_Boolean LocalHead = NOPE;
SUMA_ENTRY;
Opt = (SUMA_SURFQUAL_OPTIONS *)SUMA_malloc(sizeof(SUMA_SURFQUAL_OPTIONS));
kar = 1;
Opt->out_prefix = NULL;
Opt->surftype = NULL;
Opt->self_intersect = 0;
Opt->DoSum = 0;
brk = NOPE;
while (kar < argc) { /* loop accross command ine options */
/*fprintf(stdout, "%s verbose: Parsing command line...\n", FuncName);*/
if (strcmp(argv[kar], "-h") == 0 || strcmp(argv[kar], "-help") == 0) {
usage_SUMA_SurfQual(ps, strlen(argv[kar]) > 3 ? 2:1);
exit (0);
}
/* skip the options parsed in SUMA_ParseInput_basics_s */
SUMA_SKIP_COMMON_OPTIONS(brk, kar);
if (!brk && (strcmp(argv[kar], "-sphere") == 0)) {
if (Opt->surftype) {
SUMA_S_Err( "Surface type already specified.\n"
"Only one type allowed.");
exit(1);
}
Opt->surftype = argv[kar];
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-self_intersect") == 0)) {
Opt->self_intersect = 1;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-summary") == 0)) {
Opt->DoSum = 1;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-prefix") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -prefix \n");
exit (1);
}
Opt->out_prefix = SUMA_copy_string(argv[kar]);
brk = YUP;
}
if (!brk && !ps->arg_checked[kar]) {
fprintf (SUMA_STDERR,
"Error %s:\nOption %s not understood. Try -help for usage\n",
FuncName, argv[kar]);
suggest_best_prog_option(argv[0], argv[kar]);
exit (1);
} else {
brk = NOPE;
kar ++;
}
}
#if 0
if (Spec->N_Surfs < 1) {
SUMA_SL_Err("No surface specified.");
exit(1);
}
#endif
SUMA_RETURN (Opt);
}
int main (int argc,char *argv[])
{/* Main */
static char FuncName[]={"SurfPatch"};
SUMA_GETPATCH_OPTIONS *Opt;
char *ppref=NULL, ext[5];
float *far=NULL;
MRI_IMAGE *im = NULL;
int SO_read = -1;
int *NodePatch=NULL, N_NodePatch=-1, *FaceSetList=NULL ,
N_FaceSet = -1, N_Node = -1, N_Spec=0;
int i, inodeoff=-1, ilabeloff=-1, nvec, ncol, cnt;
SUMA_SurfaceObject *SO = NULL;
SUMA_PATCH *ptch = NULL;
SUMA_SurfSpecFile *Spec;
SUMA_INDEXING_ORDER d_order;
void *SO_name = NULL;
SUMA_Boolean exists = NOPE;
SUMA_SO_File_Type typetmp;
SUMA_SurfaceObject *SOnew = NULL;
float *NodeList = NULL;
SUMA_GENERIC_ARGV_PARSE *ps=NULL;
SUMA_Boolean LocalHead = NOPE;
SUMA_STANDALONE_INIT;
SUMA_mainENTRY;
ps = SUMA_Parse_IO_Args(argc, argv, "-i;-t;-spec;-s;-sv;");
/* Allocate space for DO structure */
SUMAg_DOv = SUMA_Alloc_DisplayObject_Struct (SUMA_MAX_DISPLAYABLE_OBJECTS);
Opt = SUMA_GetPatch_ParseInput (argv, argc, ps);
if (argc < 2)
{
SUMA_S_Err("Too few options");
usage_SUMA_getPatch(ps, 0);
exit (1);
}
/* read all surfaces */
Spec = SUMA_IO_args_2_spec(ps, &N_Spec);
if (N_Spec == 0) {
SUMA_S_Err("No surfaces found.");
exit(1);
}
if (N_Spec > 1 ) {
SUMA_S_Err( "Mike, you cannot mix -spec with -i or -t options "
"for specifying surfaces.");
exit(1);
}
if (Spec->N_Surfs < 1) {
SUMA_S_Err("No surfaces");
exit(1);
}
if (Opt->DoVol && Spec->N_Surfs != 2) {
SUMA_S_Errv("Must specify 2 and only 2 surfaces with -vol options\n"
"Have %d from the command line\n",Spec->N_Surfs);
exit(1);
}
if (Opt->oType != SUMA_FT_NOT_SPECIFIED && !Opt->VolOnly) {
for (i=0; i < Spec->N_Surfs; ++i) {
if (Spec->N_Surfs > 1) {
sprintf(ext, "_%c", 65+i);
ppref = SUMA_append_string(Opt->out_prefix, ext);
} else {
ppref = SUMA_copy_string(Opt->out_prefix);
}
SO_name = SUMA_Prefix2SurfaceName(ppref, NULL, NULL,
Opt->oType, &exists);
if (exists && !THD_ok_overwrite()) {
fprintf(SUMA_STDERR, "Error %s:\nOutput file(s) %s* on disk.\n"
"Will not overwrite.\n", FuncName, ppref);
exit(1);
}
if (ppref) SUMA_free(ppref); ppref = NULL;
if (SO_name) SUMA_free(SO_name); SO_name = NULL;
}
}
/* read in the file containing the node information */
im = mri_read_1D (Opt->in_name);
if (!im) {
SUMA_S_Errv("Failed to read 1D file '%s'\n", Opt->in_name);
exit(1);
}
far = MRI_FLOAT_PTR(im);
nvec = im->nx;
ncol = im->ny;
if (Opt->nodecol >= ncol || Opt->labelcol >= ncol) {
fprintf(SUMA_STDERR, "\n"
"Error %s: Input file has a total of %d columns.\n"
"One or both user-specified node (%d) and \n"
"label (%d) columns are too high. Maximum usable\n"
"column index is %d.\n"
, FuncName, ncol, Opt->nodecol,
Opt->labelcol, ncol -1 );
exit(1);
}
d_order = SUMA_COLUMN_MAJOR;
if (!nvec) {
SUMA_SL_Err("Empty file");
exit(1);
}
/* form the node vector */
NodePatch = (int *)SUMA_malloc(sizeof(int)*nvec);
if (!NodePatch) {
SUMA_SL_Crit("Failed to allocate.");
exit(1);
}
inodeoff = Opt->nodecol*nvec;
if (Opt->labelcol < 0) { /* all listed nodes */
for (i=0; i<nvec; ++i) {
NodePatch[i] = far[i+inodeoff];
}
N_NodePatch = nvec;
} else {
ilabeloff = Opt->labelcol*nvec;
if (Opt->thislabel < 0) { /* all nodes with non zero labels */
cnt = 0;
for (i=0; i<nvec; ++i) {
if (far[i+ilabeloff]) {
NodePatch[cnt] = far[i+inodeoff];
++cnt;
}
}
N_NodePatch = cnt;
} else { /* select labels */
cnt = 0;
for (i=0; i<nvec; ++i) {
if (far[i+ilabeloff] == Opt->thislabel) {
NodePatch[cnt] = far[i+inodeoff];
++cnt;
}
}
N_NodePatch = cnt;
}
NodePatch = (int *) SUMA_realloc(NodePatch , sizeof(int)*N_NodePatch);
}
/* done with im, free it */
mri_free(im); im = NULL;
if (Opt->DoVol) {
SUMA_SurfaceObject *SO1 =
SUMA_Load_Spec_Surf_with_Metrics(Spec, 0, ps->sv[0], 0);
SUMA_SurfaceObject *SO2 =
SUMA_Load_Spec_Surf_with_Metrics(Spec, 1, ps->sv[0], 0);
double Vol = 0.0;
SUMA_SurfaceObject *SOp = SUMA_Alloc_SurfObject_Struct(1);
byte *adj_N=NULL;
if (Opt->adjust_contour)
adj_N = SUMA_calloc(SO1->N_Node, sizeof(byte));
if (!SO1 || !SO2) {
SUMA_SL_Err("Failed to load surfaces.");
exit(1);
}
/* a chunk used to test SUMA_Pattie_Volume */
Vol = SUMA_Pattie_Volume(SO1, SO2, NodePatch, N_NodePatch,
SOp, Opt->minhits,
Opt->FixBowTie, Opt->adjust_contour,
adj_N, Opt->verb);
fprintf (SUMA_STDOUT,"Volume = %f\n", fabs(Vol));
if (Opt->out_volprefix) {
if (Opt->oType != SUMA_FT_NOT_SPECIFIED) SOp->FileType = Opt->oType;
if (Opt->flip) {
if (Opt->verb > 1)
SUMA_S_Note("Flipping stitched surf's triangles\n");
SUMA_FlipSOTriangles (SOp);
}
if (!(SUMA_Save_Surface_Object_Wrap ( Opt->out_volprefix, NULL,
SOp, SUMA_PLY, SUMA_ASCII,
NULL))) {
fprintf (SUMA_STDERR,
"Error %s: Failed to write surface object.\n", FuncName);
}
if (Opt->adjust_contour && adj_N) {
Opt->out_volprefix =
SUMA_append_replace_string(Opt->out_volprefix,
".adjneighb","",1);
ppref = SUMA_Extension(Opt->out_volprefix, ".1D.dset", NOPE);
SUMA_WRITE_IND_ARRAY_1D(adj_N, NULL, SO1->N_Node, 1, ppref);
SUMA_free(ppref); ppref=NULL;
}
}
if (SOp) SUMA_Free_Surface_Object(SOp); SOp = NULL;
}
if (!Opt->VolOnly) {
FaceSetList = NULL;
N_FaceSet = -1;
for (i=0; i < Spec->N_Surfs; ++i) {/* loop to read in surfaces */
/* now identify surface needed */
if (!(SO = SUMA_Load_Spec_Surf_with_Metrics(Spec, i, ps->sv[0], 0))) {
SUMA_S_Err("Failed to load surface .\n");
exit(1);
}
if (SO->aSO) {
/* otherwise, when you reset the number of FaceSets for example,
and you still write in GIFTI, the old contents of aSO will
prevail */
SO->aSO = SUMA_FreeAfniSurfaceObject(SO->aSO);
}
/* extract the patch */
ptch = SUMA_getPatch (NodePatch, N_NodePatch, SO->N_Node,
SO->FaceSetList, SO->N_FaceSet,
SO->MF, Opt->minhits,
Opt->FixBowTie, (!i && !Opt->DoVol));
/* verbose only for first patch, and
if no volume computation was required
This is to keep the warnings to a minimum*/
if (!ptch) {
SUMA_SL_Err("Failed to form patch.");
exit(1);
}
if (LocalHead) SUMA_ShowPatch(ptch, NULL);
/* Now create a surface with that patch */
if (Spec->N_Surfs > 1) {
sprintf(ext, "_%c", 65+i);
ppref = SUMA_append_string(Opt->out_prefix, ext);
} else {
ppref = SUMA_copy_string(Opt->out_prefix);
}
/* save the original type */
typetmp = SO->FileType;
if (Opt->oType != SUMA_FT_NOT_SPECIFIED) SO->FileType = Opt->oType;
SO_name = SUMA_Prefix2SurfaceName(ppref, NULL, NULL,
SO->FileType, &exists);
if (ppref) SUMA_free(ppref); ppref = NULL;
/* save the original pointers to the facesets and their number */
FaceSetList = SO->FaceSetList;
N_FaceSet = SO->N_FaceSet;
NodeList = SO->NodeList;
N_Node = SO->N_Node;
/* replace with Patch */
SO->FaceSetList = ptch->FaceSetList;
SO->N_FaceSet = ptch->N_FaceSet;
if (Opt->Do_p2s) {
if (LocalHead)
fprintf (SUMA_STDERR,
"%s: Changing patch to surface...\n", FuncName);
SOnew = SUMA_Patch2Surf(SO->NodeList, SO->N_Node,
SO->FaceSetList, SO->N_FaceSet, 3);
if (!SOnew) {
SUMA_S_Err("Failed to change patch to surface.");
exit(1);
}
SO->FaceSetList = SOnew->FaceSetList;
SO->N_FaceSet = SOnew->N_FaceSet;
SO->N_Node = SOnew->N_Node;
SO->NodeList = SOnew->NodeList;
}
if (SO->N_FaceSet <= 0) {
SUMA_S_Warn("The patch is empty.\n"
" Non existing surface not written to disk.\n");
} else {
/* Is the gain wanted? */
if (Opt->coordgain) {
SUMA_SL_Note("Applying coord gain to surface nodes!");
for (cnt=0; cnt < SO->NodeDim*SO->N_Node; ++cnt)
SO->NodeList[cnt] *= Opt->coordgain;
}
if (Opt->flip) {
if (Opt->verb > 1) SUMA_S_Note("Flipping triangles\n");
SUMA_FlipTriangles (SO->FaceSetList, SO->N_FaceSet);
SUMA_RECOMPUTE_NORMALS(SO);
}
if (!SUMA_Save_Surface_Object (SO_name, SO, SO->FileType,
SUMA_ASCII, NULL)) {
fprintf (SUMA_STDERR,
"Error %s: Failed to write surface object.\n",
FuncName);
exit (1);
}
}
/* bring SO back to shape */
SO->FileType = typetmp;
SO->FaceSetList = FaceSetList; FaceSetList = NULL;
SO->N_FaceSet = N_FaceSet; N_FaceSet = -1;
SO->NodeList = NodeList; NodeList = NULL;
SO->N_Node = N_Node; N_Node = -1;
if (SO_name) SUMA_free(SO_name); SO_name = NULL;
if (ptch) SUMA_freePatch(ptch); ptch = NULL;
if (SOnew) SUMA_Free_Surface_Object(SOnew); SOnew = NULL;
/* get rid of old surface object */
}
}
SUMA_LH("clean up");
if (!SUMA_FreeSpecFields(Spec)) { SUMA_S_Err("Failed to free spec fields"); }
SUMA_free(Spec); Spec = NULL;
if (Opt->out_prefix) SUMA_free(Opt->out_prefix); Opt->out_prefix = NULL;
if (Opt->out_volprefix) SUMA_free(Opt->out_volprefix);
Opt->out_volprefix = NULL;
if (Opt) SUMA_free(Opt);
if (!SUMA_Free_Displayable_Object_Vect (SUMAg_DOv, SUMAg_N_DOv)) {
SUMA_SL_Err("DO Cleanup Failed!");
}
if (!SUMA_Free_CommonFields(SUMAg_CF)) {
SUMA_SL_Err("SUMAg_CF Cleanup Failed!");
}
SUMA_RETURN(0);
}
/*!
\brief parse the arguments for SurfSmooth program
\param argv (char *)
\param argc (int)
\return Opt (SUMA_GETPATCH_OPTIONS *) options structure.
To free it, use
SUMA_free(Opt->out_prefix);
SUMA_free(Opt);
*/
SUMA_GETPATCH_OPTIONS *SUMA_GetPatch_ParseInput (char *argv[], int argc,
SUMA_GENERIC_ARGV_PARSE *ps)
{
static char FuncName[]={"SUMA_GetPatch_ParseInput"};
SUMA_GETPATCH_OPTIONS *Opt=NULL;
int kar, i, ind;
char *outprefix;
SUMA_Boolean brk = NOPE;
SUMA_Boolean LocalHead = NOPE;
SUMA_ENTRY;
Opt = (SUMA_GETPATCH_OPTIONS *)SUMA_malloc(sizeof(SUMA_GETPATCH_OPTIONS));
kar = 1;
Opt->iType = SUMA_FT_NOT_SPECIFIED;
Opt->out_prefix = NULL;
Opt->out_volprefix = NULL;
Opt->in_name = NULL;
Opt->minhits = 2;
Opt->labelcol = -1;
Opt->nodecol = -1;
Opt->thislabel = -1;
Opt->DoVol = 0;
Opt->VolOnly = 0;
Opt->coordgain = 0.0;
Opt->Do_p2s = NOPE;
Opt->FixBowTie = -1;
Opt->adjust_contour = -1;
Opt->oType = SUMA_FT_NOT_SPECIFIED;
Opt->verb = 1;
Opt->flip = 0;
brk = NOPE;
while (kar < argc) { /* loop accross command ine options */
/*fprintf(stdout, "%s verbose: Parsing command line...\n", FuncName);*/
if (strcmp(argv[kar], "-h") == 0 || strcmp(argv[kar], "-help") == 0) {
usage_SUMA_getPatch(ps, strlen(argv[kar]) > 3 ? 2:1);
exit (0);
}
SUMA_SKIP_COMMON_OPTIONS(brk, kar);
if (!brk && (strcmp(argv[kar], "-hits") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -hits \n");
exit (1);
}
Opt->minhits = atoi(argv[kar]);
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-coord_gain") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -coord_gain \n");
exit (1);
}
Opt->coordgain = atof(argv[kar]);
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-masklabel") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -masklabel \n");
exit (1);
}
Opt->thislabel = atoi(argv[kar]);
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-patch2surf") == 0)) {
Opt->Do_p2s = YUP;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-vol") == 0)) {
Opt->DoVol = 1;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-flip_orientation") == 0)) {
Opt->flip = 1;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-vol_only") == 0)) {
Opt->DoVol = 1;
Opt->VolOnly = 1;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-adjust_contour") == 0)) {
Opt->adjust_contour = 1;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-do-not-adjust_contour") == 0)) {
Opt->adjust_contour = 0;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-check_bowtie") == 0)) {
Opt->FixBowTie = 1;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-fix_bowtie") == 0)) {
Opt->FixBowTie = 2;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-ok_bowtie") == 0)) {
Opt->FixBowTie = 0;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-prefix") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -prefix \n");
exit (1);
}
Opt->out_prefix = SUMA_copy_string(argv[kar]);
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-verb") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -verb \n");
exit (1);
}
Opt->verb = atoi(argv[kar]);
if (Opt->verb < 0 || Opt->verb > 10) {
SUMA_S_Errv("Something fishy with -verb value of %s\n"
"Need integer from 0 to 2\n", argv[kar]);
exit(1);
}
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-stiched_surface") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -stiched_surface \n");
exit (1);
}
Opt->out_volprefix = SUMA_copy_string(argv[kar]);
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-out_type") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -out_type \n");
exit (1);
}
Opt->oType = SUMA_guess_surftype_argv(argv[kar]);
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-input") == 0)) {
kar ++;
if (kar+2 >= argc) {
fprintf (SUMA_STDERR, "need 3 arguments after -input \n");
exit (1);
}
Opt->in_name = argv[kar]; kar ++;
Opt->nodecol = atoi(argv[kar]); kar ++;
Opt->labelcol = atoi(argv[kar]);
brk = YUP;
}
#if 0
if (!brk && (strcmp(argv[kar], "-spec") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -spec \n");
exit (1);
}
Opt->spec_file = argv[kar];
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-sv") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -sv \n");
exit (1);
}
Opt->sv_name = argv[kar];
brk = YUP;
}
if (!brk && (strncmp(argv[kar], "-surf_", 6) == 0)) {
if (kar + 1>= argc) {
fprintf (SUMA_STDERR, "need argument after -surf_X SURF_NAME \n");
exit (1);
}
ind = argv[kar][6] - 'A';
if (ind < 0 || ind >= SURFPATCH_MAX_SURF) {
fprintf (SUMA_STDERR, "-surf_X SURF_NAME option is out of range.\n");
exit (1);
}
kar ++;
Opt->surf_names[ind] = argv[kar];
Opt->N_surf = ind+1;
brk = YUP;
}
#endif
if (!brk && !ps->arg_checked[kar]) {
fprintf (SUMA_STDERR,
"Error %s:\nOption %s not understood. Try -help for usage\n",
FuncName, argv[kar]);
suggest_best_prog_option(argv[0], argv[kar]);
exit (1);
} else {
brk = NOPE;
kar ++;
}
}
/* sanity checks */
if (Opt->FixBowTie < 0) {
if (Opt->DoVol) Opt->FixBowTie = 1; /* important to check in this case */
else Opt->FixBowTie = 0;
}
if (Opt->adjust_contour < 0) {
if (Opt->DoVol) Opt->adjust_contour = 0;
else Opt->adjust_contour = 0;
}
if (!Opt->out_prefix) Opt->out_prefix = SUMA_copy_string("SurfPatch");
if (Opt->thislabel >= 0 && Opt->labelcol < 0) {
SUMA_SL_Err("Cannot use -masklabel without specifying "
"ilabel in -input option");
exit(1);
}
if (Opt->minhits < 1 || Opt->minhits > 3) {
SUMA_SL_Err("minhits must be > 0 and < 3");
exit(1);
}
if (!Opt->in_name) {
SUMA_SL_Err("No input specified.");
exit(1);
}
SUMA_RETURN (Opt);
}
/*!
\brief A function to calulate shortest distance on a graph,
and return the path corresponding to the short distance without
relying on the SurfaceObject structure.
It uses exactly the same approach as SUMA_Dijkstra but it has been
modified to eventually survive in the AFNI world without SUMA's defines.
Perhaps at some point I should make SUMA_Dijkstra call this one
directly, something a la SUMA_Dijkstra_usegen . This way I would
not have two versions of the same algorithm in the code.
\param N_Node: Total number of nodes
\param NodeList: 3*N_node vector of floats. Each triplet of values
contains the xyz coordinates of a node.
This can be NULL, as long as FirstNeighbDist is not.
\param N_Neihbv: N_node vector of ints. N_Neighbv[n] contains the
number of nodes that are connected by an edge
(i.e. first order neighbors) to n
\param FirstNeighb: N_Node x MAX_N_Neighb matrix of ints.
FirstNeighb[n] is a vector of at least N_Neighb[n] node
indices. Those are the indices of the first order neighbors
of n
\param FirstNeighbDist: N_Node x MAX_N_Neighb matrix of floats.
FirstNeighbDist[n] is a vector of at least N_Neighb[n]
distances from node n. Say node n1 is the second neighbor of
n. Then n1 = FirstNeighb[n][1] and the distance between
n and n1 is d1 = FirstNeighbDist[n][1].
If FirstNeighbDist is NULL, the d1 is calculated based on
the Euclidian distance between the XYZ triplets starting at
NodeList[3*n] and NodeList[3*n1].
Naturally, you'll need to pass one of NodeList
or FirstNeighbDist. If both are not NULL, then
FirstNeighbDist takes precedence.
\param Nx: index of starting node
\param Ny: index of ending node
\param isNodeInMeshp: N_Node vector which can be used to restrict which nodes
can be considered in the path. You can pass NULL to have
all nodes be considered
\param N_isNodeInMesh: Pointer to the total number of nodes that
make up the mesh (subset of SO)
This parameter is passed as a pointer because as nodes in the mesh
are visited, that number is reduced and represents when the
function returns, the number of nodes that were
never visited in the search.
Set to NULL, if isNodeInMesh is NULL
\param Method_Number (int) selector for which algorithm to use. Choose from:
0 - Straight forward implementation, slow
1 - Variation to eliminate long searches for minimum of L,
much much much faster than 0, 5 times more memory.
\param Path_length (float *) The distance between Nx and Ny.
This value is negative if no path between
Nx and Ny was found.
\param N_Path (int *) Number of nodes forming the Path vector
\return Path (float) A vector of N_Path node indices forming the shortest
path, from Nx (Path[0]) to Ny (Path[*N_Path - 1]).
NULL is returned in case of error.
*/
int * SUMA_Dijkstra_generic (int N_Node,
float *NodeList, int NodeDim, int dist_metric,
int *N_Neighbv, int **FirstNeighb, float **FirstNeighbDist,
int Nx, int Ny,
byte *isNodeInMeshp,
int *N_isNodeInMesh, int Method_Number,
float *Lfinal, int *N_Path,
int verb)
{
static char FuncName[] = {"SUMA_Dijkstra_generic"};
float *L = NULL, Lmin = -1.0;
double de=0.0, le=0.0;
int i, iw, iv, v, w, N_Neighb, *Path = NULL, N_loc=-1, kk=0;
SUMA_Boolean *isNodeInMesh=NULL;
struct timeval start_time;
SUMA_DIJKSTRA_PATH_CHAIN *DC = NULL, *DCi=NULL, *DCp=NULL;
SUMA_Boolean Found = NOPE;
/* variables for method 2 */
int N_Lmins, *vLmins=NULL, *vLocInLmins=NULL,
iLmins, ReplacingNode, ReplacedNodeLocation;
float *Lmins=NULL;
SUMA_Boolean LocalHead = NOPE;
SUMA_ENTRY;
*Lfinal = -1.0;
*N_Path = 0;
if (!isNodeInMeshp) {
if (!(isNodeInMesh = (SUMA_Boolean *)SUMA_malloc( sizeof(SUMA_Boolean) *
N_Node) )) {
SUMA_S_Err("Failed to allocate");
goto CLEANUP;
}
memset((void*)isNodeInMesh, 1, sizeof(SUMA_Boolean) * N_Node);
N_isNodeInMesh = &N_loc;
*N_isNodeInMesh = N_Node;
} else {
isNodeInMesh = isNodeInMeshp;
}
/* make sure Both Nx and Ny exist in isNodeInMesh */
if ( Nx < 0 || Nx >= N_Node ||
Ny < 0 || Ny >= N_Node ) {
fprintf (SUMA_STDERR,
"\aError %s: Node %d (Nx) or %d (Ny) is outside range [0..%d[ \n"
, FuncName, Nx, Ny, N_Node);
goto CLEANUP;
}
if (!isNodeInMesh[Nx]) {
fprintf (SUMA_STDERR,
"\aError %s: Node %d (Nx) is not in mesh.\n", FuncName, Nx);
goto CLEANUP;
}
if (!isNodeInMesh[Ny]) {
fprintf (SUMA_STDERR,
"\aError %s: Node %d (Ny) is not in mesh.\n", FuncName, Ny);
goto CLEANUP;
}
if (!N_Neighbv || !FirstNeighb) {
fprintf (SUMA_STDERR,
"Error %s: missing N_Neighb or FirstNeighb.\n", FuncName);
goto CLEANUP;
}
if (!NodeList && !FirstNeighbDist) {
fprintf (SUMA_STDERR,
"Error %s: need at least NodeList or FirstNeighbDist.\n",
FuncName);
goto CLEANUP;
}
/* allocate for chain */
DC = (SUMA_DIJKSTRA_PATH_CHAIN *)SUMA_malloc(
sizeof(SUMA_DIJKSTRA_PATH_CHAIN) * N_Node);
if (!DC) {
fprintf (SUMA_STDERR, "Error %s: Could not allocate. \n", FuncName);
goto CLEANUP;
}
switch (Method_Number) {
case 0: /* Method 0, Brute force */
/* allocate for vertices labels */
L = (float *) SUMA_calloc (N_Node, sizeof (float));
if (!L) {
fprintf (SUMA_STDERR, "Error %s: Failed to allocate.\n", FuncName);
goto CLEANUP;
}
/* label all vertices with very large numbers,
initialize path previous pointers to null */
for (i=0; i < N_Node; ++i) {
L[i] = LARGE_NUM;
DC[i].Previous = NULL;
}
/* label starting vertex with 0 */
L[Nx] = 0.0;
Lmin = 0.0;
v = Nx;
*Lfinal = -1.0;
/* initialize path at Nx */
DC[Nx].Previous = NULL;
DC[Nx].node = Nx;
DC[Nx].le = 0.0;
DC[Nx].order = 0;
*N_Path = 0;
/* Brute force method */
do {
/* find v in Mesh / L(v) is minimal */
/* this sucks up a lot of time because it is searching
the entire set of N_Node instead of the one that was
intersected only.
This can be sped up, considerably */
SUMA_MIN_LOC_VEC(L, N_Node, Lmin, v);
/* locates and finds the minimum of L, nodes not in mesh will
keep their large values and will not be picked*/
if (!isNodeInMesh[v]) {
if (verb) {
fprintf (SUMA_STDERR,
"\aERROR %s: Dijkstra derailed. v = %d, Lmin = %f.\n"
" Try another point.", FuncName, v, Lmin);
}
goto CLEANUP;
}
if (v == Ny) {
if (LocalHead) fprintf (SUMA_STDERR, "%s: Done.\n", FuncName);
*Lfinal = L[v];
Found = YUP;
} else {
N_Neighb = N_Neighbv[v];
for (i=0; i < N_Neighb; ++i) {
w = FirstNeighb[v][i];
if (isNodeInMesh[w]) {
iw = NodeDim*w;
iv = NodeDim*v;
if (!FirstNeighbDist) {/* calculate edge length */
if (dist_metric == 0) {
le = 0.0; de = 0.0;
for (kk=0; kk<NodeDim; ++kk) {
de = (NodeList[iw+kk] - NodeList[iv+kk]);
le += de*de;
}
le = sqrt ( le );
} else {
fprintf (SUMA_STDERR,
"ERROR %s: Only Euclidian distance supported\n"
, FuncName);
goto CLEANUP;
}
} else {
le = FirstNeighbDist[v][i];
}
if (L[w] > L[v] + le ) {
L[w] = L[v] + le;
/* update the path */
DCp = &(DC[v]); /* previous path */
DC[w].Previous = (void *) DCp;
DC[w].le = le;
DC[w].node = w;
DC[w].order = DCp->order + 1;
}
}
}
/* remove node v from isNodeInMesh and reset their distance
value to a very large one,
this way you do not have to reinitialize this variable. */
isNodeInMesh[v] = NOPE;
*N_isNodeInMesh -= 1;
L[v] = LARGE_NUM;
Found = NOPE;
}
} while (*N_isNodeInMesh > 0 && !Found);
if (!Found) {
fprintf (SUMA_STDERR,
"Error %s: No more nodes in mesh, "
"failed to reach target.\n", FuncName);
goto CLEANUP;
}else {
if (LocalHead)
fprintf (SUMA_STDERR,
"%s: Path between Nodes %d and %d is %f.\n",
FuncName, Nx, Ny, *Lfinal);
}
if (L) SUMA_free(L); L = NULL;
break;
case 1: /********* Method 1- faster minimum searching *******************/
/* allocate for vertices labels and minimums vectors*/
L = (float *) SUMA_calloc (N_Node, sizeof (float));
/* L[i] = distance to a node i*/
Lmins = (float *) SUMA_calloc (N_Node, sizeof (float));
/* Lmins = vector of minimum calculated distances to node */
vLmins = (int *) SUMA_calloc (N_Node, sizeof (int));
/* vLmins[i] = index (into L) of the node having a
distance Lmins[i] */
vLocInLmins = (int *) SUMA_calloc (N_Node, sizeof (int));
/* vLocInLmin[j] = index (into Lmins) of a node having
index j (into L) */
if (!L || !Lmins || !vLmins || !vLocInLmins) {
fprintf (SUMA_STDERR, "Error %s: Failed to allocate.\n", FuncName);
goto CLEANUP;
}
/* label all vertices with very large numbers and initialize
vLocInLmins to -1*/
for (i=0; i < N_Node; ++i) {
L[i] = LARGE_NUM;
Lmins[i] = LARGE_NUM;
vLocInLmins[i] = -1;
DC[i].Previous = NULL;
}
/* label starting vertex with 0 */
L[Nx] = 0.0;
*Lfinal = -1.0;
/* initialize values of vectors used to keep track of minimum
values of L and their corresponding nodes */
Lmins[0] = 0.0;
vLmins[0] = Nx;
vLocInLmins[Nx] = 0;
N_Lmins = 1;
/* initialize path at Nx */
DC[Nx].Previous = NULL;
DC[Nx].node = Nx;
DC[Nx].le = 0.0;
DC[Nx].order = 0;
*N_Path = 0;
/* method with efficient tracking of minimum */
if (LocalHead)
fprintf (SUMA_STDERR,
"%s: about to MIN_LOC ....N_isNodeInMesh = %d\n",
FuncName, *N_isNodeInMesh);
do {
/* find v in Mesh / L(v) is minimal */
SUMA_MIN_LOC_VEC(Lmins, N_Lmins, Lmin, iLmins);
/* locates the minimum value in Lmins vector */
v = vLmins[iLmins]; /* get the node for this Lmin value */
if (!isNodeInMesh[v]) {
if (verb) {
fprintf (SUMA_STDERR,"\aERROR %s: \n"
"Dijkstra derailed. v = %d, Lmin = %f\n."
"Try another point.", FuncName, v, Lmin);
}
goto CLEANUP;
}
#ifdef LOCALDEBUG
fprintf (SUMA_STDERR, "%s: Node v = %d.\n", FuncName, v);
#endif
if (v == Ny) {
if (LocalHead) fprintf (SUMA_STDERR, "%s: Done.\n", FuncName);
*Lfinal = L[v];
Found = YUP;
} else {
N_Neighb = N_Neighbv[v];
for (i=0; i < N_Neighb; ++i) {
w = FirstNeighb[v][i];
if (isNodeInMesh[w]) {
iw = NodeDim*w;
iv = NodeDim*v;
if (!FirstNeighbDist) {/* calculate edge length */
if (dist_metric == 0) {
le = 0.0; de = 0.0;
for (kk=0; kk<NodeDim; ++kk) {
de = (NodeList[iw+kk] - NodeList[iv+kk]);
le += de*de;
}
le = sqrt ( le );
} else {
fprintf (SUMA_STDERR,
"ERROR %s: Only Euclidian distance supported\n"
, FuncName);
goto CLEANUP;
}
} else {
le = FirstNeighbDist[v][i];
}
if (L[w] > L[v] + le ) {
#ifdef LOCALDEBUG
fprintf (SUMA_STDERR,
"%s: L[%d]=%f > L[%d] = %f + le = %f.\n",
FuncName, w, L[w], v, L[v], le);
#endif
L[w] = L[v] + le;
/* update the path */
DCp = &(DC[v]); /* previous path */
DC[w].Previous = (void *) DCp;
DC[w].le = le;
DC[w].node = w;
DC[w].order = DCp->order + 1;
if (vLocInLmins[w] < 0) {
#ifdef LOCALDEBUG
fprintf (SUMA_STDERR,
"%s: adding entry for w = %d - First Hit. \n",
FuncName, w);
#endif
Lmins[N_Lmins] = L[w];
/* add this value to Lmins vector */
vLmins[N_Lmins] = w;
/* store the node for this Lmins value */
vLocInLmins[w] = N_Lmins;
/* store where that node is represented
in Lmins */
++N_Lmins; /* increment N_Lmins */
} else {
#ifdef LOCALDEBUG
fprintf (SUMA_STDERR,
"%s: modifying entry for w = %d Second Hit.\n", FuncName, w);
#endif
Lmins[vLocInLmins[w]] = L[w];
/* update value for Lmins */
}
}else {
#ifdef LOCALDEBUG
fprintf (SUMA_STDERR,
"%s: L[%d]=%f < L[%d] = %f + le = %f.\n",
FuncName, w, L[w], v, L[v], le);
#endif
}
}
}
/* remove node v from isNodeInMesh and reset their distance
value to a very large one,
this way you do not have to reinitialize this variable. */
isNodeInMesh[v] = NOPE;
*N_isNodeInMesh -= 1;
L[v] = LARGE_NUM;
Found = NOPE;
/* also remove the values (by swapping it with last element)
for this node from Lmins */
#ifdef LOCALDEBUG
{
int kkk;
fprintf (SUMA_STDERR,"Lmins\tvLmins\tvLocInLmins\n");
for (kkk=0; kkk < N_Lmins; ++kkk)
fprintf (SUMA_STDERR,"%f\t%d\t%d\n",
Lmins[kkk], vLmins[kkk],
vLocInLmins[vLmins[kkk]] );
}
#endif
if (vLocInLmins[v] >= 0) { /* remove its entry if there is one */
#ifdef LOCALDEBUG
fprintf (SUMA_STDERR,
"%s: removing node v = %d. N_Lmins = %d\n",
FuncName, v, N_Lmins);
#endif
--N_Lmins;
ReplacingNode = vLmins[N_Lmins];
ReplacedNodeLocation = vLocInLmins[v];
Lmins[vLocInLmins[v]] = Lmins[N_Lmins];
vLmins[vLocInLmins[v]] = vLmins[N_Lmins];
vLocInLmins[ReplacingNode] = ReplacedNodeLocation;
vLocInLmins[v] = -1;
Lmins[N_Lmins] = LARGE_NUM;
}
}
} while (*N_isNodeInMesh > 0 && !Found);
if (!Found) {
fprintf (SUMA_STDERR,
"Error %s: No more nodes in mesh, "
"failed to reach target %d. NLmins = %d\n",
FuncName, Ny, N_Lmins);
goto CLEANUP;
}else {
if (LocalHead)
fprintf (SUMA_STDERR,
"%s: Path between Nodes %d and %d is %f.\n",
FuncName, Nx, Ny, *Lfinal);
}
if (L) SUMA_free(L); L = NULL;
if (Lmins) SUMA_free(Lmins); Lmins = NULL;
if (vLmins) SUMA_free(vLmins); vLmins = NULL;
if (vLocInLmins) SUMA_free(vLocInLmins); vLocInLmins = NULL;
break; /********** Method 1- faster minimum searching **************/
default:
fprintf (SUMA_STDERR,
"Error %s: No such method (%d).\n",
FuncName, Method_Number);
goto CLEANUP;
break;
}
/* now reconstruct the path */
*N_Path = DC[Ny].order+1;
Path = (int *) SUMA_calloc (*N_Path, sizeof(int));
if (!Path) {
fprintf (SUMA_STDERR, "Error %s: Failed to allocate.\n", FuncName);
goto CLEANUP;
}
DCi = &(DC[Ny]);
iv = *N_Path - 1;
Path[iv] = Ny;
if (iv > 0) {
do {
--iv;
DCp = (SUMA_DIJKSTRA_PATH_CHAIN *) DCi->Previous;
Path[iv] = DCp->node;
DCi = DCp;
} while (DCi->Previous);
}
if (iv != 0) {
fprintf (SUMA_STDERR,
"Error %s: iv = %d. This should not be.\n",
FuncName, iv);
}
CLEANUP:
if (L) SUMA_free(L);
if (Lmins) SUMA_free(Lmins);
if (vLmins) SUMA_free(vLmins);
if (vLocInLmins) SUMA_free(vLocInLmins);
if (DC) SUMA_free(DC);
if (!isNodeInMeshp) SUMA_free(isNodeInMesh);
SUMA_RETURN (Path);
}
int *SUMA_IV_FaceSetsextract (char *IV_filename, int *N_FaceSetList)
{/* SUMA_IV_FaceSetsextract */
char s[500],serr[500];
char seq_strt[5][30], seq_end[5][30];
int i, f, ex, si, si_exit, evl, se, se_exit;
int ip, NP, cnt, nospacing, MaxAlloc = 100, *linv, *FaceSetList;
div_t cnt4;
FILE*iv_file;
static char FuncName[]={"SUMA_IV_FaceSetsextract"};
cnt4.quot = cnt4.rem = 0;
/* intialize the number of points read to 0 */
*N_FaceSetList = 0;
linv = (int *)SUMA_malloc (MaxAlloc*sizeof(int));
if (!linv)
{
SUMA_alloc_problem ("Allocation error in IV-FaceSetExtract");
return (NULL);
}
/*This is the sequence to trigger reading the numbers*/
sprintf (seq_strt[0],"IndexedFaceSet");
sprintf (seq_strt[1],"{");
sprintf (seq_strt[2],"coordIndex");
sprintf (seq_strt[3],"[");
si_exit = 4; /* set equal to the number of strings to be matched */
/*This is a sequence to mark the end of the number list*/
sprintf (seq_end[0],"]");
sprintf (seq_end[1],"}"); /* you do not need that one, it is possible to have other objects following coordIndex */
se_exit = 1; /* set equal to the number of strings to be matched */
iv_file = fopen (IV_filename,"r");
if (iv_file == NULL)
{
SUMA_error_message ("SUMA_IV_FaceSetsextract","Could not open input file ",1);
return (NULL);
}
si = 0;
ex = 1;
cnt = 0;
nospacing = 0; /* this flag is used to when the last number is read and it has the first seq_end*/
/* character attached to it, ie no space ! in between*/
while (ex != EOF && si < si_exit)
{
ex = fscanf (iv_file,"%s",s);
/*evl = equal_strings (s,seq_strt[si]);*/
if (strlen (seq_strt[si]) >= strlen (s))
{
evl = SUMA_iswordin (seq_strt[si],s);
if (evl == 1)
nospacing = 0; /* There is a space between character in starting sequence and first number*/
}
else
{
evl = SUMA_iswordin (s,seq_strt[si]);
if (evl == 1)
nospacing = 1;
}
switch (evl)
{
case 0:
si = 0; /* No match, reset the sequence counter */
break;
case 1:
if (nospacing == 1 && si == si_exit-1) /* it has to be the last character in the sequence*/
{
sprintf (serr,"Must have a space character between first number and last character in start sequence ( %s )",s);
SUMA_error_message ("SUMA_IV_FaceSetsextract",serr,1);
exit (1);
}
si = si +1; /* increment the start sequence counter */
#ifdef DEBUG_3
printf ("found %s --- si = %d\n",s,si);
#endif
break;
default:
break;
}
}
/* Now, read the series of numbers until you encounter the first string of the ending sequence*/
se = 0;
nospacing = 0;
while (ex != EOF && se < se_exit )
{
ex = fscanf (iv_file,"%s",s);
/*evl = equal_strings (s,seq_end[se]);*/
if (strlen (seq_end[se]) >= strlen (s))
{
evl = SUMA_iswordin (seq_end[se],s);
if (evl == 1)
nospacing = 0; /* There is a space between last number and fisrt character in ending sequence */
}
else
{
evl = SUMA_iswordin (s,seq_end[se]);
if (evl == 1)
nospacing = 1;
}
switch (evl)
{
case 0:
f = atoi (s);
linv[cnt] = f;
#ifdef DEBUG_3
printf ("\nNumber (%d): %d is appended to end sequence !\n",cnt,linv[cnt]);
#endif
++cnt;
if (cnt >= MaxAlloc - 1)
{
MaxAlloc = MaxAlloc + 100;
linv = (int *)SUMA_realloc ((void*) linv, MaxAlloc * sizeof(int));
if (!linv)
{
SUMA_alloc_problem ("Re-Allocation error in IV-FaceSetExtract");
return (NULL);
}
}
se = 0; /* no match for ending sequence, reset the counter */
break;
case 1: /* found the first character in the end sequence */
if (nospacing == 1 && se == 0) /* it has to be the first character in the sequence*/
{
f = atoi (s);
linv[cnt] = f;
++cnt;
#ifdef DEBUG_3
printf ("\nLast number (%d): %f is appended to end sequence !\n",cnt,f);
#endif
}
#ifdef DEBUG_3
printf ("\nfound %s --- se = %d\n",s,se);
#endif
se = se + 1;
break;
default:
break;
}
}
if (si < si_exit)
{
SUMA_error_message ("IV_FaceSetextract","Could not find specified starting sequence",0);
for (i=0;i<si_exit;++i)
printf ("%s \t",seq_strt[i]);
}
else
{
if (se < se_exit)
{
SUMA_error_message ("IV_FaceSetextract","Could not find specified ending sequence",0);
for (i=0;i<se_exit;++i)
printf ("%s \t",seq_end[i]);
}
else
{
/* check that the number of points read is multiple of 4 */
cnt4 = div (cnt,4);
if (cnt4.rem != 0)
{
SUMA_error_message ("IV_FaceSetextract","number of points read is not multiple of 4 !",0);
#ifdef DEBUG_3
printf ("%f FaceSets sets read !!!\n",(float)cnt/4);
#endif
}
}
}
*N_FaceSetList = cnt4.quot ;
/* Now allocate space for SUMA_IV_FaceSetsextract and fill it up */
NP = 3;
FaceSetList = (int *) SUMA_calloc (*N_FaceSetList * NP, sizeof(int));
if (!FaceSetList)
{
SUMA_alloc_problem("IV_FaceSetextract : Could not allocate");
return(NULL);
}
i = 0;
ip = 0;
while (i < cnt) {
FaceSetList[ip] = linv[i]; ++ip; ++i;
FaceSetList[ip] = linv[i]; ++ip; ++i;
FaceSetList[ip] = linv[i]; ++ip; ++i;
++i; /* skip the 4th value */
}
fclose (iv_file);
SUMA_free(linv);
return (FaceSetList);
}/* SUMA_IV_FaceSetsextract */
/*!
A function to call SUMA_qhull_wrap or SUMA_qdelaunay_wrap
*/
SUMA_SurfaceObject *SUMA_ConvexHullSurface(
SUMA_GENERIC_PROG_OPTIONS_STRUCT * Opt)
{
static char FuncName[]={"SUMA_ConvexHullSurface"};
SUMA_SurfaceObject *SO=NULL;
float *xyz=NULL, *xyzp=NULL, *txyz=NULL;
int npt, *ijk=NULL, nf=0, cnt, i, j, k, nxx, nyy, nzz,N_txyz=-1;
FILE *fid=NULL;
THD_fvec3 fv, iv;
SUMA_Boolean LocalHead = NOPE;
SUMA_ENTRY;
npt = 0;
N_txyz=-1;
if (Opt->UseThisBrain) {
MRI_IMAGE *im = NULL;
float *far=NULL;
int nx2, i3;
/* load the 1D file */
im = mri_read_1D (Opt->UseThisBrain);
if (!im) {
SUMA_S_Err("Failed to read file");
SUMA_RETURN(NULL);
}
far = MRI_FLOAT_PTR(im);
if (im->nx == 0) {
SUMA_S_Errv("Empty file %s.\n", Opt->UseThisBrain);
SUMA_RETURN(NULL);
}
if (im->ny != 3) {
SUMA_S_Errv("Found %d columns in %s. Expecting 3\n",
im->ny, Opt->UseThisBrain);
SUMA_RETURN(NULL);
}
/* copy the columns */
N_txyz = im->nx;
txyz = (float *)SUMA_malloc(im->nx*im->ny*sizeof(float));
if (!txyz) {
SUMA_S_Crit("Failed to allocate.");
SUMA_RETURN(NULL);
}
nx2 = 2*im->nx;
for (i=0; i<N_txyz; ++i) {
i3 = 3*i;
txyz[i3 ] = far[i];
txyz[i3+1] = far[i+im->nx];
txyz[i3+2] = far[i+nx2];
}
/* done, clean up and out you go */
if (im) mri_free(im); im = NULL;
}
if (Opt->in_vol) {
cnt = 0; npt = 0;
nxx = (DSET_NX(Opt->in_vol));
nyy = (DSET_NY(Opt->in_vol));
nzz = (DSET_NZ(Opt->in_vol));
if (Opt->debug) fprintf(SUMA_STDERR,"%s:\nRunning qhull...\n", FuncName);
xyz = (float *)SUMA_malloc(3*nxx*nyy*nzz*sizeof(float));
if (!xyz) {
SUMA_S_Err("Failed to allocate"); SUMA_RETURN(NULL);
}
for( k = 0 ; k < nzz ; k++ ) {
for( j = 0 ; j < nyy ; j++ ) {
for( i = 0 ; i < nxx ; i++ ) {
if (Opt->mcdatav[cnt] == 1) {
fv.xyz[0] = DSET_XORG(Opt->in_vol) + i * DSET_DX(Opt->in_vol);
fv.xyz[1] = DSET_YORG(Opt->in_vol) + j * DSET_DY(Opt->in_vol);
fv.xyz[2] = DSET_ZORG(Opt->in_vol) + k * DSET_DZ(Opt->in_vol);
/* change mm to RAI coords */
iv = SUMA_THD_3dmm_to_dicomm( Opt->in_vol->daxes->xxorient,
Opt->in_vol->daxes->yyorient,
Opt->in_vol->daxes->zzorient,
fv );
xyz[3*npt] = iv.xyz[0];
xyz[3*npt+1] = iv.xyz[1]; xyz[3*npt+2] = iv.xyz[2];
npt++;
}
++cnt;
}
}
}
} else if (Opt->XYZ) {
xyz = (float *)SUMA_malloc(3*Opt->N_XYZ*sizeof(float));
if (!xyz) {
SUMA_S_Err("Failed to allocate"); SUMA_RETURN(NULL);
}
for( k = 0 ; k < 3*Opt->N_XYZ ; k++ ) {
xyz[k] = Opt->XYZ[k]; npt = Opt->N_XYZ;
}
} else {
SUMA_S_Err("No input");
goto CLEANUP;
}
if (Opt->corder) {
SUMA_PC_XYZ_PROJ *pcp=NULL;
if (Opt->geom==1) {
SUMA_S_Warn("PCA projection makes no sense for usual convex hull");
}
if (!(pcp = SUMA_Project_Coords_PCA (xyz, npt, npt/2, NULL,
E3_PLN_PRJ, ROT_2_Z,0))) {
SUMA_S_Err("Failed to project");
goto CLEANUP;
}
xyzp = pcp->xyzp; pcp->xyzp = NULL;
pcp = SUMA_Free_PC_XYZ_Proj(pcp);
} else {
xyzp = xyz;
}
if (N_txyz >= 0 && N_txyz != npt) {
SUMA_S_Errv("Mismatch between number of coordinates for convex hull\n"
"and number of coordinates to adopt in the end.\n"
" %d, versus %d in -these_coords\n",
npt, N_txyz);
goto CLEANUP;
}
if (Opt->geom == 1) { /* convex hull */
if (! (nf = SUMA_qhull_wrap(npt, xyzp, &ijk, 1, Opt->s)) ) {
fprintf(SUMA_STDERR,"%s:\nFailed in SUMA_qhull_wrap\n", FuncName);
goto CLEANUP;
}
/* Other than unif==0 make no sense here, but leave it to the user */
switch (Opt->unif) {
case 0: /* coordinates as passed to qhull,
could be projected ones*/
SO = SUMA_Patch2Surf(xyzp, npt, ijk, nf, 3);
break;
case 1: /* Original corrdinates passed to qhull
(pre-projections, if any) */
SO = SUMA_Patch2Surf(xyz, npt, ijk, nf, 3);
break;
case 2: /* special coordinates passed by user,
never passed in any form to qhull */
SUMA_S_Warn("Makes no sense to mess with coords for convex hull...");
SO = SUMA_Patch2Surf(txyz, npt, ijk, nf, 3);
break;
default:
SUMA_S_Err("pit of despair");
goto CLEANUP;
}
if (Opt->debug) fprintf(SUMA_STDERR,"%s:\n%d triangles.\n", FuncName, nf);
} else if (Opt->geom == 2) { /* triangulation */
if (! (nf = SUMA_qdelaunay_wrap(npt, xyzp, &ijk, 1, Opt->s)) ) {
fprintf(SUMA_STDERR,"%s:\nFailed in SUMA_qdelaunay_wrap\n", FuncName);
goto CLEANUP;
}
switch (Opt->unif) {
case 0: /* coordinates as passed to qdelaunay,
could be projected ones*/
if (xyz == xyzp) xyz=NULL; /* xyzp will be set to
null in next call,
so xyz is treated
the same here */
SO = SUMA_NewSO(&xyzp, npt, &ijk, nf, NULL);
SUMA_LHv("xyzp %p, ijk %p\n", txyz, ijk);
break;
case 1: /* Original corrdinates passed to qdelaunay
(pre-projections, if any) */
SO = SUMA_NewSO(&xyz, npt, &ijk, nf, NULL);
SUMA_LHv("xyz %p, ijk %p\n", txyz, ijk);
break;
case 2: /* special coordinates passed by user,
never passed in any form to qdelaunay */
SO = SUMA_NewSO(&txyz, npt, &ijk, nf, NULL);
SUMA_LHv("txyz %p, ijk %p\n", txyz, ijk);
break;
default:
SUMA_S_Err("pit of despair, again");
goto CLEANUP;
}
} else {
SUMA_S_Errv("Opt->geom = %d not valid\n", Opt->geom);
goto CLEANUP;
}
CLEANUP:
if (ijk) SUMA_free(ijk); ijk=NULL;
if(txyz) SUMA_free(txyz); txyz=NULL;
if (xyzp != xyz && xyzp != NULL) SUMA_free(xyzp); xyzp = NULL;
if (xyz) SUMA_free(xyz); xyz = NULL;
SUMA_RETURN(SO);
}
int main (int argc,char *argv[])
{/* Main */
static char FuncName[]={"ConvexHull"};
int i, i3, nspec = 0;
void *SO_name=NULL;
SUMA_SurfaceObject *SO = NULL;
SUMA_GENERIC_PROG_OPTIONS_STRUCT *Opt;
char stmp[200];
SUMA_Boolean exists = NOPE;
SUMA_Boolean LocalHead = NOPE;
SUMA_GENERIC_ARGV_PARSE *ps=NULL;
SUMA_STANDALONE_INIT;
SUMA_mainENTRY;
/* Allocate space for DO structure */
SUMAg_DOv = SUMA_Alloc_DisplayObject_Struct (SUMA_MAX_DISPLAYABLE_OBJECTS);
ps = SUMA_Parse_IO_Args(argc, argv, "-o;-i;-sv;");
if (argc < 2) {
usage_SUMA_ConvexHull(ps);
exit (1);
}
Opt = SUMA_ConvexHull_ParseInput (argv, argc, ps);
SO_name = SUMA_Prefix2SurfaceName(Opt->out_prefix, NULL, NULL,
Opt->SurfFileType, &exists);
if (exists && !THD_ok_overwrite()) {
SUMA_S_Err("Output file(s) %s* on disk.\nWill not overwrite.\n",
Opt->out_prefix);
exit(1);
}
if (Opt->obj_type < 0) {
if (Opt->in_name) {
if (Opt->debug) {
SUMA_S_Note("Creating mask...");
}
if (!SUMA_Get_isosurface_datasets (Opt)) {
SUMA_SL_Err("Failed to get data.");
exit(1);
}
if (Opt->debug > 1) {
if (Opt->debug == 2) {
FILE *fout=fopen("inmaskvec.1D","w");
SUMA_S_Note("Writing masked values...\n");
if (!fout) {
SUMA_SL_Err("Failed to write maskvec");
exit(1);
}
fprintf(fout, "#Col. 0 Voxel Index\n"
"#Col. 1 Is a mask (all values here should be 1)\n" );
for (i=0; i<Opt->nvox; ++i) {
if (Opt->mcdatav[i]) {
fprintf(fout,"%d %.2f\n", i, Opt->mcdatav[i]);
}
}
fclose(fout); fout = NULL;
} else {
FILE *fout=fopen("maskvec.1D","w");
SUMA_S_Note("Writing all mask values...\n");
if (!fout) {
SUMA_S_Err("Failed to write maskvec");
exit(1);
}
fprintf(fout, "#Col. 0 Voxel Index\n"
"#Col. 1 Is in mask ?\n" );
for (i=0; i<Opt->nvox; ++i) {
fprintf(fout,"%d %.2f\n", i, Opt->mcdatav[i]);
}
fclose(fout); fout = NULL;
}
}
} else if (Opt->in_1D) {
MRI_IMAGE *im = NULL;
float *far=NULL;
int nx2;
/* load the 1D file */
im = mri_read_1D (Opt->in_1D);
if (!im) {
SUMA_S_Err("Failed to read file");
exit(1);
}
far = MRI_FLOAT_PTR(im);
if (im->nx == 0) {
fprintf(SUMA_STDERR,"Error %s:\n Empty file %s.\n", FuncName, Opt->in_1D);
exit(1);
}
if (im->ny != 3) {
fprintf(SUMA_STDERR,"Error %s:\n Found %d columns in %s. Expecting 3\n", FuncName, im->ny, Opt->in_1D);
exit(1);
}
/* copy the columns */
Opt->N_XYZ = im->nx;
Opt->XYZ = (float *)SUMA_malloc(im->nx*im->ny*sizeof(float));
if (!Opt->XYZ) {
SUMA_S_Crit("Failed to allocate.");
exit(1);
}
nx2 = 2*im->nx;
for (i=0;i<Opt->N_XYZ; ++i) {
i3 = 3*i;
Opt->XYZ[i3 ] = far[i];
Opt->XYZ[i3+1] = far[i+im->nx];
Opt->XYZ[i3+2] = far[i+nx2];
}
/* done, clean up and out you go */
if (im) mri_free(im); im = NULL;
} else if (ps->i_N_surfnames) {
SUMA_SurfSpecFile *Spec=NULL;
SUMA_SurfaceObject *SO=NULL;
if (ps->i_N_surfnames > 1) {
SUMA_S_Err("Only 1 input surface allowed!");
exit(1);
}
Spec = SUMA_IO_args_2_spec(ps, &nspec);
if (!Spec) {
SUMA_S_Err("Failed to create spec!");
exit(1);
}
if (nspec != 1) {
SUMA_S_Warn("Expected one spec and nothing else");
}
/* load the surface object */
SO = SUMA_Load_Spec_Surf(Spec, 0, ps->sv[0], 0);
if (!SO) {
SUMA_S_Err("Failed to read surface.");
exit(1);
}
/* transfer coords */
if(SO->NodeDim != 3) {
SUMA_S_Err("bad node coords.");
exit(1);
}
Opt->N_XYZ = SO->N_Node;
Opt->XYZ = (float *)SUMA_malloc(SO->N_Node * SO->NodeDim * sizeof(float));
if (!Opt->XYZ) {
SUMA_S_Crit("Failed to allocate.");
exit(1);
}
for (i=0;i<SO->NodeDim*SO->N_Node; ++i) Opt->XYZ[i] = SO->NodeList[i];
if (nspec) {
int k=0;
for (k=0; k<nspec; ++k) {
if (!SUMA_FreeSpecFields(&(Spec[k]))) { SUMA_S_Err("Failed to free spec fields"); }
}
SUMA_free(Spec); Spec = NULL; nspec = 0;
}
if (SO) SUMA_Free_Surface_Object(SO); SO = NULL;
} else {
SUMA_S_Err("No input!");
exit(1);
}
} else {
SUMA_S_Err("Bad input!");
exit(1);
}
/* Now call Marching Cube functions */
if (!(SO = SUMA_ConvexHullSurface(Opt))) {
SUMA_S_Err("Failed to create surface.\n");
exit(1);
}
/* write the surface to disk */
if (!SUMA_Save_Surface_Object (SO_name, SO,
Opt->SurfFileType, Opt->SurfFileFormat, NULL)) {
fprintf (SUMA_STDERR,
"Error %s: Failed to write surface object.\n", FuncName);
exit (1);
}
if (ps) SUMA_FreeGenericArgParse(ps); ps = NULL;
if (Opt->fvec) SUMA_free(Opt->fvec); Opt->fvec = NULL;
if (Opt->mcdatav) {SUMA_free(Opt->mcdatav); Opt->mcdatav = NULL;}
if (Opt->in_vol) { DSET_delete( Opt->in_vol); Opt->in_vol = NULL;}
if (Opt->out_prefix) SUMA_free(Opt->out_prefix); Opt->out_prefix = NULL;
if (Opt->XYZ) SUMA_free(Opt->XYZ); Opt->XYZ = NULL;
if (Opt) SUMA_free(Opt);
if (!SUMA_Free_Displayable_Object_Vect (SUMAg_DOv, SUMAg_N_DOv)) {
SUMA_SL_Err("DO Cleanup Failed!");
}
if (SO_name) SUMA_free(SO_name); SO_name = NULL;
if (!SUMA_Free_CommonFields(SUMAg_CF)) SUMA_error_message(FuncName,"SUMAg_CF Cleanup Failed!",1);
exit(0);
}
/*!
\brief parse the arguments for SurfSmooth program
\param argv (char *)
\param argc (int)
\return Opt (SUMA_GENERIC_PROG_OPTIONS_STRUCT *) options structure.
To free it, use
SUMA_free(Opt->out_name);
SUMA_free(Opt);
*/
SUMA_GENERIC_PROG_OPTIONS_STRUCT *SUMA_ConvexHull_ParseInput (char *argv[], int argc, SUMA_GENERIC_ARGV_PARSE *ps)
{
static char FuncName[]={"SUMA_ConvexHull_ParseInput"};
SUMA_GENERIC_PROG_OPTIONS_STRUCT *Opt=NULL;
int kar, i, ind;
char *outname;
SUMA_Boolean brk = NOPE;
SUMA_Boolean LocalHead = NOPE;
SUMA_ENTRY;
Opt = (SUMA_GENERIC_PROG_OPTIONS_STRUCT *)SUMA_malloc(sizeof(SUMA_GENERIC_PROG_OPTIONS_STRUCT));
kar = 1;
Opt->spec_file = NULL;
Opt->out_prefix = NULL;
Opt->sv_name = NULL;
Opt->N_surf = -1;
Opt->in_name = NULL;
Opt->cmask = NULL;
Opt->MaskMode = SUMA_ISO_UNDEFINED;
for (i=0; i<SUMA_GENERIC_PROG_MAX_SURF; ++i) { Opt->surf_names[i] = NULL; }
outname = NULL;
Opt->in_vol = NULL;
Opt->nvox = -1;
Opt->ninmask = -1;
Opt->mcdatav = NULL;
Opt->debug = 0;
Opt->v0 = 0.0;
Opt->v1 = -1.0;
Opt->fvec = NULL;
Opt->SurfFileType = SUMA_PLY;
Opt->SurfFileFormat = SUMA_ASCII;
Opt->xform = SUMA_ISO_XFORM_MASK;
Opt->obj_type = -1;
Opt->obj_type_res = -1;
Opt->XYZ = NULL;
Opt->in_1D = NULL;
Opt->N_XYZ = 0;
Opt->s = SUMA_copy_string("convex_hull");
Opt->geom = 1;
Opt->corder = 0;
Opt->unif = 0;
Opt->UseThisBrain = NULL;
brk = NOPE;
while (kar < argc) { /* loop accross command ine options */
/*fprintf(stdout, "%s verbose: Parsing command line...\n", FuncName);*/
if (strcmp(argv[kar], "-h") == 0 || strcmp(argv[kar], "-help") == 0) {
usage_SUMA_ConvexHull(ps);
exit (0);
}
SUMA_SKIP_COMMON_OPTIONS(brk, kar);
if (!brk && (strcmp(argv[kar], "-xform") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -xform \n");
exit (1);
}
if (!strcmp(argv[kar], "mask")) {
Opt->xform = SUMA_ISO_XFORM_MASK;
} else if (!strcmp(argv[kar], "none")) {
Opt->xform = SUMA_ISO_XFORM_NONE;
} else if (!strcmp(argv[kar], "shift")) {
Opt->xform = SUMA_ISO_XFORM_SHIFT;
}else {
fprintf (SUMA_STDERR,
"%s is a bad parameter for -xform option. \n", argv[kar]);
exit (1);
}
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-input_1D") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -input_1D \n");
exit (1);
}
Opt->in_1D = argv[kar];
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-these_coords") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -these_coords \n");
exit (1);
}
Opt->UseThisBrain = argv[kar];
Opt->unif = 2;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-q_opt") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need option after -q_opt \n");
exit (1);
}
if (!strcmp(argv[kar],"triangulate_xy")) {
Opt->geom = 2;
} else if (!strcmp(argv[kar],"convex_hull")) {
Opt->geom = 1;
} else {
SUMA_S_Errv("Bad value of %s for -q_opt", argv[kar]);
exit(1);
}
Opt->s = SUMA_copy_string(argv[kar]);
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-proj_xy") == 0)) {
Opt->corder = 1;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-orig_coord") == 0)) {
Opt->unif = 1;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-debug") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -debug \n");
exit (1);
}
Opt->debug = atoi(argv[kar]);
if (Opt->debug > 2) { LocalHead = YUP; }
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-isocmask") == 0)) {
if (Opt->MaskMode != SUMA_ISO_UNDEFINED) {
fprintf (SUMA_STDERR, "only one masking mode (-iso*) allowed.\n");
}
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -isocmask \n");
exit (1);
}
Opt->cmask = argv[kar];
Opt->MaskMode = SUMA_ISO_CMASK;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-isoval") == 0)) {
if (Opt->MaskMode != SUMA_ISO_UNDEFINED) {
fprintf (SUMA_STDERR, "only one masking mode (-iso*) allowed.\n");
}
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -isoval \n");
exit (1);
}
Opt->v0 = atof(argv[kar]);
Opt->MaskMode = SUMA_ISO_VAL;
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-isorange") == 0)) {
if (Opt->MaskMode != SUMA_ISO_UNDEFINED) {
fprintf (SUMA_STDERR, "only one masking mode (-iso*) allowed.\n");
}
kar ++;
if (kar+1 >= argc) {
fprintf (SUMA_STDERR, "need 2 arguments after -isorange \n");
exit (1);
}
Opt->v0 = atof(argv[kar]);kar ++;
Opt->v1 = atof(argv[kar]);
Opt->MaskMode = SUMA_ISO_RANGE;
if (Opt->v1 < Opt->v0) {
fprintf (SUMA_STDERR,
"range values wrong. Must have %f <= %f \n",
Opt->v0, Opt->v1);
exit (1);
}
brk = YUP;
}
if (!brk && (strcmp(argv[kar], "-input") == 0)) {
kar ++;
if (kar >= argc) {
fprintf (SUMA_STDERR, "need argument after -input \n");
exit (1);
}
Opt->in_name = SUMA_copy_string(argv[kar]);
brk = YUP;
}
if (!brk && !ps->arg_checked[kar]) {
fprintf (SUMA_STDERR,
"Error %s:\n"
"Option %s not understood. Try -help for usage\n",
FuncName, argv[kar]);
exit (1);
} else {
brk = NOPE;
kar ++;
}
}
/* transfer some options to Opt from ps.
Clunky because this is retrofitting */
if (ps->o_N_surfnames) {
Opt->out_prefix = SUMA_copy_string(ps->o_surfnames[0]);
Opt->SurfFileType = ps->o_FT[0];
Opt->SurfFileFormat = ps->o_FF[0];
}
if (ps->i_N_surfnames) {
if (Opt->in_name || Opt->in_1D) {
SUMA_S_Err( "Options -i_TYPE, -input and -input_1D"
" are mutually exclusive.");
exit(1);
}
}
if (Opt->in_name) {
if (ps->i_N_surfnames !=0 || Opt->in_1D) {
fprintf (SUMA_STDERR,"Error %s:\nOptions -i_TYPE, -input and -input_1D are mutually exclusive.\n", FuncName);
exit(1);
}
}
if (Opt->in_1D) {
if (ps->i_N_surfnames !=0 || Opt->in_name) {
fprintf (SUMA_STDERR,"Error %s:\nOptions -i_TYPE, -input and -input_1D are mutually exclusive.\n", FuncName);
exit(1);
}
}
if (Opt->in_name && Opt->obj_type >= 0) {
fprintf (SUMA_STDERR,"Error %s:\nOptions -input and -shape are mutually exclusive.\n", FuncName);
exit(1);
}
if ((!Opt->in_name && Opt->obj_type < 0) && (!Opt->in_1D && !ps->i_N_surfnames)) {
fprintf (SUMA_STDERR,"Error %s:\nEither -input or -input_1D or -i_TYPE options must be used.\n", FuncName);
exit(1);
}
if (Opt->in_1D || ps->i_N_surfnames) {
if (Opt->MaskMode != SUMA_ISO_UNDEFINED) {
fprintf (SUMA_STDERR,"Error %s:\nCannot use -iso* options with either -input_1D or -i_TYPE options.\n", FuncName);
exit(1);
}
if (Opt->xform != SUMA_ISO_XFORM_MASK) {
fprintf (SUMA_STDERR,"Error %s:\nCannot use -xform option with either -input_1D or -i_TYPE options.\n", FuncName);
exit(1);
}
}
if (!Opt->out_prefix) Opt->out_prefix = SUMA_copy_string("convexhull_out");
if (Opt->xform == SUMA_ISO_XFORM_NONE) {
if (Opt->v0 != 0) {
fprintf (SUMA_STDERR,"Error %s: Bad %f isovalue\nWith -xform none you can only extract the 0 isosurface.\n(i.e. -isoval 0)\n", FuncName, Opt->v0);
exit(1);
}
if (Opt->MaskMode != SUMA_ISO_VAL) {
fprintf (SUMA_STDERR,"Error %s: \nWith -xform none you can only use -isoval 0\n", FuncName);
exit(1);
}
}
if (Opt->xform == SUMA_ISO_XFORM_SHIFT) {
if (Opt->MaskMode != SUMA_ISO_VAL) {
fprintf (SUMA_STDERR,"Error %s: \nWith -xform shift you can only use -isoval val\n", FuncName);
exit(1);
}
}
SUMA_RETURN(Opt);
}
