Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm

Size: px
Start display at page:

Download "Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm"

Transcription

1 Desgn of a Real Tme FPGA-based Three Dmensonal Postonng Algorthm Nathan G. Johnson-Wllams, Student Member IEEE, Robert S. Myaoka, Member IEEE, Xaol L, Student Member IEEE, Tom K. Lewellen, Fellow IEEE, and Scott Hauck, Senor Member IEEE Abstract We report on the mplementaton and hardware platform of a real tme Statstcs-Based Processng (SBP) method wth depth of nteracton processng for contnuous mnature crystal element (cmce) detectors usng a sensor on the entrance surface desgn. Our group prevously reported on a Feld Programmable Gate Array (FPGA) SBP mplementaton that provded a two dmensonal (2D) soluton of the detector s ntrnsc spatal resoluton. Ths new mplementaton extends that work to take advantage of three dmensonal (3D) look up tables to provde a 3D postonng soluton that mproves ntrnsc spatal resoluton. Resoluton s most mproved along the edges of the crystal, an area where the 2D algorthm s performance suffers. The algorthm allows an ntrnsc spatal resoluton of ~0.90 mm FWHM n X and Y and a resoluton of ~1.90 mm FWHM n Z (.e., the depth of the crystal) based upon DETECT2000 smulaton results that nclude the effects of Compton scatter n the crystal. A ppelned FPGA mplementaton s able to process events n excess of 220k events per second, whch s greater than the maxmum expected concdence rate for an ndvdual detector. In contrast to all detectors beng processed at a centralzed host, as n the current system, a separate FPGA s avalable at each detector, thus dvdng the computatonal load. A prototype desgn has been mplemented and tested usng a reduced word sze due to memory lmtatons of our commercal prototypng board. A I. INTRODUCTION contnuous mnature crystal element (cmce) detector s a low cost alternatve to dscrete crystal detector modules that have tradtonally been used to acheve hgh spatal resoluton for small anmal postron emsson tomography (PET) scanners. A key to the magng performance of the cmce detector s the use of a statstcs based postonng (SBP) algorthm [1,2]. SBP s used to mprove the resoluton of the monolthc sensor module and ncrease the effectve mage area of the sensor compared to Anger postonng. The bass of SBP nvolves the calculaton of the most lkely locaton of an event gven the sensor outputs. We prevously reported on a feld programmable gate array (FPGA) mplementaton of our SBP method for a two dmensonal (2D) soluton (.e., X and Y postonng) for a cmce detector [4]. Whle the majorty of events occur near the surface of the module crystal, the depth of nteracton does vary for each event. Accurate calculaton of the depth of nteracton permts more accurate calculatons of the concdence lne of response (LOR) and yelds better ntrnsc spatal resoluton performance for our cmce detectors. A three dmensonal (3D) SBP algorthm provdes a soluton that ncludes the X and Y dmensons and the depth of nteracton. Whle the prmary goal of fndng the depth of nteracton s for use wth the LOR, the three dmensonal algorthm also provdes better X and Y resoluton. The use of depth of nteracton n calculatons allows a closer match between sensor outputs and characterzaton tables. The advantage of properly matched characterzaton tables s most evdent near the edges and corners of the crystal where the resoluton of 2D SBP usually suffers. II. DETECTOR DESIGN AND METHODS A. cmce Detector Module The cmce detector module s modeled as beng composed of a 49.6 mm by 49.6 mm by 15 mm LYSO crystal coupled to a 2D array of sensors [Fg. 1]. The module uses a novel sensor on the entrance surface (SES) desgn whch places the sensors on the entrance of the crystal [3]. The advantage of placng the sensor array on the entrance surface of the crystal s that t places the sensors closer to where the majorty of events Manuscrpt receved November 13, Ths work was supported n part by Zecotech, Altera, DOE DE-FG02-08ER64676, and NIH grants EB and EB N. Johnson-Wllams, and S. Hauck are wth the Unversty of Washngton Department of Electrcal Engneerng, Seattle, WA USA (e-mal: NathanJW@u.washngton.edu, Hauck@ee.washngton.edu). R. Myaoka, X. L, and T. Lewellen are wth Unversty of Washngton Department of Radology, Seattle, WA USA. occur. Fg. 1. Illustraton of detector module wth sensor on the entrance surface desgn. The sensor array contans 256 (.e., 16x16) MAPD elements.

