Optimal Scheduling of Capture Times in a Multiple Capture Imaging System
|
|
- Beatrice Jefferson
- 5 years ago
- Views:
Transcription
1 Optmal Schedulng of Capture Tmes n a Multple Capture Imagng System Tng Chen and Abbas El Gamal Informaton Systems Laboratory Department of Electrcal Engneerng Stanford Unversty Stanford, Calforna 9435, USA ABSTRACT Several papers have dscussed the dea of extendng mage sensor dynamc range by capturng several mages durng a normal exposure tme. Most of these papers assume that the mages are captured accordng to a unform or an exponentally ncreasng exposure tme schedule. Even though such schedules can be justfed by certan mplementaton consderatons, there has not been any systematc study of how capture tme schedules should be optmally determned. In ths paper we formulate the multple capture tme schedulng problem when the ncdent llumnaton probablty densty functon (pdf) s completely known as a constraned optmzaton problem. We am to fnd the capture tmes that maxmze the average sgnal SNR. The formulaton leads to a general upper bound on achevable average SNR usng multple capture for any gven llumnaton pdf. For a unform pdf, the average SNR s a concave functon n capture tmes and therefore well-known convex optmzaton technques can be appled to fnd the global optmum. For a general pece-wse unform pdf, the average SNR s not necessarly concave. The cost functon, however, s a Dfference of Convex (D.C.) functon and well-establshed D.C. or global optmzaton technques can be used. Keywords: Sgnal-to-Nose Rato(SNR), Dynamc Range(DR), multple capture, hgh speed magng, mage sensor. INTRODUCTION Hgh frame rate CMOS mage sensors wth non-destructve readout capabltes have been recently demonstrated., As dscussed n many papers, 3,4 ths capablty can be used to enhance the sensor dynamc range. The dea s to capture several mages durng a normal exposure tme shorter ntegraton tme mages capture the brghter areas of the scene whle longer ntegraton tme mages capture the darker areas of the scene. Ths method has been shown to acheve better SNR than other schemes such as logarthmc sensors and well capacty adjustng. 5 One mportant problem n the mplementaton of multple capture that has not receved much attenton s the selecton of the number of captures and ther tme schedule to acheve a desred mage qualty. Several papers 4,5 have assumed exponentally ncreasng capture tme schedules, whle others 6,7 have assumed unformly spaced capture tme schedules. Even though such schedules can be justfed by certan mplementaton consderatons, there has not been any systematc study of how optmal capture tme schedules can be determned. By fndng optmal schedules, one can acheve the mage qualty requrements wth less captures, whch s desrable snce reducng the number of captures reduces the magng system computatonal power, memory, and power consumpton requrements as well as the nose generated by the multple readouts. To determne the capture tme schedule, scene llumnaton nformaton s needed. Such nformaton may not be avalable before takng one or more captures of the scene. Thus n general an onlne schedulng algorthm that determnes the tme for the next capture based on updated nformaton about the scene llumnaton gathered durng prevous captures may be needed. Fndng such optmal onlne schedules appears ntractable. Instead, n ths paper, we nvestgate the tme capture schedulng problem assumng Correspondence: Emal: tngchen@sl.stanford.edu, abbas@sl.stanford.edu; Telephone: ; Fax:
2 complete scene llumnaton nformaton. Ths can be vewed as an offlne verson of the problem. Optmal solutons to the offlne schedulng problem can provde gudance for developng onlne schedulng heurstcs as well as performance bounds on such heurstcs. In the followng secton we provde background on the mage sensor pxel model assumed, defne SNR and dynamc range, and brefly dscuss the multple capture method. In Secton 3, we formulate the multple capture tme schedulng problem when the ncdent llumnaton probablty densty functon (pdf) s completely known. We use average pxel sgnal SNR as an objectve functon snce t generally provdes good ndcaton of mage qualty. To smplfy the analyss, we assume that read nose s much smaller than shot nose and thus can be gnored. Wth ths assumpton the smple Last-Sample-Before-Saturaton (LSBS) algorthm for syntheszng hgh dynamc range mage from multple captures s optmal wth respect to SNR. 6 We use ths formulaton to establsh a general upper bound on achevable average SNR usng multple capture for any gven llumnaton pdf. In Secton 4 we show that for a unform pdf, the average SNR s a concave functon n capture tmes and therefore the global optmum can be easly found usng well-known convex optmzaton technques. In Secton 5 we show that for a general pece-wse unform pdf, the average SNR s not necessarly concave. The cost functon, however, s a Dfference of Convex (D.C.) functon and well-establshed D.C. or global optmzaton technques can be used.. BACKGROUND We assume mage sensors operatng n drect ntegraton, e.g., CCDs and CMOS PPS, APS, and DPS. Fgure depcts a smplfed pxel model and the charge Q(t) versus tme t for such sensors. Durng capture, each pxel converts ncdent lght nto photocurrent ph. The photocurrent s ntegrated onto a capactor and the charge Q(T ) (or voltage) s read out at the end of exposure tme T. Dark current dc and addtve nose corrupt the photocharge. The nose can be expressed as the sum of three ndependent components, () shot nose U(T ) N(,q( ph + dc )T ), where q s the electron charge, () readout crcut nose V (T ) (ncludng quantzaton nose) wth zero mean and varance σv, and () reset nose and FPN C wth zero mean and varance σc. Thus the output charge from a pxel can be expressed as { (ph + Q(T )= dc )T + U(T )+V(T)+C, for Q(T ) Q sat Q sat, otherwse, where Q sat s the saturaton charge, also referred to as well capacty. The SNR can be expressed as ( ph T ) SNR( ph )= q( ph + dc )T + σv + σ C for ph max, () where max Q sat /T refers to the maxmum non-saturatng photocurrent. Note that SNR ncreases wth ph, frst at db per decade when reset, FPN and readout nose domnate, then at db per decade when shot nose domnates. SNR also ncreases wth T. Thus t s always preferable to have the longest possble exposure tme. However, saturaton and moton mpose practcal upper bounds on exposure tme. Sensor dynamc range 8 s defned as the rato of the maxmum non-saturatng photocurrent max to the smallest detectable photocurrent mn = q T q dct + σv + σ C. Dynamc range can be extended by capturng several mages durng exposure tme wthout resettng the photodetector. 3,4 Usng the Last-Sample-Before- Saturaton (LSBS) algorthm 4 dynamc range can be extended at the hgh llumnaton end as llustrated n Fgure (b). Lu et. al., have shown how multple capture can also be used to extend dynamc range at the low llumnaton end usng weghted averagng. Ther method reduces to the LSBS algorthm when only shot nose s present PROBLEM FORMULATION We assume complete knowledge of the scene nduced photocurrent pdf and seek to fnd the capture tme schedule {t,t,..., t N } for N captures that maxmzes the average SNR wth respect to the gven pdf f I () Ths s equvalent to knowng the scene llumnaton pdf for a known sensor response.
3 V dd Q(t) Reset Q(t) Q sat Hgh lght ph + dc C Low lght τ τ 3τ 4τ T t (a) (b) Fgure. (a) Photodode pxel model, and (b) Photocharge Q(t) vs. Tme t under two dfferent llumnatons. Assumng multple capture at unform capture tmes τ,τ,...,t and usng the LSBS algorthm, the sample at T s used for the low llumnaton case, whle the sample at 3τ s used for the hgh llumnaton case. (see Fgure ). We assume that the pdf s zero outsde a fnte length nterval ( mn, max ). For smplcty we gnore all nose terms except for shot nose due to photocurrent. Let k be the maxmum non-saturatng photocurrent for capture tme t k, k N. Thus t k = Q sat, k and determnng {t,t,..., t N } s equvalent to determnng the set of currents {,,..., N }. The SNR as a functon of photocurrent s now gven by SNR() = Q sat q k for k+ < k and k N. To avod saturaton we assume that = max. Under these assumptons, the capture tme schedulng problem s as follows: Gven f I () and N, fnd {,..., N } that maxmzes the average SNR E (SNR(,..., N )) = Q sat q N k= k subject to: mn = N+ < N <...< k <...< < = max <. k+ k f I () d, () Upper bound: Note that snce we are usng the LSBS algorthm, SNR() Qsat q and thus for any N, max E (SNR(,,..., N )) Q sat q. Ths provdes a general upper bound on the maxmum achevable average SNR usng multple capture. Now, for a sngle capture wth capture tme correspondng to max, the average SNR s gven by E (SNR SC )= Q sat q max mn f I () d = Q sate(i), max q max where E(I) s the expectaton (or average) of the photocurrent for gven pdf f I (). Thus for a gven f I (), multple capture can ncrease average SNR by no more than a factor of max /E(I).
4 f I () t t N t 5 t 4 t 3 t t mn N 5 4 Fgure. Photocurrent pdf showng capture tmes and correspondng maxmum non-saturatng photocurrents. Note that the postons of capture tmes are not drawn n scale. 3 max 4. OPTIMAL SCHEDULING FOR UNIFORM PDFS In ths secton we show how our schedulng problem can be optmally solved when the photocurrent pdf s unform. In ths case, the schedulng problem becomes: Gven a unform photocurrent llumnaton pdf over the nterval ( mn, max ) and N, fnd {,..., N } that maxmzes the average SNR E (SNR(,..., N )) = Q sat q( max mn ) subject to: mn = N+ < N <...< k <...< < = max <. N ( k k+ ), (3) k Note that for k N, the functon ( k k+ k ) s concave n the two varables k and k+ (whch can be readly verfed by showng that the Hessan matrx s negatve sem-defnte). Snce the sum of concave functons s concave, the average SNR s a concave functon n {,..., N }. Thus the schedulng problem reduces to a convex optmzaton problem wth lnear constrants, whch can be optmally solved usng well known convex optmzaton technques such as gradent/sub-gradent based methods. Table 4 provdes examples of optmal schedules for to captures assumng unform photocurrent pdf over (, ]. Note that the optmal capture tmes are qute dfferent from the commonly assumed unform or exponentally ncreasng tme schedules. Fgure 3 compares the optmal average SNR to the average SNR acheved by unform and exponentally ncreasng schedules. To make the comparson far, we assumed the same maxmum exposure tme for all schedules. Note that usng our optmal schedulng algorthm, wth only captures, the E(SNR) s wthn 4% of the upper bound. Ths performance cannot be acheved wth the exponentally ncreasng schedule and requres over captures to acheve usng the unform schedule. 5. SCHEDULING FOR PIECE-WISE UNIFORM PDFS In the real world, not too many scenes exhbt unform llumnaton statstcs. On the other hand, the optmzaton problem for general pdfs appears to be qute ntractable. In ths secton we nvestgate the schedulng problem for pece-wse unform llumnaton pdfs. Snce any pdf can be approxmated by a pecewse unform pdf, solutons for pece-wse unform pdfs can provde good approxmatons to solutons of the general problem. Such approxmatons are llustrated n Fgures 4 and 5. The emprcal llumnaton pdf of the scene n Fgure 4 has two non-zero regons correspondng to drect llumnaton and the dark shadow regons, and can be reasonably approxmated by a segment pece-wse unform pdf. The emprcal pdf of the scene n Fgure 5, whch contans large regons of low llumnaton, some moderate llumnaton regons, k=
5 Capture Scheme t t t 3 Optmal Exposure Tmes (t k /t ) t 4 t 5 t 6 t 7 t 8 t 9 t Captures 3 Captures Captures Captures Captures Captures Captures Captures Captures Table. Optmal capture tme schedules for a unform pdf over nterval (, ]. Upper bound.8 Optmal Unform E (SNR).6 Exponental.4. fi() Number of Captures Fgure 3. Performance comparson of optmal schedule, unform schedule, and exponental (wth exponent = ) schedule. E (SNR) s normalzed wth respect to the sngle capture case wth = max.
6 and small very hgh llumnaton regons s approxmated by a 3 segment pece-wse unform pdf. Of course better approxmatons of the emprcal pdfs can be obtaned usng more segments, but as we shall see, solvng the schedulng problem becomes more complex as the number of segments ncreases. x 4 True mage ntensty hstogram Approxmated pece-wse unform pdf fi().5.5 mn max mn max (normalzed to max ) Fgure 4. An mage wth approxmated two-segment pece-wse unform pdf 3 x 4 True mage ntensty hstogram Approxmated pece-wse unform pdf fi() mn 4 max mn max mn max (normalzed to max ) Fgure 5. An mage wth approxmated three-segment pece-wse unform pdf
7 Frst consder the schedulng problem for a two-segment pece-wse unform pdf. We assume that the pdf s unform over the ntervals ( mn, max ), and ( mn, max ). Clearly, n ths case, no capture should be assgned to the nterval ( max, mn ), snce one can always do better by movng such a capture to mn. Now, assumng that k out of the N captures are assgned to segment ( mn, max ), the schedulng problem becomes: Gven a -segment pece-wse unform pdf wth k captures assgned to nterval ( mn, max ) and N k captures to nterval ( mn, max ), fnd {,..., N } that maxmzes the average SNR E (SNR(,..., N )) = Q k sat c ( j j+ )+c ( k mn max N k+ )+c + c ( j j+ ), q j= j k k j j=k+ (4) where the constants c and c account for the dfference n the pdf values of the two segments, subject to: mn = N+ < N <...< k+ < max mn k <...< < = max <. The optmal soluton to the general -segment pece-wse unform pdf schedulng problem can thus be found by solvng the above problem for each k and selectng the soluton that maxmzed the average SNR. Smple nvestgaton of the above equaton shows that E (SNR(,..., N )) s concave n all the varables except k. Certan condtons such as c mn c max can guarantee concavty n k as well, but n general the average SNR s not a concave functon. A closer look at equaton (4), however, reveals that E (SNR(,..., N )) s a Dfference of Convex (D.C.) functon, 9, snce all terms nvolvng k n equaton (4) are concave functons of k except for c max/ k, whch s convex. Ths allows us to apply well-establshed D.C. optmzaton technques (e.g., see 9, ). It should be ponted out, however, that these D.C. optmzaton technques are not guaranteed to fnd the global optmal. In general, t can be shown that average SNR s a D.C. functon for any M-segment pece-wse unform pdf wth a prescrbed assgnment of the number of captures to the M segments. Thus to numercally solve the schedulng problem wth M-segment pece-wse unform pdf, one can solve the problem for each assgnment of captures usng D.C. optmzaton, then choose the assgnment and correspondng optmal schedule that maxmzes average SNR. One partcularly smple yet powerful optmzaton technque that we have expermented wth s Sequental Quadratc Programmng (SQP) wth multple randomly generated ntal condtons. Fgures 6(a) and (b) compare the soluton usng SQP wth random ntal condtons to the unform schedule and the exponentally ncreasng schedule for the two pece-wse unform pdfs of Fgures 4 and 5. Due to the smple nature of our optmzaton problem, we were able to use brute-force search to fnd the globally optmal solutons, whch turned out to be dentcal to the solutons usng SQP. Note that unlke other examples, n the 3-segment example, the exponental schedule ntally outperforms the unform schedule. The reason s that wth few captures, the exponental assgns more captures to the large low and medum llumnaton regons than the unform. 6. DISCUSSION The paper presented the frst systematc study of optmal selecton of capture tmes n a multple capture magng system. Prevous papers on multple capture have assumed unform or exponentally ncreasng capture tme schedules justfed by certan practcal mplementaton consderatons. It s advantageous n terms of system computatonal power, memory, power consumpton, and nose to employ the least number of captures requred to acheve a desred dynamc range and SNR. To do so, one must carefully select the capture tme schedule to optmally capture the scene llumnaton nformaton. To develop understandng of the schedulng problem and as a frst step towards developng onlne algorthms, we formulated the offlne schedulng problem,.e., assumng complete pror knowledge of scene llumnaton pdf, as an optmzaton problem where average SNR s maxmzed for a gven number of captures. Ignorng read nose and FPN and usng the LSBS algorthm, our formulaton leads to a general upper bound on the average SNR for any llumnaton pdf. For a unform llumnaton pdf, we showed that the average SNR s a concave functon n capture
8 E (SNR) fi() Upper bound Optmal Unform Exponental Number of Captures E (SNR) fi() Upper bound Optmal Unform Exponental Number of Captures (a) (b) Fgure 6. Performance comparson of the optmal schedule, unform schedule, and exponental (exponent = ) schedule for the scenes n Fgures 4 and 5. E (SNR) s normalzed wth respect to the sngle capture case wth = max. tmes and therefore the global optmum can be found usng well-known convex optmzaton technques. For a general pece-wse unform llumnaton pdf, the average SNR s not necessarly concave. Average SNR s, however, a D.C. functon and can be solved usng well-establshed D.C. or global optmzaton technques. The offlne schedulng algorthms we dscussed can be drectly appled n stuatons where enough nformaton about scene llumnaton s known n advance. It s not unusual to assume the avalablty of such pror nformaton. For example all auto-exposure algorthms used n practce, assume the avalablty of certan scene llumnaton statstcs. Our results can also be used to develop heurstc onlne algorthms that can perform better than the offlne algorthm wth only partal nformaton of scene llumnaton statstcs. In stuatons where read nose and FPN s too hgh to neglect, our results may not be completely satsfactory, snce the LSBS algorthm s no longer optmal and dynamc range can also be extended at the low llumnaton end as shown by Lu et. al.. 6 Our upper bound on average SNR of Q sat /q stll holds, however. ACKNOWLEDGEMENTS The work reported n ths paper was partally supported by the Programmable Dgtal Camera (PDC) Project by HP, Aglent, Kodak and Canon. The authors would lke to thank the members of the PDC project for suggestons that greatly mproved the presentaton of the paper. REFERENCES. S. Klenfelder, S. Lm, X. Lu, and A. El Gamal, A, Frame/s.8um CMOS Dgtal Pxel Sensor wth Pxel-Level Memory, n ISSCC Dgest of Techncal Papers, pp , (San Francsco, CA), February.. D. Handoko, S. Kawahto, Y. Todokoro, and A. Matsuzawa, A CMOS Image Sensor wth Non- Destructve Intermedate Readout Mode for Adaptve Iteratve Search Moton Vector Estmaton, n IEEE Workshop on CCD and Advanced Image Sensors, pp. 5 55, (Lake Tahoe, CA), June. 3. O. Yadd-Pecht and E. Fossum, Wde ntrascene dynamc range CMOS APS usng dual samplng, IEEE Trans. on Electron Devces 44(), pp. 7 73, D. Yang, A. El Gamal, B. Fowler, and H. Tan, A 64x5 CMOS mage sensor wth ultra-wde dynamc range floatng-pont pxel level ADC, IEEE J. Sold-State Crcuts 34(), pp , 999.
9 5. D. Yang and A. El Gamal, Comparatve Analyss of SNR for Image Sensors wth Enhanced Dynamc Range, n Proceedngs of SPIE, vol. 3649, pp. 97, (San Jose, CA), January X. Lu and A. El Gamal, Photocurrent Estmaton from Multple Non-destructve Samples n a CMOS Image Sensor, n Proceedngs of SPIE, vol. 436, pp , (San Jose, CA), January. 7. D. Handoko, S. Kawahto, Y. Takokoro, M. Kumahara, and A. Matsuzawa, A CMOS Image Sensor for Focal-plane Low-power Moton Vector Estmaton, n Symposum of VLSI Crcuts, pp. 8 9, June. 8. A. El Gamal, EE39b Classnotes: Introducton to Image Sensors and Dgtal Cameras, Stanford, Calforna,. 9. R. Horst and H. Tuy, Global optmzaton: determnstc approaches, Sprnger, New York, R. Horst, P. M. Pardalos, and N. V. Thoa, Introducton to global optmzaton, Kluwer Academc, Boston, Massachusetts,.
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 informationParallelism 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 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 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 informationGSLM 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 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 informationA 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 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 informationWishing 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 informationNUMERICAL 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 informationCS 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 informationLearning 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 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 informationQuality 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 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 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 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 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 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 information6.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 informationHelsinki 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 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 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 informationAn 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 informationEdge 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 informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
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 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 informationSubspace 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 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 informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More 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 information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationMeta-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 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 informationOutline. 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 informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
More informationMathematics 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 informationSensors and Camera Systems for Scientific, Industrial, and Digital Photography Applications II, Morley M. Blouke, John Canosa, Nitin Sampat, Editors,
Photocurrent Estimation from Multiple Non-destructive Samples in a CMOS Image Sensor Xinqiao Liu and Abbas El Gamal Information Systems Laboratory Department of Electrical Engineering Stanford University
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 informationA 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 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 informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More 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 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 informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More 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 informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
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 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 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 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 informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
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 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 information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationAn 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 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 informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationDesign and Implementation of an Energy Efficient Multimedia Playback System
Desgn and Implementaton of an Energy Effcent Multmeda Playback System Zhjan Lu, John Lach, Mrcea Stan, Kevn Skadron, Departments of Electrcal and Computer Engneerng and Computer Scence, Unversty of Vrgna
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationA HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS
Kumar Pardeep and Chaturved D.K., Pahua G.L. - A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS Kumar
More informationUSING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES
USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES 1 Fetosa, R.Q., 2 Merelles, M.S.P., 3 Blos, P. A. 1,3 Dept. of Electrcal Engneerng ; Catholc Unversty of
More informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
More informationCHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION
48 CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION 3.1 INTRODUCTION The raw mcroarray data s bascally an mage wth dfferent colors ndcatng hybrdzaton (Xue
More informationChannel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7
Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationA Background Subtraction for a Vision-based User Interface *
A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationDesign for Reliability: Case Studies in Manufacturing Process Synthesis
Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationCategories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms
3. Fndng Determnstc Soluton from Underdetermned Equaton: Large-Scale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu
More informationNOVEL CONSTRUCTION OF SHORT LENGTH LDPC CODES FOR SIMPLE DECODING
Journal of Theoretcal and Appled Informaton Technology 27 JATIT. All rghts reserved. www.jatt.org NOVEL CONSTRUCTION OF SHORT LENGTH LDPC CODES FOR SIMPLE DECODING Fatma A. Newagy, Yasmne A. Fahmy, and
More informationEnd-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video
End-to-end Dstorton Estmaton for RD-based Robust Delvery of Pre-compressed Vdeo Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna, Santa
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 informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
More informationAn Efficient Background Updating Scheme for Real-time Traffic Monitoring
2004 IEEE Intellgent Transportaton Systems Conference Washngton, D.C., USA, October 3-6, 2004 WeA1.3 An Effcent Background Updatng Scheme for Real-tme Traffc Montorng Suchendra M. Bhandarkar and Xngzh
More informationQuantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control
Quantfyng Responsveness of TCP Aggregates by Usng Drect Sequence Spread Spectrum CDMA and Its Applcaton n Congeston Control Mehd Kalantar Department of Electrcal and Computer Engneerng Unversty of Maryland,
More informationIntegrated Expression-Invariant Face Recognition with Constrained Optical Flow
Integrated Expresson-Invarant Face Recognton wth Constraned Optcal Flow Chao-Kue Hseh, Shang-Hong La 2, and Yung-Chang Chen Department of Electrcal Engneerng, Natonal Tsng Hua Unversty, Tawan 2 Department
More informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationCooperative UAV Trajectory Planning with Multiple Dynamic Targets
AIAA Gudance, avgaton, and Control Conference 2-5 August 200, Toronto, Ontaro Canada AIAA 200-8437 Cooperatve UAV Trajectory Plannng wth Multple Dynamc Targets Zhenshen Qu and Xangmng X 2 Harbn Insttute
More informationExplicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements
Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More 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 informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
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 informationX- 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 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 informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More information