Knee Segmentation and Registration Toolkit (KSRT)

Size: px
Start display at page:

Download "Knee Segmentation and Registration Toolkit (KSRT) https://bitbucket.org/marcniethammer/ksrt/wiki/home"

Transcription

1 Knee Segmentaton and Regstraton Toolkt (KSRT) Automatc Cartlage Segmentaton and Cartlage Thckness Analyss Software Release: Junpyo Hong Lang Shan Marc Nethammer January 22, 2015 Contents 1 Lcense 2 2 Overvew 2 3 Analyss Approaches Cartlage Segmentaton Preprocessng Mult-Atlas-Based Bone Segmentaton Mult-Atlas-Based Cartlage Segmentaton Longtudnal Segmentaton Cartlage Thckness Computaton Statstcal Thckness Analyss KSRT Software Overvew of the Software Ppelne Overvew of Scrpts Prerequstes Tasks Image Data Format Buldng the Software Dependences Utlty Applcatons Buld Instructon Supported Platform Tutoral: Pfzer Longtudnal Study Dataset PLS Dataset Runnng the Software Ppelne Preprocessng Tranng Classfers Automatc Cartlage Segmentaton Longtudnal Segmentaton Cartlage Thckness Computaton Statstcal Analyss on the Thckness

2 1 Lcense The Knee Segmentaton and Regstraton Toolkt (KSRT) s dstrbuted under the Apache 2.0 lcense. For more nformaton, please see the lcense fle wthn the gt repostory gt@btbucket.org:marcnethammer/ ksrt.gt. Copyrght (c) 2014 Department of Computer Scence, Unversty of North Carolna at Chapel Hll Lcensed under the Apache Lcense, Verson 2.0 (the "Lcense"); you may not use ths fle except n complance wth the Lcense. You may obtan a copy of the Lcense at Unless requred by applcable law or agreed to n wrtng, software dstrbuted under the Lcense s dstrbuted on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, ether express or mpled. See the Lcense for the specfc language governng permssons and lmtatons under the Lcense. 2 Overvew Ths software s an open source dstrbuton of algorthms to automatcally quantfy cartlage thckness from magnetc resonance (MR) mages and to perform related statstcal analyses. The mplemented algorthms are n detal descrbed n [3]. Ths document serves as a hgh-level overvew, contans an nstallaton gude, as well as a tutoral to gude a user through a data analyss. In partcular, the software descrbed n ths user manual allows to automatcally performs the followng analyss tasks: 1) Segmentng cartlage from knee Magnetc Resonance Imagng (MRI) data. 2) Computng cartlage thckness from the automatc cartlage segmentatons. 3) Establshng spatal correspondence across MRI data approprate for statstcal analyss. 4) Performng statstcal analyss of localzed cartlage changes for cross-sectonal and longtudnal data. The purpose of ths document s to provde background nformaton necessary for understandng and usng the software so that t can be used on other datasets. The software has so far successfully been appled to analyze data from the Pfzer Longtudnal Study [2, 3] as well as from the MICCAI SKI10 challenge on cartlage segmentaton [2]. A summary of the obtaned results can be found n [2]. Secton 3 gves an overvew of the analyss approaches used. For a more detaled explanaton please refer to [3]. Secton 4 llustrates how to buld the software. Secton 5 presents a tutoral on how to use the software to analyze the Pfzer Longtudnal Dataset. 3 Analyss Approaches Ths secton descrbes brefly the analyss approaches used n KSRT. Specfcally, Secton 3.1 descrbes how cartlage segmentaton s performed, Secton 3.2 dscusses the cartlage thckness computatons, and Secton 3.3 descrbes the statstcal analyss approach. 2

3 Fgure 1: Flowchart of overall cartlage segmentaton ppelne 3.1 Cartlage Segmentaton KSRT uses a mult-atlas-based segmentaton approach [3] wth non-local patch-based label fuson. Fgure 1 shows a flow-chart of the overall analyss ppelne, whch conssts of the followng steps. Frst, both the femur bone and the tba bone are automatcally segmented usng a mult-atlas strategy. These bone segmentatons are used for an ntal rough mage algnment and to automatcally extract a smaller regon around the knee jont wthn whch a refned regstraton and the segmentaton of cartlage s performed. Focusng on ths smaller regon sgnfcantly reduces the computatonal cost of the approach. The cartlage segmentaton tself s based on a spatal pror obtaned from mult-atlas regstraton of labeled jont regons and a datalkelhood terms obtaned through local feature-based probablstc classfcaton. Both the spatal pror and the data-lkelhoods are used wthn a three-label convex segmentaton formulaton to obtan the segmentaton labels for femoral and tbal cartlage as well as background. The three-label segmentaton makes use of an ansotropc spatal regularzaton term to smultaneously suppress nose whle respectng the thn cartlage structures. In the context of atlas-based segmentaton, an atlas [1] s defned as the par of an orgnal structural mage and the correspondng segmentaton. The segmentaton n the atlas par s assumed to be obtaned for example by manual segmentaton by a doman expert. 3

4 Suppose we have N atlases, then n each atlas A ( = 1, 2,..., N), we have A Structural Image, I A Manual Segmentaton of the Femur bone, S F B A Manual Segmentaton of the Tba bone, S T B A Manual Segmentaton of the Femoral cartlage, S F C A Manual Segmentaton of the Tbal cartlage, S T C The remander of ths secton provdes bref descrptons for each stage of the segmentaton ppelne. Secton gves an overvew of the preprocessng requred for datasets pror to cartlage segmentaton and statstcal analyss. Secton explans the mult-atlas-based automatc segmentaton of the femur and the tba. Secton explans how femoral and tbal cartlage are segmented usng a mult-atlas segmentaton strategy guded by the segmentatons of femor and tba. Fnally, Secton shows how cartlage segmentatons can be refned for longtudnal data (as avalable for example from the Pfzer Longtudnal Study or the data of the Osteoarthrts Intatve) by enforcng temporal regularty Preprocessng Before we can use the data for analyss some preprocessng needs to be performed. We frst remove artfacts n mages caused by the nonhomogenety n magnetc felds. Then we rescale mage ntenstes so that values range from 0 to 100. We perform edge preservng smoothng to further remove nose n the mages. Fnally we downsample the mages by a factor of 4 for the frst 2 dmensons to make mage regstraton more effcent whle not losng too much nformaton. Note that ths only affects the regstraton, segmentaton s stll performed at the full mage resoluton Mult-Atlas-Based Bone Segmentaton After the data s pre-processed approprately for the analyss, we automatcally segment knee bones from the mages usng a mult-atlas strategy. The labelng cost c of each voxel locaton x n the query mage for each label l n F B, BG, T B ( F B, BG, and T B denotes the femur bone, the background, and the tba bone respectvely) are defned by log-lkelhoods : ( ) p(i(x) l) P (l) c(x, l) = log (P (l I(x))) = log log (p(i(x) l) P (l)) (1) p(i(x)) We frst segment femur bone and tba bone from the query mage by performng the followng steps: 1) Regstraton: We compute spatal transformaton to regster each of the atlases to the query mage. We frst compute affne transformaton based on structural mages of each atlases and the query such that T affne : I I q. (2) Then we apply T affne computed from (2) to I, S F B, and S T B ( = 1, 2,..., N). T affne T affne T affne I S F B S T B (3) Ths s followed by a B-Splne transformaton such that T bsplne : (T affne I ) I q (4) 4