2 The sensor array conssts of a 16 by 16 array of mcro-pxel avalanche photododes (MAPD). MAPDs are one vendor s verson of the Geger mode APD. To reduce the computatonal load of handlng 256 ndvdual sensors outputs row-column summng s used and reduces the 16 by 16 array to 32 outputs. Smulaton tools were used to determne the lght response functon of the descrbed cmce detector. To summarze, DETECT2000 [5,6] s used to determne the probablty that a lght photon generated at a specfc (X, Y, Z) poston n the crystal s detected by a specfc photosensor. GEANT [7] s used to track the gamma nteractons (both Compton and photoelectrc) wthn the crystal. For each nteracton, the number of lght photons produced by the scntllator crystal s determned. That number s adjusted for the nonproportonalty of LSO accordng to the tables reported by Rooney [8]. Posson nose s then added to the number of lght photons produced. B. Statstcs-based Postonng Method (SBP) Suppose the dstrbutons of the 32 row-column sum outputs, M = m1, m2,, m32 for scntllaton poston X,Y are ndependent normal dstrbutons wth mean {μ(x)} and standard devaton {σ(x)}. The lkelhood functon for makng any sngle observaton m gven x s: n 2 1 ( m ( )) μ x L[ m = x] exp 2 = ( ) 1 σ ( x) 2π 2σ x (1) The maxmum lkelhood estmator of the event poston x s gven by: 2 ( m ( )) μ x arg mn + ln( σ ( x) ) 2( ) x 2σ x (2) The mean and varance of the lght probablty densty functon (PDF) are created by characterzng the detector module. For the two dmensonal method the module s characterzed at a resoluton of 127x127 (X,Y). Each pont s spaced.3875mm apart gvng a unform dstrbuton across the 49.6mm X 49.6mm crystal. For more detaled explanatons about the SBP mplementaton refer to Joung and Lng [1,2]. C. Three Dmensonal SBP The same prncples of the two dmensonal SBP can be appled to a 3D search. Instead of two dmensons, the lght response functon s characterzed n 3D, gvng μ and σ as a functon of X, Y and Z. The module s characterzed for 127x127x15 postons, wth 127x127 representng the X and Y dmensons wth each X and Y poston characterzed for 15 depths. As wth the 2D mplementaton, each XY poston s on a grd wth each pont separated by.3875mm. The 15 depths, however, are not equally dstrbuted over the 15mm deep crystal; depth s characterzed at a hgher resoluton near the entrance of the crystal where events are most lkely to occur [Table 1, Fg. 2]. In total the module s characterzed for 241,935 dfferent postons, 15 tmes more than the 2D mplementaton. The lkelhood functon of 3D SBP s seen n Equaton 3. Fg. 2. Illustraton of the dstrbuton of depth levels Start Depth End Depth Level Level Level Level Level Level Level Level Level Level Level Level Level Level Level Table 1. Locaton of depth levels n the 15 mm thck scntallator crystal. D. Herarchcal Search A herarchcal search can be used to produce a SBP soluton n many fewer teratons than an exhaustve search. A herarchcal search begns wth a coarse graned search, and through each stage becomes more refned, untl the maxmum resoluton s reached n the fnal stage [Fg. 3]. A sx stage, two dmensonal, herarchcal search has been mplemented and tested for prevous versons of the cmce detector module [4]. Each search stage compares nne dfferent ponts equally dstrbuted across the search area. The lkelhood of each pont s calculated and the most lkely of the nne ponts s selected as the center pont for the next more refned search [Fgure 9]. Comparng 9 dfferent ponts n each search stage allows the herarchcal SBP algorthm to solve for the postonng of a 127x127 grd n sx stages. In total, 54 data pont computatons are requred, whch s a drastc reducton from the 16,129 data pont calculatons needed for an exhaustve search. (3)

