A statistical approach for intensity loss compensation of confocal microscopy images

Size: px
Start display at page:

Download "A statistical approach for intensity loss compensation of confocal microscopy images"

Transcription

1 Journal of Mcroscopy, Vol. 230, Pt , pp Receved 4 Aprl 2007; accepted 2 October 2007 A statstcal approach for ntensty loss compensaton of confocal mcroscopy mages S. GOPINATH, Q. WEN, N. THAKOOR, K. LUBY-PHELPS & J. X. GAO Computer Scence and Engneerng Department, Unversty of Texas at Arlngton, U.S.A. Electrcal Engneerng Department, Unversty of Texas at Arlngton, U.S.A. Cell Bology Department, Unversty of Texas Southwestern Medcal Center, Dallas, TX, U.S.A. Computer Scence and Engneerng Department, Unversty of Texas at Arlngton, U.S.A. Key words. Compensaton, confocal mcroscopy, expectaton maxmzaton, ntensty loss, photobleachng. Summary In ths paper, a probablstc technque for compensaton of ntensty loss n confocal mcroscopy mages s presented. For sngle-colour-labelled specmen, confocal mcroscopy mages are modelled as a mxture of two Gaussan probablty dstrbuton functons, one representng the background and another correspondng to the foreground. Images are segmented nto foreground and background by applyng Expectaton Maxmzaton algorthm to the mxture. Fnal ntensty compensaton s carred out by scalng and shftng the orgnal ntenstes wth the help of parameters estmated for the foreground. Snce foreground s separated to calculate the compensaton parameters, the method s effectve even when mage structure changes from frame to frame. As ntensty decay functon s not used, complexty assocated wth estmaton of the ntensty decay functon parameters s elmnated. In addton, mages can be compensated out of order, as only nformaton from the reference mage s requred for the compensaton of any mage. These propertes make our method an deal tool for ntensty compensaton of confocal mcroscopy mages that suffer ntensty loss due to absorpton/scatterng of lght as well as photobleachng and the mage can change structure from optcal/temporal sectonto-secton due to changes n the depth of specmen or due to a lve specmen. The proposed method was tested wth a number of confocal mcroscopy mage stacks and results are presented to demonstrate the effectveness of the method. Correspondence to: Jean X. Gao. e-mal: gao@uta.edu Ths work s supported n part by Natonal Scence Foundaton NSF IIS , NSF IIS , NSF IIS Introducton Images produced by confocal mcroscope tend to decrease n ntensty wth tme as an effect of photobleachng when conventonal fluorescence tags are used or wth depth due to absorpton or scatterng of exctaton and fluorescence. These effects make analyss of the mages wthout ntensty correcton a complcated problem. Methods used to compensate the ntensty loss can be categorzed nto two types, Pre-processng methods: Ones that correct the ntensty loss wth modfed optcs as the mages are beng captured (Atkns & De Paula, 1994; Chen et al., 1995; Becker, 1996; Song et al., 1996). More recently, a method, whch manpulates the photomultpler gan, was ntroduced to counter the hgh ntensty losses n the deep layers of the specmen by Ĉapek et al. (2006). Post-processng methods: These methods compensate the mages after they are captured (Rgaut & Vassy, 1991; Oostveldt et al., 1998; Ortz et al., 1999; Kervrann et al., 2004; Ĉapek et al., 2005). Intensty decay functon (IDF) based methods model ntensty loss n the mages as a parametrc decay functon of depth or tme. The decay parameters are estmated and compensated for n these methods. Another famly of methods reles on matchng hstogram profles of mage stacks. These methods however cannot handle change n mage structure along the optcal axs. Optcs-based methods assume that the majorty of the ntensty loss s due to absorpton and scatterng of lght as t travels through the specmen. As the rate of photobleachng can vary for dfferent types of specmens, ntensty loss cannot be deally compensated by optcs alone. For ths reason, we concentrate on post-processng methods to correct the ntensty loss. Journal complaton C 2008 The Royal Mcroscopcal Socety