5 Just as for the affne transformaton, we apply the transformaton computed n (4) to T affne I, S F B, and T affne S T B T affne T bsplne T bsplne T bsplne T affne T affne T affne I S F B S T B 2) Label Fuson: We propagate the regstered segmentaton masks,.e., T bsplne T affne S T B p(t B), for the query mage I q : T bsplne T affne S F B and to form the spatal pror of the femur bone and the tba bone,.e., p(f B) and p(f B) = 1 N p(t B) = 1 N N =1 N =1 ( T bsplne T affne ( T bsplne T affne ) S F B ) S T B where F B and T B respectvely denote the femur bone and the tba bone. Recall from that we have downsampled the mage to make regstraton effcent whle not losng too much nformaton. After summaton and dvson n (6), we upsample p(f B) and p(t B) back to the orgnal dmenson. 3) Segmentaton: Fnally, we segment the femur bone and the tba bone from the query by mnmzng the labelng cost of each voxel locaton for the femur bone and the tba bone. Recall from (1) that ths cost s expressed n terms of posteror probablty: (5) (6) c(x, F B) = log (p (F B I (x))) log (p(i(x) F B) p(f B)) c(x, T B) = log (p (T B I (x))) log (p(i(x) T B) p(t B)) (7) where x denotes each voxel locaton n the mage, and I(x) denotes ntensty value at x. The lkelhood of the femur bone and the tba bone,.e., p(i(x) F B) and p(i(x) T B), are computed as the followng. p(i(x) F B) = p(i(x) T B) = exp( βi(x)) (8) where β s set to 0.02 and the ntensty values I(x) range from 0 to 100 as a result of the preprocessng descrbed n We use the three-label segmentaton descrbed n [3] to segment the femur bone and the tba bone by mnmzng labelng costs (7) Mult-Atlas-Based Cartlage Segmentaton After segmentng the knee bones from the query (denoted by S F B and S T B ), we can use these segmentaton masks to gude cartlage segmentaton. The labelng cost for the femoral cartlage and the tbal cartlage s expressed n terms of posteror probabltes: wth prors computed from mult-atlas-based regstraton followed by non-local patch-based label fuson and lkelhoods computed from probablstc classfcaton (we use a Support Vector Machne (SVM)). The labelng cost c of each voxel x for each label l n F C, BG, T C ( F C, BG, T C respectvely denote the femoral cartlage, the background, and the tbal cartlage) s, ( ) p (f (x) l) p (l) c(x, l) = log (P (l f (x))) = log log (p (f (x) l) p (l)) (9) p (f (x)) We perform the followng steps to automatcally segment both cartlages from the query. 5

6 1) Jont Regon Extracton: We automatcally extract a smaller regon around the jont. Ths regon s computed based on the bone segmentaton from the prevous stage of the ppelne. Ths process makes the further processng more effcent whle not affectng the cartlage segmentaton performance. 2) Probablstc Classfcaton: We compute lkelhood terms p(f(x) l) for the labelng cost c va probablstc classfcaton. For features, we used: ntenstes on three scales frst-order dervatves n three drectons on three scales second-order dervatves n the axal drectons on three scales where three scales are obtaned by convolvng wth Gaussan kernels of σ = 0.3 mm, 0.6 mm, and 1.0 mm. All features are normalzed to be centered at 0 and have unt standard devaton. We use an SVM for classfcaton. 3) Regstraton: We use mult-atlas-based regstraton to propagate segmentaton masks for the femoral cartlage and the tbal cartlage. We regster each atlas A to the query va computng affne transformatons: T affne,f C T affne,t C : S F B S F B : S T B S T B (10) We apply T affne,f C to the femoral cartlage segmentaton S F C and the structural mage I, and T affne,t C to the tbal cartlage segmentaton S T C and the structural mage I. S F C Ĩ F C S T C Ĩ T C = T affne,f C = T affne,f C = T affne,t C = T affne,t C S F C I S T C I (11) 4) Label Fuson: After the regstraton, we form prors for the femoral cartlage (.e., p(f C)) and the tbal cartlage (.e., p(t C)) usng the warped label mages,.e., S F C and S T C. Note that the non-local patch based strategy n label fuson s robust to local errors ntroduced by regstraton. Let p F C (x) denote p(f C) at the voxel locaton x and p T C (x) denote p(t C) at the voxel locaton x. p F C (x) s computed as: N y N p F C (x) wf C (x, y) S F C (y) =1 (x) =, (12) N y N (x) wf C (x, y) w F C (x, y) = exp =1 x P(x)y P(y) ( I(x ) ĨF C (y ) h F C (x) ) 2, (13) where x s a voxel n the patch P(x) centered at x (smlarly y a voxel n the patch P(y) centered at y) and h F C (x) s defned by h F C (x) = mn 1 N y N (x) x P(x) y P(y) ( I(x ) ĨF C (y )) 2 + ɛ (14) 6

7 We compute p T C (x) exactly the same way by substtutng F C wth T C n equatons: (12), (13), and (14). 5) Segmentaton: Fnally wth spatal prors computed from (12) and the lkelhood computed va classfcaton, we use the three-label segmentaton wth ansotropc regularzaton to segment cartlage. In order to make use of ansotropc regularzaton, we compute the normal drectons Longtudnal Segmentaton The segmentaton result computed so far s assumed to be temporally ndependent. I.e., each tmepont s segmented ndependently. However, f we know the dataset s longtudnal, then we can further enforce temporal consstences across mage data at dfferent tme ponts. Our longtudnal segmentaton also follows a smlar framework: regstraton followed by three-label segmentaton. 1. Regstraton: To algn longtudnal mages of a gven subject, we regster all of the tme ponts to the frst tme-pont (baselne mage). We frst compute a rgd transformaton between the t th tme pont and the frst tme pont based on the femur bone segmentaton. R F B t : S F B t S F B 0 (15) where subscrpt t denotes t th tme pont. Then we apply the transformatons (15) to: the segmentaton mask of the femoral cartlage, the local lkelhood map of the femoral cartlage, spatal pror map of the femoral cartlage, and the structural mage around the jont from Jont Regon Extracton stage. R F B t S F C t R F B t p t (f(x) F C) R F B t p t (F C) R F B t I jont t Then we compute another rgd transformaton based on the transformed femoral cartlage segmentaton mask. Rt F C : ( Rt F B St F C ) S F C 0 (17) We apply Rt F C to all of the transformed: the segmentaton mask of the femoral cartlage, the local lkelhood map of the femoral cartlage, the spatal pror map of the femoral cartlage, and the structural mage around the jont. S F C t = R F C t R F B t p t (f(x) F C) = R F C t p t (F C) = R F C t Ĩ jont t = R F C t S F C t R F B t p t (f(x) F C) R F B t p t (F C) R F B t I jont t We repeat the above procedure to algn the tbal segmentaton mask, the tbal cartlage lkelhood map, the spatal pror for the tbal cartlage, and the structural mage around the jont based on the tba bone segmentaton and the tbal cartlage segmentaton. 2. Segmentaton: Once the dfferent tme pont are algned to the baselne, we compute the labelng cost c for t th tme pont, ( ) pt (f (x) l) p t (l) c(x, l, t) = log (p t (l f(x))) = log log ( p t (f (x) l) p t (l)) (19) p t (f (x)) Then we compute the normal drectons because we make use of ansotropc regularzaton for the longtudnal segmentaton. We longtudnally segment cartlages by mnmzng the labelng cost (19) wth each terms computed from (18). (16) (18) 7