3 Fg. 3. Example of a sx stage herarchcal soluton for 2D SBP. E. Two Dmensonal SBP Implementaton A two dmensonal herarchcal SBP algorthm has been desgned and mplemented on an FPGA development board [4]. The mplementaton produced smlar accuracy to exhaustve methods wth a drastcally reduced number of calculatons. The sx stages of the herarchcal search were ppelned n the FPGA mplementaton [Fg. 4]. In ths arrangement the algorthm could produce a soluton wth a much hgher throughput, the tme t takes to solve a sngle stage. The FPGA mplementaton was capable of processng data n real tme, n excess of 200,000 events per second. Fg. 4. Ppelned mplementaton of Herarchcal 2D SBP III. ALGORITHM DESIGN A. Hardware Lmtatons The lmtng factor n mplementng the SBP algorthm s the large data tables requred for the fne graned search stages toward the end of the ppelne. In the fnal stage of the 2D mplementaton the sxth search stage requred a data table over 2.75MB. Snce 3D SBP characterzes the lght response functon for 15 depths t s expected that the requred tables wll be sgnfcantly larger. Custom hardware s currently under desgn for the applcaton. The custom hardware wll feature Altera's Stratx III FPGA wth three large banks of external memory wth suffcent capacty to store the large data tables requred for 3D SBP. Wth the custom hardware n progress a development board was used to ad n the desgn and mplementaton of the 3D algorthm. The development board used s the Stratx II DSP Development Board Professonal Edton whch features the Stratx II FGPA. Of partcular nterest to ths applcaton s the avalable ~8Mb of on chp memory, 32Mb of off-chp SRAM memory, and 128Mb of off-chp SDRAM memory. B. Algorthm Dervaton Many of the same deas and approaches from the 2D mplementaton were carred over to the 3D mplementaton. As a basc approach, the herarchcal search method was used to reduce the number of calculatons requred to produce a soluton. Snce the 3D mplementaton adds an extra dmenson and the detector module s slghtly dfferent some changes were needed. The smplest way to extend the 2D herarchcal search to a 3D herarchcal search s to expand some of the stages n the prevous 2D algorthm to 3D stages. The 3D search treats the depth of nteracton as an ndependent varable (just lke the X and Y dmensons), and adds the depth varable to the search algorthm. A 3D stage uses a volumetrc search, performng the same basc comparson operaton as a 2D stage but comparng a dstrbuton of ponts across the X, Y, and Z dmensons n place of just the X and Y dmensons [Fg. 5]. The 3D stage fnds the best ft combnaton of X, Y, and, Z wthn the stage s dstrbuton of ponts. Fg. 5. Groupng of voxels n a 2D search (left) and groupng of voxels n a 3D search (rght). Functonally, a 3D stage works smlar to a 2D stage wth one major dfference; a 3D stage uses a three dmensonal characterzaton table n place of a two dmensonal characterzaton table. In a 3D table, values are dependent on all three dmensons rather than n a 2D table where X and Y values are averaged accordng to the expected dstrbuton of depth. The 3D table allows a 3D stage to examne ndependent ponts across all three dmensons and select the best ft pont n X, Y, and Z. The computaton process n a 3D stage s the same as n a 2D stage, the lkelhood of each pont s calculated wth the best ft becomng the center pont n the more refned search carred out n the next stage. Snce a 3D search compares the same XY ponts of a 2D search at multple depths, a 3D search wll consder a greater total number of ponts than the comparable 2D search. For the gven system, the depth of nteracton s defned by 15 depths. As wth the XY planar search, the depth search can be dvded nto a herarchcal search, reducng the number of computatons requred to produce a soluton. Dvdng the 15 levels equally nto a herarchcal search would allow the depth soluton to be found n only 3 stages, wth each stage comparng three depths [Fg. 6]. Snce the exstng ppelne has sx stages, only half of the stages wll be converted to 3D stages. Stages not converted to a three dmensonal search wll reman two dmensonal to complete the XY search. Wth only half of the search stages requred to be volumetrc, the order of those stages n the ppelne becomes a varable for optmzaton of accuracy and memory requrements.