2 144 S. GOPINATH ET AL. As factors contrbutng to the ntensty loss cannot be modelled accurately for practcal mages accordng to Wu & J (2005), t poses a problem when IDF s used for ntensty compensaton. In addton, the combnaton of ntensty loss due to photobleachng and depth can gve rse to a complcated IDF. Our method s motvated by hstogram matchng; however, t deals wth a contnuous doman by modellng an mage as a mxture of two Gaussan probablty dstrbuton functons (PDFs) and matchng the profles of foreground probablty dstrbutons. By matchng foreground and not the entre mage, our method avods the problems arsng due to change n structure of the mage. Dfferent postprocessng approaches to correct the ntensty varatons can be found n the lterature. Negahdarpour & Yu (1993) apply a general model n whch the horzontal and vertcal flow felds as well as addtve and multplcatve ntensty relatonshps are estmated for every pxel. Accordng to Ĉapek et al. (2005), ths approach s computatonally expensve. A least-squares optmzaton-based approach, whch optmzes brghtness and contrast, s proposed by Peraswamy & Fard (2003) and Kervrann et al. (2004). These technques are hghly senstve to outlers. The reweghed least-squares method s used by Kervrann et al. (2004) to correct the dsadvantage of Peraswamy & Fard (2003). The method dscussed n Kervrann et al. (2004) s not only senstve to nose whch can be elmnated by medan flterng but also to the dynamc movement of objects n neghbourng optcal sectons. Accordng to Ĉapek et al. (2005), ths gves erroneous and unstable results even n the presence of a very few outlers n optcal sectons. In Cox et al. (1995), ntensty varatons are corrected based on hstogram warpng, but t s restrcted to the case where a global, spatally nvarant, nonlnear, monotoncally ncreasng relatonshp exsts between the ntenstes of the two mages. Ĉapek et al. (2005) extend the approach of Cox et al. (1995) and attempt to gve a general and fully automatc method of correctng ntensty loss n confocal mcroscopy mages. The proposed method manpulates the mage hstogram as n Ĉapek et al. (2005), but t focusses on the contnuous doman of probabltes to flter the foreground nformaton to calculate the correcton parameters. Before we present our approach, we wll dscuss the approach by Ĉapek et al. (2005) n short. The approach proposed n Ĉapek et al. (2005) conssts of two stages. In the frst stage, a standard hstogram s constructed wth the help of hstograms of all the optcal sectons n the mage stack. In the second stage, ndvdual hstograms are warped accordng to the standard hstogram to acheve the brghtness and contrast of the standard hstogram. The constructon of standard hstogram s adopted from Nyul et al. (2000). The approach s based on landmarks chosen n the mage hstogram. The landmarks chosen are the mnmum and maxmum ntenstes and percentles of the ntenstes of the mage. However, mnmum and maxmum ntensty of mage are hghly senstve to nose. For the mages that change the structure from optcal secton-to-secton, proporton of the foreground to the background vares. Ths causes substantal changes n hstograms, makng hstogram-based methods less effectve. The man dea of the proposed method s to flter the foreground nformaton from a gven mage by modellng t as a mxture of Gaussan PDFs and use ths nformaton to compensate mage ntensty loss. The foreground mean and standard devaton are used to transform the pxel ntenstes of the orgnal mage relatve to the ntensty parameters of a reference mage. The paper s organzed as follows: Secton 2 explans the proposed approach n detal. Secton 3 presents expermental results. Paper concludes n Secton 4. Proposed approach In many statstcal applcatons, Gaussan mxture modellng (GMM) s used as a general tool for modellng a large heterogeneous populaton. Detaled ntroducton to GMM can be found n Theodords & Koutroumbas (1999). GMM s a sem-parametrc estmaton approach that provdes good flexblty and precson n modellng the statstcs of unlabelled sample data. In our case, the mage data can be assumed to be generated from two components, one formng the Fg. 1. Flowchart for the proposed compensaton algorthm, numbers n the bracket ndcate the correspondng equatons.

3 STATISTICAL APPROACH FOR INTENSITY LOSS COMPENSATION 145 Fg. 2. Sequence 1: Orgnal optcal sectons at tme t = 1 from (a) top (z = 1) to (l) bottom (z = 12) (bottom frame s used as the reference). background of the mage and the other pertanng to the foreground of the mage. However, t s not known that whch pxel belongs to whch component. Because of ths, the problem can be consdered to have mssng data, that s, background/foreground membershp nformaton. Each component can be consdered to have ts own parameters θ, whch defne the probablty densty functon P (x;θ). These parameters can be estmated through the expectaton maxmzaton (EM) algorthm, whch s the wdely used approach to solve the mssng data problem. It devses approprate parameters for the chosen model wth respect to the data ponts generated by ndvdual components. In the EM algorthm, ntal estmates for the parameters are chosen arbtrarly. As the selecton of ntal estmates affects the result, they must be chosen carefully. The teratve parameter estmaton process conssts of two steps, the expectaton (E) step and the maxmzaton (M) step. In the E step, the expected value of the mssng data s calculated. In the M step, the resultng value of the expectaton s maxmzed by selectng new set of parameters. The E and M steps are terated untl a stoppng crteron such as a number of teratons s met or untl there s no change n the mxture model parameters. Most of the mages captured wth confocal mcroscopy are bmodal, one mode each for background and foreground. Hence, the

4 146 S. GOPINATH ET AL. Fg. 3. Sequence 1: Foreground membershp probablty for optcal sectons at tme t = 1 (Brght regons denote hgher foreground membershp probablty and dark regons denote hgher background membershp probablty). mage data s modelled as a two-component GMM. Based on the assumpton that the loss of ntensty ncreases relatvely wth tme or depth or both, the frst mage of the tme seres or the frst z-slce of the stack wll have mnmal loss of ntensty and can be consdered as the reference mage. The reference mage should have good vsual nformaton of the object or specmen to be studed. Intally, mean ntensty and standard devaton for the foreground and background are estmated wth EM algorthm. Then the parameters of the foreground component are used to warp each pxel of the mage to ts relatve reference ntensty. Followng subsectons explan ndvdual steps taken durng ths process n detal. Parameter estmaton For a two component GMM of the j th mage n a stack, there are sx unknown parameters, { (w θ j j = 1,μj 1,σ j ) ( j 1, w 2,μj 2,σ j ) } 2, (1)

5 STATISTICAL APPROACH FOR INTENSITY LOSS COMPENSATION 147 (a) Foreground mean nrensty Tme Depth (b) Foreground mean nrensty Tme Depth Fg. 4. Sequence 1: Mean ntensty of foreground regon n (a) orgnal mage stack and (b) restored mage stack.

6 148 S. GOPINATH ET AL. (a) Foreground mean ntensty Before, t=10 Before, t=20 60 Before, t=30 After, t=10 After, t=20 After, t= Depth (b) Foreground mean ntensty Before, z=3 Before, z=6 Before, z=12 After, z=3 After, z=6 After, z= Tme Fg. 5. Sequence 1: Varaton n the mean ntensty of foreground regon of orgnal mage stack and restored mage stack (a) wth depth (b) wth tme. where w j 1, w j 2 are mxture weght constants, μ j 1, μ j 2 represent mean ntenstes and σ j 1, σ j 2 gve the standard devatons correspondng to background and foreground Gaussan PDF, respectvely, for the j th mage. The frst step s to estmate the membershp probablty for each nth pxel of j th confocal mcroscopy mage. Gven ntensty for ths pxel s xn, j the membershp probablty can be calculated as, where P j F j (n) = w j 1 P j 1 P j ( j ) xn ( j ) j xn + w 2 P j 2 w j ( x j n ), (2) { ( j ( ) x j 1 xn μ j ) 2 } n = σ j exp 2π 2 ( σ j ) 2. (3)

