Applicability of Non-Rigid Medical Image Registration using Moving Least Squares

Size: px
Start display at page:

Download "Applicability of Non-Rigid Medical Image Registration using Moving Least Squares"

Transcription

1 010 Internatonal Journal of Computer Applcatons ( ) Applcablty of Non-Rgd Medcal Image Regstraton usng Movng Least Squares Ms.Hema P Menon Department of Computer Scence and Engneerng Amrta School of Engneerng, Combatore Dr.K.A.Narayanankutty Department of Electroncs and Comm. Engneerng Amrta School of Engneerng, Combatore ABSTRACT A drawback of the non-rgd regstraton s ts unpredctable nature of the deformaton on the target mage. Mappng every pont on mages can cause deformatons even to regons, whch are expected to reman rgd. A non-rgd regstraton s therefore desrable, that produces only local deformatons where needed, whle stll preservng the overall rgdty. Ths work focuses on one such method called the Movng Least Squares (MLS) transformaton and compares the results wth Thn Plate Splnes (TPS). An ntensty based non-rgd regstraton algorthm s appled aprory, f the nput medcal mages are from two dfferent patents n order to facltate for the selecton of homologous control ponts n them. We compare the performance of both the technques by calculatng the Target Regstraton Error (TRE) at certan ponts and results are encouragng. Keywords Movng Least Squares, Non-rgd medcal mage regstraton, Thn Plate Splnes, As-rgd-as-possble transformatons. 1. INTRODUCTION Image regstraton, a processng requrement for combnng mages (.e., mage fuson), s used extensvely n the medcal feld for montorng dsease progresson, mage guded surgery, studyng bran shft after surgery and developng medcal atlases. The process for mage regstraton nvolves two mages namely, the source and the target mages, and fndng the best deformaton feld to algn the two mages. Varous features lke ponts, lne segments and ntenstes can be used as the bass for the regstraton. Functons used to map the source mage to the target mage are called transformaton functons. It s classfed as rgd or non-rgd, based on the transformaton functon used. Unlke rgd regstratons, where the dstances between all ponts reman constant before and after the regstraton, a non-rgd regstraton nvolve more complex computatons lke local stretchng and scalng to map the two mages whch mght generate unpredctable deformatons. It s not possble to exactly specfy the mappng of each pont n the source mage to the target mage. It would thus be good to have a non-rgd regstraton technque that produces local deformatons only where needed whle stll preservng the overall rgdty of the transformaton as much as possble called as-rgd-aspossble methods. Fortunately such technques exst, and ths work focuses on one such method called the MLS transformaton []. Ths technque s relatvely recent and s better known for surface reconstructon and n computer graphcs for mage deformaton and morphng. Here, we are explorng the applcablty of the MLS technque as a pont based non-rgd regstraton technque. Methods of MLS usng affne, smlarty transformatons and rgd transformatons are presented elsewhere [].The results are compared wth TPS method, whch s another wdely used technque both qualtatvely and quanttatvely. The source and target mages consdered for regstraton are of the same modalty. To evaluate the performance of the MLS technque, D MR bran mages from the same patent and dfferent patents were consdered as the nput to the system. If the source and target mages are from the same patent, then homologous control ponts are selected from the respectve mages and are passed to each of the regstraton algorthm to get the transformed source. If the nput mages are from two dfferent patents, an ntensty based non-rgd regstraton algorthm s used for the selecton of homologous control ponts. Then the selected control ponts are appled to each of the pont based technque to obtan the regstered source. Durng ths process we can compare the performance of both the technques by calculatng the TRE at certan ponts n the mage other than the control ponts. Fgure 1: The Image Regstraton process. Steps n Image Regstraton nvolve pre-processng, feature selecton, feature correspondence, determnng and applyng a transformaton, and n many cases re-samplng of the mages [3].. MEDICAL IMAGE REGISTRATION Image regstraton has evolved ndependently n varous research areas, rangng from geo-surveyng to medcal magng, each wth a number of unque 85