4 soluton early enough to ncrease the accuracy of the fnergraned XY searches. The best combnaton tested places a volumetrc search thrd, fourth, and ffth n the ppelne. Fg. 6: Outlne of herarchcal search to fnd depth among 15 levels. Planar searches followng any volumetrc stages n the ppelne wll also use three dmensonal characterzaton tables. The depth of nteracton found n the precedng stages s used as a constant wth the 3D characterzaton table producng a 2D dmensonal characterzaton table matched to the calculated depth of nteracton. The matched table offers the advantage that characterzaton values from the table are based on a specfc depth, whch s more accurate than a 2D table where the values are based on an average depth. The prncple downsde to the volumetrc search stage approach s the ncreased number of computatons requred. As outlned above, each volumetrc search n the ppelne performs a 3x3x3 search, 3 tmes as many calculatons as the orgnal 2D search. Wth memory bandwdth lmtatons restrctng each stage to operatng on one pont at a tme, the 3D stage has a crtcal path of 27 calculatons. Replacng a 2D stage wth a 3D stage ncreases the crtcal path length n the ppelne to that of the 3D stage, reducng throughput by a factor of three. The memory requrement for a 3D search s also drastcally ncreased. Each volumetrc search and each 2D stage followng a volumetrc search requres a 3D table. The sze ncrease of a 3D table over a 2D table s dependant on the number of levels ncluded. For example, a 3D table wth all 15 depths requres 15 tmes the memory of the correspondng 2D table. Snce the depth search s organzed as a herarchcal search not every volumetrc search requres a full 3D table. The table for the frst of the three volumetrc stages s ncreased by a factor three, the second by a factor of seven, and the thrd by a factor of ffteen. Any 2D stage followng a 3D stage s requred to have at least as many depths as the precedng 3D stage. Wth the 2D sxth stage table already requrng close to 3MB, convertng to 3D tables s a sgnfcant ncrease n capacty requrements. To evaluate tradeoffs the algorthm was tested wth the volumetrc search stages placed n dfferent locatons n the ppelne to study the effects of volumetrc search placement compared to system accuracy [Table 2]. The results show that placng the depth search too early or too late n the ppelne s detrmental to system accuracy across all dmensons. When the volumetrc stages were placed early, the X and Y resoluton proved to be too coarse/naccurate to provde a good bass for a depth search. When placed late, results ndcated that many of the calculatons early n the ppelne were naccurate due to a lack of nformaton on the actual depth of nteracton. Placng the volumetrc searches toward the mddle of the ppelne allowed a suffcently accurate XY bass for calculatng the depth whle producng a depth Locaton of Volumetrc Searches FWHM-XY FHWM-Z Stages 1,2, Stages 2,3, Stages 3,4, Stages 4,5, Table 2. Accuracy of SBP Algorthm wth volumetrc search stages placed at dfferent locatons n the ppelne. Placng a volumetrc search thrd, fourth, and ffth n the ppelne produces very good results; however there are several hardware lmtatons whch prohbt ts use. The added memory requrement of the volumetrc searches would exceed the capacty of the on-chp memory currently avalable, whch would move the later volumetrc stage s table off-chp where memory bandwdth s much more lmted. Total memory capacty s also a problem snce the sxth stage table s requred to be ffteen tmes larger than the orgnal 2D table. The number of computatons requred for each volumetrc search s also prohbtve. Gven the current hardware desgn, there s nsuffcent memory bandwdth to perform the 27 calculatons requred for a volumetrc search and meet the throughput requrements of the system. The exstng hardware wll only permt the 27 calculatons necessary n a volumetrc stage to be computed n approxmately 500 clock cycles, yeldng a throughput of 140,000 events per second. Ths s 0.7x the requred throughput. To ncrease the throughput of the system, the volumetrc search can be splt nto two ndependent stages: an XY planar search followed by a lnear Z search. Usng ths method the algorthm wll alternate between a 3x3 planar search and a 3 depth lnear search. The two stages combned do not perform the same operaton as the volumetrc search; n place of comparng all possble ponts (X,Y,Z) the algorthm frst solves for XY, and then Z [Fg. 7]. Ths change dramatcally ncreases the throughput of the algorthm, reducng the 27 calculaton operatons to 9 operatons. Fg. 7. Comparson between a volumetrc search stage (left) and a planar/lnear search stage (rght). Both the planar search and the lnear search wll use 3D characterzaton tables. The planar search wll use the depth nformaton found n the precedng stages as a constant, solvng for the best ft XY at the gven depth. The lnear search wll use the XY nformaton found n the prevous stage as a constant, solvng for the best depth ft at the gven XY. The addtonal 3 ndependent depth search stages sgnfcantly

