A Robust Parametric Method for Bias Field Estimation and Segmentation of MR Images

Size: px
Start display at page:

Download "A Robust Parametric Method for Bias Field Estimation and Segmentation of MR Images"

Transcription

1 A Robust Parametrc Method for Bas Feld Estmaton and Segmentaton of MR Images Chunmng L, Chrs Gatenby,LWang 2, John C. Gore Vanderblt Unversty of Imagng Scence, Nashvlle, TN 37232, USA 2 Nanjng Unversty of Scence and Technology, Nanjng, Chna lchunmng@gmal.com Abstract Ths paper proposes a new energy mnmzaton framework for smultaneous estmaton of the bas feld and segmentaton of tssues for magnetc resonance mages. The bas feld s modeled as a lnear combnaton of a set of bass functons, and thereby parameterzed by the coeffcents of the bass functons. We defne an energy that depends on the coeffcents of the bass functons, the membershp functons of the tssues n the mage, and the constants approxmatng the true sgnal from the correspondng tssues. Ths energy s convex n each of ts varables. Bas feld estmaton and mage segmentaton are smultaneously acheved as the result of mnmzng ths energy. We provde an effcent teratve algorthm for energy mnmzaton, whch converges to the optmal soluton at a fast rate. A salent advantage of our method s that ts result s ndependent of ntalzaton, whch allows robust and fully automated applcaton. The proposed method has been successfully appled to 3-Tesla MR mages wth desrable results. Comparsons wth other approaches demonstrate the superor performance of ths algorthm.. Introducton In quanttatve processng and analyss of magnetc resonance (MR) mages, major dffcultes arse from varatons n ntensty due to B and B0 feld nhomogenetes. Such ntensty non unformtes cause ntensty varatons even for a sngle tssue, whch may mslead many mage analyss algorthms, such as segmentaton and regstraton. Therefore, correcton for such ntensty nhomogenetes s often a mandatory step before quanttatve analyss of the mage data. Bas correcton methods can be broadly categorzed nto two classes: prospectve methods [9, 6] and retrospectve methods [8, 6, 4,, 8]. Prospectve methods try to avod ntensty nhomogenety n the acquston process by usng specal hardware or specfc sequences. These methods are able to correct some of the ntensty nhomogenety caused by the MR scanner. However, they cannot correct for sources of nhomogenety that are patent dependant, whch makes them of lmted value for clncal use [0]. In contrast to the prospectve methods, retrospectve methods rely exclusvely on the nformaton wthn the acqured mage and thus can be appled to remove patent dependant effects. One of the most popular types of methods for bas feld correcton are segmentaton based approaches [8, 7, 4,, 8, 9]. In these methods, the tasks of bas feld correcton and segmentaton are nterleaved n an teratve process such that they beneft from each other to yeld better results. In [8], Wells et al. developed an approach based on an expectaton-maxmzaton (EM) algorthm for nterleaved bas feld correcton and segmentaton. Ths method was later mproved by Gullemaud and Brady n [ 4]. However, methods based on the EM algorthm requre a good ntalzaton for ether the bas feld or for the classfcaton estmate [5]. They typcally requre manual selectons of representatve ponts for each tssue class to perform ntalzaton. Such ntalzatons are subjectve and often rreproducble [7]. Moreover, the fnal correcton and segmentaton are senstve to the specfc choces of ntal condtons [, 5, 7]. Based on the EM framework n [8], Leemput et al. [7] proposed an explct parametrc model of the bas feld. Instead of manual nterventon, ther method used a dgtal bran atlas that provdes a pror probablty maps for whte matter (WM), gray matter (GM), and cerebrospnal flud (CSF). Although ths method s clamed to be more robust than the method of Wells et al., the ntalzaton of the parameters remans crtcal [5]. In [], Pham and Prnce proposed an energy mnmzaton approach for segmentaton and bas feld estmaton n whch a fuzzy C-means (FCM) algorthm was used for segmentaton. In ther proposed energy functon, a term was ntroduced to ensure the smoothness of the computed bas feld. The coeffcent of the smoothng term s, however, sometmes dffcult to ad /09/$ IEEE 28