8 Fgure 2: Thckness Computaton ppelne. Extract the jont regon and automatcally segment cartlages. Compute cartlage thckness. Regster all of the 3D thckness maps to a common atlas space. Project 3D thckness maps onto a 2D plane along axal drecton. 3.2 Cartlage Thckness Computaton Once both femoral and tbal cartlages are segmented we use the method descrbed n [4] to compute thckness of those cartlages. Please refer [4] for more detals on computng tssue thckness. 3.3 Statstcal Thckness Analyss Once cartlage thcknesses are computed we establsh spatal correspondence of the thcknesses by mappng them to a common atlas space. We use an affne followed by B-Splne transform whch are computed based on bone segmentatons for each cartlage thckness volume. Then these transformed thcknesses are projected down to an axal slce by takng the medan thckness value along the axal drecton (where thcknesses are approxmately constant). Then these thckness maps are comparable across tme-ponts and subjects. Note that all segmentatons and thcknesses are computed n natve mage space. Fgure 3.3 llustrates how the thckness maps are computed. Once the 2D thckness maps are created we frst ft a lnear mxture model to model dfferences between normal control subjects and OA subjects. Then we cluster OA subjects such that subjects n the same cluster have smlar patterns n thnnng of the cartlages. Then we ft another lnear mxture models to each OA cluster for a refned statstcal analyss. See [3] for more detals. 4 KSRT Software Ths secton descrbes the software avalable mplementng the algorthms descrbed n Secton 3. Specfcally, Secton 4.1 gves an overvew of the software ppelne. Secton 4.2 dscusses the mage format used. Secton 4.3 dscusses how to buld the software. Secton 4.4 dscusses the supported platforms. 8

9 4.1 Overvew of the Software Ppelne Ths software package contans several components for automatc segmentaton of cartlage. In what follows, we wll gve an overvew of all the stages of the analyss ppelne. The source code dstrbuton contans the followng drectores: src: Ths drectory contans C++ mplementaton of the algorthm. lb: Ths drectory contans varous applcatons used. scrpts: Ths drectory contans scrpts to run the segmentaton on a compute cluster. matlab: Ths drectory contans scrpts wrtten n MATLAB to perform statstcal analyss on cartlage thckness Overvew of Scrpts In the source code dstrbuton we provde scrpts to submt jobs on clusters usng the qsub command to automatcally segment cartlage from query mages. Under the scrpts drectory, you wll fnd the followng job submsson scrpts: submt_preprocess: Ths scrpt performs preprocessng on the dataset as descrbed n submt_transvm: Ths scrpt trans SVM classfers usng the lbsvm mplementaton. Three SVM classfers for the femoral cartlage, the background, and the tbal cartlage are traned. The traned classfers are saved to be used durng the cartlage segmentaton. submt_cartseg_ndp: Ths scrpt s the man scrpt that automatcally segments femoral and tbal cartlage from query mages as descrbed n 3.1. In order to run ths scrpt successfully, some prerequste tasks need to be performed pror to executng the scrpt. Please refer to Secton for the detals on these tasks. submt_temporal_algn: Ths scrpt enforces temporal consstences across segmentaton results of dfferent tme ponts of a sngle subject. In order to run ths scrpt successfully the dataset needs to be longtudnal and also needs to be organzed n a specfc way as descrbed later n ths document. submt_cartseg_long: Ths scrpt refnes segmentaton results va establshng spatal correspondence across dfferent tme ponts Prerequstes Tasks To run the ppelne usng the provded scrpts the followng path varables need to be defned. If you are usng bash, then follow the nstructons below to defne path varables n your.bashrc so that scrpts runnng the ppelne can access the approprate paths. In addton, you need to create two text fles to denote query mages and atlas mages n the dataset so that the aforementoned scrpts can access and process data approprately. Path Varables ksrt Applcaton Drectory: You have to defne ksrt Applcaton drectory as ksrtappdir n your system settng fle. If you are usng bash, then put the followng n your.bashrc. AppDIR=/home/username/ksrt/buld/Applcaton export AppDIR ksrt Lbrary Drectory: If you choose to use the provded scrpts to run the ppelne, then put the followng n your.bashrc. 9