7 STATISTICAL APPROACH FOR INTENSITY LOSS COMPENSATION 149 In the above equatons, = 1, 2 and n = 1, 2,..., N M, where N M s the dmenson of the mage and j = 1, 2,..., K wth K beng the number of the mage slces. In the second step, the Gaussan PDF mxture parameter values are estmated from the above membershp probablty: σ j = w j = M N 1 F j (n), (4) M N n=1 M N μ j n=1 = F j (n) xn j M N n=1 F j (n) M N n=1 F j (n) (xn j μ j M N n=1 F j (n), (5) )2. (6) The above two steps are terated untl all the parameters converge. The teratve process s repeated for each mage n the stack. Image warpng Once the mxture parameters for the mage are known, ntensty can be compensated by compensatng these parameters to match some reference. The compensated ntensty for the nth pxel n the j th mage can be calculated from orgnal ntensty x j n as: { ( j x (x ) n j = F j 2 (n) n μ j ) } 2 σ r + μ r + F j 1 (n) x n j. (7) σ j 2 Here, μ r and σ r represent mean and standard devaton references for the foreground. Mean and standard devaton of the frst mage n the stack can be set as the reference parameters for the mage stack restoraton. However, n the case where the frst mage n the stack does not have enough detals or s not the brghtest, one of the other mages can be chosen to be the reference. Fgure 1 summarzes the entre compensaton algorthm. Expermental results The proposed approach was mplemented n MATLAB and was tested on several sets of mages n the Bovson lab database at Unversty of Texas at Arlngton. Before proceedng to the expermental results, we wll brefly talk about the ntalzaton used for the experment. Intalzaton s crucal for the EM algorthm. As parameters from the reference frame are needed for mage restoraton, EM s carred out on the reference mage frst. The mxture weghts for the reference frame m can be ntalzed as w m 1 = wm 1 = 0.5. Snce the background mean s lower than the overall mage mean and foreground mean s hgher, one can select the ntal values arbtrarly to follow ths restrcton, M N 1 μ = xn m M N,μm 1 = μ 2,μm 2 = 3μ 2. n=1 A good ntal value for the mxture standard devaton s the overall standard devaton of the mage. σ1 m = σ 2 m = 1 (M N) 1 M N n=1 (x m n μ)2. These values can be mproved upon by randomly usng varous ntalzatons and then choosng the one that maxmzes the membershp probabltes. However, reasonable fxed values as stated above were used for the repeatablty of the experment. After successful completon of the EM procedure for reference frame m, reference parameters are set as μ r = μ r 2,σ r = σ r 2. As any mage n the sequence s very smlar to ts prevous mage, the parameters of the prevous mage after EM are used to ntalze the EM procedure for the next mage. w j 1 = w j 1 1,μ j 1 = μ j 1 1,σ j 1 = σ j 1 1, w j 2 = w j 1 2,μ j 2 = μ j 1 2,σ j 2 = σ j 1 2. Ths ntalzaton also helps to reduce the computatonal burden by reducng the number of EM teratons. MATLAB mplementaton of the proposed method wth above ntalzaton takes less than 1 s per optcal secton on an average on a 2.53 GHz Pentum 4 computer. Ths s faster compared to Ĉapek et al. (2006), who report that C++ mplementaton of ther approach takes approxmately 2 s per optcal secton. A C++ mplementaton of our approach can provde further speed-up f needed. Contrast to Nose rato Before, z=3 Before, z=6 Before, z=12 After, z=3 After, z=6 After, z= Tme Fg. 6. Sequence 1: Contrast-to-nose rato.

8 150 S. GOPINATH ET AL. Fg. 7. Sequence 1: Restored optcal sectons at tme t = 1 from (a) top (z = 1) to (l) bottom (z = 12). Sequence 1 The sequence tested here s a 4D-xyzt sequence wth resoluton acqured by spnnng dsk confocal mcroscopy, and showng the traffckng of caveoln1-gfp n a CHO (Chnese hamster ovary) cell. Fgures 2(a) to (l) show all the 12 optcal sectons at tme t = 1. It can be observed from the mages that the ntensty of the optcal sectons vares sgnfcantly from one secton to the other. The ntensty rses from depth z = 1toz = 5 and drops agan tll z = 11 before t rses n the fnal optcal secton at z = 12. These ntensty changes prmarly result from a combnaton of ncreasng z depth, changes n cross-sectonal area of the cell, and actual changes n the dstrbuton of caveoln1-gfp, whch s concentrated on the cell surface relatve to the cell nteror. Secton 12 shows the bottom surface of the cell where t s spread out on the glass cover slp. The top surface of the cell was not ncluded n the z stack. In addton, the morphology of dscrete fluorescent objects changes wth the depth. GMM parameters were calculated wth EM algorthm. For each frame, the teratve process was termnated when foreground and background mean values changed by less than 0.01.

9 STATISTICAL APPROACH FOR INTENSITY LOSS COMPENSATION 151 Fg. 8. Sequence 2: Orgnal mage stack: optcal sectons from z = 1to18,att =30. Fgure 3 shows the foreground membershp probablty after the convergence of EM algorthm. Snce these are membershp probabltes and not membershps, these can take any value from 0 to 1. The brghtness of a pxel s hgher, that s the probablty s close to one, f t belongs to the foreground. On the other hand, the darkness of a pxel ndcates that t belongs to background (ths means the probablty s close to 0). Despte the structural changes and changes n ntensty, Fg. 9. Sequence 2: Orgnal mage stack: optcal sectons at z = 15 for t = 1, 12, 24, 36, 48, 60.

