X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmFile.cxx;h=1e90cccb49650543aa4b9a35789e4d5adb3e3cd7;hb=ba8ca5c7ae54ae183c5d88dba3a8f2e3098ce017;hp=e21f6e0a81c76b5da44d9acf5c78db0776194fe4;hpb=f88cd7e3127179d20920d54df75bff206be94a09;p=gdcm.git diff --git a/src/gdcmFile.cxx b/src/gdcmFile.cxx index e21f6e0a..1e90cccb 100644 --- a/src/gdcmFile.cxx +++ b/src/gdcmFile.cxx @@ -3,8 +3,8 @@ Program: gdcm Module: $RCSfile: gdcmFile.cxx,v $ Language: C++ - Date: $Date: 2005/07/24 02:10:48 $ - Version: $Revision: 1.262 $ + Date: $Date: 2005/08/29 13:05:01 $ + Version: $Revision: 1.265 $ Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de l'Image). All rights reserved. See Doc/License.txt or @@ -78,7 +78,6 @@ #include #include //sscanf #include // for atoi -#include // for pow namespace gdcm { @@ -786,8 +785,8 @@ int File::GetBitsStored() /** * \brief Retrieve the number of Bits Allocated - * (8, 12 -compacted ACR-NEMA files-, 16, ...) - * @return The encountered number of Bits Allocated, 0 by default. + * (8, 12 -compacted ACR-NEMA files-, 16, 24 -old RGB ACR-NEMA files-,) + * @return The encountered Number of Bits Allocated, 0 by default. * 0 means the file is NOT USABLE. The caller has to check it ! */ int File::GetBitsAllocated() @@ -921,8 +920,8 @@ std::string File::GetPixelType() } else if ( bitsAlloc == "24" ) { - // (in order no to be messed up - bitsAlloc = "8"; // by old RGB images) + // (in order no to be messed up by old RGB images) + bitsAlloc = "8"; } std::string sign = GetEntryValue(0x0028, 0x0103);//"Pixel Representation" @@ -1290,7 +1289,7 @@ void File::AddAnonymizeElement (uint16_t group, uint16_t elem, el.Group = group; el.Elem = elem; el.Value = value; - AnonymizeList.push_back(el); + UserAnonymizeList.push_back(el); } /** @@ -1306,8 +1305,8 @@ void File::AnonymizeNoLoad() uint32_t lgth; uint32_t valLgth = 0; std::string *spaces; - for (ListElements::iterator it = AnonymizeList.begin(); - it != AnonymizeList.end(); + for (ListElements::iterator it = UserAnonymizeList.begin(); + it != UserAnonymizeList.end(); ++it) { d = GetDocEntry( (*it).Group, (*it).Elem); @@ -1315,11 +1314,11 @@ void File::AnonymizeNoLoad() if ( d == NULL) continue; - if ( dynamic_cast(d) ) - { - gdcmWarningMacro( "You cannot 'Anonymize a SeqEntry "); - continue; - } + if ( dynamic_cast(d) ) + { + gdcmWarningMacro( "You cannot 'Anonymize' a SeqEntry "); + continue; + } offset = d->GetOffset(); lgth = d->GetLength(); @@ -1345,7 +1344,7 @@ void File::AnonymizeNoLoad() bool File::AnonymizeFile() { // If Anonymisation list is empty, let's perform some basic anonymization - if ( AnonymizeList.begin() == AnonymizeList.end() ) + if ( UserAnonymizeList.begin() == UserAnonymizeList.end() ) { // If exist, replace by spaces SetValEntry (" ",0x0010, 0x2154); // Telephone @@ -1363,15 +1362,15 @@ bool File::AnonymizeFile() } else { - SetValEntry("anonymised", 0x0010, 0x0010); + SetValEntry("anonymized", 0x0010, 0x0010); } } } else { gdcm::DocEntry *d; - for (ListElements::iterator it = AnonymizeList.begin(); - it != AnonymizeList.end(); + for (ListElements::iterator it = UserAnonymizeList.begin(); + it != UserAnonymizeList.end(); ++it) { d = GetDocEntry( (*it).Group, (*it).Elem); @@ -1788,173 +1787,6 @@ bool File::Load( std::string const &fileName ) } #endif -// ----------------------------------------------------------------------------------------- -// THERALYS Algorithm to determine the most similar basic orientation -// -// Transliterated from original Python code. -// Kept as close as possible to the original code -// in order to speed up any further modif of Python code :-( -// ------------------------------------------------------------------------------------------ - -/** - * \brief THERALYS' Algorithm to determine the most similar basic orientation - * (Axial, Coronal, Sagital) of the image - * \note Should be run on the first gdcm::File of a 'coherent' Serie - * @return orientation code - * @return orientation code - * # 0 : Not Applicable (neither 0020,0037 Image Orientation Patient - * # nor 0020,0032Image Position found ) - * # 1 : Axial - * # -1 : Axial invert - * # 2 : Coronal - * # -2 : Coronal invert - * # 3 : Sagital - * # -3 : Sagital invert - * # 4 : Heart Axial - * # -4 : Heart Axial invert - * # 5 : Heart Coronal - * # -5 : Heart Coronal invert - * # 6 : Heart Sagital - * # -6 : Heart Sagital invert - */ -double File::TypeOrientation( ) -{ - float iop[6]; - bool succ = GetImageOrientationPatient( iop ); - if ( !succ ) - { - return 0.; - } - - vector3D ori1; - vector3D ori2; - - ori1.x = iop[0]; ori1.y = iop[1]; ori1.z = iop[2]; - ori1.x = iop[3]; ori2.y = iop[4]; ori2.z = iop[5]; - - // two perpendicular vectors describe one plane - double dicPlane[6][2][3] = - { { {1, 0, 0 },{0, 1, 0 } }, // Axial - { {1, 0, 0 },{0, 0, -1 } }, // Coronal - { {0, 1, 0 },{0, 0, -1 } }, // Sagittal - { { 0.8, 0.5, 0.0 },{-0.1, 0.1 , -0.95 } }, // Axial - HEART - { { 0.8, 0.5, 0.0 },{-0.6674, 0.687, 0.1794} }, // Coronal - HEART - { {-0.1, 0.1, -0.95},{-0.6674, 0.687, 0.1794} } // Sagittal - HEART - }; - - vector3D refA; - vector3D refB; - int i = 0; - Res res; // [ , ] - res.first = 0; - res.second = 99999; - for (int numDicPlane=0; numDicPlane<6; numDicPlane++) - { - ++i; - // refA=plane[0] - refA.x = dicPlane[numDicPlane][0][0]; - refA.y = dicPlane[numDicPlane][0][1]; - refA.z = dicPlane[numDicPlane][0][2]; - // refB=plane[1] - refB.x = dicPlane[numDicPlane][1][0]; - refB.y = dicPlane[numDicPlane][1][1]; - refB.z = dicPlane[numDicPlane][1][2]; - res=VerfCriterion( i, CalculLikelyhood2Vec(refA,refB,ori1,ori2), res ); - res=VerfCriterion( -i, CalculLikelyhood2Vec(refB,refA,ori1,ori2), res ); - } - return res.first; -/* -// i=0 -// res=[0,99999] ## [ , ] -// for plane in dicPlane: -// i=i+1 -// refA=plane[0] -// refB=plane[1] -// res=self.VerfCriterion( i , self.CalculLikelyhood2Vec(refA,refB,ori1,ori2) , res ) -// res=self.VerfCriterion( -i , self.CalculLikelyhood2Vec(refB,refA,ori1,ori2) , res ) -// return res[0] -*/ - -} - -Res -File::VerfCriterion(int typeCriterion, double criterionNew, Res const & in) -{ - Res res; - double criterion = in.second; - if (criterionNew < criterion) - { - res.first = criterionNew; - res.second = typeCriterion; - } -/* -// type = res[0] -// criterion = res[1] -// # if criterionNew<0.1 and criterionNew : - type : vector 3D (double) -//- : - type : vector 3D (double) -// - Description of the first plane -//- : - type : vector 3D (double) -//- : - type : vector 3D (double) -// - Description of the second plane -//------------------------- Return : ------------------------------------ -// double : 0 if the planes are perpendicular. While the difference of -// the orientation between the planes are big more enlarge is -// the criterion. -//------------------------- Other : ------------------------------------- -// The calculus is based with vectors normalice -double -File::CalculLikelyhood2Vec(vector3D const & refA, vector3D const & refB, - vector3D const & ori1, vector3D const & ori2 ) -{ - - vector3D ori3 = ProductVectorial(ori1,ori2); - vector3D refC = ProductVectorial(refA,refB); - double res = square_dist(refC, ori3); - - return sqrt(res); -} - -//------------------------- Purpose : ----------------------------------- -//- Calculus of the poduct vectorial between two vectors 3D -//------------------------- Parameters : -------------------------------- -//- : - type : vector 3D (double) -//- : - type : vector 3D (double) -//------------------------- Return : ------------------------------------ -// (vec) : - Vector 3D -//------------------------- Other : ------------------------------------- -vector3D -File::ProductVectorial(vector3D const & vec1, vector3D const & vec2) -{ - vector3D vec3; - vec3.x = vec1.y*vec2.z - vec1.z*vec2.y; - vec3.y = -( vec1.x*vec2.z - vec1.z*vec2.x); - vec3.z = vec1.x*vec2.y - vec1.y*vec2.x; - - return vec3; -} - //----------------------------------------------------------------------------- // Print