10 LbDIR=/home/username/ksrt/lb export LbDIR Dataset Drectory: You have to defne DataDIR to be the path to your dataset. Please put the followng n your.bashrc. DataDIR=/home/username/your_path_to_data export DataDIR Slcer Drectory: If you choose to use the provded scrpts to run the ppelne on a compute cluster, some of applcatons that are part of Slcer3 are needed. Please put the followng lnes n your.bashrc. SlcerDIR=/home/username/your_path_to_Slcer export SlcerDIR Text fles: Below are the text fles needed. Place these two text fles where the dataset s. That s the drectory ponted by $DataDIR defned n.bashrc. lst.txt: Ths text fle contans a lst of all query mages to be segmented. Ths text fle needs to lst relatve paths to the query mages from $DataDIR. For example, lst.txt used later n 5 looks lke the followng. ste ste ste ste ste ste Wth each row correspondng to a sngle query mage. There are three columns per row. The frst column denotes whch ste drectory the query mage resdes n. The second column denotes the subject d of the query mage. Lastly, the thrd column denotes the tme pont of the query mage (n month). lst_atlas.txt: Ths text fle contans a lst of all atlas mages. The format s exactly the same as lst.txt. 4.2 Image Data Format We use the Nearly Raw Raster Data (NRRD) format throughout the analyss. See teem.sourceforge.net/ nrrd for a detaled descrpton of ths format. Ths data format s supported by ITK ( AS our analyss software uses ITK to read and wrte mages other ITK supported fle-formats could n prncple also easly be supported n future releases of the software. For now please convert all your data to NRRD format before runnng ths software. Ths converson could for example be done usng Slcer or usng a smple ITK scrpt. 4.3 Buldng the Software KSRT depends on a number of dfferent open-source packages whch are freely avalable onlne. CMake s used to confgure the buld and s avalable from Earler versons of CMake may not be supported so we recommend downloadng CMake at least hgher than verson

11 4.3.1 Dependences To buld the software, you wll need the followng packages. If you have already bult Slcer-3, then you only need to buld the Approxmate Nearest Neghbor lbrary and the ImageMath package. InsghtToolkt 3.20 (ITK3) s requred for all of applcatons n KSRT package. Both ITK3 and ITK4 are avalable to download at Slcer-3 s also requred to buld KSRT successfully. It s avalable to download from slcer.org/slcerwk/ndex.php/slcer3:downloads. ann s requred to buld KSRT. Ths s an open-source lbrary for approxmate nearest neghbor search and s avalable to download at Ths s provded as a part of the software dstrbuton Utlty Applcatons In addton, the software uses several applcatons. These applcatons are not requred to buld KSRT, but these are requred to run the ppelne usng the provded scrpts successfully. These applcatons are ncluded as part of the source code dstrbuton. Below are the lst of the applcatons used along wth short descrptons. ImageMath s an open-source C++ lbrary for mathematcal operatons on mages. It s avalable to download at ExtractLargestConnectedComponentFromBnaryImage s used to segment the largest connected component from a bnary mage. Ths s used to segment out bones and cartlages after the labelng cost of each object s computed. Ths applcaton can be found under /path_to_ksrt_source/lb/extractlargestc A detaled descrpton of the applcaton s avalable at ImageSegmentaton/ExtractLargestConnectedComponentFromBnaryImage. lbsvm-3.17 s a C++ mplementaton of Support Vector Machne lbrares. Ths s needed f you wsh to use SVM to compute lkelhoods whch n turn are used to compute labelng costs. It s avalable to download at Buld Instructon CMake s used to confgure the buld and generate Makefles or Vsual Studo Soluton fles. After successfully confgurng, the software can be bult usng the natve compler. For nformaton on usng CMake, please refer to The followng secton provdes step-by-step nstructon on how to buld dependent packages. Slcer3 Please refer for buld nstructons on buldng Slcer3 ndex.php/slcer3:buld_instructons. When fnshed buldng Slcer3, ITK3 wll also be downloaded and nstalled. Once all of dependent applcatons are bult, then please follow the steps below to buld KSRT. 1. Clone the gt source code dstrbuton at gt@btbucket.org:marcnethammer/ksrt.gt by executng g t c l o n e gt@btbucket. org : marcnethammer/ k s r t. g t 2. Create a separate drectory for your buld fles and executables. For example, f you cloned the source code dstrbuton n /home/username/ksrt, then you may create a separate drectory named /home/username/ksrt-buld. 11

12 3. Change nto the buld drectory created n the prevous step. Then runccmake../ksrt n the termnal to confgure KSRT. 4. Below are the lst of path varables needed to confgure KSRT successfully. ANN LIB s a path to actual lbrary fle whch s located at ksrt/lb/ann_1.1.2/lb/lbann.a drectory of the source code dstrbuton. ANN PATH s path to nclude drectory of ann package. Ths drectory s at ksrt/lb/ann_1.1.2/nclude Slcer3 DIR s a path buld drectory of Slcer3. GenerateCLP DIR s a path to a package that comes wth Slcer3. Ths package should be located at under the buld drectory of Slcer3 that looks lke the followng. your_path_to_slcer3/slcer3-buld/lbs/slcerexecutonmodel/generateclp ITK3 DIR s also nstalled along wth Slcer3. Ths should be set to somethng lke the followng. your_path_to_slcer3/slcer3-lb/insght-buld Once these path varables are set, then let CMake confgure agan and agan untl CMake can confgure the buld wthout any errors. 5. Once Confgured, you can generate the buld,.e., Makefle for KSRT. 6. Use make command to buld KSRT. 4.4 Supported Platform We have bult and tested the software package under Unx-based system (e.g. Lnux and MacOSx). We recommend runnng the system on a cpmpute cluster as some parts of the ppelne are computatonally demandng, but can be computed n parallel on a cluster. 5 Tutoral: Pfzer Longtudnal Study Dataset We wll llustrate how to segment cartlage usng the Longtudnal Mult-Atlas Approach based on the Pfzer Longtudnal Dataset. The software can be run n a smlar way on the SKI10 and the OASIS datasets. Ths tutoral provdes step-by-step nstructons to run the software for analyzng longtudnal changes n cartlage thckness on subjects. In ths example, we wll use the Mult-Atlas based cartlage segmentaton wth longtudnal constrants. 5.1 PLS Dataset The Pfzer Longtudnal Study (PLS) dataset contans 706 T1-weghted (3D SPGR) mages for 155 subjects, maged at baselne, 3, 6, 12, and 24 months at a resoluton of mm 3. Some subjects have mssng scans. The kellgren-lawrence grades (KLG) were determned for all subjects from the baselne scans, classfyng 82 as normal control subjects (KLG0), 40 as KLG2, and 33 as KLG3. For the dstrbuton of ths dataset that was avalable to us the top level drectory of the dataset conssted of seven drectores, each representng dfferent stes where subjects receved longtudnal MRI assessments of ther knees. ste1001 ste1002 ste1003 ste

13 ste1005 ste1006 ste1007 Insde each of the aforementoned ste drectores, MRI data s grouped by drectores named after unque subject ds that contan longtudnal knee MRI measurements of the subject wth that d. These folders contan varyng number of subjects. For example, under the drectory ste1001, there are 29 folders, each storng longtudnal knee MRI data of a subject maged at ths ste , , , Lastly nsde of each of the subject folder s a longtudnal collecton of knee MRI data that are stored separately for dfferent tme ponts of the measurement. The name of folders s the number of the months after the ntal scan; therefore, the frst MRI measurement (baselne MRI data) s under 0. For example, under , there are fve folders named 0, 3, 6, 12, 24. The aforementoned folders contan the followng fles: Structural MR mage: cor_t1.nhdr and cor_t1.raw.gz Manual segmentaton of the femoral cartlage: fem.nhdr and fem.raw.gz Manual segmentaton of the tbal cartlage: tb.nhdr and tb.raw.gz Both manual segmentaton of the femoral cartlage and of the tbal cartlage (drawn by a doman expert, Dr. Felx Ecksten) are avalable for all mages. However these manual segmentatons are only used for evaluatng the qualty of automatc cartlage segmentaton; therefore these segmentatons are not strctly needed to run the software. Recall from 3.1, we make use of the knee bone segmentatons to gude cartlage segmentatons. Expert segmentaton on the femur bone and on the tba bone are only avalable for us for the baselne mages of 18 subjects. These 18 baselne mages serve as atlases A whch are necessary to run our software ppelne. When the aforementoned folder s one of these 18 baselne mage (atlas mage) folders, then the folder contans the followng fles: Structural MR mage: cor_t1.nhdr and cor_t1.raw.gz Manual segmentaton of the femur bone: femur.nhdr and femur.raw.gz Manual segmentaton of the femoral cartlage: fem.nhdr and fem.raw.gz Manual segmentaton of the tba bone: tba.nhdr and tba.raw.gz Manual segmentaton of the tbal cartlage: tb.nhdr and tb.raw.gz There are a total of 706 mages n the PLS dataset. 13

14 5.2 Runnng the Software Ppelne In ths secton we descrbe the expected output after runnng the provded scrpts. Recall that prerequste tasks descrbed n need to be done pror to runnng the scrpts Preprocessng As prevously dscussed, the frst step s to process the data approprately for analyss. By executng preprocess.sh we perform the preprocessng on the entre dataset as descrbed n Type the followng command to run preprocessng scrpts on the dataset. qsub submt Preprocess We store all of the ntermedate results of the preprocessng. Below are the lst of fles that are saved as the ntermedate results of the preprocessng. cor_t1_correct: Bas feld caused by magnetc non-homogenety s corrected from the orgnal mage cor_t1. cor_t1_correct_scale: Intensty values of cor_t1_correct are rescaled so that values are between 0 and 100 cor_t1_correct_scale_smooth: The result of the prevous step,.e., cor_t1_correct_scale, are smoothed whle preservng edges n the mage. cor_t1_correct_scale_smooth_small: The smoothed mage,.e., cor_t1_correct_scale_smooth, s downsampled to be used durng regstraton. Fgure 3 shows the result of the preprocessng on an mage taken at baselne for subject

15 (a) (b) (c) (d) Fgure 3: Result of preprocessng of a subject baselne mage: (a) bas-feld corrected mage, (b) ntenstyscaled mage, (c) smoothed mage, (d) downsampled mage Tranng Classfers The next step s to tran SVM classfers to be used durng cartlage segmentaton to provde lkelhood terms for the labelng cost n (9). We tran SVM classfers to perform probablstc classfcaton of the femoral cartlage, the background, and the tbal cartlage. The classfer outputs probabltes of each voxels n the mage belongng to the femoral cartlage, the background, and the tbal cartlage. The classfer s traned usng features descrbed n extracted from the atlas mages. Type the followng command n the termnal to tran the SVM classfer. qsub submt TranSVM The scrpt frst creates a folder named SVM at the dataset drectory to save traned classfers and extracted features. The path to ths folder looks somethng lke the followng. $DataDIR/SVM Once the drectory s created (or already exsts) the followng fles are saved n the folder after the executon of the scrpt. cor_t1_correct_scale_30000: Intensty values of the atlas mages are rescaled to range from 0 to pror to feature extracton. Recall that after the preprocessng ntensty values of the mage 15

16 range from 0 to 100. tranlabel.nhdr: Label mage extracted to be used n the tranng tran_1: Features extracted for the femoral cartlage. tran_2: Features extracted for the background. tran_3: Features extracted for the tbal cartlage. tran_1_small: subset of tran_1 to be used durng tranng tran_2_small: subset of tran_2 to be used durng tranng tran_3_small: subset of tran_3 to be used durng tranng tran_small: Concatenaton of tran_1_small, tran_2_small, and tran_3_small tran_balance.model: traned SVM classfer Automatc Cartlage Segmentaton Once the classfers are traned we are now ready to process the query mages. Please type the followng command n the termnal. qsub submt CartSeg ndp In ths secton we provde what to expect as an output for each stage n the scrpt along wth vsualzaton of ntermedate results. Bone Regstraton We regster all of atlases to a gven query mage va computng a seres of spatal transformatons. Durng executon, fles are saved to an output drectory of the form $DataDIR/$SITEID Q/$ID Q/$VISIT Q/ moved atlas where $SITEID_Q s one of the ste drectores descrbed n 5.1, $ID_Q s one of the subject d drectores under the SITEID_Q, and $VISIT_Q s one of the measurement tme ponts of that subject denoted by $ID_Q. If the output drectory does not exst, the scrpt creates the output drectory frst. Once the output drectory s created (or already exsts), you should fnd the followng fles n the output drectory. affne transform fle: affne_$id_a.tfm B-Splne transform fle: bsplne_$id_a.tfm transformed structural mage: moved_$id_a.nhdr and moved_$id_a.raw.gz transformed femur bone segmentaton: moved_femur_$id_a and moved_femur_$id_a.raw.gz transformed tba bone segmentaton: moved_tba_$id_a and moved_tba_$id_a.raw.gz $ID_A denotes dfferent IDs of atlas subjects. 16

17 Bone Label Fuson After the regstraton, we fuse all of the moved segmentatons of the atlases to form the pror probablty of a voxel belongng to the femur bone. We smply take an arthmetc mean of all of the transformed segmentaton masks to form the pror probablty map for the femur bone p(f emur) and the tba bone p(t ba) respectvely. Two mages named pfemur and ptba are saved after the label fuson. Fgure 4 llustrates what these pror probablty maps look lke. (a) (b) Fgure 4: Spatal pror probablty map for the femur bone (left, a) and the tba bone (rght, b). Bone Segmentaton We compute bone lkelhoods for each voxel, whch are saved as pbone. Gven bone lkelhoods and prors we compute the labelng cost map for the femur bone, the background, and the tba bone; these are saved as cost_femur, cost_bkgrd, and cost_tba respectvely. These labelng cost maps are used wthn a threelabel segmentaton method to segment the femur bone and the tba bone. Fgure 5 shows vsualzatons of these costs. 17

18 Fgure 5: Labelng costs for the femur bone (top), the background (mddle), and the tba (bottom). 18

19 There s a regularzaton parameter to choose n segmentaton method (see [3] for detals); ths optmzaton; we set ths parameter to 0.5. Fgure 6 shows the fnal bone segmentatons. Fgure 6: Fnal bone segmentatons. Extract Jont Regon We automatcally extract a smaller regon (from ths pont on, we refer ths regon as jont regon) from the orgnal mages to make the further processng more effcent. These regons are automatcally extracted usng the bone segmentaton masks from the structural mage, the femur bone segmentaton mask, and the tba bone segmentaton mask. In addton, we create another structural mage whch s a rescaled verson of the structural mage of the jont regon. The ntensty values are rescaled so that they range from 0 to (Recall that after the preprocessng, ntensty values range from 0 to 100.) Ths rescaled mage s used for extractng features to be used n classfcaton. Durng executon of the scrpt, we store all of the smaller mages extracted around the jont regon to an output drectory. The output drectory has the form $DataDIR/$SITEID Q/$ID Q/$VISIT Q/ j o n t / where $SITEID_Q s one of the ste drectores descrbed n 5.1, $ID_Q s one of the subject d drectores under the SITEID_Q, and $VISIT_Q s one of the measurement tme ponts of that subject denoted by $ID_Q. 19

20 If the output drectory does not exst, the scrpt frst creates the drectory. The followng fles are saved under the output drectory after the scrpt has fnshed extractng the jont regon: Structural mage of ths regon: cor_t1_correct_scale The rescaled structural mage: cor_t1_correct_scale_30000 The femur bone segmentaton mask of the regon: seg_femur The tba bone segmentaton mask of the regon: seg_tba Fgure 7 shows the results for a sample query mage. 20

21 Fgure 7: Structural mage extracted around the jont regon (top), segmentaton mask for the femur bone extracted around the jont regon (mddle), and segmentaton mask for the tba bone extracted around the jont regon (bottom). 21

22 Cartlage Regstraton Just as for the bone segmentaton, we frst regster all of the atlas subjects to the query subject as a frst step of cartlage segmentaton. The scrpt frst creates a folder to save the results generated durng the cartlage regstraton of the form $DataDIR/$SITEID Q/$ID Q/$VISIT Q/ m o v e d c a r t a t l a s where $SITEID_Q s one of the ste drectores descrbed n 5.1, $ID_Q s one of the subject d drectores under the SITEID_Q, and $VISIT_Q s one of the measurement tme ponts of that subject denoted by $ID_Q. If the output drectory does not exst, the scrpt creates the output drectory frst. Once the output drectory s created (or already exsts), the followng fles are saved n the output drectory: T affne,f C : affne_femur_$id_a.tfm ĨF C : moved_mr_femur_$id_a S F C : moved_fem_$id_a T affne,t C : affne_tba_$id_a.tfm ĨT C : moved_mr_tba_$id_a S T C : moved_tb_$id_a $ID_A denotes dfferent IDs of atlas subjects. Cartlage Tssue Classfcaton We perform probablstc classfcaton to output probabltes of a voxel belongng to three classes: the femoral cartlage, the background, and the tbal cartlage. Recall that these probabltes wll be used to compute the lkelhood terms for the labelng cost n (9). The scrpt frst creates a folder of the followng form to save results of the SVM classfcaton: $DataDIR/$SITEID Q/$ID Q/$VISIT Q/ j o n t s e g e m e n t a t o n where $SITEID_Q s one of the ste drectores descrbed n 5.1, $ID_Q s one of the subject d drectores under the SITEID_Q, and $VISIT_Q s one of the measurement tme ponts of that subject denoted by $ID_Q. Then features are extracted from cor_t1_correct_scale_30000 and are saved n a fle named f_$id_$visit n the SVM folder ($ID and $VISIT denote subject d and the tme pont of the current query mage respectvely). We use the traned classfer to perform probablstc classfcaton; the output of the classfcaton s saved n a fle named p_$id_$visit under the SVM folder. The classfcaton output s then transformed to lkelhood probablty maps for the femoral cartlage and the tbal cartlage respectvely; these lkelhood maps are saved under jont_segmentaton. The followng fles are generated as a result of classfcaton: The lkelhood map for the femoral cartlage: pfem_svm The lkelhood map for the tbal cartlage: ptb_svm Fgure 8 shows the lkelhood probablty maps of the femoral cartlage and the tbal cartlage for one of queres. 22

23 Fgure 8: The classfcaton map of the femoral cartlage (top) and of the tbal cartlage (bottom). Cartlage Label Fuson Once all of the atlases are regstered to the query, we now fuse the regstered labels of the atlases to form spatal prors for the femoral cartlage and the tbal cartlage. We use non-local patch-based label fuson technques to fuse all of deformed label mages. We frst upscale both deformed structural mage and deformed segmentaton masks by a factor of 3 to make them approxmately sotropc. Then we compute 12 for each voxel locatons wth patch sze beng set to 2, neghborhood sze set to 2, and nearest neghbor set to 5. The resultng fused labels for the femoral cartlage and the tbal cartlages are downsampled to the orgnal sze. After the label fuson s fnshed, the results are saved as mages under jont_segmentaton created n the prevous step. Ths results n: Non-local patch based label fuson of the femoral cartlage: fem_fuson_patch Non-local patch based label fuson of the tbal cartlage: tb_fuson_patch Fgure 9 shows the label fuson results for the femoral and the tbal cartlage for an example query mage. 23

24 Fgure 9: The label fuson result for the femoral cartlage (top) and the tbal cartlage (bottom). Compute Normal Drectons The scrpt also computes the normal drectons for each dmenson. These normal drectons are needed because we use ansotropc regularzaton durng segmentaton. Normal drectons are saved as nx, ny, and nz under the folder where the current query mage s. Cartlage Segmentaton Once we have computed pror probabltes from label fuson and lkelhood probabltes provded by SVM, we can now compute the labelng cost for each of the classes n terms of posteror probabltes. There are two parameters g and a that control two regularzaton terms used n the optmzaton process. In our example, we set g to be 1.4 and a to be 0.2. We use the normal drectons computed prevously because we are segmentng the mages usng ansotropc regularzaton. For more detals on these parameters, please refer [3]. The scrpt saves the followng fles under the jont_segmentaton folder: Labelng cost of background: bkg_cost 24

25 Labelng cost of the femoral cartlage: fem_cost Labelng cost of the tbal cartlage: tb_cost Segmentaton mask of the femoral cartlage: seg_fem Segmentaton mask of the tbal cartlage: seg_tb Fgure 10 shows the labelng costs for background, and the femoral and tbal cartlage respectvely. Fgure 11 shows the resultng segmentatons for femur and tba. 25

26 Fgure 10: Labelng cost for the femur (top), background (mddle), and tba (bottom). 26

27 Fgure 11: Fnal segmentaton mask of the femoral cartlage (top) and the tbal cartlage (bottom). Temporal Algnment If we know the dataset s longtudnal, then we can encourage temporal consstences among resultng cartlage segmentaton masks of dfferent tme ponts. We need the followng two text fles for the longtudnal segmentaton: n_anso.txt: A text fle lstng nput fles needed for longtudnal segmentaton. Each lne corresponds to the femoral cartlage labelng cost, background labelng cost, the tbal cartlage labelng cost and normal drectons of dfferent tme ponts of a subject. out_anso.txt: A text fle lstng output fles of longtudnal segmentaton. Each lne corresponds to the longtudnal segmentaton of the femoral cartlage and the tbal cartlage of dfferent tme ponts of a subject. These text fles are automatcally generated by runnng the followng bash scrpt; please type the followng command n the termnal. sh k s r t / s c r p t / CartSeg Long Preprocess. sh 27

28 Notce that ths scrpt s run as a standard bash scrpt. Please run ths scrpt only once. After runnng CartSeg_Long_Preprocess.sh, please type the followng command n termnal to rgdly algn segmentaton masks of dfferent tme ponts. qsub s u b m t t e m p o r a l a l g n The scrpt frst creates ntermedate output folders for each subjects to store ntermedate results of the temporal algnment. It frst creates the followng folder: $DataDIR/$SITE/$ID/ jont4d (Recall that $ID and $SITE denote subject d and the ste d of the current query patent). Then the scrpt creates another folder under the jont4d folder just created to save ntermedate results of regstratons. $DataDIR/$SITE/$ID/ jont4d / transform As noted n the prevous secton (.e. secton 3.1.4) we use a seres of rgd regstratons to temporally algn segmentaton results of dfferent tme ponts to the baselne. The followng fles are the results of the frst regstraton whch s based on bone segmentaton masks. These fles are saved n the transform folder. Dfferent tme ponts of a subject are denoted by $VISIT. $VISIT_femur.tfm: Rgd transformaton computed based on femur bone segmentaton masks $VISIT_femurBased.nhdr: Rgdly transformed orgnal structural mage accordng to the above transformaton (.e., $VISIT_femur.tfm) $VISIT_femur_femurBased.nhdr: Rgdly transformed femur bone segmentaton mask accordng to the above transformaton (.e., $VISIT_femur.tfm) $VISIT_seg_fem_femurBased.nhdr: Rgdly transformed femoral cartlage segmentaton mask accordng to the above transformaton (.e., $VISIT_femur.tfm) $VISIT_fem_fuson_patch_femurBased.nhdr: Rgdly transformed femoral cartlage spatal pror map accordng to the above transformaton (.e., $VISIT_femur.tfm) $VISIT_pFem_femurBased.nhdr: Rgdly transformed femoral cartlage lkelhood map accordng to the above transformaton (.e., $VISIT_femur.tfm) $VISIT_tba.tfm: Rgd transformaton computed based on tba bone segmentaton masks $VISIT_tbaBased.nhdr: Rgdly transformed orgnal structural mage accordng to the above transformaton (.e., $VISIT_tba.tfm) $VISIT_tba_tbaBased.nhdr: Rgdly transformed tba bone segmentaton mask accordng to the above transformaton (.e., $VISIT_tba.tfm) $VISIT_seg_tb_tbaBased.nhdr: Rgdly transformed tbal cartlage segmentaton mask accordng to the above transformaton (.e., $VISIT_tba.tfm) $VISIT_tb_fuson_patch_tbaBased.nhdr: Rgdly transformed tbal cartlage spatal pror map accordng to the above transformaton (.e., $VISIT_tba.tfm) $VISIT_pTb_tbaBased.nhdr: Rgdly transformed tbal cartlage lkelhood map accordng to the above transformaton (.e., $VISIT_tba.tfm) 28

29 The followng fles are the results of the second regstraton whch s based on cartlage segmentaton masks. The rgd transformaton s computed among deformed cartlage segmentaton masks (.e., $VISIT_seg_fem_femurBased.nhdr and $VISIT_seg_tb_tbaBased.nhdr). Then ths transformaton s appled to deformed mages, deformed segmentaton masks, deformed fuson results, and deformed lkelhood maps. These fles are also saved n transform folder. $VISIT_fem.tfm: Rgd transformaton computed based on the femoral cartlage segmentaton masks $VISIT_femBased.nhdr: Rgdly transformed orgnal structural mage accordng to the above transformaton (.e., $VISIT_fem.tfm) $VISIT_femur_femBased.nhdr: Rgdly transformed femur bone segmentaton mask accordng to the above transformaton (.e., $VISIT_fem.tfm) $VISIT_seg_fem_femBased.nhdr: Rgdly transformed femoral cartlage segmentaton mask accordng to the above transformaton (.e., $VISIT_fem.tfm) $VISIT_fem_fuson_patch_femBased.nhdr: Rgdly transformed femoral cartlage spatal pror map accordng to the above transformaton (.e., $VISIT_fem.tfm) $VISIT_pFem_femBased.nhdr: Rgdly transformed femoral cartlage lkelhood map accordng to the above transformaton (.e., $VISIT_fem.tfm) $VISIT_tb.tfm: Rgd transformaton computed based on the tbal cartlage segmentaton masks $VISIT_tbBased.nhdr: Rgdly transformed orgnal structural mage accordng to the above transformaton (.e., $VISIT_tb.tfm) $VISIT_tba_tbBased.nhdr: Rgdly transformed tba bone segmentaton mask accordng to the above transformaton (.e., $VISIT_tb.tfm) $VISIT_seg_tb_tbBased.nhdr: Rgdly transformed tbal cartlage segmentaton mask accordng to the above transformaton (.e., $VISIT_tb.tfm) $VISIT_tb_fuson_patch_tbBased.nhdr: Rgdly transformed tbal cartlage spatal pror map accordng to the above transformaton (.e., $VISIT_tb.tfm) $VISIT_pTb_tbBased.nhdr: Rgdly transformed tbal cartlage lkelhood map accordng to the above transformaton (.e., $VISIT_tb.tfm) In addton to the transform folder, the scrpt creates another folder under the jont4d folder to save results of the longtudnal segmentaton. The folder name s of the followng form: $DataDIR/$SITE/$ID/ jont4d / segmentaton The scrpt computes labelng cost for the femoral cartlage, background, and the tbal cartlage based on rgdly deformed cartlage segmentaton masks, fuson results, and the lkelhood maps. Normal drectons are also computed because we are usng ansotropc regularzaton for the longtudnal segmentaton. The followng fles are saved under the segmentaton folder. $VISIT_fem_cost.nhdr: Labelng cost of the femoral cartlage $VISIT_bg_cost.nhdr: Labelng cost of the background $VISIT_tb_cost.nhdr: Labelng cost of the tbal cartlage $VISIT_nx.nhdr: Normal drecton along the frst dmenson $VISIT_ny.nhdr: Normal drecton along the second dmenson $VISIT_nz.nhdr: Normal drecton along the thrd dmenson 29

30 5.3 Longtudnal Segmentaton Please type the followng command for longtudnal three label based segmentaton wth ansotropc regularzaton. qsub submt CartSeg long The followng fles are saved under segmentaton folder. $VISIT_seg_fem_long.nhdr: Longtudnal segmentaton masks for the femoral cartlage $VISIT_seg_tb_long.nhdr: Longtudnal segmentaton masks for the tbal cartlage 5.4 Cartlage Thckness Computaton Please type the followng command to compute tssue thckness based on the longtudnal segmentaton masks. qsub submt Thckness long The scrpt wll create a folder to save ntermedate results of the followng form: $DataDIR/ t h c k Then 3D tssue thckness s computed on the results of the longtudnal segmentaton. The followng fles are saved under the thck folder. fem_$id_$visit.nhdr: 3D thckness computed on longtudnal segmentaton masks for the femoral cartlage tb_$id_$visit.nhdr: cartlage 3D thckness computed on longtudnal segmentaton masks for the tbal Then we deform each of these 3D thckness maps to the baselne of a subject pror to creatng 2D thckness maps. Ths s acheved va affne transformaton followed by B-Splne transformaton. The scrpt creates another folder to save the results of these spatal transformatons of the followng form: $DataDIR/ t h c k / transform After the transform folder s created, the followng fles are saved. affne_$id_$visit_femur.tfm bsplne_$id_$visit_femur.tfm affne_$id_$visit_tba.tfm bsplne_$id_$visit_tba.tfm After applyng the affne followed by the B-Ssplne transform, the resultng deformed 3D thckness s saved under the folder of the followng form: $DataDIR/ t h c k /moved fem_$id_$visit.nhdr: Deformed 3D thckness computed on longtudnal segmentaton masks for the femoral cartlage tb_$id_$visit.nhdr: Deformed 3D thckness computed on longtudnal segmentaton masks for the tbal cartlage 30

31 Fnally 2D thckness maps are generated va projecton of these deformed 3D thckness. The scrpt creates a folder to save these 2D projected thckness maps of the followng form: $DataDIR/ t h c k /moved 2d The followng fles are saved under moved_2d folder as a result of the computaton: fem_$id_$visit.nhdr: Projected 2D thckness computed on longtudnal segmentaton masks for the femoral cartlage tb_$id_$visit.nhdr: Projected 2D thckness computed on longtudnal segmentaton masks for the tbal cartlage 5.5 Statstcal Analyss on the Thckness Once the 2D thckness maps are generated, we use MATLAB scrpts to perform localzed analyss of changes on cartlage thckness. The Statstcal Toolbox s requred to run the analyss. To assocate the mages wth KLG grades we need to provde a textfle named lst_klg.txt. Ths fle s formatted n the followng way:... TODO... We can then run the analyss based on the followng scrpts: 1. Frst run the followng scrpt n MATLAB >> create_mask Ths scrpt wll compute a bnary mask for a regon where the majorty of pxels n the projected 2D thckness map le. The bnary mask s computed for the femoral cartlage and the tbal cartlage separately. These bnary masks are saved as fem_mask.mat (bnary mask for the femoral cartlage) and tb_mask.mat (bnary mask for the tbal cartlage). Ths scrpt also reads n prevously computed 2D thckness maps and saves as fem.mat and tb.mat. These.mat fles are saved under the mat folder whch s created f the folder does not exst. 2. Then run the followng scrpts to ft ntal lnear mxed-effects model to model dfference between OA subjects and Normal Control subjects. >> ftlme_fem >> ftlme_tb These two scrpts wll ft the models respectvely based on KLG score specfed n lst_klg.txt and 2D thckness values. Just as the prevous scrpt, these scrpts save the results n.mat fles. These scrpts save the computed models as lme_cell_fem.mat and lme_cell_tb.mat respectvely. 3. Run the followng scrpts to cluster OA subjects. >>cluster_fem >>cluster_tb We cache fxed effects, random effects, standard devatons, and p-values n.mat fles. We use a standard K-means cluster method to cluster OA subjects. The result of cluster ndces for OA subjects are saved as ndex_fem.mat and ndex_tb.mat. 4. Then fnally run the followng scrpts to ft models to each clusters. There are total of 8 scrpts to run. 31

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

A B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images

A B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images A B-Snake Model Usng Statstcal and Geometrc Informaton - Applcatons to Medcal Images Yue Wang, Eam Khwang Teoh and Dnggang Shen 2 School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

A fault tree analysis strategy using binary decision diagrams

A fault tree analysis strategy using binary decision diagrams Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6) Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst

More information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1 4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING James Moscola, Young H. Cho, John W. Lockwood Dept. of Computer Scence and Engneerng Washngton Unversty, St. Lous, MO {jmm5,

More information

Medical X-ray Image Classification Using Gabor-Based CS-Local Binary Patterns

Medical X-ray Image Classification Using Gabor-Based CS-Local Binary Patterns Medcal X-ray Image Classfcaton Usng Gabor-Based CS-Local Bnary Patterns Fatemeh Ghofran, Mohammad Sadegh Helfroush, Habbollah Danyal, Kamran Kazem Abstract As ntensty of medcal x-ray mages vares consderably

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

Detection of an Object by using Principal Component Analysis

Detection of an Object by using Principal Component Analysis Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

Assembler. Building a Modern Computer From First Principles.

Assembler. Building a Modern Computer From First Principles. Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

An Efficient Method for Deformable Segmentation of 3D US Prostate Images

An Efficient Method for Deformable Segmentation of 3D US Prostate Images An Effcent Method for Deformable Segmentaton of 3D US Prostate Images Yqang Zhan 1,2,3, Dnggang Shen 1,2 1 Sect. of Bomedcal Image Analyss, Dept. of Radology, Unversty of Pennsylvana, Phladelpha, PA dnggang.shen@uphs.upenn.edu

More information

A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION

A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION Mhaela Gordan *, Constantne Kotropoulos **, Apostolos Georgaks **, Ioanns Ptas ** * Bass of Electroncs Department,

More information

Development of an Active Shape Model. Using the Discrete Cosine Transform

Development of an Active Shape Model. Using the Discrete Cosine Transform Development of an Actve Shape Model Usng the Dscrete Cosne Transform Kotaro Yasuda A Thess n The Department of Electrcal and Computer Engneerng Presented n Partal Fulfllment of the Requrements for the

More information

Image Alignment CSC 767

Image Alignment CSC 767 Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances

More information

Feature-Area Optimization: A Novel SAR Image Registration Method

Feature-Area Optimization: A Novel SAR Image Registration Method Feature-Area Optmzaton: A Novel SAR Image Regstraton Method Fuqang Lu, Fukun B, Lang Chen, Hao Sh and We Lu Abstract Ths letter proposes a synthetc aperture radar (SAR) mage regstraton method named Feature-Area

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

A fast algorithm for color image segmentation

A fast algorithm for color image segmentation Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

Implementation of a Dynamic Image-Based Rendering System

Implementation of a Dynamic Image-Based Rendering System Implementaton of a Dynamc Image-Based Renderng System Nklas Bakos, Claes Järvman and Mark Ollla 3 Norrköpng Vsualzaton and Interacton Studo Lnköpng Unversty Abstract Work n dynamc mage based renderng has

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

More information

News. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example

News. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example Unversty of Brtsh Columba CPSC, Intro to Computaton Jan-Apr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt

More information

Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning

Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning Parallel Inverse Halftonng by Look-Up Table (LUT) Parttonng Umar F. Sddq and Sadq M. Sat umar@ccse.kfupm.edu.sa, sadq@kfupm.edu.sa KFUPM Box: Department of Computer Engneerng, Kng Fahd Unversty of Petroleum

More information

Registration of Expressions Data using a 3D Morphable Model

Registration of Expressions Data using a 3D Morphable Model Regstraton of Expressons Data usng a 3D Morphable Model Curzo Basso DISI, Unverstà d Genova, Italy Emal: curzo.basso@ds.unge.t Thomas Vetter Departement Informatk, Unverstät Basel, Swtzerland Emal: thomas.vetter@unbas.ch

More information

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like: Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A

More information

Motivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to:

Motivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to: 4.1 4.2 Motvaton EE 457 Unt 4 Computer System Performance An ndvdual user wants to: Mnmze sngle program executon tme A datacenter owner wants to: Maxmze number of Mnmze ( ) http://e-tellgentnternetmarketng.com/webste/frustrated-computer-user-2/

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

MOTION BLUR ESTIMATION AT CORNERS

MOTION BLUR ESTIMATION AT CORNERS Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter

More information

Feature-Preserving Mesh Denoising via Bilateral Normal Filtering

Feature-Preserving Mesh Denoising via Bilateral Normal Filtering Feature-Preservng Mesh Denosng va Blateral Normal Flterng Ka-Wah Lee, Wen-Png Wang Computer Graphcs Group Department of Computer Scence, The Unversty of Hong Kong kwlee@cs.hku.hk, wenpng@cs.hku.hk Abstract

More information

Assembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface.

Assembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface. IDC Herzlya Shmon Schocken Assembler Shmon Schocken Sprng 2005 Elements of Computng Systems 1 Assembler (Ch. 6) Where we are at: Human Thought Abstract desgn Chapters 9, 12 abstract nterface H.L. Language

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

THE PULL-PUSH ALGORITHM REVISITED

THE PULL-PUSH ALGORITHM REVISITED THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748

More information

Brave New World Pseudocode Reference

Brave New World Pseudocode Reference Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005 Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed

More information

RECOGNITION AND AGE PREDICTION WITH DIGITAL IMAGES OF MISSING CHILDREN

RECOGNITION AND AGE PREDICTION WITH DIGITAL IMAGES OF MISSING CHILDREN RECOGNIION AND AGE PREDICION WIH DIGIAL IMAGES OF MISSING CHILDREN A Wrtng Project Presented to he Faculty of the Department of Computer Scence San Jose State Unversty In Partal Fulfllment of the Requrements

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Title: A Novel Protocol for Accuracy Assessment in Classification of Very High Resolution Images

Title: A Novel Protocol for Accuracy Assessment in Classification of Very High Resolution Images 2009 IEEE. Personal use of ths materal s permtted. Permsson from IEEE must be obtaned for all other uses, n any current or future meda, ncludng reprntng/republshng ths materal for advertsng or promotonal

More information

Detection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature

Detection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature Detecton of hand graspng an object from complex background based on machne learnng co-occurrence of local mage feature Shnya Moroka, Yasuhro Hramoto, Nobutaka Shmada, Tadash Matsuo, Yoshak Shra Rtsumekan

More information

Help for Time-Resolved Analysis TRI2 version 2.4 P Barber,

Help for Time-Resolved Analysis TRI2 version 2.4 P Barber, Help for Tme-Resolved Analyss TRI2 verson 2.4 P Barber, 22.01.10 Introducton Tme-resolved Analyss (TRA) becomes avalable under the processng menu once you have loaded and selected an mage that contans

More information

Some Tutorial about the Project. Computer Graphics

Some Tutorial about the Project. Computer Graphics Some Tutoral about the Project Lecture 6 Rastersaton, Antalasng, Texture Mappng, I have already covered all the topcs needed to fnsh the 1 st practcal Today, I wll brefly explan how to start workng on

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Random Kernel Perceptron on ATTiny2313 Microcontroller

Random Kernel Perceptron on ATTiny2313 Microcontroller Random Kernel Perceptron on ATTny233 Mcrocontroller Nemanja Djurc Department of Computer and Informaton Scences, Temple Unversty Phladelpha, PA 922, USA nemanja.djurc@temple.edu Slobodan Vucetc Department

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Classification of Face Images Based on Gender using Dimensionality Reduction Techniques and SVM

Classification of Face Images Based on Gender using Dimensionality Reduction Techniques and SVM Classfcaton of Face Images Based on Gender usng Dmensonalty Reducton Technques and SVM Fahm Mannan 260 266 294 School of Computer Scence McGll Unversty Abstract Ths report presents gender classfcaton based

More information

ANSYS FLUENT 12.1 in Workbench User s Guide

ANSYS FLUENT 12.1 in Workbench User s Guide ANSYS FLUENT 12.1 n Workbench User s Gude October 2009 Copyrght c 2009 by ANSYS, Inc. All Rghts Reserved. No part of ths document may be reproduced or otherwse used n any form wthout express wrtten permsson

More information

Vol. 5, No. 3 March 2014 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.

Vol. 5, No. 3 March 2014 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved. Journal of Emergng Trends n Computng and Informaton Scences 009-03 CIS Journal. All rghts reserved. http://www.csjournal.org Unhealthy Detecton n Lvestock Texture Images usng Subsampled Contourlet Transform

More information