2 010 Internatonal Journal of Computer Applcatons ( ) applcatons. Medcal mage analyss, n partcular, has many challengng and useful applcatons. The need for regstraton can arse when mages of a gven pece of anatomy are taken over a perod of tme and need to be compared, as s the case for the study of tumor growth or n functonal magnetc resonance magng(fmri) studes [4, 5]. Regstraton can also be used to characterze normal versus abnormal anatomcal shape varatons. For example, tumors may be regstered to normal or abnormal tumors wthn the same class. Other applcatons nclude labelng and segmentaton, n whch the mage to be labeled/segmented s regstered to a prevously labeled/segmented mage (the atlas).ths atlas regstraton crcumvents the need for explct labelng/segmentaton. The mage that needs to be compared may also be obtaned usng dfferent hardware devces, each hghlghtng a specfc part of the body (these mages are also referred to as mult-modalty mages). Examples of common mult-modalty mages n medcal magng nclude Computed Tomography (CT), X-ray magng, Postron Emsson Tomography (PET) magng, and Nuclear Magnetc Resonance (NMR) Imagng. If these mages are regstered, they can be combned (fused) n a more meanngful way to provde an ntegrated vew. Medcal mage regstraton s a very popular area of mage processng wth applcatons rangng from montorng dsease progresson [6], buldng medcal atlases [5], mage guded surgery etc [4]. A survey of the recent publcatons n the feld of medcal mage regstraton wth algorthms, valdatons and applcatons can be found n [6] and [7]. More detals about the feature selecton and correspondence, transformaton functons and evaluaton methods for -D and 3-D mage regstraton can be found n [8]. 3. NONRIGID IMAGE REGISTRATION 3.1 Normal or Body Text Non-rgd regstraton s an actve area of research n the feld of medcal mage regstraton. Ths actvty s due to the fact that one cannot decde on the best algorthm for all applcatons,.e., no unversal soluton exsts for the mappng problem and lack of a reference standard to compute the exact errors obtaned n the regstraton process [10]. Each algorthm works well under certan constrants and condtons but may not do so under a dfferent set of condtons. Crum et al [9] dscusses the varous types of non-rgd regstraton algorthms, ther concepts, applcatons and lmtatons. The man problem that non-rgd regstratons pose s that t s not possble to actually predct the deformaton feld [9]. The control ponts may be mapped exactly n the source and target mages/volume usng dfferent methods [11], but the accuracy n mappng the other ponts n the source mage/volume map onto n the target mage/volume s unpredctable. Ths s because non-rgd regstraton nvolves more transformatons than just rotaton and translaton as requred for rgd regstratons [9]. Ths work focuses on evaluatng a non-rgd regstraton technque whch allows the deformaton feld to be as-rgd-aspossble whle stll performng local stretchng deformatons. 3. As-rgd-as-possble Transformatons The concept of as-rgd-as-possble transformatons was frst ntroduced by Alexa et al [1] where an object space morphng technque that blends the nterors of objects as a smooth blendng was proposed. Ths morphng was called as-rgd-as-possble because the objects undergo mnmum dstorton durng morphng. The shape manpulaton technque presented by Igarash et al [13] s also based on as-rgd-as-possble transformatons. Frst Page Copyrght Notce 3.3 MLS Transformatons The prncple of the MLS technque s to mnmze the least squares error functon obtaned durng the mappng transformaton process. A set of control ponts are chosen and transformaton functon s obtaned for each pont n the mage and s based on a weght functon ncluded n the least squares error functon at each pont of evaluaton. Ths weght functon ensures that the effect of a control pont s seen mostly n the regons mmedately surroundng t, whle ts effect s less promnent n far off regons. The transformaton matrx of the MLS technque can nclude affne, smlarty and as-rgd-as-possble transformatons and therefore extended here for regstraton. Ths work focuses on the as-rgd-as-possble transformatons whch are capable of producng local deformatons. The transformaton functon s smooth and nterpolates the control ponts. Gven a set of control ponts on the source and target mages, the MLS technque computes the transformaton I v(x) that best mnmzes the least squares error: I( p ) q where p and q are the set of control ponts n the source and target mages respectvely. Ths transformaton however produces a sngle affne transformaton of the entre mage as there s no control over the scalng or shearng n the mage. A weghtng functon ncluded to ths least squares error fxes ths problem and thus produces a dfferent transformaton functon for each pont of evaluaton of the mage. w I( p q The weghtng functon w s of the form w p 1 v where v s the pont of evaluaton n the mage and α s the fall-of-parameter of the weghtng functon whose value decdes f the weghts computed are small or large. The weghtng functon s dependent on the pont of evaluaton and thus produces a dfferent transformaton for each pont of the mage. Hence the method s called Movng Least Squares. We can see that as v approaches the control ponts, 86

3 010 Internatonal Journal of Computer Applcatons ( ) the weght approaches nfnty and the transformaton functon nterpolates. The transformaton functon can be solved as a smple lnear transformaton matrx, M and a translaton vector, T as: I v ( x) xm T The transformaton matrx M can be modfed to nclude affne, smlarty and rgd transformatons. To perform as-rgd-as-possble transformatons, the matrx, M must be constraned to satsfy the condton for rgdty M'M=I. The translaton component can be easly computed by: T q p M where control ponts gven by: are the weghted centrods of the The transformaton functon can now be calculated as: The least squares problem can be wrtten as: where p and pˆ q I v ( x) ( x p) M q p w pˆ M The transformaton matrx for the as-rgd-aspossble transformatons can be obtaned by elmnatng the scalng constant. The soluton s smple and closed form. It can be obtaned easly by a slght modfcaton of the smlarty transformaton for whch the transformaton matrx must satsfy the condton, M 1 M =M 1M =λ I, where λ s some constant and M 1 and M are the columns of M and are vectors of sze x1. M 1 and M have the relatonshp such that, For rgdty condton to be satsfed, M M=I, the scalng constants needs to be removed. By usng partal dervatves wth respect to the free varables n M and substtutng the values back nto the error functon the optmum transformaton functon s obtaned as: r where removes any scalng and thus produces as-rgd-as possble transforms. qˆ w p p and q w p ( x, y) ( y, x) ˆ and q w qˆ pˆ T M M 1 q q w qˆ pˆ w q T w The non-rgd regstraton technque evaluated n ths paper, the MLS transformaton s escrbed n [11]. Though ths paper s buld on technque descrbed by Igarash t ams at achevng faster deformatons. For ths purpose we propose the transformaton of objects by usng lnear MLS. No trangulaton of the nput s needed n ths case and the transformaton can be computed at each pont n the mage. The transformatons acheved usng rgdty constrants are as-rgd-as-possble wth mnmum nonlnear shearng and non-unform scalng, whch s a property of MLS transforms, thus makng t a sutable canddate for applcatons n medcal mage regstraton where rgd regstratons are nsuffcent and non-rgd regstratons are necessary to algn features of the mage. 3.4 Thn Plate Splne Transformatons Thn-plate splnes are a part of the splne famly wth radal bass functons as the nterpolatng functon. They produce smooth and closed form transformatons and have been used extensvely n mage deformaton. Thnplate Splnes have been used n remote sensng for mappng mages. Goshtasby et al [8] descrbes how the thn-plate splnes can be used n mage deformaton for remote sensng mages. Hs book on D and 3D regstratons also descrbes the TPS transformaton functon and t applcatons [14]. Though the TPS produces smooth transformatons, the man dsadvantage of the technque s that each control pont n the mage has a global effect on the transformaton and thus even f one pont s perturbed all other ponts n the mage do not get mapped correctly [9]. The work by Booksten et al [15] also descrbes the theory behnd TPS transformatons and how t can be used n medcal mage processng. Numerous papers have been publshed n the medcal mage processng area usng the TPS algorthm n mage regstraton [16, 17]. The TPS algorthm can be used to obtan an elastc transformaton to map the source mage to the target mage. Rohr et al [18] uses the TPS as a technque to obtan elastc regstraton of bran mages takng nto account the errors at the landmark ponts n the mages. The method proposed n ths paper s applcable to D and 3D MR mages. Ths paper establshes that the MLS transformaton technque can be used as an alternate to the TPS transformaton technque and can perform better due to ts as-rgd-as-possble nature. Ths could enable the MLS technque to be used n applcatons lke constructng medcal atlases, studyng the progresson of dseases, postoperatve shft of bran and other such applcatons where the TPS technque has been used so far. 4. IMPLEMENTATION DETAILS The overall system for the non-rgd regstraton of the medcal mages obtaned from the same patents usng the MLS and TPS technques s shown n fgure 4.1. For each par of the source and target mages frst of all a set of homologous control ponts are extracted. These control ponts from the source and the target are taken as the nput to the Movng least Squares (MLS) and Thn Plate Splne (TPS) algorthms, whch wll fnd out a transformaton functon for each pxel poston n the source mage to 87

4 010 Internatonal Journal of Computer Applcatons ( ) obtan the regstered source. In the case of mages taken from two dfferent patents, t s dffcult to dentfy homologous control ponts. As these ponts play the most mportant role n the regstraton process t becomes necessary to accurately obtan homologous control ponts from the source and target mages. Intally two mages of the same modalty S and T from two dfferent patents were gven as the nput to the system. The two mages were regstered usng an ntensty based method. The deformaton functon thus obtaned was appled to the source mage S to get the new transformed mage T. T has homologous ponts to the source S. The transformed source mage T obtaned by the ntensty based regstraton algorthm was used as the new target mage for the pont based regstraton process. In ths case we can quanttatvely evaluate the performance of the two technques by computng the Target Regstraton Error(TRE) as shown n the followng fgure Intensty Based Non-Rgd Regstraton Algorthm Here an error functon s estmated usng Taylorseres expanson, n order to smplfy the mnmzaton. A more accurate estmate of the actual error functon can be determned usng a Newton-Raphson style teratve scheme. In partcular, on each teraton, the estmated transformaton s appled to the source mage, and a new transformaton s estmated between the newly warped source and target mage. As few as fve teratons greatly mprove the fnal estmate. Secondly, the requred spatal/temporal dervatves have fnte support, thus fundamentally lmtng the amount of moton that can be estmated. A coarse-tofne scheme s adopted n order to contend wth larger motons []. A Gaussans pyramd s bult for both source and target mages and the local affne parameters are estmated at the coarsest level. These parameters are used to warp the source mage n the next level of the pyramd. A new estmate s computed at ths level, and the process repeated through each level of the pyramd. The transformatons at each level of the pyramds are accumulated yeldng a sngle fnal transformaton. Ths multscale approach s crtcal gven the dfferental nature of our measurements, allowng us to regster mages wth larger motons. Fnally the estmaton of the spatal/temporal dervatves s crucal step. Spatal/temporal dervatves of dscretely sampled mages are often computed as dfferences between neghbourng sample values. Such dfferences are typcally poor approxmatons to dervatves and lead to substantal errors. In computng dervatves we employ a set of dervatve flters specfcally desgned for mult-dmensonal dfferentaton [3]. The spatal/temporal dervatves are estmated as follows. The mages are frst pre-fltered n tme(usng the two-tap flter( [ ] ).The dervatve n x s then estmated by pre-flterng the result n y (usng the 3-tap pre-flter [ ] ), followed by dfferentatng n x (usng the dervatve flter[ ]).Smlarly the dervatve n y s estmated by frst pre-flterng the result n x (usng the 3-tap preflter [ ]), followed by dfferentatng n y (usng the dervatve flter [ ]).The dervatve n tme s estmated by frst preflterng n space (n x and y) usng the 3-tap pre-flter [ ]), followed by applyng the two-tap dervatve flter [ ] n tme to the result. These flters sgnfcantly mprove the resultng regstraton. System overvew for the regstraton algorthm s splt nto three sectons as depcted n Fgure 3. It depcts the multscale estmaton of the regstraton map, from a coarse to fne scale. The multscale regstraton algorthm proceeds as follows. The source and target mages at the coarsest scale are regstered to obtan an ntal estmaton of the regstraton map [10]. Ths ntal estmate s used to warp the source mage at the next scale. The warped source mage s then regstered wth ts correspondng target mage. Ths process repeated at each level of the pyramd. A sngle regstraton map s obtaned by accumulatng successve estmated regstraton maps at each scale. Ths multscale regstraton approach allows us to recover large motons as well as small motons. Wthn each scale, the regstraton map s determned n an teratve fashon. After an ntal estmaton of the regstraton parameters the source mage s warped wth the estmated parameters and regstered agan wth the target mage. Durng each of these teratons, successve ntermedate regstraton maps are accumulated to form a sngle regstraton map [4]. The teratons are stopped when the average dsplacement of the estmated moton s less than 0.1 pxels. Wthn each scale, and wthn each accuracy-teraton, a smooth regstraton map s obtaned as follows. Gven source and target mage, an estmate of the regstraton map wthout smoothness s frst obtaned. Fgure 3: System dagram Intensty Based Non Rgd Regstraton Ths ntal estmate s used to bootstrap the nonlnear teratve estmaton of the smooth regstraton 88

5 010 Internatonal Journal of Computer Applcatons ( ) map []. These regstratons are referred to as smoothness-teratons. These three components together form the complete regstraton algorthm. 4.. Control Pont Selecton Control pont selecton s an mportant aspect n pont based mage regstraton technque. For good regstraton results t s necessary to select these control ponts as accurately as possble. Control ponts are selected from the source and target mages by the user. Anatomcally smlar structures from the two mages are usually selected as the control ponts. After the selecton process t s appled to both the regstraton algorthm to obtan the regstered source Target Regstraton Error (TRE) Wthout quanttatve evaluaton, no regstraton method can be accepted for practcal utlzaton. The Target Regstraton Error (TRE) s one such method whch s the dsplacement between two correspondng ponts after regstraton,.e., after one of the ponts has been subjected to the regsterng transformaton. A lower TRE ndcates a better method. The word target n the name of ths error measure s meant to suggest that the error s beng measured at an anatomcal poston that s the target of some nterventon or dagnoss. Such errors would be expected to be more meanngful than errors measured at ponts wth no ntrnsc clncal sgnfcance. Let p represent a pont n the frst mage of a par to be regstered, and q a pont n the second mage. A regstraton method appled to ths par leads to a transformaton T that, wthout loss of generalty, regsters the frst mage to the second. The dfference between the two vectors representng the transformed pont and the correspondng pont gves the target regstraton error. Thus, TRE = T (p) q, whch s nothng but the regstraton error at that pont and s computed as the dsparty n the poston of two correspondng ponts after regstraton. A low TRE thus ndcates a better method. 5. EXPERIMENTAL RESULTS 5.1. Datasets Used Ths secton presents the results for evaluaton of two dmensonal mages usng the MLS and TPS technques. We use two dmensonal Magnetc Resonance mages (MR) of bran from same patents as well as dfferent patents for performng the regstraton. The datasets used are jpeg mages of sze 56x Quanttatve Analyss- Performance Metrcs Qualtatve (Vsual) comparsons are not suffcent to evaluate the performance of any algorthm, quanttatve evaluatons have to be made. For ths purpose the target regstraton error (TRE) was computed at certan ponts n the mage for both the methods. The target regstraton error at any pont, whch s nothng but the regstraton error at that pont, s computed as the dsparty n the poston of two correspondng ponts after regstraton [0,9]. To compute the TRE, three ponts (namely A, B and C) at random was selected on the nternal structures of the bran as shown n the Fgure 4(a & b).the TRE at these ponts A, B and C, shown on the source mage, was computed by fndng the ponts they mapped to on the MLS and TPS regstered mages. Snce the ponts correspondng to A, B and C could be found on the target mage by usng the Intensty based non-rgd regstraton Algorthm comparsons could be made on the resultng TRE s for the two methods. Table 1 shows the resultng TRE values for the two methods. Table 1: Comparson of MLS and TPS Fgure 4(a:d) Shows the Regstraton of D MR Bran Images wth ponts marked wth Yellow, Whte and Blue used to calculate TRE. Fgure 4 (a) Source Image wth 1 Control Ponts Fgure 4 (c) Regstraton -MLS Fgure 4 (b) Target Image wth 1 Control Ponts Fgure 4 (d) Regstraton - TPS 89

6 010 Internatonal Journal of Computer Applcatons ( ) 5.3. Computatonal Aspects for MLS and TPS The MLS and TPS algorthm were mplemented n Matlab. The MLS algorthm nvolves fndng the transformaton at each pont n the mage and thus has a longer computaton tme as seen n Table. One way to reduce the computaton tme would be to decmate the mage or volume usng a grd and apply the deformaton to each vertex of the grd nstead of each pont and nterpolatng the other ponts usng blnear nterpolaton. TPS transformatons are computatonally less tme consumng Observatons If the control ponts are unformly dstrbuted n both the source and target, t s dffcult to vsually analyse the performance of both the algorthms. In ths case both the algorthms wll gve vsually smlar results. Hence the Target Regstraton Error (TRE) s used as a quanttatve metrc to evaluate the performance of both the technques. stretchng caused n the spne regon along wth the stretchng seen near the head regon. Thus t can be sad that non-unform placement of control ponts affects the deformaton feld mnmally n case of the MLS technque than the TPS technque whch showed more stretchng. Fgure 5 (a) Source and Target Image wth 7 Control Ponts Table : Executon Tme for MLS and TPS Algorthm Based on Number of Control Ponts A lower TRE ndcates a better method. Here three ponts other than the control ponts are randomly selected from the source and target. Then the TRE value s calculated. In each case t was found that the TRE for MLS technque s low as compared to TPS. The executon tme for both the methods by varyng the number of control ponts ndcates that TRE perform faster than MLS. Even f the executon tme of TPS s faster compared to MLS, the later wll gve less error durng the regstraton. So we can conclude that MLS technque s quanttatvely better than TPS algorthm Qualtatve Analyss Qualtatve analyss s done based on Human Percepton. To evaluate the performance of the two technques based on the placement of control ponts, the homologous control ponts were selected only on the spne leavng out the other regons as shown n fgure 5 (a) and (b). The regstraton result usng MLS and TPS technques can be seen n fgure 5(c) and (d). It was observed that even though control ponts were not placed n the head regon, the MLS technque produced a qualtatvely better result. Ths technque dd not show any non-unform scalng or stretchng and also produced an as-rgd-as-possble transformaton. The TPS transformaton was seen to stretch the mage unnaturally. In ths case too, we observed the Fgure 5 (b) Regstraton MLS Fgure 5 (c) Regstraton - TPS To show that MLS can be used as a better technque for non-rgd regstraton whle mantanng the overall rgdty of the mage the two technques were also evaluated by usng a lmted number of control ponts. Usng more control ponts wll produce equally good results for the two methods snce ths allows more control over the deformaton feld. Fgure 6 (a) shows the source and target mages wth 3 control ponts placed on the head regon. The results of the two regstraton technques can be seen n the Fgure 6 (b) and (c). A vsual nspecton of the two transformatons showed that the MLS algorthm produces a qualtatvely better mage than the TPS method. The MLS transformaton was observed to map the source to the target mage wth mnmal stretchng, due to ts as-rgd-as-possble transformaton ablty, whle the TPS transformaton was observed to cause more stretchng across shape. If the number of control ponts selected are less or f they are not unformly dstrbuted the Thn Plate Splne (TPS) regstraton algorthm fals. But n both the scenaros MLS technque wll produce vsually good results than TPS. 6. CONCLUSIONS In ths work we have appled an nterpolatng non-rgd regstraton technque.e., Movng Least Squares and compared the results both quanttatvely and qualtatvely wth another pont based technque.e., Thn Plate Splnes. MLS technque was found to be a good 90

7 010 Internatonal Journal of Computer Applcatons ( ) canddate for non-rgd regstraton for a gven number of control ponts than thn plate splnes. A theoretcal ncety of the MLS technque s that the deformaton feld s as rgd as possble, gven the constrant that the control ponts are to be nterpolated. Fgure 6 (a) Source and Target Image wth 3 Pvots Fgure 6 (b) Regstered Source- ML Fgure 6 (c) Regstered Source -TPS Ths can offer advantages over other non-rgd regstraton methods, partcularly those where bony structures should be mnmally deformed durng regstraton. Non-rgd regstratons often produce unwanted stretchng n the mages and the unpredctable nature of the deformaton feld poses a major drawback whch makes an algorthm wth the ablty to produce as-rgd-as-possble transformatons attractve. The as-rgd-as-possble nature of the MLS technque thus makes t a sutable canddate for non-rgd regstratons as t provdes a transformaton that mantans the rgdty of structures that need to reman nondeformed, whle producng local deformatons. The overall rgdty of the mage s mantaned better wth the MLS method. Ths can be seen clearly n the example of the D MR bran mages taken from the same patents. Certan structures of the bran n the source mage s deformed to match the target mage whle the other regons of the mage reman mnmally affected thus mantanng the global rgdty whle performng local deformatons. The results show that there are no unwanted stretchng and shearng n the mage. Ths s because the effect of the control ponts on each pxel locaton s weghted by a weght functon. The results for the regstraton of D MR human bran mages of dfferent patents s used for qualtatve comparson. A quanttatve evaluaton s done by comparson of the target regstraton error (TRE).It shows that the MLS method has lower error values. Selectng the control ponts forms an mportant aspect of mage regstraton. Thus t becomes necessary to select these control ponts as accurately as possble. Any error n ths placng of ponts affects the fnal regstraton result. Ths s more pronounced n case of the TPS transformaton as each pont has a global effect on the deformaton feld. From the results obtaned for the MLS transformaton we observed that the as-rgd-as-possble nature of transformaton produces an acceptable deformaton even f one or two control ponts are not placed accurately. Ths s because of the weghtng functon on the least squares error functon. Ths weghtng functon ensures that the effect of the control pont n regons far away from t s less affected. The MLS transformaton nvolves computng the transformaton at each pont n the mage or volume. Ths leads to a longer computaton tme though t produces good results. One way to reduce the computaton tme would be to decmate the mage wth a grd and computng the transformaton only at the grd vertces and nterpolatng the other pont n the mage usng an nterpolaton technque lke blnear nterpolaton. The MLS method can be used for producng even better regstraton results. In the future we would lke to evaluate the performance of the MLS algorthm by modfyng the weght parameter. Study can also be made by examnng the results by usng dfferent dstance functons to see the varaton of rgdty n the deformaton. Another area of nterest would be to study the effect of perturbaton of the control ponts. Research can be carred out n future to fnd out ways for optmzng the MLS algorthm by automatng the process of control pont selecton. 7. REFERENCES [1] J. Mantz and M. Vergever, A survey of medcal mage regstraton, n Medcal Image Analyss, pp. 1 36, March [] R. Kollur, Provably good movng least squares, n Proc. of Internatonal Conference on Informaton Processng n Medcal Imagng, pp , 005. [3] H.Chu and A. Rangarajan, A new pont-matchng algorthm for non-rgd regstraton, n IEEE Internatonal Conference on Computer Vson and Image Understandng, pp , 003. [4] F. Sauer, Image regstraton: Enablng technology for mage guded surgery and therapy, n IEEE Transactons on Engneerng n Medcne and Bology Socety, pp , 005. [5] A.W. Toga and P.M. Thompson, Handbook of medcal magng, 1 st ed., 000. [6] P. Freeborough and N. Fox, Modelng bran deformatons n alzhemer dsease by flud regstraton of seral 3d mr mages, Journal of Computer Asssted Tomogra- phy, vol., pp , [7] M. Sonka and M. Ftzpatrck, Handbook of medcal magng, Medcal Image Processng and Analyss, SPIE Press Monograph, vol., pp ,

8 010 Internatonal Journal of Computer Applcatons ( ) [8] A. Goshtasby, Regstraton of mages wth geodesc dstorton, n IEEE Transactons on Geoscence and Remote Sensng, pp , January [9] W. Crum and T. Hartkens, Non-rgd mage regstraton: Theory and practce, The Brtsh Journal of Radology, vol. 77, pp , December 004. [10] J. Hajnal and D. Hawkes, Medcal Image Regstraton. CRC Press, ed., 001. [11] S. Schaefer and J. Warren, Image deformaton usng movng least squares, n ACM Transactons on Graphcs, p. 533â540, July 006. [1] M. Alexa and D. Levn, As-rgd-as-possble shape nterpolaton, n Proceedngs of ACM SIGGRAPH, pp , 000. [13] T. Igarash and J. Hughes, As-rgd-as-possble shape manpulaton, n ACM Transactons on Graphcs, vol. 4, pp , Aprl 005. [14] A. Goshtasby, D and 3D medcal regstraton for medcal, remote sensng, and ndustral applcatons, n IEEE Transactons on Geoscence and Remote Sensng, vol. 6, pp , Aprl 005. [15] F. Booksten, Prncpal warps: Thn-plate splnes and the decomposton of deformatons, n IEEE Transactons on Pattern Analyss and Machne Intellgence, pp , June [16] H. Park and C. Meyer, Constructon of an abdomnal probablstc atlas and ts applcaton n segmentaton, n IEEE Transactons on Medcal Imagng, pp , Aprl 003. [17] H.J.Johnson and G. E. Chrstensen, Landmark and ntensty based, consstent thn-plate splne mage regstraton, n Proc. of Internatonal Conference on Informaton Processng n Medcal Imagng, vol. 08, pp , 001. [18] K. Rohr and M. H. Kuhn, Landmark-based elastc regstraton usng approxmat- ng thn-plate splnes, n IEEE Transactons on Medcal Imagng, pp ,001. [19] Y. Zhu and S. Gortler, 3d deformaton usng movng least squares, Harvard Computer Scence Techncal Report, pp , 007. [0] K. Rohr and M.Fornefett, Splne-based elastc mage regstraton: ntegraton of landmark errors and orentaton attrbutes, n IEEE Transactons on Computer Vson and Image Understandng, pp , 003. [1] G. Rohde and B. Dawant, The adaptve bases algorthm for ntensty-based non- rgd mage regstraton, n IEEE Transactons on Medcal Imagng, pp , Aprl 003. [] Senthl Peraswamy, Hany Fard: Medcal Image Regstraton wth Partal Data,IEEE Transactons on Medcal Imagng 006. [3] C.Davatzkos, Spatal transformaton and regstraton of bran mages usng elastcally deformable models, Computer Vson and Image Understandng: CVIU, 66():07-, [4] L. Zagorchev and A. Goshtasby, A compartve study of transformaton functons for nonrgd mage regstraton, IEEE Transactons on Image Processng, 15(3):59 538, March 006. [5] S.Peraswamy and H.Fard, Elastc regstraton n the presence of ntensty varatons, IEEE Transactons on Medcal Imagng, (7): , July

EVALUATION OF MOVING LEAST SQUARES AS A TECHNIQUE FOR NON- RIGID MEDICAL IMAGE REGISTRATION. Vijayalakshmi Sathyanarayanan. Thesis

EVALUATION OF MOVING LEAST SQUARES AS A TECHNIQUE FOR NON- RIGID MEDICAL IMAGE REGISTRATION. Vijayalakshmi Sathyanarayanan. Thesis EVALUATION OF MOVING LEAST SQUARES AS A TECHNIQUE FOR NON- RIGID MEDICAL IMAGE REGISTRATION By Vjayalakshm Sathyanarayanan Thess Submtted to the Faculty of the Graduate School of Vanderblt Unversty n partal

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

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

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

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

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

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

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

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

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

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

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

University of Erlangen-Nuremberg. Cauerstrae 7, Erlangen, Germany. and edges. Each node is labeled by a feature vector that characterizes

University of Erlangen-Nuremberg. Cauerstrae 7, Erlangen, Germany. and edges. Each node is labeled by a feature vector that characterizes Deformable Templates for the Localzaton of Anatomcal Structures n Radologc Images Wolfgang Sorgel and Bernd Grod Telecommuncatons Laboratory Unversty of Erlangen-Nuremberg Cauerstrae 7, 91058 Erlangen,

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 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

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

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

A NEW IMPLEMENTATION OF THE ICP ALGORITHM FOR 3D SURFACE REGISTRATION USING A COMPREHENSIVE LOOK UP MATRIX

A NEW IMPLEMENTATION OF THE ICP ALGORITHM FOR 3D SURFACE REGISTRATION USING A COMPREHENSIVE LOOK UP MATRIX A NEW IMPLEMENTATION OF THE ICP ALGORITHM FOR 3D SURFACE REGISTRATION USING A COMPREHENSIVE LOOK UP MATRIX A. Almhde, C. Léger, M. Derche 2 and R. Lédée Laboratory of Electroncs, Sgnals and Images (LESI),

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

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

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons

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

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

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

IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH

IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH Jyot Joglekar a, *, Shrsh S. Gedam b a CSRE, IIT Bombay, Doctoral Student, Mumba, Inda jyotj@tb.ac.n b Centre of Studes n Resources Engneerng,

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

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

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

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:

More information

Multi-view 3D Position Estimation of Sports Players

Multi-view 3D Position Estimation of Sports Players Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem

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

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

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

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

An efficient method to build panoramic image mosaics

An efficient method to build panoramic image mosaics An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract

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

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

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

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

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

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

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

Feature-based image registration using the shape context

Feature-based image registration using the shape context Feature-based mage regstraton usng the shape context LEI HUANG *, ZHEN LI Center for Earth Observaton and Dgtal Earth, Chnese Academy of Scences, Bejng, 100012, Chna Graduate Unversty of Chnese Academy

More information

Multi-stable Perception. Necker Cube

Multi-stable Perception. Necker Cube Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008

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

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm 01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc

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

Inverse-Polar Ray Projection for Recovering Projective Transformations

Inverse-Polar Ray Projection for Recovering Projective Transformations nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced

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

Structure from Motion

Structure from Motion Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton

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

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

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

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

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

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

Video Object Tracking Based On Extended Active Shape Models With Color Information

Video Object Tracking Based On Extended Active Shape Models With Color Information CGIV'2002: he Frst Frst European Conference Colour on Colour n Graphcs, Imagng, and Vson Vdeo Object rackng Based On Extended Actve Shape Models Wth Color Informaton A. Koschan, S.K. Kang, J.K. Pak, B.

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

Robust registration between cardiac MRI images and atlas for segmentation propagation

Robust registration between cardiac MRI images and atlas for segmentation propagation Robust regstraton between cardac MRI mages and atlas for segmentaton propagaton X. Zhuang *a, D. J. Hawkes a, W. R. Crum a, R. Boubertakh b, S. Urbe b, D. Atknson a, P. Batchelor b, T. Schaeffter b, R.

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

SIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT

SIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT SIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT Helmut Pottmann a, Stefan Leopoldseder a, Mchael Hofer a a Insttute of Geometry, Venna Unversty of Technology, Wedner Hauptstr. 8 10, A 1040 Wen,

More information

What are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry

What are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry Today: Calbraton What are the camera parameters? Where are the lght sources? What s the mappng from radance to pel color? Why Calbrate? Want to solve for D geometry Alternatve approach Solve for D shape

More information

The Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b

The Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b 3rd Internatonal Conference on Materal, Mechancal and Manufacturng Engneerng (IC3ME 2015) The Comparson of Calbraton Method of Bnocular Stereo Vson System Ke Zhang a *, Zhao Gao b College of Engneerng,

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

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

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

Non-Rigid Registration and Correspondence Finding in Medical Image Analysis Using Multiple-Layer Flexible Mesh Template Matching

Non-Rigid Registration and Correspondence Finding in Medical Image Analysis Using Multiple-Layer Flexible Mesh Template Matching Non-Rgd Regstraton and Correspondence Fndng n Medcal Image Analyss Usng Multple-Layer Flexble Mesh Template Matchng Janhua Yao, Russell Taylor 2. Dagnostc Radology Department, Clncal Center, Natonal Insttutes

More information

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS Davd Belton Cooperatve Research Centre for Spatal Informaton (CRC-SI) The Insttute for

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

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

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

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Target Tracking Analysis Based on Corner Registration Zhengxi Kang 1, a, Hui Zhao 1, b, Yuanzhen Dang 1, c

Target Tracking Analysis Based on Corner Registration Zhengxi Kang 1, a, Hui Zhao 1, b, Yuanzhen Dang 1, c Advanced Materals Research Onlne: 03-09-8 ISSN: 66-8985, Vols. 760-76, pp 997-00 do:0.408/www.scentfc.net/amr.760-76.997 03 Trans Tech Publcatons, Swtzerland Target Trackng Analyss Based on Corner Regstraton

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

Parameterization of Quadrilateral Meshes

Parameterization of Quadrilateral Meshes Parameterzaton of Quadrlateral Meshes L Lu 1, CaMng Zhang 1,, and Frank Cheng 3 1 School of Computer Scence and Technology, Shandong Unversty, Jnan, Chna Department of Computer Scence and Technology, Shandong

More information

Face Detection with Deep Learning

Face Detection with Deep Learning Face Detecton wth Deep Learnng Yu Shen Yus122@ucsd.edu A13227146 Kuan-We Chen kuc010@ucsd.edu A99045121 Yzhou Hao y3hao@ucsd.edu A98017773 Mn Hsuan Wu mhwu@ucsd.edu A92424998 Abstract The project here

More information

An Efficient Background Updating Scheme for Real-time Traffic Monitoring

An Efficient Background Updating Scheme for Real-time Traffic Monitoring 2004 IEEE Intellgent Transportaton Systems Conference Washngton, D.C., USA, October 3-6, 2004 WeA1.3 An Effcent Background Updatng Scheme for Real-tme Traffc Montorng Suchendra M. Bhandarkar and Xngzh

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

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

New dynamic zoom calibration technique for a stereo-vision based multi-view 3D modeling system

New dynamic zoom calibration technique for a stereo-vision based multi-view 3D modeling system New dynamc oom calbraton technque for a stereo-vson based mult-vew 3D modelng system Tao Xan, Soon-Yong Park, Mural Subbarao Dept. of Electrcal & Computer Engneerng * State Unv. of New York at Stony Brook,

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Model-Based Bundle Adjustment to Face Modeling

Model-Based Bundle Adjustment to Face Modeling Model-Based Bundle Adjustment to Face Modelng Oscar K. Au Ivor W. sang Shrley Y. Wong oscarau@cs.ust.hk vor@cs.ust.hk shrleyw@cs.ust.hk he Hong Kong Unversty of Scence and echnology Realstc facal synthess

More information

A Robust Method for Estimating the Fundamental Matrix

A Robust Method for Estimating the Fundamental Matrix Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

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

Object-Based Techniques for Image Retrieval

Object-Based Techniques for Image Retrieval 54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the

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

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros. Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both

More information