10 152 S. GOPINATH ET AL. (a) Foreground mean ntensty (b) Foreground mean ntensty Before, t=1 Before, t=20 Before, t=40 Before, t=60 After, t=1 After, t=20 After, t=40 After, t= Depth Before, z=1 Before, z=6 Before, z=12 Before, z=18 After, z=1 After, z=6 After, z=12 After, z= Tme Fg. 10. Sequence 2: Varaton n the mean ntensty of foreground regon of orgnal mage stack and restored mage stack (a) wth depth (b) wth tme. the foreground regons are consstently detected. The success of the proposed method can be attrbuted to ths consstency. Fgure 4 shows foreground mean ntenstes for the entre mage stack before and after compensaton. A few of the curves are extracted n Fg. 5 to observe the ntensty loss trends closely. Fgure 5(a) shows the plot for the varaton n the foreground mean wth depth at tme t =10, 20, 30, whch s n agreement wth the vsual observatons made. However, varaton of mean ntensty wth tme plotted n Fg. 5(b) for depth z = 3, 6, 12 reveal facts that are dffcult to observe vsually. Intensty of the foreground drops as the tme progresses as expected owng to effects of photobleachng. However, rate of the decay s dfferent at dfferent depth levels. At depth z = 6, the mean ntensty drops from 77.3 to 75.3, whereas at depth z = 12 t drops from 82.2 to Decay rate at z = 12 s more than two tmes the decay rate at z = 6. As Contrast to Nose rato Before, z=1 Before, z=6 Before, z=12 Before, z=18 After, z=1 After, z=6 After, z=12 After, z= Tme Fg. 11. Sequence 2: Contrast-to-nose rato. our method does not use IDF, estmaton of complcated IDF requred to model ths mage sequence becomes unnecessary. The mage sequence was restored wth reference values μ r = 82.2 and σ r = 50.9, whch were estmated from frame at t = 1 and z = 12. Ths frame was chosen as t has the maxmum mean ntensty. Restored mages at z = 1 are shown n Fg. 7. Foreground ntenstes of the restored mage stacks are plotted n Fg. 4(b). Steady values of the ntenstes can be observed n the plot. The steady values are also reflected n the restored mages n Fg. 7. Contrast-to-nose rato (CNR) was computed for the sequence for quanttatve analyss. CNR = μ j 2 μ j 1 σ j. (8) 1 Fgure 6 shows CNR curves before and after compensaton for depths z = 3, 6, 12. A substantal ncrease n the CNR after the compensaton can be seen for all the depths. Sequence 2 The next sequence s a 4D-xyzt sequence smlar to the frst sequence wth resoluton Compared to the frst sequence, the second sequence shows more structural changes as seen n Fg. 8. The shape of the foreground object changes from a sngle round object n the top optcal secton to the two elongated objects n the deeper optcal sectons. It also exhbts severe photobleachng wth tme (Fg. 9). Foreground mean ntenstes are droppng drastcally wth tme as seen n Fg. 10(b). Worst drop s from 70.3 to 31.4 at depth z = 18. Although, the least drop s experenced by z = 6, t has the least foreground mean ntensty to start wth. The sequence was restored by selectng optcal secton at z = 18 at tme t = 1 wth μ r = 70.3 and σ r = Steady ntenstes can be seen after the restoraton n Fgs 12, 13 and also n 10 (a) and 10 (b). CNR for ths sequence s shown n Fg. 11.

11 STATISTICAL APPROACH FOR INTENSITY LOSS COMPENSATION 153 Fg. 12. Sequence 2: Restored mage stack: optcal sectons from z = 1 18, at t =30. Fg. 13. Sequence 2: Restored mage stack: optcal sectons at z = 15 for t =1, 12, 24, 36, 48, 60. Sequence 3 The thrd mage sequence s a 3D-xyt sequence of dmensons showng traffckng of caveoln1-gfp n a sngle optcal secton. For ths long sequence, ntensty loss due to photobleachng s promnent as frame number ncreases. Mean ntensty of the foreground drops from 35 to 21.5 from frame at tme t = 1tot = 220. Changes of object shape

12 154 S. GOPINATH ET AL. Fg. 14. Sequence 3: Reference secton t = 1 and some sectons from an orgnal mage stack. Sectons: (a) t = 1, (b) t = 20, (c) t = 40, (d) t = 60, (e) t = 80, (f) t = 100, (g) t = 120, (h) t = 140, () t = 160, (j) t = 180, (k) t = 200, (l) t = 220. from frame to frame are manly due to object moton, and are mnmal compared wth those resultng from changng optcal secton as n the frst two sequences. In Fg. 14, we show the few mages from the orgnal sequence of confocal mcroscopy mages. The entre sequence was processed by our algorthm usng frst frame (Fg. 14(a)) as the reference mage. Reference values were μ r = 34.7 and σ r = From Fg. 16, one can see that the ntensty drops steadly wth ncreasng tme-pont. Generally, ths decay s modelled wth an IDF. A smple photophyscal model for photobleachng s a sngle exponental decay, but the actual IDF may be much more complcated and mpossble to estmate a pror. The proposed

