Performance requirements of the Mojette Transform for internet distributed databases and image processing
|
|
- Horatio Cook
- 6 years ago
- Views:
Transcription
1 Performance requrements the Mojette Transform for nternet dstrbuted databases and mage processng P. Serföző*, J. Vásárhely*, P.Szoboszla**, J. Turán*** * Unversty Mskolc, Department Automaton, Mskolc, Hungary ** Ercsson Hungary, Budapest, Hungary *** Department Electroncs and Multmeda Communcatons, Techncal Unversty Kosce, Slovaka Abstract In the last ten years there were ntensve researches to fnd new methods for handlng nternet dstrbuted databases and mage processng. One these methods s the Mojette transform (MOT). Ths transform s an exact dscrete Radon transform defned for a set specfc projectons. The MOT s used manly n mage processng applcatons. There were several mplementaton usng personal computers [8] and [9], but these applcaton were mplemented only for locally stored mages. There are some applcatons where real tme computng s a must, but the mplementatons before referred can not accomplsh ths requrement. The Mojette transforms mplemented under dfferent operatng systems and for dfferent processors presented below helps the performance analyses the MOT and also let to conclude the need for reconfgurable hardware mplementaton. There s also analyzed the mplementaton Mojette transform and Inverse Mojette transform (IMOT) the mplementaton n Feld Programmable Gate Arrays usng reconfgurable platform. The paper tres to conclude the necessty for hardware mplementaton for real tme processng. The paper outlne the development work n order to create an embedded reconfgurable hardware based on FPGA board. I. INTRODUCTION The word Mojette comes from France (Poters), where - n old French - t descrbes the class whte beans. These whte beans where used to teach chldren to start computng bascs arthmetc (addton and subtracton). Guédon named the transform Mojette after the analogy beans and bns. The bns contan the sum pxel values the respectve projecton lne [0]. Inscrbng nvsble marks (watermarkng) nto an mage has dfferent applcatons such as copyrght, steganography or data ntegrty checkng. Many dfferent technques have been employed for the last years n dfferent spaces (Fourer, wavelet, Mojette domans, etc.) [-0]. The applcatons come from dfferent feld such as computer tomography [], nternet dstrbuted data bases [4], encodng, multmeda error correcton [2], etc. Untl today the am the researches was stware mplementaton the Mojette and nverse Mojette transform. Ths knd mplementaton can be used only on stll mages, because they can not process the data n real-tme. Moton pctures, vdeo streams and dstrbuted data bases requre run-tme processng the frames. Only specalzed hardware or embedded systems wth real-tme operatng systems can ensure ths. II. DIRECT MOJETTE TRANSFORM The man dea behnd the Mojette transformaton (smlarly to the Radon transformaton) s to calculate a group projectons on an mage block. [3]. The Mojette transform (MOT) (see [5], [6] and []) projects the orgnal dgtal 2D mage: F { F(,j);,, N; j,, M} (.) onto a set K dscrete D projectons wth: M { M k (l); k,, K; l,, l K } (2.) MOT s an exact dscrete Radon transform defned for a set S {(p k, q k ), k,, K} specfc projectons angles: M K () l proj( pk, qk, bl ) F(, j) δ ( bl (, j) L q k jp ) k (3.) where proj (p k, q k, b l ) defnes the projecton lnes p k, q k ;δ(x) s the Drac delta wth the form: and ( ), f _ x 0 δ x { (4.) 0, f _ x L {(, j); b q jp 0} (5.) l k k s a dgtal bn n the drecton θ k and on set b l. So the projecton operator sums up all pxels value whch centers are ntersected by the dscrete projecton lne l. The restrcton angle θ k leads both to a dfferent samplng and to a dfferent number bns n each projecton (p k, q k ).
2 For a projecton defned by θ, the number bns n can be calculated by: n ( N ) p + ( M ) q + (6.) The drect MOT s depcted for a 3x3 pxel mage and for 3x3 pxel unary mage n Fg.. a and b. The set three drectons S {(-, ), (, ), (, 0)}, gves the thrteen bns for nteger values (*.pgm fles Portable Grey Map format fle wth 256 grey tones) and unary mage. The MOT can be ether performed by drectly addton the mage grey values or by addto-modulus (to preserve the magntude the computed spectral coeffcents). For bnary mages operaton XOR may be used (see [5], [6] and []). III. INVERSE MOJETTE TRANSFORM The nverse Mojette transform (IMOT) back-projects the bns the dfferent projectons onto the reconstructed mage. That means a sngle pxel bn correspondence must be found at each teraton n order to reconstruct a pxel value. When t has been done, ths pxel value s subtracted from each projecton. The Inverse Mojette Transform means to terate ths process untl the mage s completely reconstructed. For the reconstructon one need two projecton sets, one s the MOT the mage and the other s the MOT a unary mage (each pxel value s ). Fg.. c and d shows the frst step the reconstructon process. A. The condton reconstructon The key the transform wth regard to the controlled redundancy s that the number computed projectons can be larger than one need for the reconstructon (nverse transform). Thus, we can control a frst step redundancy wth the number projectons. The queston s then to know how many projectons and whch projectons gve an adequate set to reconstruct the mage (compute the Inverse Mojette Transform). The result was gven by Katz n 99 for rectangular mage [5]. Accordng to Katz s lemma [5], an mage F dmenson NxM pxels can be reconstructed wth the set K projectons M {M k } f K N P K p k k K or M Q K q k k (.) where N x M s the mage sze, p k s the drecton coordnate x axs (N), q k s the drecton coordnate y axs (M). Ths means that for the reconstructon one need as many projectons as the sum the absolute value the projecton coordnates have to be equal or greater then the dmenson the mage n the same drecton. The order complexty the MOT s lnear both n the number projectons and the number pxels. In order to obtan the same complexty for the IMOT, a specfc lst sngle pxel-bn correspondence has to be created and managed [6, ]. There s no need that both sums satsfy the crtera, t s suffcent f one the sums does. The man characterstc the MOT s the redundancy, whch can be measured by the followng parameter: bns R pxels (8.) Due to the ll-posed nature the IMOT mportant degradaton occurs when the bns have been slghtly modfed durng the transfer (.e. before the IMOT process start). [5], [6] and []. IV. 5 p,q (,), (-,), (0,) a, b, c, d, Fg.. The drect Mojette transform for real valued (a) and unary (b) mage and the frst step the reconstructon process (c and d) MOTITIMOT CO-PROCESSOR IMPLEMENTATION HARDWARE NEEDS The MOTIMOT co-processor denotes the hardware mplementaton the drect and nverse Mojette transform as co-processng element an embedded processor. To estmate the hardware and stware needs for a MOTIMOT system there s necessary to map the resources what such a system should need. These resources are not lmted to the drect and nverse Mojette transformaton, but also posses embedded computer functons mplemented n an embedded system runnng a real tme operatng system. Snce the data are dstrbuted thru the nternet we suppose that the database elements or the mages are receved n real-tme thru an Ethernet connecton or from a dgtal camera connected to the platform and transmtted on the nternet after the mage are transformed wth the MOT. The MOT and IMOT functons are mplemented as separate hardware co-processors the man processor. For the moment the MOT has been mplemented n stware n order to be able to compare dfferent hardware platforms wth dfferent operatng systems. The Vrtex2P FPGA has and embedded Power PC, Ths processor wll execute the MOT transform and we can compare ts performance wth other platform performances. As stated n [5] real tme mage processng needs very hgh computng performances wth relatvely low power dsspaton, whch condton can not accomplshed by PC
3 and fxed pont DSP. Whle usng FPGA the advantage s usng embedded on-chp processors wth on-chp memory and on chp system bus. For ths reason and for the flexblty was chosen Vrtex FPGA based platforms. These boards are Xlnx embedded system boards and for detals see [3] and [20]. The man advantage usng FPGAs s the flexblty development tools, the hardware-stware co-desgn soluton, and hardware n the loop smulaton. Also as the result ths mplementaton the MOT and IMOT mplemented by parallel functons nstead sequental ones s much faster then the stware mplementaton. For tests was chosen a 256x256 pxel szed grayscale mage, whch requres 64KB memory for storage. The bn vectors are stored n the memory n a so called MOT memory fle. The dmenson the MOT memory fle s gven by the product between the mage slces, the number bns n (see eq. 6.) and the maxmum sze a bn, whch s gven below: λ mn( N mod p, M mod q ) (9.) bn _ sze max[{ λ, w] (0.) max( bt _ nr) C + ( bn _ szemod2 + x) (.) where mem x fle _ sze + 0 f bn _ sze 2k, k Z f bn _ sze 2k +, k Z n n max( bt _ nr), (2.) + slces where N, M, p, q were specfed n eq. (6), λ s the maxmum number pxels contaned by a bn n the th projecton lne, w s the number projecton lnes, C s the color depth the orgnal mage (8 bts for a *.pgm), bn_sze s the maxmum number pxels contaned by a bn for any projecton lne, n s the number bns n the projecton lne and n slces s the number mage slces. An mage slce s obtaned by the dvson the mage by an even number. The dvson the orgnal mage n slces s motvated by the fact that durng the transmsson the MOT fle ths can be corrupted. From the corrupted MOT fle the mage can not be reconstructed wthout damaged area. Whle applyng the Mojette transform to slces the effect the MOT corrupton s dmnshed. Also the memory necessary to calculate the MOT and IMOT s smaller n the case slces. Processng the whole mage would result n the need for reconfguraton n order to calculate all the projectons, because to load the 256x256 mage n the embedded memory need 256KB only for 4 projecton lnes [2]. For ths reason the 256x256 pxel mage s dvded n 4 slces (28x28). Whle processng the IMOT (for the same mage sze) one needs to read the MOT memory fle from the external memory and to reconstruct the mage. For the reconstructon one need to generate the MOT fle the same sze unary mage wth the same projecton lnes. From eq. (0) the bn_sze means the maxmum pxel numbers contaned by a bn and also defnes the number bts needed for the unary bns the unary MOT fle. Durng the back projecton (IMOT) the bns whch contan only one pxel value are substtuted to ther correspondng poston. These pxel values contaned by other bns (n other projectons) also and those bn values have to be decreased wth the current pxel value. To calculate the postons the bns n the projectons and to calculate the correspondence n the mage a sngle pxel bn the unary mage s needed. It results when the value a sngle pxel bn s substtuted and the other bn values are decreased, the changes also have to be valdated n the unary MOT fle. The unary MOT fle contan unary bns. These bns contan not only the current pxel number contaned by the bn n the MOT fle but the correspondng poston n the mage these pxels to. Snce there s no need to process at the same tme the MOT and the IMOT there s the possblty to actvate only one co-processor at a tme by usng partal run-tme reconfguraton. The reconfguraton s actvated by the embedded Power PC processor usng the ICAP nterface. The proposed MOT/IMOT hardware s strongly dependent by the board structure gven n [3] or [20]. Ths dependency constran only the communcaton channels to the devces from whch the mages are receved, but do not mpose lmts to the co-processor mplementatons. A. The IMOT mplementaton Fg. 2 shows the nternal block schema a MOT/IMOT computng hardware wth the IMOT coprocessor actve. In the fgure the MOT/IMOT s represented as a sngle block, snce the mplementaton area needed for one them wll be used to mplement the other one, ths may explan why partal reconfguraton s needed. Fg. 2 summarzes only the man parts the mage processng system. Ths are: the PowerPC as the man processng unt and the IMOT unt. The IMOT coprocessor s connected to the PowerPC va the nternal PLB bus. The co-processor read and wrtes data to the dual memory, whch s the nterface memory when the perpherals were generated n the Embedded Development Kt (EDK) Fg. 3 represents the detaled block dagram the IMOT co-processor. The IMOT fle s sent n quarter mage fragments by the man processor va the PLB (processor local bus). In Fg. 3 the co-processor reads the IMOT from memory va the PLB n drect memory access mode (DMA), the bns are wrtten n the reconstructon blocks (P, P2, P3, P4) together wth ther ndex. The pxel ndex s computed from the bn ndex by the pxel ndex computng sub-block. The pxel ndex s wrtten to the pxel value storage regster the correspondng drecton (qs*8bt). In parallel to ths the other blocks (P2, P3, and P4) receve the bn value and the pxel ndex. From the receved pxel ndex every block computes the correspondng bn ndex and decreases ther bn value wth the receved bn value and valdates the changes n the correspondng dual memory
4 block. The co-processor block s synchronzed by an IMOT fnte state machne not represented n Fg. 3. motherboard, processor PowerPC 405, CPU frequency 00 MHz; processor local and on chp perpheral bus frequency PLB/OPB/OCM: 00 MHz; DDR: 00 MHz, 32-bt;, 256MB DDR DIMM, System ACE CF controller, 52 MB Compact Flash card, onboard 0/00 Ethernet network nterface card. In the frst step the FPGA mplementaton ML30 the operatng system used for platform support was Lnux. Fg. 2. MOTIMOT block schema wth the IMOT co-processor. Two dfferent types FPGA boards were consdered n the development phase because the hardware resources the two dfferent FPGAs (Vrtex4 and Vrtex2P) are dfferent and also the board characterstcs are dfferent. B. The MOT mplementaton In order to have benchmark tests the Drect Mojette transform and the nverse transform also was mplemented n stware usng C programmng language. For the performance test were used dfferent hardware platforms wth dfferent operatng systems and dfferent system confguratons. In ths paper we analyze the performance test for the followng platforms: - PC: The frst platform was an Intel the P4/3.4GHz processor based boar wth GByte DDR DIMM RAM/400MHz, 0/00 Ethernet network nterface card, 300GByte Wnchester; operatng system: Wndows XP. - PCL: The second platform s a Lnux based server wth the followng confguraton: number processors: 2. Processor 0 s: AuthentcAMD cpu famly: 5 model3 model name: AMD Opteron(tm) Processor 250, steppng:, MHz cache sze: 024 KB, floatng pont unt (fpu): yes fpu_excepton: yes, cpud level: wp : yes, bogomps: TLB sze: 024 4K pages clflush sze: 64 cache_algnment: 64 address szes: 40 bts physcal, 48 bts vrtual; Processor s: vendor_d: AuthentcAMD, cpu famly: 5, model: 3, model name: AMD Opteron(tm) Processor 250, steppng:, cpu: MHz, cache sze: 024 KB fpu: yes, fpu_excepton: yes cpud level :, wp: yes, bogomps: TLB, sze: 024 4K pages, clflush sze: 64, cache_algnment : 64, address szes: 40 bts physcal,. - ML30: The thrd platform s an FPGA based board, whch can be characterzed as follows: Vrtex-II Pro XC2VP30 FPGA, ATX form factor Fg. 3. IMOT detaled block dagram The MOT computng stware was run for 0 tmes n each platform and n the followng condtons: The processed mages had the followng dmensons: 52x52, 256x256, 28x96 pxel values and were dvded n 32x32 pxel slces; there were 3 knd tests as follows: a. Compute one frame 52x52 pxel dvded n 32x32 pxel slces; b. Compute 6 frame 52x52 pxel dvded n 32x32 pxel slces; c. Compute 24 frame 52x52 pxel dvded n 32x32 pxel slces; There were also consdered the same tests for the 52x52 pxel mages wth 6x6 pxel sze wndow, 256x256 pxel mages wth 6x6, 32x32 pxel sze wndow and 28x96 pxel mages wth 6x6 pxels sze wndow. The 28x96 pxel mages were consdered because the moble applcatons have general LCD graphc dsplay wth the mentoned dmenson. Table I. contans the mnmum and maxmum test results for the PC, PCL and ML30 platforms. From the table result that for the PC platform the average computng tmes are the longest compared to the other platforms. In Table I. one frame s one stll mage. Whle 24 frames represent one second an uncompressed moton pcture, the 6 frames represent one second a compressed vdeo.
5 TABLE I. TEST RESULT OF MOJETTE TRANSFROM ON 3 PLATFORMS Mn. max-mn P IV MHz W AMD Opteron 2x2400MHz W PowerPC MHz mW Table II. contans the speed rato the embedded PPC405 (platform ML30) compared to the other two mcroprocessors (platform PC and PCL). One can say that the embedded ML30 platform processng speed s just only ~0-2 tmes slower compared to the PC, and ~46 tmes slower compared to the PCL platform; whle the system clock frequency the PC s 34 tmes faster and the PCL system clock frequency s 24 tmes faster then the ML30 platform clock (00MHz). TABLE II. SPEED RATION OF EMBEDDED PPC405 COMPARED TO OTHER PROCESSORS PIV AMD Opt. PPC405 PIV PPC405 AMD Opt In Table III. are presented the test results the PPC405 mcroprocessor wth 32x32 pxel wndow for the MOT transform and for dfferent mage szes. One can conclude from the table that the computatonal tme s not growng parallel wth the mage sze. Another notceable result s the decreasng standard devaton when the computatonal tme ncrease (wth the mage sze). TABLE III. MOT COMPUTING PERFORMANCES FOR ML30 PLTAFROM Wndow: 32x32 28x96 256x256 52x52 Mn. maxmn Aganst the low power dsspaton the ML30 platform the mplemented stware soluton s unusable when real-tme computaton data s needed. One can conclude that hardware realzaton s necessary for the MOT dependng on the applcaton. Table IV presents the test results for the stware mplementaton the IMOT for dfferent sze mages wth 6x6 pxel sze wndow. The long processng tme for vdeo fles s not acceptable. Whle the data after the MOT s stored n a data storage devce, the reconstructed data (output the IMOT) s processed by an applcaton. The long computatonal tme requre a relatve large data buffer between the IMOT and the applcaton. TABLE IV. IMOT COMPUTING PERFORMANCES FOR ML30 PLTAFROM Wndow: 6x6 28x96 256x256 Mn. maxmn Today the portable devces are very popular and there s a real demand to ntegrate dfferent devces (telephone, mp3 player, TV) n one applance. An average LCD dsplay a normal moble phone have approxmately a dsplay sze 28x96 pxels. Test result MOT and IMOT on ML30 for ths sze mage (28x96 pxels) s represented n Table V. The man dea usng the ML30 and ts embedded PowerPC processor to compute MOT and IMOT s ts very low power consumpton. Unfortunately ths platform wth a Lnux kernel s not powerful enough for real-tme computaton n the case stware mplementaton the algorthm. As t s shown n the table computng the IMOT s more tme-wastng then computng the MOT data fle. However n the targeted applcaton (nternet dstrbuted vdeo data base) the IMOT computng s tme crtcal. Ths s another motvaton to mplement the MOT-IMOT n hardware. Wndow: 6x6 28x96 (MoT) 28x96 (IMoT) TABLE V. IMOT COMPUTATION PERFORMANCES Mn. max-mn The mnmum, maxmum and average computatonal tmes for the MOT n the case 28x96 pxel sze mage and dfferent wndow szes (6x6:, 2 and 3; 32x32: 4, 5 and 6)
6 are depcted n Fg. 4. tce that the stware mplementaton the algorthm s faster when 32x32 pxel sze wndow s used. Probably t s caused by the less overhead (n tme) the process creaton. tme [sec] Test results MoT computng mn dt [sec] max dt [sec] avg dt [sec] Fg. 4. The mnmum, maxmum and average computatonal tmes for the MOT for dfferent wndow szes From the test result t can be concluded that the ML30 platform runnng on 00MHz clock frequency t s just 5-6 tmes slower then the other two platforms runnng wth 34 and 24 tmes faster clock, but the computaton tmes s not slower as 34/24 tmes as expected. Analyzng the power dsspaton durng the computaton the MOT t can be fgured that the less power was dsspated by the ML30 platform consumng just around 00mW whle the PC platform dsspated between W, and for the PCL platform the dsspated power was even larger W. V. CONCLUSIONS There was mplemented n stware the MOT and IMOT for three dfferent platforms wth dfferent operatng systems. The mplementaton was motvated by the fact that the Mojette transforms wll be mplemented n hardware on the ML30 and ML403 platform. From the stware mplementatons result the followng conclusons: The expected computaton speed per workng frequency for the ML30 platform was not as bad as expected. te that the ML30 platform workng frequency s 00MHz, whle the other platforms run wth 2.4 and 3.4 GHz. The drect MOT transformaton s not so tme crtcal, but n some applcatons hardware mplementaton would be recommended. The IMOT for moble applcatons t should be mplemented n hardware snce the transformaton s tme crtcal for vdeo on demand applcatons. The dsspated power should be consdered n the case moble applcatons. In the paper were mentoned two dfferent FPGA hardware platforms. The man reason to consder these platforms s that the two platforms contan two dfferent types FPGAs. The ML 30 board s a PC form factor board platform contanng the Vrtex 2P FPGA wth the PC board possbltes (PCI, Ethernet, etc.), whle the ML30 board s small form factor board as powerful as the prevous one wth a Vrtex 4 FPGA chp. REFERENCES [] Hartung, F., Kutter, M.: Multmeda Watermarkng Technques, Proc. IEEE, vol. 8,, 999. [2] Turán, J.: Fast Translaton Invarant Transforms and Ther Applcatons, ELFA, Kosce, 999. [3] rmand, N., Guedon, J. P.: La transformee Mojette: une representaton recordante pour l mage, Comptes Rendus Academe des Scences de Pars, Theoretcal Comp. SCI. Secton, 998, pp [4] Guedon, J. P., Parren, B., rmand, N.: Internet Dstrbuted Image Databases. Int. Comp. Aded Eng., Vol. 8, 200, pp [5] Katz, M.: Questons unqueness and resoluton n reconstructon from projectons. Lecture tes n Bomathematcs, (Vol. 26), Sprnger-Verlag, Berln, 99. [6] Autrusseau, F., Guedon, J. P.: Image Watermarkng for Copyrght Protecton and Data Hdng va the Mojette Transform, Proceedngs SPIE, VOL. 465, 2002, pp [] Turán, J., Ovsenk, L., Benca, M., Turán, J. Jr: Implementaton CT and IHT Processors for nvarant Object Recognton System, Radoengneerng, Vol. 3, dec. page 65- [8] Autrusseau F.: Modélsaton psychovsuelle pour le tatouage des mages, Ph. D. Dssertaton, Nantes, France, 2002., pp. [9] Szoboszla P.: Dgtal Watermarkng wth Mojette and Wawelet transforms, Dploma work, Unversty Mskolc, Department Automaton, 2006, pp. 58. [0] Guédon J-P., rmand N.: The Mojette Transform: The Frst Ten Years, Proceedngs DGCI 2005, LNCS 3429, 2005, pp [] Guédon J-P., rmand N.: Splne Mojette Transform Applcaton n tomography and communcaton, In EUSIPCO, sep [2] Parren B., rmand N., Guédon J-P.: Multmeda Forward Error Correctng Codes For Wreless Lan, Annals Telecommuncatons (3-4) March-Aprl, [3] Xlnx, ML403 User Gude, [4] Bobda C., Huebner M., Nyonkuru A, Blodget B., Majer M., Ahmadna A.,: Desgnng Partal and Dynamcally Reconfgurable Applcatons on Xlnx Vrtex-II FPGAs usng Handel-C, /default.asp, pp. 6. [5] Amlcar do Carmo L., Hethecker S., Rolf E., FlexFlm An Image Processor for Dgtal Flm Processng, Dagstuhl Semnar on Dynamcally Reconfgurable Archtectures, [6] Hethecker S., Rolf E., FlexFlm: A Qualty Servce Capable Schedulng SDRAM Controller, Dagstuhl Semnar on Dynamcally Reconfgurable Archtectures, [] G. Eason, B. ble, and I. N. Sneddon, On certan ntegrals Lpschtz-Hankel type nvolvng products Bessel functons, Phl. Trans. Roy. Soc. London, vol. A24, pp , Aprl 955. [8] I. S. Jacobs and C. P. Bean, Fne partcles, thn flms and exchange ansotropy, n Magnetsm, vol. III, G. T. Rado and H. Suhl, Eds. New York: Academc, 963, pp [9] Y. Yorozu, M. Hrano, K. Oka, and Y. Tagawa, Electron spectroscopy studes on magneto-optcal meda and plastc substrate nterface, IEEE Transl. J. Magn. Japan, vol. 2, pp. 40 4, August 98 [Dgests 9 th Annual Conf. Magnetcs Japan, p. 30, 982]. [20] Xlnx, ML30 User Gude, [2] P. Serfőző, J. Vásárhely, Analyss Mojette Transform Implementaton on Feld Programmable Gate Array, Proceedngs the th Internatonal Symposum Hugaran Researchers on Computatonal Intellgence, Budapest, pp , ISBN X ACKNOWLEDGMENT The authors gratefully acknowledge the donatons Xlnx Inc. and Celoxca Inc.
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 informationAn 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 informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
More informationA 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 informationAssignment # 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 informationCluster 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 informationLoad 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 informationVirtual 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 informationImprovement 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 informationA 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 informationIP Camera Configuration Software Instruction Manual
IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the
More informationThe 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 informationVISUAL 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 informationContent 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 informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationSLAM 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 informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationProgramming 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 information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationOutline. Digital Systems. C.2: Gates, Truth Tables and Logic Equations. Truth Tables. Logic Gates 9/8/2011
9/8/2 2 Outlne Appendx C: The Bascs of Logc Desgn TDT4255 Computer Desgn Case Study: TDT4255 Communcaton Module Lecture 2 Magnus Jahre 3 4 Dgtal Systems C.2: Gates, Truth Tables and Logc Equatons All sgnals
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationSimulation 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 informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationA 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 informationSupport 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 informationR 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 informationAccelerating X-Ray data collection using Pyramid Beam ray casting geometries
Acceleratng X-Ray data collecton usng Pyramd Beam ray castng geometres Amr Averbuch Guy Lfchtz Y. Shkolnsky 3 School of Computer Scence Department of Appled Mathematcs, School of Mathematcal Scences Tel
More informationSome material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier
Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)
More informationAn 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 informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationCompiler 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 informationELEC 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 informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationParallel 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 informationUser 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 informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More informationPYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES
PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES Ruxandra Olmd Faculty of Mathematcs and Computer Scence, Unversty of Bucharest Emal: ruxandra.olmd@fm.unbuc.ro Abstract Vsual secret sharng schemes
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationTN348: 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 informationTECHNIQUE 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 informationDynamic wetting property investigation of AFM tips in micro/nanoscale
Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen
More informationProblem 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 informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationThe 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 informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationConfiguration Management in Multi-Context Reconfigurable Systems for Simultaneous Performance and Power Optimizations*
Confguraton Management n Mult-Context Reconfgurable Systems for Smultaneous Performance and Power Optmzatons* Rafael Maestre, Mlagros Fernandez Departamento de Arqutectura de Computadores y Automátca Unversdad
More informationModule 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 informationWavefront 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 informationAdvanced 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 informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationLecture 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 informationFPGA Based Fixed Width 4 4, 6 6, 8 8 and Bit Multipliers using Spartan-3AN
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.11 No.2, February 211 61 FPGA Based Fxed Wdth 4 4, 6 6, 8 8 and 12 12-Bt Multplers usng Spartan-3AN Muhammad H. Ras and Mohamed H.
More informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationS1 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 informationSecure and Fast Fingerprint Authentication on Smart Card
SETIT 2005 3 rd Internatonal Conference: Scences of Electronc, Technologes of Informaton and Telecommuncatons March 27-31, 2005 TUNISIA Secure and Fast Fngerprnt Authentcaton on Smart Card Y. S. Moon*,
More informationEnhanced AMBTC for Image Compression using Block Classification and Interpolation
Internatonal Journal of Computer Applcatons (0975 8887) Volume 5 No.0, August 0 Enhanced AMBTC for Image Compresson usng Block Classfcaton and Interpolaton S. Vmala Dept. of Comp. Scence Mother Teresa
More informationMULTISPECTRAL 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 informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationFPGA-based implementation of circular interpolation
Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 04, 6(7):585-593 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 FPGA-based mplementaton of crcular nterpolaton Mngyu Gao,
More informationEnhanced Watermarking Technique for Color Images using Visual Cryptography
Informaton Assurance and Securty Letters 1 (2010) 024-028 Enhanced Watermarkng Technque for Color Images usng Vsual Cryptography Enas F. Al rawashdeh 1, Rawan I.Zaghloul 2 1 Balqa Appled Unversty, MIS
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationKinematics of pantograph masts
Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n
More informationReducing 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 informationComputational ghost imaging using a fieldprogrammable
Computatonal ghost magng usng a feldprogrammable gate array IKUO HOSHI, * TOMOYOSHI SHIMOBABA, TAKASHI KAKUE, AND TOMOYOSHI ITO 1 Graduate School of Engneerng, Chba Unversty, 1-33, Yayo-cho, Inage-ku,
More informationCS 268: Lecture 8 Router Support for Congestion Control
CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationFloating-Point Division Algorithms for an x86 Microprocessor with a Rectangular Multiplier
Floatng-Pont Dvson Algorthms for an x86 Mcroprocessor wth a Rectangular Multpler Mchael J. Schulte Dmtr Tan Carl E. Lemonds Unversty of Wsconsn Advanced Mcro Devces Advanced Mcro Devces Schulte@engr.wsc.edu
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationREFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.
Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent
More informationQuantifying Performance Models
Quantfyng Performance Models Prof. Danel A. Menascé Department of Computer Scence George Mason Unversty www.cs.gmu.edu/faculty/menasce.html 1 Copyrght Notce Most of the fgures n ths set of sldes come from
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationRemote Sensing Image Retrieval Algorithm based on MapReduce and Characteristic Information
Remote Sensng Image Retreval Algorthm based on MapReduce and Characterstc Informaton Zhang Meng 1, 1 Computer School, Wuhan Unversty Hube, Wuhan430097 Informaton Center, Wuhan Unversty Hube, Wuhan430097
More informationThe stream cipher MICKEY-128 (version 1) Algorithm specification issue 1.0
The stream cpher MICKEY-128 (verson 1 Algorthm specfcaton ssue 1. Steve Babbage Vodafone Group R&D, Newbury, UK steve.babbage@vodafone.com Matthew Dodd Independent consultant matthew@mdodd.net www.mdodd.net
More informationMallathahally, Bangalore, India 1 2
7 IMPLEMENTATION OF HIGH PERFORMANCE BINARY SQUARER PRADEEP M C, RAMESH S, Department of Electroncs and Communcaton Engneerng, Dr. Ambedkar Insttute of Technology, Mallathahally, Bangalore, Inda pradeepmc@gmal.com,
More informationActive 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 informationPositive 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 informationFor 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 information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationPrivate 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 informationHardware Support for QoS-based Function Allocation in Reconfigurable Systems
Hardware Support for QoS-based Functon Allocaton n Reconfgurable Systems Mchael Ullmann, Wansheng Jn, Jürgen Becker Unverstät Karlsruhe (TH), Germany {ullmann, jn, becker}@tv.un-karlsruhe.de Abstract Ths
More informationImage 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 informationMOTION BLUR ESTIMATION AT CORNERS
Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter
More informationEfficient 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 informationData Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach
Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationA 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 informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More informationTHE PULL-PUSH ALGORITHM REVISITED
THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748
More informationQOS AWARE HW/SW PARTITIONING ON RUN-TIME RECONFIGURABLE MULTIMEDIA PLATFORMS
QOS AWARE HW/SW PARTITIONING ON RUN-TIE RECONFIGURABE UTIEDIA PATFORS N. Pham Ngoc, G. afrut 2, J-Y. gnolet 2, G. Deconnc, and R. auwerens 2 Katholee Unverstet euven-esat/eecta Kasteelpar Arenberg 0 B-300
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationHigh-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 informationAssembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface.
IDC Herzlya Shmon Schocken Assembler Shmon Schocken Sprng 2005 Elements of Computng Systems 1 Assembler (Ch. 6) Where we are at: Human Thought Abstract desgn Chapters 9, 12 abstract nterface H.L. Language
More informationDetermining 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 informationProblem 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 information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More information