5 ncreases hardware requrements over the sngle volumetrc search stage. By havng both the planar and lnear searches act ndependently as separate stages, the memory bandwdth and capacty requrements are sgnfcantly ncreased compared to the volumetrc search, as each stage would requre ts own characterzaton tables and perform ther calculaton ndependently. At the cost of some throughput, the ncrease n requred memory bandwdth and capacty requrements can be addressed. The ndependent planar search and lnear search can be grouped as a sngle stage performng two operatons. In ths confguraton the stage frst performs a planar search, followed by the lnear search. Ths allows the planar search and lnear search to share one memory table. The cost of ths s an ncrease n the crtcal path caused by the addton of the 3 lnear search calculatons to the planar stage. Compared to the orgnal volumetrc search approach frst descrbed, ths varaton allows an algorthm wth no addtonal memory bandwdth or memory capacty requrements but wth a greater than 2X ncrease n throughput. Usng the same test setup as the volumetrc search algorthm, several orderngs of the planar/lnear stages were compared [Table 3]. As was seen n Table 1 there s a sgnfcant qualty gan when performng the depth searches after the frst stage and lttle to no gan n begnnng the depth searches after the second stage. The best opton s placng a hybrd search stage second, thrd and fourth n the ppelne. Compared wth the best opton from table 1, the hybrd search stage performs smlarly, wth slghtly mproved depth resoluton and slghtly poorer XY resoluton. Locaton of Lnear/Planar Stages FWHM-XY FHWM-Z Stages 1,2, Stages 2,3, Stages 3,4, Stages 4,5, Table 3. Accuracy of SBP Algorthm wth lnear/planar search stages placed at dfferent locatons n the ppelne. Another opton avalable to ncrease throughput s placng the depth search by tself n a sngle stage, performng the entre depth search at once. Usng the prevously outlned herarchcal depth search, the DOI can be found n a sngle stage n 9 calculatons. Gven that a herarchcal search can fnd the depth n 9 calculatons, placng the depth search n a sngle stage mantans the orgnal 2D search s crtcal path length to 9 calculatons. Ths change offers several other benefts wthout much cost. By compressng all of the depth searches nto a sngle stage the memory tables needed for the coarser graned depth searches can be elmnated, reducng the capacty requrement of on-chp memory. Table 4 shows the smulated results of the algorthm wth the lnear depth search placed at dfferent locatons n the ppelne. Compared wth results from table 2, t can be seen that performng the entre depth search n a sngle stage has lttle effect on the accuracy of the system. Based on the results shown n Table 3 there s no beneft n performng the depth search after the thrd stage of planar XY search. Snce the depth search characterzaton table sze ncreases by a factor of 4 for each planar search precedng t, the depth search s deally placed after the thrd XY search, where a hgh degree of accuracy s acheved wthout requrng a larger memory than necessary. Locaton of Lnear Depth Search FWHM-XY FHWM-Z After Stage After Stage After Stage After Stage After Stage After Stage Table 4. Accuracy of SBP Algorthm wth sngle herarchcal search stages placed at dfferent locatons n the ppelne. A common problem to all the prevously descrbed methods s the large memory capacty requred. The full data tables for the later stages of the algorthm are qute large, wth the sxth stage 15-depth table requrng 45MB of storage space. The total memory requrement for the system exceeds 60MB, an amount greater than the development board capacty. Whle not requred, an XY planar search can beneft from the use of a three dmensonal characterzaton table over a two dmensonal one. A three dmensonal characterzaton table allows a better match between sensor outputs and table values based on the known depth rather than an average or assumed depth. However, not all 15 depths are requred to take advantage of ths. In the case of stage 4, 5 and 6 the full data table s not requred and a smplfed three dmensonal table can be used whch has a reduced number of levels. Ths reducton saves memory at the potental cost of lower accuracy. In general, the greater number of levels that can be used, the greater the accuracy. However, the results ndcate that the number of depths used s subject to dmnshng returns, where sgnfcant mprovements n accuracy correlate wth larger tables up to a certan pont when accuracy s not ganed as readly. In the best case of hgh accuracy wth a reduced table sze, 4 depths are used n stage 4, 8 n stage 5, and 15 n stage 6. Ths corresponds to the followng memory requrements: 768KB for the 4 th stage, 6MB for the 5 th stage, and 45MB for the 6 th stage. However, the development board cannot support such a large memory requrement. The general trend s that the more depths used, the greater the accuracy. Followng ths general trend, the best combnaton wll be the most detaled characterzaton tables that can ft on the development board. After allocatng some of the on-chp memory for the frst three stages and the depth stage, roughly.2mb remans for the fourth stage. Ths s only suffcent space for a sngle depth 4 th stage table. The off chp SRAM has 32KB of addressng, allowng at most a 2 depth 5 th stage table. The 500KB of addressng for the SDRAM memory s suffcent to allow an 8 depth 6 th stage table. Although an 8 depth table can be used for the sxth stage, a 4 depth table produces slghtly better results. The recommended number of depths used for the development board mplementaton uses 1 depth for stage 4, 2