13 STATISTICAL APPROACH FOR INTENSITY LOSS COMPENSATION 155 Fg. 15. Sequence 3: Reference secton t = 1 and some sectons from restored mage stack. Sectons: (a) t = 1, (b) t = 20, (c) t = 40, (d) t = 60 (e) t = 80, (f) t = 100, (g) t = 120, (h) t = 140, () t = 160, (j) t = 180, (k) t = 200, (l) t = 220. method has helped to mantan a constant ntensty for the entre stack after the compensaton wthout any IDF. In Fgs 15 and 16, t can be observed that the ntenstes of the foreground object of the restored seres are unform wth very lttle varaton. For the frst frame, the number of teratons taken for EM to converge was 63. For the rest of the frames, t requred only 1.36 teratons on average, wth a mnmum of 1 and a maxmum of 11 teratons. Thus, usng prevous frames estmated parameters to ntalze the next frames parameters helps to reduce computatonal load sgnfcantly. Fg. 17 shows CNR before and after compensaton.

14 156 S. GOPINATH ET AL. Mean ntensty Orgnal foreground Restored foreground Orgnal background Restored background Tme Fg. 16. Sequence 3: Mean ntensty of background and foreground. Contrast to Nose rato Orgnal mage Restored mage Tme Fg. 17. Sequence 3: Contrast-to-nose rato. Sequence 4 Sequence 4 s a 3D-xyt sequence smlar to Sequence 3 wth resoluton For ths mage sequence, t s dffcult to separate the foreground and background vsually. Foreground membershp probablty for the optcal sectons shown n Fg. 18 are depcted n Fg. 19 as estmated by the proposed algorthm. Smlar to sequence 3, Fg. 21 shows the decay of foreground ntensty over tme. The frst frame of the sequence was chosen as the reference frame. Reference mean μ r was calculated to be 35.4 and reference standard devaton σ r was Restored mages are shown n Fg. 20 and correspondng contrast-to-nose ratos are plotted n Fg. 22. Concluson For relable analyss as well as vsualzaton of cell dynamcs, t s essental that the acqured mages reflect the exact nformaton of the specmen. The objectve of the proposed method was to help regan the vsual nformaton lost due to varous deteroratng factors such as scatterng and absorpton of the exctaton, photobleachng of fluorescent mages etc. Majorty of the current approaches to solve ths problem are ether computatonally complex, tme-consumng, restrcted to parametrc decay models (IDF) or are hghly senstve to nose. The proposed method provdes a smple yet effectve statstcal approach to solve ths problem. It overcame the dsadvantages of current methods and at the same tme ncreased the vsual value of confocal mcroscopy mages. The man dea was to flter the foreground nformaton from a gven mage by modellng t as a mxture of Gaussan PDFs and use ths nformaton to compensate the ntensty loss of the confocal mcroscopy mages. When multple fluorescence tags are used n a specmen, the proposed method can be smply appled to the ndvdual tags or a multple Gaussan PDF mxture model can be used to handle the scenaro. References Atkns, P. & De Paula, J. (1994) Spectroscopy 2: electronc transtons. Physcal Chemstry, pp W.H. Freeman and Company, New York. Becker, P.L. (1996) Quanttatve fluorescence measurements. Fluorescence Imagng Spectroscopy and Mcroscopy (ed. by Wang, X.F. & Herman, B.), pp Wley, New York. Ĉapek, M., Janàĉek, J. & Kubínová, L. (2006) Methods for compensaton of lght attenuaton wth depth of mages captured by a confocal mcroscope. Mcros. Res. Tech. 69, Ĉapek, M., Kubínová, L., Hána, K. & Smrĉka, P. (2005) Compensaton of the contrast and brghtness attenuaton wth depth n confocal mcroscopy. In Proceedngs of the Sprng Conference on Computer Graphcs 2005, Chen, H., Swedlow, J.R., Grote, M., Sedat, J.W. & Agard, D.A. (1995) The collecton, processng, and dsplay of dgtal three-dmensonal mages of bologcal specmens. Handbook of Bologcal Confocal Mcroscopy (ed. by Pawley, J.B.), pp Plenum Press, New York. Cox, I., Roy, S. & Hngoran, S. (1995) Dynamc hstogram warpng of mage pars for constant mage brghtness. In Proceedngs of the IEEE Internatonal Conference on Image Processng 1995, 2, Kervrann, C., Legland, D. & Pardn, L. (2004) Robust ncremental compensaton of the lght attenuaton wth depth n 3D fluorescence mcroscopy. J. Mcrosc. 214(3), Negahdarpour, S. & Yu, C.-H. (1993) A generalzed brghtness change model for computng optcal flow. In Proceedngs of the IEEE Internatonal Conference on Computer Vson 1993, Nyul, L., Udupa, J. & Zhang, X. (2000) New varants of a method of MRI scale standardzaton. IEEE Trans. Med. Img. 19(2), Oostveldt, P.V., Verhaegen, F. & Messens, K. (1998) Heterogeneous photobleachng n confocal mcroscopy caused by dfferences n refractve ndex and exctaton mode. Cytometry 32, Ortz, S., Garca, E., Jones, A., Pnkel, D., Gray, J., Sudar, D. & Lockett, S. (1999) Segmentaton of confocal mcroscope mages of cell nucle n thck tssue sectons. J. Mcrosc. 193,

15 STATISTICAL APPROACH FOR INTENSITY LOSS COMPENSATION 157 Peraswamy, S. & Fard, H. (2003) Elastc regstraton n the presence of ntensty varatons. IEEE Trans. Med. Imag. 22(7), Rgaut, J. & Vassy, J. (1991) Hgh-resoluton 3D mages from confocal scannng laser mcroscopy: quanttatve study and mathematcal correcton of the effects from bleachng and fluorescence attenuaton n depth. Anal. Quant. Cytol. 13, Song, L., Varma, C.A., Verhoeven, J.W. & Tanke, H.J. (1996) Influence of the trplet excted state on the photobleachng knetcs of fluorescen n mcroscopy. Bophyscs 70, Theodords, S. & Koutroumbas, K. (1999) Pattern Recognton. Academc press, San Dego. Wu, H.-X. & J, L. (2005) Fully automated ntensty compensaton for confocal mcroscopc mages. J. Mcrosc. 220(1), Fg. 18. Sequence 4: Reference secton t = 1 and some sectons from orgnal mage stack. Sectons: (a) t = 1, (b) t = 20, (c) t = 40, (d) t = 60, (e) t = 80, (f) t = 100, (g) t = 115, (h) t = 130, () t = 166.