2 just for desrable results [7]. In addton, ths method s also computatonally ntensve [2], due to the ntroducton of the bas feld smoothng term. In ths paper, we propose a new energy mnmzaton approach for jont bas feld estmaton and tssue segmentaton. A bas feld s modeled as a lnear combnaton of smooth bass functons, and hence parameterzed as the coeffcents of the bass functons. We defne an energy that depends on the coeffcents of the bass functons, the membershp functons of the tssues n the mage, and the constants approxmatng the true sgnal from the correspondng tssues. Ths energy s convex n each of ts varables. Bas feld estmaton and mage segmentaton are smultaneously acheved as the result of mnmzng ths energy. A salent advantage of our method s that ts result s ndependent of ntalzaton, whch allows robust and fully automated applcaton. 2. Problem Formulaton and an Energy Mnmzaton Method The ntensty nhomogenety n an MR mage can be modeled as a multplcatve component of an observed mage descrbed by I(x) = b(x) J(x)+n(x) () where I(x) s the measured mage ntensty at locaton (voxel) x, J s the true sgnal to be restored, b s an unknown bas feld, n s addtve nose. Ideally, the true sgnal J from each tssue should take a specfc value of the physcal property beng measured (e.g. the proton densty for MR mages). Therefore, t can be assumed that the true sgnal J s pecewse approxmately constant. More specfcally, we assume that there are N tssues n the regon of nterest, denoted by, and that the true sgnals J orgnated from the -th tssue are approxmately a constant c. The bas feld b s commonly assumed to be slowly varyng. It s our goal to estmate the unknown bas feld b and true sgnal J from the measured mage I. In ths work, the bas feld s estmated by a lnear combnaton of a set of bass functons. Let g,,g M be a set of bass functons defned on. We estmate the bas feld by a lnear combnaton of the bass functons b(x) = M w k g k (x) (2) k= where w k R, k =,,M, are the combnaton coeffcents. Theoretcally, any functon can be approxmated by a lnear combnaton of a set of bass functons up to arbtrary accuracy [2], gven a suffcently large number of bass functons. In our current mplementaton, we use orthogonal polynomals as the bass functons,.e. the bass functons g,,g M satsfy g (x)g j (x)dx = δ j (3) where δ j =0for j and δ j =for = j. The segmentaton s gven by an optmal estmaton of the true sgnal J by a pecewse constant map J, whch takes a constant value c n the regon of the -th tssue. These regons { } N of N tssues form a partton of the mage doman n the sense that N =and j = for j. Thus, the pecewse constant map J can be wrtten as J(x) = c u (x). (4) where u (x) s the membershp functon of the regon such that {, x u (x) = (5) 0, else. and u (x) =. (6) 2.. Energy Formulaton We formulate the problem of segmentaton and bas feld estmaton as a task of seekng the best pecewse constant map J and bas feld b such that ther product b J best fts the measured ntensty mage I. The pecewse constant map J can be expressed as J = N c u as n Eq. (4), whle the bas feld b s modeled as a lnear combnaton b = M k= w kg k as n Eq. (2). Therefore, we defne the fttng error F = M I(x) [ w k g k (x)][ c u (x)] 2 dx (7) k= Ths fttng error s the proposed energy n terms of the constants c,,c N, the membershp functons u,,u N, and the coeffcents w,,w M. The mnmzaton of ths energy gves the optmal membershp functons u,,u N as a segmentaton result, whle the optmal coeffcents w,,w M of the bass functons defne the estmated bas feld. The scalar constants c,,c N and w,,w M, and the functons u,,u N and g,,g M can be represented n the form of column vectors,.e. c =(c,..., c N ) T, w = (w,..., w M ) T, U(x) = (u (x),..., u N (x)) T, and G(x) =(g (x),,g M (x)) T. Thus, the above energy F can be rewrtten as F (U, c, w) = I(x) (w T G(x))(c T U(x)) 2 dx (8) 29

3 From Eq. (5), we have c T U(x) =c for x. Thus, the energy F can be rewrtten as F (U, c, w) = = = I(x) (w T G(x))(c T U(x)) 2 dx I(x) (w T G(x))c 2 dx (9) I(x) (w T G(x))c 2 u (x)dx From the expresson of F n the last lne, t s easy to mnmze wth respect to the membershp functons u,,u N Energy Mnmzaton It s worth notng that the energy F (U, c, w) s convex n each of ts varables. The energy F (U, c, w) can be mnmzed by an teratve process of nterleaved mnmzaton wth respect to each varable. The mnmzer of F (U, c, w) n each varable, U, c, orw, s gven below. Mnmzaton wth respect to U. For fxed c and w,we mnmze F (U, c, w) wth respect to U under a constrant that U =(u,,u N ) T satsfes Eq. (6). It can be shown that the mnmzer Û =(û,, û N ) T s gven by {, = mn (x); û (x) =, =,N. (0) 0, mn (x). where mn (x) =argmn { I(x) (w T G(x))c 2 }. Mnmzaton wth respect to c. For fxed U and w, there s a unque mnmzer of the functon F (U, c, w) n the varable c. Ths unque mnmzer, denoted by ĉ = (ĉ,, ĉ N ) T, s gven by ĉ = I(x)b(x)u (x)dx, =,,N. () b2 (x)u (x)dx Mnmzaton wth respect to w. For fxed U and c, to mnmze F (U, c, w) wth respect to w, we take dervatve of F wth respect to w, we get where and F = 2v +2Aw w v = A = I(x)G(x)J(x)dx, G(x)G(x) T J 2 (x)dx, (2) wth J(x) =c T U. Note that A s an M M matrx, wth M beng the number of the bass functons. It can be shown that the above matrx A s nonsngular (see below). Therefore, the lnear equaton F w = 2v +2Aw = 0 has a unque soluton ŵ = A v (3) The entre procedure of mnmzaton of the energy F (U, c, w) s descrbed as below: Step. Intalzaton of c, w and U; Step 2. Update c to be ĉ gven by Eq. (); Step 3. Update w to be ŵ gven by Eq. (3); Step 4. Update U to be Û gven by Eq. (0); Step 5. Check convergence crteron. If convergence has been reached, stop the teraton, otherwse, go to Step Matrx Analyss for Numercal Issues The non-sngularty of matrx A s verfed as the followng. We frst defne h m (x) g m (x) N c2 u (x). Thus, the (m, k) entry of A can be expressed as the nner product of h m and h k gven by h m,h k = h m (x)h k (x)dx. Therefore, the matrx A s the Graman matrx of h,,h M. By lnear algebra [5], the Graman matrx of h,,h M s non-sngular f and only f they are lnearly ndependent. It s easy to see that the above defned functons h,,h M are lnearly ndependent, whch mples the non-sngularty of A. Numercal stablty s an mportant ssue n computng the nverse matrx A n Eq. (3), and may have a sgnfcant mpact on the accuracy of the fnal result of our method. In general, the numercal stablty of computng an nverse matrx A can be characterzed by the condton number [3] of the matrx A. The condton number of a postvedefnte matrx A s gven by κ(a) =λ max (A)/λ mn (A), where λ mn (A) and λ max (A) are the mnmal and maxmal egenvalues of matrx A, respectvely. The stablty s ensured when the condton number s bounded by a reasonably small number. For the above defned matrx A n Eq. (2) wth the bass functons g,,g M satsfyng the orthogonalty condton n Eq. (3), we are able to prove that 0 < mn{c 2 } λ mn (A) λ max (A) max{c 2 } 220

4 Therefore, an upper bound of the condton number of A s provded by max{c 2 } κ(a) mn{c 2 }. (4) For example, f max {c } = 250 and mn {c } =50,by the nequalty (4), we have κ(a) =25.Wehave 2 observed that the condton numbers are less than 26.0 for all the experments n ths paper, whch s suffcent to ensure the numercal stablty of the nverson operaton n our algorthm. 3. Results In ths secton, we demonstrate the effectveness of the proposed method, especally ts robustness to ntalzaton. To verfy the robustness of our method, we randomly generate dfferent ntalzatons of all the varables U, c, and w n usng our method. Expermental results have confrmed that our algorthm converges to the same result from dfferent ntalzatons that are generated randomly. Moreover, the convergence s reached after a small number of teratons. The typcal number of teratons needed for convergence s between 0 and 20 for most of mages. Our method has been appled to 3-tesla MR mages, whch have sgnfcant ntensty nhomogenetes. We frst show the results of our method for the 3-tesla MR mages n the frst column of Fg.. The estmated bas felds, the segmentaton results, and bas corrected mages are shown n the second, thrd, and fourth columns, respectvely. As can be seen from thrd column, the tssue segmentaton results are qute consstent wth the bran anatomy. In the bas corrected mages n the fourth column, the ntenstes wthn each tssue become qute homogeneous. Fgure. Results of our method on 3T bran MR mages. Column : Orgnal mages; Column 2: Estmated bas felds; Column 3: Segmentaton results. Column 4: Bas corrected mages. We compared our method wth the methods of Wells et al. [8], Leemput et al. [7]. We tested these three methods on a synthetc mage of crcles wth ntensty nhomogenety (top left n Fg. 2) and an MR bran mage wth nose %, ntensty non-unformty (INU) 80% (top rght Fg. 2), whch was obtaned from McGll Bran Web []. Snce the algorthms of Wells et al. and Leemput et al. are senstve to the ntalzaton of the parameters (mean, varances and a pror probablty for each tssue), proper ntalzaton of these parameters s necessary n usng ther methods. Unless otherwse specfed, the ntalzaton of the parameters n ther methods are obtaned from a prelmnary segmentaton and estmaton of the parameters usng the K-means algorthm. When such ntalzatons are used, the segmentaton results of Wells et al. s method (Fgs. 2(c) and 2(e)) and Leemput et al. s method (Fgs. 2(g) and 2()) are acceptable. However, when the ntalzaton of these parameters are changed, the segmentaton results of these two methods vary sgnfcantly, as shown n the two results n Fgs. 2(d), 2(f), 2(h), 2(j). The results of our method for two randomly generated ntalzatons are shown n the bottom row of Fg. 2. No vsble dfference can be seen from the results of our method for the two randomly generated ntalzatons. Fgs. 3 and 4 show the comparson results for two synthetc mages wth severe ntensty nhomogenetes. The results of the methods by Wells et al., Leemput et al., and the proposed one are shown n the frst, second and thrd rows, respectvely. The estmated bas feld, segmentaton results, and bas corrected mage are shown n every row. Whle t s dffcult to vsually compare the bas corrected mages, the segmentaton results of our method are more accurate than the other two methods, especally n the lower part of the mage. To quanttatvely evaluate the performance of the algorthms, we use Jaccard smlarty (JS) [3] as an ndcator of the segmentaton accuracy. The JS between two regons S and S 2 s defned as the rato between the areas of the ntersecton and the unon of them, namely, J(S,S 2 )= S S 2 S S 2. To evaluate the accuracy of segmentaton, we compute the JS between the segmented regon S by the algorthm and the correspondng regon S 2 gven by the ground truth. The closer the JS values to, the better the segmentaton and bas correcton. We tested the three methods on 30 mages from McGll bran data. For the methods of Wells et al. and Leemput et al., we used 20 dfferent ntalzatons of the means, whle the varances and a pror probablty are ntalzed properly by prelmnary estmaton of them. The JS values for WM and GM of the results obtaned by the three methods are shown n Fg. 5. The JS values of the Wells et al., the Leemput et al. and our method are plotted wth red squares, green crcles and blue damonds respectvely. The JS values of our method for the 20 dfferent ntalzatons show 22

5 (a) (b) (c) (d) (e) (f) (g) (h) () (j) (k) (l) (m) (n) Fgure 3. Comparson results for a synthetc mage shown n the fst column. The estmated bas felds, segmentaton results, and bas corrected mages are shown n the second, thrd, and fourth columns, respectvely. The results of the methods of Wells et al., Leemput et al., and the proposed method are shown n rows,2,3, respectvely. Fgure 2. Results of the method of Wells et al., the method of Leemput et al. and our method wth two dfferent ntalzatons. The segmentaton results wth good guess are shown n columns and 3; the segmentaton results wthout good guess are shown n columns 2 and 4. The results of the methods of Wells et al., Leemput et al., and the proposed method are shown n rows 2,3,4, respectvely. no vsble dfference n Fg. 5, whch demonstrate the ndependence of ntalzaton of our method. By contrast, there s large varablty n the JS values for the results obtaned by the methods of Wells et al. and Leemput et al. for 20 dfferent ntalzatons, as can be seen n Fg. 5. We have appled our method to 3D MR mages. Fg. 6 shows the result of our method for a 3-tesla 3D MR mage. To vsualze the results, we select four sagttal slces as shown n the frst row of Fg. 6. The correspondng estmated bas felds, fnal segmentaton results and corrected mages are shown n the second, thrd, and fourth rows respectvely. The ntenstes wth each tssue become qute homogeneous n the bas corrected mages. Meanwhle, the segmentaton results show hgh agreement wth the bran anatomy. 4. Concluson In ths paper, we have presented a new energy mnmzaton framework for smultaneous estmaton of the bas feld and segmentaton of tssues for magnetc resonance mages. Fgure 4. Comparson results for a synthetc mage shown n the fst column. The estmated bas felds, segmentaton results, and bas corrected mages are shown n the second, thrd, and fourth columns, respectvely. The results of the methods of Wells et al., Leemput et al., and the proposed method are shown n rows,2,3, respectvely. We provde an effcent teratve algorthm for energy mnmzaton, whch converges to the optmal soluton at a fast rate. A salent advantage of our method s that ts result s ndependent of ntalzaton, whch allows robust and fully 222

6 JS for WM Method by Wells et al. Method by Leemput et al. Proposed method Image JS for GM Method by Wells et al. Method by Leemput et al. Proposed method Image Fgure 5. Test of senstvty to ntalzaton for our method and the methods of Wells et al. and Leemput et al. The x-axs represents 30 mages, and the y-axs represents the JS values for WM (left) and GM (rght) of the three methods for 20 dfferent ntalzatons. Fgure 6. Sagttal vew of the 3D segmentaton and bas correcton results. Row : Orgnal mages. Row 2: Estmated bas felds. Row 3: Segmentaton results. Row 4: Bas corrected mages. automated applcaton. The proposed method has been successfully appled to 3-Tesla MR mages wth desrable results. Comparsons wth other approaches demonstrate the superor performance of ths algorthm. References [] 4 [2] M. Ahmed, S. Yamany, N. Mohamed, A. Farag, and T. Morarty. A modfed fuzzy c-means algorthm for bas feld estmaton and segmentaton of MRI data. IEEE Trans. Med. Imagng, 2(3):93 99, March [3] G. Golub and C. V. Loan. Matrx Computatons. The Johns Hopkns Unversty Press, 3rd edton, [4] R. Gullemaud and J. Brady. Estmatng the bas feld of MR mages. IEEE Trans. Med. Imag., 6(3):238 25, June 997. [5] R. Horn and C. Johnson. Matrx Analyss. Cambrdge Unversty Press, Cambrdge, [6] B. Johnston, M. S. Atkns, B. Mackewch, and M. Anderson. Segmentaton of multple scleross lesons n ntensty corrected multspectral MRI. IEEE Trans. Med. Imag., 5(2):54 69, Aprl 996. [7] V. Leemput, K. Maes, D. Vandermeulen, and P. Suetens. Automated model-based bas feld correcton of MR mages of the bran. IEEE Trans. Med. Imag., 8(0): , October 999., 4 [8] C. L, R. Huang, Z. Dng, C. Gatenby, D. Metaxas, and J. Gore. A varatonal level set approach to segmentaton and bas correcton of medcal mages wth ntensty nhomogenety. In Proceedngs of Medcal Image Computng and Computer Aded Interventon (MICCAI), volume LNCS 5242, Part II, pages , [9] C. L, C. Xu, A. Anderson, and J. Gore. MRI tssue classfcaton and bas feld estmaton based on coherent local ntensty clusterng: A unfed energy mnmzaton framework. In Proceedngs of Informaton Processng n Medcal Imagng (IPMI), Wllamsburg, VA on July 5-0, [0] B. Lkar, M. Vergever, and F. Pernus. Retrospectve correcton of mr ntensty nhomogenety by nformaton mnmzaton. IEEE Trans. Med. Imag., 20(2):398 40, December 200. [] D. Pham and J. Prnce. Adaptve fuzzy segmentaton of magnetc resonance mages. IEEE Trans. Med. Imag., 8(9): , September 999. [2] M. J. D. Powell. Approxmaton Theory and Methods. Cambrdge Unversty Press, Cambrdge, [3] D. W. Shattuck, S. R. Sandor-Leahy, K. A. Schaper, D. A. Rottenberg, and R. M. Leahy. Magnetc resonance mage tssue classfcaton usng a partal volume model. Neuromage, 3: , May [4] J. Sled, A. Zjdenbos, and A. Evans. A nonparametrc method for automatc correcton of ntensty nonunformty n MRI data. IEEE Trans. Med. Imagng, 7():87 97, January 998. [5] M. Styner, C. Brechbuhler, G. Szekely, and G. Gerg. Parametrc estmate of ntensty nhomogenetes appled to MRI. IEEE Trans. Med. Imag., 9(3):53 65, March [6] M. Tncher, C. R. Meyer, R. Gupta, and D. M. Wllams. Polynomal modelng and reducton of rf body col spatal nhomogenety n MRI. IEEE Trans. Med. Imag., 2(2):36 365, 993. [7] U. Vovk, F. Pernus, and B. Lkar. A revew of methods for correcton of ntensty nhomogenety n MRI. IEEE Trans. Med. Imag., 26(3):405 42, March 2007., 2 [8] W. Wells, E. Grmson, R. Kkns, and F. Jolesz. Adaptve segmentaton of MRI data. IEEE Trans. Med. Imag., 5(4): , 996., 4 [9] D. A. G. Wcks, G. J. Barker, and P. S. Tofts. Correcton of ntensty nonunformty n MR mages of any orentaton. Magn. Reson. Imag., (2):83 96,

Image Segmentation with Simultaneous Illumination and Reflectance Estimation: An Energy Minimization Approach

Image Segmentation with Simultaneous Illumination and Reflectance Estimation: An Energy Minimization Approach Image Segmentaton wth Smultaneous Illumnaton and Reflectance Estmaton: An Energy Mnmzaton Approach Chunmng L 1, Fang L 2, Chu-Yen Kao 3, Chenyang Xu 4 1 Vanderblt Unversty Insttute of Imagng Scence, ashvlle,

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

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

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

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

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

Coil Sensitivity Estimation for Optimal SNR Reconstruction and Intensity Inhomogeneity Correction in Phased Array MR Imaging

Coil Sensitivity Estimation for Optimal SNR Reconstruction and Intensity Inhomogeneity Correction in Phased Array MR Imaging Col Senstvty Estmaton for Optmal SNR Reconstructon and Intensty Inhomogenety Correcton n Phased Array MR Imagng Prashanth Vemur 1, Eugene G. Kholmovsk 1, Denns L. Parker 1, Bran E. Chapman 2 1 UCAIR, Department

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

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

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

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

Nonlocal Mumford-Shah Model for Image Segmentation

Nonlocal Mumford-Shah Model for Image Segmentation for Image Segmentaton 1 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:ccluxaoq@163.com ebo e 23 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

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

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

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

Learning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris

Learning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris Learnng Ensemble of Local PDM-based Regressons Yen Le Computatonal Bomedcne Lab Advsor: Prof. Ioanns A. Kakadars 1 Problem statement Fttng a statstcal shape model (PDM) for mage segmentaton Callosum segmentaton

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

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

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

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

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

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

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

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

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

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

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

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

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

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

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

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

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

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

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

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

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

A penalized fuzzy clustering algorithm

A penalized fuzzy clustering algorithm Proceedngs of the 6th WSEAS Internatonal Conference on Appled Computer Scence, Tenerfe, Canary Islands, Span, December 6-8, 26 3 A penalzed fuzzy clusterng algorthm Mn-Shen Yang a, Wen-Lang Hung b and

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

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

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

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

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

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Wavefront Reconstructor

Wavefront Reconstructor A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes

More information

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r

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

How can physicians quantify brain degeneration?

How can physicians quantify brain degeneration? Chapter 11 How can physcans quantfy bran degeneraton? If the human bran were so smple that we could understand t, we would be so smple that we couldn't E. M. Pugh M. Bach Cuadra( ), J.-Ph. Thran( ), F.

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

New Appearance Models for Natural Image Matting

New Appearance Models for Natural Image Matting New Appearance Models for Natural Image Mattng Dheeraj Sngaraju Johns Hopkns Unversty Baltmore, MD, USA. dheeraj@cs.jhu.edu Carsten Rother Mcrosoft Research Cambrdge, UK. carrot@mcrosoft.com Chrstoph Rhemann

More information

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde

More information

New Appearance Models for Natural Image Matting

New Appearance Models for Natural Image Matting New Appearance Models for Natural Image Mattng Dheeraj Sngaraju Johns Hopkns Unversty Baltmore, MD, USA. dheeraj@cs.jhu.edu Carsten Rother Mcrost Research Cambrdge, UK. carrot@mcrost.com Chrstoph Rhemann

More information

Private Information Retrieval (PIR)

Private Information Retrieval (PIR) 2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market

More information

Newton-Raphson division module via truncated multipliers

Newton-Raphson division module via truncated multipliers Newton-Raphson dvson module va truncated multplers Alexandar Tzakov Department of Electrcal and Computer Engneerng Illnos Insttute of Technology Chcago,IL 60616, USA Abstract Reducton n area and power

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

Backpropagation: In Search of Performance Parameters

Backpropagation: In Search of Performance Parameters Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

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

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

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

An Image Segmentation Method Based on Partial Differential Equation Models

An Image Segmentation Method Based on Partial Differential Equation Models An Image Segmentaton Method Based on Partal Dfferental Equaton Models Jang We, Lu Chan* College of Informaton Engneerng, Tarm Unversty, Alar, Chna *Correspondng Author Emal: 76356718@qq.com Abstract In

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

Line Clipping by Convex and Nonconvex Polyhedra in E 3

Line Clipping by Convex and Nonconvex Polyhedra in E 3 Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz

More information

A hybrid approach to segmentation of medical images

A hybrid approach to segmentation of medical images Annales UMCS Informatca AI (4) 9-6 Annales UMCS Informatca Lubln-Polona Secto AI http://www.annales.umcs.lubln.pl/ A hybrd approach to segmentaton of medcal mages Karol Kuczyńsk *, Paweł Mkołajczak Laboratory

More information

Recognizing Faces. Outline

Recognizing Faces. Outline Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &

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

A NOTE ON FUZZY CLOSURE OF A FUZZY SET

A NOTE ON FUZZY CLOSURE OF A FUZZY SET (JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

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

Estimation of Inferential Uncertainty in Assessing Expert Segmentation Performance from STAPLE

Estimation of Inferential Uncertainty in Assessing Expert Segmentation Performance from STAPLE 1 Estmaton of Inferental Uncertanty n Assessng Expert Segmentaton Performance from STAPLE Olver Commowck, Smon K. Warfeld, Senor Member IEEE Computatonal Radology Laboratory, Department of Radology, Chldren

More information

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL GROUP ANALYSIS Martn M. Mont UCLA Psychology NITP AGGREGATING MULTIPLE SUBJECTS When we conduct mult-subject analyss we are tryng to understand whether an effect s sgnfcant across a group of people. Whether

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

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

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

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

From Comparing Clusterings to Combining Clusterings

From Comparing Clusterings to Combining Clusterings Proceedngs of the Twenty-Thrd AAAI Conference on Artfcal Intellgence (008 From Comparng Clusterngs to Combnng Clusterngs Zhwu Lu and Yuxn Peng and Janguo Xao Insttute of Computer Scence and Technology,

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

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

Robust Mean Shift Tracking with Corrected Background-Weighted Histogram

Robust Mean Shift Tracking with Corrected Background-Weighted Histogram Robust Mean Shft Trackng wth Corrected Background-Weghted Hstogram Jfeng Nng, Le Zhang, Davd Zhang and Chengke Wu Abstract: The background-weghted hstogram (BWH) algorthm proposed n [] attempts to reduce

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

An inverse problem solution for post-processing of PIV data

An inverse problem solution for post-processing of PIV data An nverse problem soluton for post-processng of PIV data Wt Strycznewcz 1,* 1 Appled Aerodynamcs Laboratory, Insttute of Avaton, Warsaw, Poland *correspondng author: wt.strycznewcz@lot.edu.pl Abstract

More information

Lecture 13: High-dimensional Images

Lecture 13: High-dimensional Images Lec : Hgh-dmensonal Images Grayscale Images Lecture : Hgh-dmensonal Images Math 90 Prof. Todd Wttman The Ctadel A grayscale mage s an nteger-valued D matrx. An 8-bt mage takes on values between 0 and 55.

More information

A Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves

A Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves A Newton-Type Method for Constraned Least-Squares Data-Fttng wth Easy-to-Control Ratonal Curves G. Cascola a, L. Roman b, a Department of Mathematcs, Unversty of Bologna, P.zza d Porta San Donato 5, 4017

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

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon

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

Mesh Editing in ROI with Dual Laplacian

Mesh Editing in ROI with Dual Laplacian Mesh Edtng n ROI wth Dual Laplacan Luo Qong, Lu Bo, Ma Zhan-guo, Zhang Hong-bn College of Computer Scence, Beng Unversty of Technology, Chna lqngng@sohu.com, lubo@but.edu.cn,mzgsy@63.com,zhb@publc.bta.net.cn

More information

An Ensemble Learning algorithm for Blind Signal Separation Problem

An Ensemble Learning algorithm for Blind Signal Separation Problem An Ensemble Learnng algorthm for Blnd Sgnal Separaton Problem Yan L 1 and Peng Wen 1 Department of Mathematcs and Computng, Faculty of Engneerng and Surveyng The Unversty of Southern Queensland, Queensland,

More information

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn

More information

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)

More information

Adaptive Transfer Learning

Adaptive Transfer Learning Adaptve Transfer Learnng Bn Cao, Snno Jaln Pan, Yu Zhang, Dt-Yan Yeung, Qang Yang Hong Kong Unversty of Scence and Technology Clear Water Bay, Kowloon, Hong Kong {caobn,snnopan,zhangyu,dyyeung,qyang}@cse.ust.hk

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

Novel Fuzzy logic Based Edge Detection Technique

Novel Fuzzy logic Based Edge Detection Technique Novel Fuzzy logc Based Edge Detecton Technque Aborsade, D.O Department of Electroncs Engneerng, adoke Akntola Unversty of Tech., Ogbomoso. Oyo-state. doaborsade@yahoo.com Abstract Ths paper s based on

More information

An optimized workflow for coherent noise attenuation in time-lapse processing

An optimized workflow for coherent noise attenuation in time-lapse processing An optmzed workflow for coherent nose attenuaton n tme-lapse processng Adel Khall 1, Hennng Hoeber 1, Steve Campbell 2, Mark Ibram 2 and Dan Daves 2. 1 CGGVertas, 2 BP 75 th EAGE Conference & Exhbton ncorporatng

More information

A Scalable Projective Bundle Adjustment Algorithm using the L Norm

A Scalable Projective Bundle Adjustment Algorithm using the L Norm Sxth Indan Conference on Computer Vson, Graphcs & Image Processng A Scalable Projectve Bundle Adjustment Algorthm usng the Norm Kaushk Mtra and Rama Chellappa Dept. of Electrcal and Computer Engneerng

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

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information