6 depths for stage 5, and 4 depths for stage 6 (hghlghted n Table 5). Whle ths soluton s not deal, t s a sgnfcant mprovement over usng a sngle depth for the fnal stages and also represents a sgnfcant savngs n memory. Reducng stage 4 from a 15 depth table to a 1 depth table saves 2.625MB, whle the reducton n stages 5 and 6 save 9.75MB and 24MB respectvely. The reductons amount to a total 58% lower memory capacty requrement for the system. Combnng observatons from the prevous tests gves the basc framework of the three dmensonal algorthm [Fg. 8]. The frst three stages are XY planar searches, smlar to ones used n the orgnal two dmensonal algorthm. The depth of nteracton s found n a lnear search after the frst three stages and the depth s then used as part of the planar searches n stages 5 and 6. The depth remans unchanged through the last three stages of the ppelne. Fg. 8. Basc framework of 3D SBP herarchcal search. C. Dynamc Breadth Search In the deal case the soluton set forms a hyperbolc parabalod wth a smooth and consstent gradent to the most lkely soluton. In ths deal case a herarchcal search wll consstently produce the same result as an exhaustve search, as any pont closer to the absolute mnmum has a greater lkelhood, allowng the algorthm to always converge to the correct soluton. However, n practce the soluton set s rarely deal and often has local mnma or an uneven gradent. There are many reasons behnd the unbalanced gradent and local mnma: reflectons from the edges of the crystal, truncaton of the sgnals due to the edges of the crystal, and nose n the system. Reflectons from the edge of the crystal are most detrmental to system accuracy. In ths case lght can reflect from the edge of the crystal, gvng the appearance of an event n a dfferent locaton. Lastly, as wth any system, nose can have a detrmental effect to the system s accuracy. Most detrmental to system accuracy are local mnma. A local mnmum s a porton of the soluton set whch breaks from the general gradent of the set and, when vewed n a lmted scope, appears to be the absolute mnmum of the system. As a result of a local mnmum, a herarchcal search can ncorrectly select a pont farther from the absolute mnma n coarse graned stages and eventually converge to the local mnma as a soluton n place of the true mnmum. Generally, the local mnma that can trap the herarchcal search are located near the true mnmum. Local mnma and nose that have a great effect on system accuracy have the hghest occurrence on the outer edges of the crystal where reflectons are most lkely to occur. Examnng the results of data sets across a range of postons on the crystal show that events occurrng wthn 5mm of the crystal edge produce sgnfcantly poorer results than postons located closer to the center of the crystal. A hgh occurrence of the same local mnma leads to a tendency to produce ncorrect solutons n the same locaton wth a hgher than normal frequency. When vewng a large number of samples for a data pont wth local mnma, the dstrbuton of the results shows multple peaks: often the correct soluton and a peak occurrng at each locaton of a local mnmum [Fg. 9]. Fg. 9. Example of multple peakng (left) found wth a 2D herarchcal search compared to the desred soluton (rght) found wth an exhaustve search. Addtonal peaks, even those close to the correct soluton, have a great effect on the usefulness of the PET system. When constructng an mage from postonng data t s mpossble to determne the dfference between a peak caused by a correct event or by a local mnmum. Incorrectly dentfyng a peak caused by a local mnmum as a true poston leads to mage ghostng, an object that appears n the produced mage but does not actually exst. Inversely, gnorng closely grouped peaks that mght be caused by local mnma but are actually dfferent data ponts can elmnate valuable nformaton. Snce mage reconstructon cannot dfferentate between the two, t s mportant to elmnate the problem at the source and ensure that the herarchcal search s not affected by local mnma n the soluton set. Examnaton of data sets wth local mnma shows that local mnma have a tendency to occur near the absolute mnma. Snce the local mnma have a tendency to be located near the true mnma a broader fne gran search becomes a vable correcton opton. A broader 5x5 search ncreases the range of the search by.3875mm n all drectons. Expandng the fnal search stage from a 3x3 to a 5x5 reduces the occurrence of multple peakng by 41% and decreases average error by.011 mm over the entre range of postons. A 7x7 search ncreases the range of the search by.775 mm. Whle a 7x7 doesn t further decrease the rate of dual peakng, expandng the fnal search stage to a 7x7 search reduces the average error by an addtonal.001mm compared to the 5x5. When expanded to a 9x9 search there s lttle beneft over a 7x7, wth only a slght decrease n average error. Further analyss shows that postons located n the corner of the crystal are more greatly affected than those that are near only one edge. Nearly every data pont wthn 5mm of the corner had nstances of multple peakng. If the data pont s located along a sngle edge the occurrence s generally much lower and less severe. When focusng on an area 5mm from a corner a 5x5 search reduces the nstances of dual peakng by 36%, a 7x7 reduces the rate by 68%, and a 9x9 reduces the rate by a comparable amount. Smlar performance gans are also seen n average error: a 5x5 reduces average error by.09mm, a 7x7 reduces average error by.13mm, and a 9x9 reduces average error by.15mm. The cost of the expanded search s ncreased computatonal requrements. Compared to a 3x3 search, a 5x5 search requres