16 158 S. GOPINATH ET AL. Fg. 19. Sequence 4: Foreground membershp probablty for optcal sectons at tme (a) t = 1, (b) t = 20, (c) t = 40, (d) t = 60, (e) t = 80, (f) t = 100, (g) t = 115, (h) t = 130, () t = 166 (Brght regons denote hgher foreground membershp probablty and dark regons denote hgher background membershp probablty).

17 STATISTICAL APPROACH FOR INTENSITY LOSS COMPENSATION 159 Fg. 20. Sequence 4: Reference secton t = 1 and some sectons from restored mage stack. Sectons: (a) t = 1, (b) t = 20, (c) t = 40, (d) t = 60, (e) t = 80, (f) t = 100, (g) t = 115, (h) t = 130, () t = 166.

Tutorial 2. COMP4134 Biometrics Authentication. February 9, Jun Xu, Teaching Asistant

Tutorial 2. COMP4134 Biometrics Authentication. February 9, Jun Xu, Teaching Asistant Tutoral 2 COMP434 ometrcs uthentcaton Jun Xu, Teachng sstant csjunxu@comp.polyu.edu.hk February 9, 207 Table of Contents Problems Problem : nswer the questons Problem 2: Power law functon Problem 3: Convoluton

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2) 1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons

More information

Appendix B: Resampling Algorithms

Appendix B: Resampling Algorithms 407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles

More information

Probability Density Function Estimation by different Methods