7 2.7 tmes as many calculatons. A 7x7 search requres 5.4 tmes as many calculatons as a 3x3, and a 9x9 search requres 9 tmes as many calculatons. A broader fnal search stage, whle addressng the multple peak ssue, has a great effect on system throughput. Replacng the fnal stage wth a broader search reduces throughput by 2.7X for a 5x5, 5.4 for a 7x7, and 9 for a 9x9. Snce 9x9 search requres a sgnfcantly greater number of calculatons, wth an only slght beneft over the 7x7, t s not consdered. The majorty of crystal postons receve lttle to no beneft from usng an expanded search. Examnng system accuracy and occurrences of multple peaks shows that only postons wthn 5mm of the crystal edge are benefted by a broader search. Approxmately 37% of the crystal area falls wthn 5mm of an edge. Gven an equal dstrbuton of events across the crystal ths corresponds to 37% requrng a broader search. If only events wthn 5mm of the edge of the crystal nvoke a 7x7, throughput s reduced to.38x compared to a 3x3 fnal stage. Further mprovements can be made usng a 5x5 search for data located near only one edge of the crystal and a 7x7 search for data located n the corner of the crystal [Fg. 10]. Ths modfcaton results n an ncrease of throughput of 1.5X over only usng a 7x7 search, reducng throughput to.57x when compared to the 3x3 search. the prevous stage ndcates that the poston s near the edge the algorthm enters the 5x5 search state, and f the prevous stage ndcates a corner poston the algorthm enters the 7x7 search state. Note that the state of the fnal stage has no effect on the operatons of the precedng stages. IV. RESULTS The new three dmensonal SBP algorthm produces hgher qualty results than the prevous two dmensonal SBP for our new detector module. The dfference between the two algorthms s greatest at the edge of the crystal where the three dmensonal method produces greatly mproved results and the two dmensonal method typcally performs poorly (Table 5). Another advantage that s not captured by the FWHM results s that when usng a 2D look up table there s a sgnfcant problem wth dual peakng of the postonng estmate. Ths has been corrected n part by usng 3D SBP and further mprovement was ganed by the use of the dynamc breadth search. The 3D SPB algorthm was ppelned and has been mplemented on a commercally avalable FPGA development board. The mplementaton can process events n excess of 220k events per second, whch s greater than the maxmum expected concdence rate for an ndvdual detector. In comparson to an exhaustve search, whch compares the lkelhood of every pont, the mplemented algorthm produces a soluton n much fewer calculatons and wth a smlar accuracy [Table 6]. Fg. 10: Search breadth regons A 7x7 search s computatonal ntensve, requrng more than fve tmes the calculatons of a 3x3 search. Whle only a porton of data ponts are expected to nvoke a 7x7 search, the computatonal ntensty of those select data ponts have a profound mpact. Whle multple fnal stage data tables allowng parallel calculatons would be deal, the sze of a full table makes t mpractcal. Alternatvely, n the event of a 7x7 search the ppelne s stalled whle the 7x7 search performs the extra calculatons; n ths stuaton the characterzaton tables of the prevous stage are unused for much of the tme. In an effort to ncrease the throughput of a 7x7 search the ffth stage table can be used to perform some of the calculatons. 9 of the ponts n a 7x7 search are avalable n the ffth stage table; performng those calculatons n parallel ncreases the throughput of a 7x7 search by 22%. Overall ths change results n an expected 1.05X speed up averaged across all data ponts compared to usng the sxth stage table by tself. The decson of search breadth s based on the poston found n the precedng stage. When the precedng stage ndcates that the locaton of the event s wthn 5mm of the edge of the crystal the algorthm s adjusted accordngly. If Dstance From Edge of Crystal FWHM-XY 2D Algorthm 3D Algorthm Table 5. Comparson between two and three dmensonal SBP methods FWHM-XY FHWM-Z Method Exhaustve SBP D Herarchcal SBP Table 6. Comparson between exhaustve and three dmensonal SBP methods. REFERENCES [1] J Joung, et al., CMce: a hgh resoluton anmal PET usng contnuous LSO wth a statstcs based postonng scheme, NIM. Phys. Res. A, vol. 489, no. 1-3, pp , Aug [2] T. Lng, et al., Performance comparsons of contnuous mnature crystal elements (cmce) detectors, IEEE TNS, vol. 53, pp , [3] X. L, et al., A hgh resoluton, monolthc crystal PET/MRI detector wth DOI postonng capablty IEEE EMBS, pp , 2008 [4] D. DeWtt, Master s Thess, Department of Electrcal Engneerng, Unversty of Washngton, 2008.