Probability Density Function Estimation by different Methods EEE 739Q SPRIG 00 COURSE ASSIGMET REPORT Probablty Densty Functon Estmaton by dfferent Methods Vas Chandraant Rayar Abstract The am of the assgnment was to estmate the probablty densty functon (PDF of

More information

CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION

CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala

More information

Pop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing

Pop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,

More information

Research Article Green s Theorem for Sign Data

Research Article Green s Theorem for Sign Data Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1 On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool

More information

Chapter 3 Describing Data Using Numerical Measures

Chapter 3 Describing Data Using Numerical Measures Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:

More information

A linear imaging system with white additive Gaussian noise on the observed data is modeled as follows:

A linear imaging system with white additive Gaussian noise on the observed data is modeled as follows: Supplementary Note Mathematcal bacground A lnear magng system wth whte addtve Gaussan nose on the observed data s modeled as follows: X = R ϕ V + G, () where X R are the expermental, two-dmensonal proecton

More information

Improvement of Histogram Equalization for Minimum Mean Brightness Error

Improvement of Histogram Equalization for Minimum Mean Brightness Error Proceedngs of the 7 WSEAS Int. Conference on Crcuts, Systems, Sgnal and elecommuncatons, Gold Coast, Australa, January 7-9, 7 3 Improvement of Hstogram Equalzaton for Mnmum Mean Brghtness Error AAPOG PHAHUA*,

More information

Quantitative Discrimination of Effective Porosity Using Digital Image Analysis - Implications for Porosity-Permeability Transforms

Quantitative Discrimination of Effective Porosity Using Digital Image Analysis - Implications for Porosity-Permeability Transforms 2004, 66th EAGE Conference, Pars Quanttatve Dscrmnaton of Effectve Porosty Usng Dgtal Image Analyss - Implcatons for Porosty-Permeablty Transforms Gregor P. Eberl 1, Gregor T. Baechle 1, Ralf Weger 1,

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010 Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton

More information

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

More information

MULTISPECTRAL IMAGE CLASSIFICATION USING BACK-PROPAGATION NEURAL NETWORK IN PCA DOMAIN

MULTISPECTRAL IMAGE CLASSIFICATION USING BACK-PROPAGATION NEURAL NETWORK IN PCA DOMAIN MULTISPECTRAL IMAGE CLASSIFICATION USING BACK-PROPAGATION NEURAL NETWORK IN PCA DOMAIN S. Chtwong, S. Wtthayapradt, S. Intajag, and F. Cheevasuvt Faculty of Engneerng, Kng Mongkut s Insttute of Technology

More information

Markov Chain Monte Carlo Lecture 6

Markov Chain Monte Carlo Lecture 6 where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways

More information

A Novel Fuzzy logic Based Impulse Noise Filtering Technique

A Novel Fuzzy logic Based Impulse Noise Filtering Technique Internatonal Journal of Advanced Scence and Technology A Novel Fuzzy logc Based Impulse Nose Flterng Technque Aborsade, D.O Department of Electroncs Engneerng, Ladoke Akntola Unversty of Tech., Ogbomoso.

More information

Semi-supervised Classification with Active Query Selection

Semi-supervised Classification with Active Query Selection Sem-supervsed Classfcaton wth Actve Query Selecton Jao Wang and Swe Luo School of Computer and Informaton Technology, Beng Jaotong Unversty, Beng 00044, Chna Wangjao088@63.com Abstract. Labeled samples

More information

IMAGE DENOISING USING NEW ADAPTIVE BASED MEDIAN FILTER

IMAGE DENOISING USING NEW ADAPTIVE BASED MEDIAN FILTER Sgnal & Image Processng : An Internatonal Journal (SIPIJ) Vol.5, No.4, August 2014 IMAGE DENOISING USING NEW ADAPTIVE BASED MEDIAN FILTER Suman Shrestha 1, 2 1 Unversty of Massachusetts Medcal School,

More information

Image Processing for Bubble Detection in Microfluidics

Image Processing for Bubble Detection in Microfluidics Image Processng for Bubble Detecton n Mcrofludcs Introducton Chen Fang Mechancal Engneerng Department Stanford Unverst Startng from recentl ears, mcrofludcs devces have been wdel used to buld the bomedcal

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA 4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected

More information

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

XII.3 The EM (Expectation-Maximization) Algorithm

XII.3 The EM (Expectation-Maximization) Algorithm XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

The Study of Teaching-learning-based Optimization Algorithm

The Study of Teaching-learning-based Optimization Algorithm Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

Motion Perception Under Uncertainty. Hongjing Lu Department of Psychology University of Hong Kong

Motion Perception Under Uncertainty. Hongjing Lu Department of Psychology University of Hong Kong Moton Percepton Under Uncertanty Hongjng Lu Department of Psychology Unversty of Hong Kong Outlne Uncertanty n moton stmulus Correspondence problem Qualtatve fttng usng deal observer models Based on sgnal

More information

Change Detection: Current State of the Art and Future Directions

Change Detection: Current State of the Art and Future Directions Change Detecton: Current State of the Art and Future Drectons Dapeng Olver Wu Electrcal & Computer Engneerng Unversty of Florda http://www.wu.ece.ufl.edu/ Outlne Motvaton & problem statement Change detecton

More information

Boostrapaggregating (Bagging)

Boostrapaggregating (Bagging) Boostrapaggregatng (Baggng) An ensemble meta-algorthm desgned to mprove the stablty and accuracy of machne learnng algorthms Can be used n both regresson and classfcaton Reduces varance and helps to avod

More information

Temperature. Chapter Heat Engine

Temperature. Chapter Heat Engine Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the

More information

A New Scrambling Evaluation Scheme based on Spatial Distribution Entropy and Centroid Difference of Bit-plane

A New Scrambling Evaluation Scheme based on Spatial Distribution Entropy and Centroid Difference of Bit-plane A New Scramblng Evaluaton Scheme based on Spatal Dstrbuton Entropy and Centrod Dfference of Bt-plane Lang Zhao *, Avshek Adhkar Kouch Sakura * * Graduate School of Informaton Scence and Electrcal Engneerng,

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

Expectation Maximization Mixture Models HMMs

Expectation Maximization Mixture Models HMMs -755 Machne Learnng for Sgnal Processng Mture Models HMMs Class 9. 2 Sep 200 Learnng Dstrbutons for Data Problem: Gven a collecton of eamples from some data, estmate ts dstrbuton Basc deas of Mamum Lelhood

More information

Chapter 4. Velocity analysis

Chapter 4. Velocity analysis 1 Chapter 4 Velocty analyss Introducton The objectve of velocty analyss s to determne the sesmc veloctes of layers n the subsurface. Sesmc veloctes are used n many processng and nterpretaton stages such

More information

DETERMINATION OF UNCERTAINTY ASSOCIATED WITH QUANTIZATION ERRORS USING THE BAYESIAN APPROACH

DETERMINATION OF UNCERTAINTY ASSOCIATED WITH QUANTIZATION ERRORS USING THE BAYESIAN APPROACH Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata TC XVII IMEKO World Congress Metrology n the 3rd Mllennum June 7, 3,

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Gaussian Mixture Models

Gaussian Mixture Models Lab Gaussan Mxture Models Lab Objectve: Understand the formulaton of Gaussan Mxture Models (GMMs) and how to estmate GMM parameters. You ve already seen GMMs as the observaton dstrbuton n certan contnuous

More information

Natural Images, Gaussian Mixtures and Dead Leaves Supplementary Material

Natural Images, Gaussian Mixtures and Dead Leaves Supplementary Material Natural Images, Gaussan Mxtures and Dead Leaves Supplementary Materal Danel Zoran Interdscplnary Center for Neural Computaton Hebrew Unversty of Jerusalem Israel http://www.cs.huj.ac.l/ danez Yar Wess

More information

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

Tracking with Kalman Filter

Tracking with Kalman Filter Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,

More information

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models Computaton of Hgher Order Moments from Two Multnomal Overdsperson Lkelhood Models BY J. T. NEWCOMER, N. K. NEERCHAL Department of Mathematcs and Statstcs, Unversty of Maryland, Baltmore County, Baltmore,

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

Regularized Discriminant Analysis for Face Recognition

Regularized Discriminant Analysis for Face Recognition 1 Regularzed Dscrmnant Analyss for Face Recognton Itz Pma, Mayer Aladem Department of Electrcal and Computer Engneerng, Ben-Guron Unversty of the Negev P.O.Box 653, Beer-Sheva, 845, Israel. Abstract Ths

More information

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS M. Krshna Reddy, B. Naveen Kumar and Y. Ramu Department of Statstcs, Osmana Unversty, Hyderabad -500 007, Inda. nanbyrozu@gmal.com, ramu0@gmal.com

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

Cathy Walker March 5, 2010

Cathy Walker March 5, 2010 Cathy Walker March 5, 010 Part : Problem Set 1. What s the level of measurement for the followng varables? a) SAT scores b) Number of tests or quzzes n statstcal course c) Acres of land devoted to corn

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering,

COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering, COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION Erdem Bala, Dept. of Electrcal and Computer Engneerng, Unversty of Delaware, 40 Evans Hall, Newar, DE, 976 A. Ens Cetn,

More information

Finite Mixture Models and Expectation Maximization. Most slides are from: Dr. Mario Figueiredo, Dr. Anil Jain and Dr. Rong Jin