8 [5] G. Tsang, et al., A smulaton to model poston encodng multcrystal PET detectors, IEEE TNS, vol. 42, pp , [6] G. F. Knoll, et al., Lght collecton n scntllaton detector compostes for neutron detecton, IEEE TNS, vol. 35, pp , [7] S. Agostnell, et al., "Geant4 a smulaton toolkt," NIM Secton A, vol. 506, pp , [8] B. D. Rooney, et al., Scntllator lght yeld nonproportonalty: calculatng photon response usng measure electron response, IEEE TNS, vol. 44, pp , 1997.

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

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

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

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

Parallelism for Nested Loops with Non-uniform and Flow Dependences

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

More information

A 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

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

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

More information

Wishing you all a Total Quality New Year!

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

More information

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

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

More information

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

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

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

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

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

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

More information

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

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

User Authentication Based On Behavioral Mouse Dynamics Biometrics

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

More information

Reducing Frame Rate for Object Tracking

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

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

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

More information

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

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

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

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

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

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Multi-view 3D Position Estimation of Sports Players

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

More information

Feature Reduction and Selection

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

More information

A 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

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

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

More information

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

Load Balancing for Hex-Cell Interconnection Network

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

More information

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

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

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

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

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

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

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

More information

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 fault tree analysis strategy using binary decision diagrams

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

More information

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

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

More information

Programming in Fortran 90 : 2017/2018

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

More information

The Codesign Challenge

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

More information

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

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

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

More information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

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

Problem Set 3 Solutions

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

More information

Lecture 5: Multilayer Perceptrons

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

More information

Pictures at an Exhibition

Pictures at an Exhibition 1 Pctures at an Exhbton Stephane Kwan and Karen Zhu Department of Electrcal Engneerng Stanford Unversty, Stanford, CA 9405 Emal: {skwan1, kyzhu}@stanford.edu Abstract An mage processng algorthm s desgned

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

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

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

More information

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

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

More information

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

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

Performance Evaluation of Information Retrieval Systems

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

More information

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

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm

Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm Nathan G. Johnson-Williams, Student Member IEEE, Robert S. Miyaoka, Senior Member IEEE, Xiaoli Li, Student Member IEEE, Tom K. Lewellen,

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Analysis of Continuous Beams in General

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

More information

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

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

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

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

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

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

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

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

A Statistical Model Selection Strategy Applied to Neural Networks

A Statistical Model Selection Strategy Applied to Neural Networks A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos

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

CSE 326: Data Structures Quicksort Comparison Sorting Bound

CSE 326: Data Structures Quicksort Comparison Sorting Bound CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the

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

Fusion Performance Model for Distributed Tracking and Classification

Fusion Performance Model for Distributed Tracking and Classification Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

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

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables

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

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

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

Simplification of 3D Meshes

Simplification of 3D Meshes Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng

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

Intelligent Information Acquisition for Improved Clustering

Intelligent Information Acquisition for Improved Clustering Intellgent Informaton Acquston for Improved Clusterng Duy Vu Unversty of Texas at Austn duyvu@cs.utexas.edu Mkhal Blenko Mcrosoft Research mblenko@mcrosoft.com Prem Melvlle IBM T.J. Watson Research Center

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

Advanced Computer Networks

Advanced Computer Networks Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

CMPS 10 Introduction to Computer Science Lecture Notes

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

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

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

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

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

More information

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

Classification Based Mode Decisions for Video over Networks

Classification Based Mode Decisions for Video over Networks Classfcaton Based Mode Decsons for Vdeo over Networks Deepak S. Turaga and Tsuhan Chen Advanced Multmeda Processng Lab Tranng data for Inter-Intra Decson Inter-Intra Decson Regons pdf 6 5 6 5 Energy 4

More information

Wireless Sensor Network Localization Research

Wireless Sensor Network Localization Research Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information