Finite Mixture Models and Expectation Maximization. Most slides are from: Dr. Mario Figueiredo, Dr. Anil Jain and Dr. Rong Jin Fnte Mxture Models and Expectaton Maxmzaton Most sldes are from: Dr. Maro Fgueredo, Dr. Anl Jan and Dr. Rong Jn Recall: The Supervsed Learnng Problem Gven a set of n samples X {(x, y )},,,n Chapter 3 of

More information

/ n ) are compared. The logic is: if the two

/ n ) are compared. The logic is: if the two STAT C141, Sprng 2005 Lecture 13 Two sample tests One sample tests: examples of goodness of ft tests, where we are testng whether our data supports predctons. Two sample tests: called as tests of ndependence

More information

Unified Subspace Analysis for Face Recognition

Unified Subspace Analysis for Face Recognition Unfed Subspace Analyss for Face Recognton Xaogang Wang and Xaoou Tang Department of Informaton Engneerng The Chnese Unversty of Hong Kong Shatn, Hong Kong {xgwang, xtang}@e.cuhk.edu.hk Abstract PCA, LDA

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

BACKGROUND SUBTRACTION WITH EIGEN BACKGROUND METHODS USING MATLAB

BACKGROUND SUBTRACTION WITH EIGEN BACKGROUND METHODS USING MATLAB BACKGROUND SUBTRACTION WITH EIGEN BACKGROUND METHODS USING MATLAB 1 Ilmyat Sar 2 Nola Marna 1 Pusat Stud Komputas Matematka, Unverstas Gunadarma e-mal: lmyat@staff.gunadarma.ac.d 2 Pusat Stud Komputas

More information

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

A Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function

A Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1,

More information

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics ) Ismor Fscher, 8//008 Stat 54 / -8.3 Summary Statstcs Measures of Center and Spread Dstrbuton of dscrete contnuous POPULATION Random Varable, numercal True center =??? True spread =???? parameters ( populaton

More information

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence

More information

Clustering & Unsupervised Learning

Clustering & Unsupervised Learning Clusterng & Unsupervsed Learnng Ken Kreutz-Delgado (Nuno Vasconcelos) ECE 175A Wnter 2012 UCSD Statstcal Learnng Goal: Gven a relatonshp between a feature vector x and a vector y, and d data samples (x,y

More information

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for U Charts. Dr. Wayne A. Taylor

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for U Charts. Dr. Wayne A. Taylor Taylor Enterprses, Inc. Adjusted Control Lmts for U Charts Copyrght 207 by Taylor Enterprses, Inc., All Rghts Reserved. Adjusted Control Lmts for U Charts Dr. Wayne A. Taylor Abstract: U charts are used

More information

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com

More information

18.1 Introduction and Recap

18.1 Introduction and Recap CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng

More information

Department of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification

Department of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification Desgn Project Specfcaton Medan Flter Department of Electrcal & Electronc Engneeng Imperal College London E4.20 Dgtal IC Desgn Medan Flter Project Specfcaton A medan flter s used to remove nose from a sampled

More information

Microscopy with self-reconstructing beams

Microscopy with self-reconstructing beams Mcroscopy wth self-reconstructng beams Floran O. Fahrbach 1,, Phlpp Smon und Alexander Rohrbach 1, 1 Centre for Bologcal Sgnallng Studes (boss), Unversty of Freburg, Germany Laboratory for Bo- and ano-photoncs,

More information

A Fast Fractal Image Compression Algorithm Using Predefined Values for Contrast Scaling

A Fast Fractal Image Compression Algorithm Using Predefined Values for Contrast Scaling Proceedngs of the World Congress on Engneerng and Computer Scence 007 WCECS 007, October 4-6, 007, San Francsco, USA A Fast Fractal Image Compresson Algorthm Usng Predefned Values for Contrast Scalng H.

More information

Queueing Networks II Network Performance

Queueing Networks II Network Performance Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL

More information

GEMINI GEneric Multimedia INdexIng

GEMINI GEneric Multimedia INdexIng GEMINI GEnerc Multmeda INdexIng Last lecture, LSH http://www.mt.edu/~andon/lsh/ Is there another possble soluton? Do we need to perform ANN? 1 GEnerc Multmeda INdexIng dstance measure Sub-pattern Match

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Fuzzy Boundaries of Sample Selection Model

Fuzzy Boundaries of Sample Selection Model Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN

More information

Statistical Evaluation of WATFLOOD

Statistical Evaluation of WATFLOOD tatstcal Evaluaton of WATFLD By: Angela MacLean, Dept. of Cvl & Envronmental Engneerng, Unversty of Waterloo, n. ctober, 005 The statstcs program assocated wth WATFLD uses spl.csv fle that s produced wth

More information

Lab 2e Thermal System Response and Effective Heat Transfer Coefficient

Lab 2e Thermal System Response and Effective Heat Transfer Coefficient 58:080 Expermental Engneerng 1 OBJECTIVE Lab 2e Thermal System Response and Effectve Heat Transfer Coeffcent Warnng: though the experment has educatonal objectves (to learn about bolng heat transfer, etc.),

More information

Probability Theory (revisited)

Probability Theory (revisited) Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted

More information

Second Order Analysis

Second Order Analysis Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Rotation Invariant Shape Contexts based on Feature-space Fourier Transformation

Rotation Invariant Shape Contexts based on Feature-space Fourier Transformation Fourth Internatonal Conference on Image and Graphcs Rotaton Invarant Shape Contexts based on Feature-space Fourer Transformaton Su Yang 1, Yuanyuan Wang Dept of Computer Scence and Engneerng, Fudan Unversty,

More information