REAL-TIME RENDERING OF CUT DIAMONDS
|
|
- Basil Hawkins
- 6 years ago
- Views:
Transcription
1 Online ID 0459 Page REAL-TIME RENDERING OF CUT DIAMONDS paper caegory: process (auhor ) (auhor ) Absrac We presen a mehod o creae in real ime compuer-generaed images o cu diamonds o convex polyhedral shape The mehod is based on beam racing and models he complee underlying physics o Fresnel s equaions and polarizaion racing To achieve high compuaional eiciency, we linearize he non-linear reracion and ake advanage o he convex shape We analyze he scaling o our mehod wih increasing deph o recursive beam racing We compare resuls produced by our mehod wih hose generaed by ray racing For ypical scenes and image resoluions o approximaely 800-by-800 pixels, he speed-up acor o our mehod compared o ray racing is abou 000 o 5000, depending on recursion deph, wih he obained images being almos idenical Our mehod produces phoo-realisic images, which we demonsrae by comparison o phoographs aken under careully conrolled lighing condiions o images produced by our mehod when simulaing he same condiions Inroducion and Moivaion We describe a highly eicien mehod or real-ime and nearphoorealisic rendering o cu diamonds Figure shows highqualiy images produced by our mehod Our work was moivaed by he desire o develop an ineracive ool supporing he rapid generaion o imagery o cu diamonds The primary objecive was o devise a novel approach ha is as eicien as possible and can suppor ruly ineracive rendering o diamonds, allowing a user o ully explore he parameer space given by geomery, lighing and camera We have achieved his objecive The sysem ha we have creaed allows a user o speciy and change easily he parameers conrolling opical/geomerical diamond characerisics and he seings or our camera viewing model Our main objecives in designing our sysem were o devise an algorihm ha is in accordance wih he physical laws o relecion and reracion (Snell s law and Fresnel s equaions), and leads o a compuaionally highly eicien implemenaion producing high-qualiy renderings We briely review he essenial physical laws underlying our approach; describe how hese laws are implemened in he design o our algorihm; and compare he resuls produced by our prooype wih hose obained by ray racing and wih acual digial phoographs In compuer graphics, ray racing is he proo-ypical mehod used or generaing digial images o hree-dimensional scenes Eecs like relecion and reracion can be modelled well wih a ray racing approach Neverheless, o generae correc ray-raced images i is crucial o embed he whole physics o relecion and reracion coeiciens in one s ray racing algorihm - and in he Fig : Renderings o diamonds obained wih our mehod
2 Online ID 0459 Page deiniion o all objecs consiuing a scene In general, such a rigorous, physics-based approach is currenly no applicable o scenes conaining housands o complicaed objecs wih dieren opical properies Our work was moivaed by he goal o demonsrae ha i is possible o produce correc images o cu diamonds, and o documen ha his goal can be achieved on oday's commodiy PCs using sandard graphics cards Wih our curren implemenaion i is possible or a user o obain highqualiy renderings o cu diamonds a ineracive rame raes, ie he/she can vary rendering or diamond parameers and obain a rendering insanly Our approach o eicien rendering o cu diamonds is based on he principle o beam racing, see [Heckber and Hanrahan 984] Ray racing, being an image-/screen-space approach requires us o shoo rays hrough every screen pixel; beam racing can lead o subsanial acceleraions over sandard ray racing by using enire "bundles" (beams) o rays insead We have adaped beam racing or cu diamond rendering There are numerous ray racing packages ha use Snell s law o compue reracions However, he relecion and reracion coeiciens, given by Fresnel s equaions, are no always implemened, as heir compuaion is expensive To compare he eiciency o he implemenaion o our mehod wih a ypical commonly used ray racing package, we chose o use MegaPOV [MegaPOV], an exension o he popular ray racer Persisence o Vision [POV-Ray], or comparison, as i makes use o Fresnel s equaions We have compared compuaional eiciency and qualiy o rendering resuls Subjec o he chosen image resoluion, i has urned ou ha our implemenaion can produce resuls highly similar o hose creaed wih MegaPOV - wih speed-up acors o several orders o magniudes To validae ha our implemenaion o he physical laws and our mahemaical simpliicaions are also in agreemen wih physical realiy, we have perormed comparison wih digial phoographs Our experimens have conirmed ha our implemenaion can produce highly realisic renderings Mehod We consider a convex polyhedron, in he remainder o his paper reerred o as sone, made o a maerial o isoropic index o reracion This deiniion comprises almos all relevan cases, as wih he excepion o he hear shape, all shapes commonly used or jewellery are convex polyhedra Boh diamond and cubic zirconia, he bes commercial subsiue or diamond, are maerials wih an isoropic index o reracion The sone s aces will be reerred o as aces Due o he polyhedron s convexiy, all aces are convex polygons Firs, we describe he individual componens o our mehod, and hen we show how hey are used in he main algorihm Beam racing Ray racing is known o produce very realisic images Wih he appropriae models or local ineracion o ligh and objecs, many physical eecs can be simulaed wih high accuracy Unorunaely, ray racing is also very slow, as every pixel o he rendered image has o be compued individually Beam racing [Heckber and Hanrahan 984] builds upon he idea o enlarging he sampling area As in he case o ray racing, ligh is raced backwards, rom he observer s eye o he objecs in he scene and inally owards he ligh sources Insead o ininiesimally hin rays (poin sampling), beams wih inie Fig : A beam b is deined by an eye poin v and a polygon p Insead o using p, we use he screen-projeced polygon p o deine he beam b exension are used (area sampling) In his paper, a beam is undersood as a cone wih convex polygonal cross-secion (Fig ) A poin v (he locaion o he observer s eye) and a convex polygon p deine a beam For a given beam, here is no unique polygon ha deines he beam Any inersecion o he beam wih a plane can be used By esablishing a reerence plane (he screen ) wih a coordinae sysem and using he inersecion o screen and beam as deining polygon, we can deine beams in erms o wo-dimensional screen coordinaes In OpenGL [Shreiner 999], he mapping sc OpenGL ha convers hree-dimensional objec poins o wo-dimensional screen coordinaes is sc OpenGL = pd o mv o hg wih hg : ( x y z) a ( x y z ) he ransormaion o homogeneous coordinaes, 4 mv : x a M x, M R R he produc o he modelview and projecion marices and ( ) pd ( ) OpenGL : x y z w a x y z w he perspecive division We use he same kind o mapping, bu in a slighly modiied noaion and omiing he deph componen in he perspecive division, as we will no need i Our mapping sc o screen coordinaes is sc = pd o cm wih cm : x a A x + b, A R R, b R and x pd : x a w R R x w,, c + c y For given OpenGL modelview and projecion marices, we can compue A, b, w and c o yield he same mapping In oher words, we use OpenGL-like screen coordinaes o deine beams and compue inersecions o polygons wih beams However, his is no done by he OpenGL subsysem, bu direcly in he algorihm The concep o beams is well suied or scenes consising o convex polygons, as he inersecion o a beam and a convex polygon yields a convex polygon, which is used o deine a child beam wih he same origin [Ghazanarpour and Hasenraz 998] In his ramework, relecions are easily incorporaed, as hey are linear ransormaions, ransorming polygons ino polygons and beams ino beams 4
3 Online ID 0459 Page Fig : The inersecion o beam wih aces The compuaion o he inersecion is done in erms o screen coordinaes, which reduces he calculaion o he beam-polygon-inersecion o he inersecion o wo convex polygons The beam subdivision As explained in he preceding secion, we deine beams in erms o wo-dimensional screen coordinaes This simpliies he calculaion o he inersecion o a beam wih a ace, as i can be done in screen coordinaes Figure shows he hree-dimensional arrangemen and he corresponding screen-projeced scene As he mapping sc consiss o a linear ransormaion and a perspecive division, he projecion o screen ransorms convex polygons (he aces) ino convex polygons (he projeced polygons in Fig ) As he paren polygon ha deines he beam is convex oo, we have o compue he inersecion o wo convex polygons, which is easy and can be done raher as In order o avoid he projecion o aces ha do no yield an inersecion wih he paren polygon, we sar wih a ace ha is known o yield an inersecion We deermine a suiable sar ace by consrucing a ray in he cener o he beam and deermining he ace where i leaves he sone While acually compuing he inersecion, all aces adjacen o he ace currenly reaed are marked or processing, i hey mus have a non-vanishing inersecion wih he beam This can easily be deermined rom he muual posiion o he polygons edges When all aces marked or processing have been projeced and heir inersecions compued, he subdivision o he beam is inished, as () here are no urher aces wih non-vanishing inersecion, as he sone is known o be convex, and () he sum o he child beams is equal o he beam isel, as he surace o he sone is closed The second saemen can be easily undersood by realizing ha when racing he beam, we are inside he sone, hus here is no way o leaving he sone wihou crossing is surace The relecion mapping r The relecion upon a ace wih plane equaion x n c = 0, n R,c R is given by he mapping ( n n ) x + c n r : R R, x a As i depends only on he plane parameers, i can be rewrien in he more convenien linear orm r : x a A x + b, and he marix A and he vecor b sored or every ace a he sar o he beam race algorihm 4 The reracion mapping On ineraces o maerials wih dieren index o reracion, ligh ges reraced according o Snell s law, given as n sinα = n sinα Fig 4: The reracion o an inciden ray on a plane inerace beween media wih indices o reracion n < n For a viewer a posiion v, ligh emied rom a poin x inside medium seems o come rom a virual image poin ~ x We consider a plane inerace o wo maerials wih indices o reracion n < n (Fig 4) For a viewer a poin v, ligh originaing a poin x inside maerial seems o come rom he virual image poin ~ x For a ixed viewing posiion v and in he limi β 0, ie, or small opening angles around he main ray, he relaion beween x and ~ x is well deined We reer o his mapping as m : R R, x a ~ rer x For non-vanishing opening angles β, here is no single virual image poin In opics, he resuling image auls are called aberraions In his paper, we neglec he eecs o aberraion As mrer is nonlinear and compuaionally expensive, we linearize i by Taylor series expansion Using he Taylor series o m rer a poin x 0 m rer ( x ) = mrer ( x0 ) + mrer ( x0 )( x x0 ) + L we deine a linear projecion ( ransmission ) : R R, x a A x + b wih A : = m rer ( x 0 ), b : = mrer ( x 0 ) mrer ( x 0 ) x 0 The developmen poin x 0 has o be on he inerace in order o asser coninuiy: As poins in medium do no ge reraced (he ligh does no cross he reracing boundary beween medium and ), hey are mapped ono hemselves In order o yield an overall coninuous mapping, mus map he poins in he inerace plane ono hemselves, jus as m rer does This is assered by choosing a developmen poin on he inerace The mos suiable choice or x 0 is he cener o he ace A he inerace, m rer is coninuous bu is derivaive is no coninuous, hus, sricly speaking, he erm m rer ( x 0 ) is a singlesided derivaive For he compuaion o m rer ( x 0 ), we are ree o choose a suiable base ( b, b, b) and consruc m rer ( x 0 ) rom he direcional derivaives along he base vecors For b and b, we use he plane vecors o he inerace plane, as i is very simple o compue he direcional derivaives or hem The choice o b and he compuaion o he direcional derivaive is explained in Figure 4 From he direcion o incidence d inc, deined by v and x 0, and Snell s law, we obain he direcion d rer o he reraced ray We choose a virual image poin ~ x = x 0 + εdinc wih using a small value or ε and a small angle β o deine a second ray, compue he reracion o his second ray and ge he poin x as he inersecion poin o he wo
4 Online ID 0459 Page 4 reraced rays Thus, he direcional derivaive along b : = x x ~ 0 is b ~ = x x0, and we inally ge he derivaive m rer ( x 0 ) as ~ m ( ) ( ) ( ) rer x0 = b b b b b b Boh A and b are hereore ixed, and he mapping is deermined This compuaion mus be done only once or every ace direcly visible rom he viewer 5 Fresnel s equaions Snell s law describes he reracion angle, bu no he inensiies o he releced and he reraced ligh componens These inensiies are given by Fresnel s equaions [Jackson 999] Using he quaniies and sign convenions as shown in Figure 5, or he ligh componen wih an elecric ield orhogonal o he plane o incidence, he relecion and ransmission coeiciens are given by E, orh n n r, orh : = = E0, orh n + n E, orh n, orh : = = E n + n 0 orh For he elecric ield parallel o plane o incidence hese coeiciens are given by E, par n n r, par : = = E0, par n + n E, par n, par : = = E n + n 0, par In he case o oal inernal relecion, he relecion coeiciens become complex Their absolue value is one, as all ligh ges iδorh releced Thus, hese coeiciens have he orm r TIR, orh = e iδ par and r TIR, par = e For our applicaion, we do no need he absolue phase, as we consider only incoheren ligh Only he phase dierence δ = δ orh δ par is relevan The equaion or δ is given in [Born and Wol 999] For he compuaion o he releced and ransmied inensiies, he polarizaion sae has o be known Algorihms ha do no rack he polarizaion sae usually assume unpolarized ligh and use he relecion and ransmission coeiciens r, unpol = r, orh + r, par = +, unpol, orh, par 6 Polarizaion racking As he relecion and reracion coeiciens given by Fresnel s equaions dier or he parallel and orhogonal componen, he polarizaion sae o ligh changes due o he relecions and reracions Compleely unpolarized ligh can ge compleely linearly polarized by a single relecion (he angle o incidence or his case is known as Breweser s angle) As here are many relecions and reracions o ake ino accoun when racing ligh hrough he sone, he polarizaion sae o he ligh mus be racked There are several ways o represen he polarizaion sae o ligh: The Sokes parameers, he coherence marix and he Jones calculus Each o hese ways has is own disinc advanages [Chipman 995, Wol and Kurlander 990] For he applicaion o cu-diamond rendering, he mos suiable represenaion is he coherence marix: I can handle parially polarized ligh and lends isel o easy ransormaion For a given ligh ray, an orhogonal coordinae sysem is esablished wih he Fig 5: Adoped sign convenion or elecic ield used in Fresnel s equaions z-axis corresponding o he direcion o he ligh propagaion The coherence marix J is deined as E x E xex ExEy J = ( Ex Ey ) =, Ey EyEx EyEy wih E x and E y denoing he componens o he elecric ield wih respec o he coordinae sysem, and he angular brackes denoing ime averaging The coherence marix does no include E z, as here is no elecric ield in he direcion o propagaion The ligh inensiy is given by he race o he coherence marix r J = J xx + J yy, while he deerminan gives he degree o polarizaion For deails on how o inerpre he coherence marix, see [Born and Wol 999] In order o apply he relecion and ransmission coeiciens, he coordinae sysem mus be roaed such ha is x-axis is aligned wih he direcions orhogonal o he plane o incidence and he y- axis parallel o he plane o incidence Wih respec o a coordinae sysem ha is roaed around he z-axis by he angle ϕ, he elecric ield is given as Ex cosϕ sinϕ = Ex E y sinϕ cosϕ E y 4444 mro: = Now i is possible o apply he ransmission or relecions coeiciens The releced par is given as Ex ro 0 Ex Ex = = m rel mro E y 0 rp E rel y E y 44 mrel: = or, in he case o oal inernal relecion, iδ e 0 m = rel 0 wih δ he phase dierence deined in secion Fresnel s equaions The ransmied par is Ex o 0 Ex E x = = mrans mro Ey 0 p E rans y E y mrans : = Acually, he cos acor does no belong o he ransormaion o he elecric ield, bu o he ransormaion o he ligh power (energy per ime): The ligh power or he sampling area changes proporionally o he raio / due o he change o he
5 Online ID 0459 Page 5 beam s cross-secion Insead o soring his acor and applying i when compuing he ligh power, we apply is roo in he ransormaion o he elecric ield As a consequence, when compuing he coherence marix rom he ransormed elecric ield, i has already been aken ino accoun 7 Deph o ield The imaging o small objecs ends o go hand in hand wih a considerable deph-o-ield: Due o heir size, small objecs emi lile ligh In order o capure enough ligh or a phoograph he enry lens mus be large, ie, mus have large numerical aperure A large numerical aperure yields a small deph o ield As cu diamonds usually are relaively small, mos phoographs o cu diamonds exhibi a pronounced deph o ield We are used o his deph o ield in diamond picures, and i is his phenomenon ha makes crisp picures look unrealisic o he human observer For added realism, we mus simulae deph o ield There is a sraighorward approach o simulae deph o ield: We can posiion he (pin-hole) camera a several locaions in he lens (wih adjused viewing direcion) and calculae he average o he images This approach amouns o rendering he same scene several imes wih a slighly modiied camera, and compuing he average o all picures In OpenGL, his calculaion is done in he accumulaion buer [Shreiner 999], as is increased color deph avoids rounding errors For a smooh-looking deph o ield, many camera posiions are necessary, ypically 0 o 00 8 Parallel and perspecive reracion The accumulaed projecion ransormaion m acc or every beam is o he orm x a A x + b, wih A R R, b R Aer applicaion o his projecion, he perspecive division pd is applied For every inersecion es, his ransormaion mus be done or all corners o he ace o be projeced Considering overall compuaional cos, his sep requires he execuion o a relaively large number o loaing-poin operaions We can reduce his compuaional cos by using parallel reracion insead o he reracion mapping deined above The idea is depiced in Figure 6 Insead o using, we use he mapping parallel : R R, x a Ax + b, wih n drer drer A : =, b : = c drer n drer n where n and c are he parameers o he ace s implici plane equaion x n c = 0 This mapping projecs all poins in he direcion d rer ono he ace plane Insead o using he overall projecion pd o cm o, we use he projecion pd o zrecons o red d o cm o parallel, aking advanage o he possible reducion o wo-dimensional space, red ( ) ( ) d : R R, x y z a x y, which is compensaed by an ensuing reconsrucion mapping deined as z ( ) ( ( )) recons : R R, x y a x y recons x, y, which re-compues he z-componen ha is los in red d Reconsrucion wih he uncion recons is possible due o he ac ha all poins mapped by cm o parallel lie in a plane deined by he ace plane equaion, ransormed linearly by cm Fig 6: (a) Perspecive reracion and (b) parallel reracion We spli he overall projecion sc ino wo pars, given by sc = pd o o o 44 o zrecons redd cm parallel, : = pdrecons = : mred using a modiied perspecive division pd recons : R R and a linear mapping mred : R R, x a A red x + bred wih A red R R, bred R The crucial idea or he reducion o compuaional cos is o use he mapping m red insead o sc or he inersecion es This approach reduces he number o loaing-poin calculaions or he linear par by one hird and leaves ou he perspecive division compleely Only during he las sage o our algorihm, when we draw o he screen, do we compue he acual screen coordinaes by pd recons As many more coordinaes are projeced or he inersecion es han coordinaes drawn on he screen, he delayed perspecive division reduces he number o loaing-poin operaions as well To summarize: Insead o using screen coordinaes, we use preperspecive-division coordinaes resuling rom m red or he compuaion o he inersecions This approach reduces he number o loaing-poin operaions by more han one hird In principle, a problem can occur during he reconsrucion uncion recons, as i can lead o a division by zero In pracice, he probabiliy o his siuaion o occur is so small ha i can be negleced O course, due o he missing perspecive division, polygons ha are benign in screen coordinaes can be almos degenerae in pre-perspecive-division coordinaes However, he inersecion es or he subdivison o beams mus be able cope wih almos degenerae polygons, and as he opposie siuaion is jus as likely o occur (polygons benign in pre-perspecivedivision coordinaes, bu almos degenerae in screen coordinaes), parallel reracion is numerically no more sensiive han perspecive reracion The only real issue ha remains is his one: Due o he missing perspecive division, someimes he orienaion o projeced polygons is wrong (ie, he polygon s corners are ordered in mahemaical negaive insead o posiive sense) As he inersecion algorihm relies on a ixed orienaion, or polygons oriened wrongly, we use red d wih he y-componen reversed, perorm all compuaions wih his projecion, and inally reverse he y-componen when drawing, ie, jus beore he perspecive division pd recons
6 Online ID 0459 Page 6 Fig 7: Dieren levels o image qualiy Recursion deph: eigh (all our examples), image size 800*800 pixel, using ani-aliasing From le o righ: (a) Rendered wih parallel reracion (655 ms); (b) rendered wih perspecive reracion (809 ms); (c) same as (b), wih addiion o specral sampling (hree wavelenghs) (6 ms); (d) same as (c), wih addiion o deph o ield (9 camera posiions, 65 s) 9 The main algorihm 4 or (every ace direcly visible) { creae beam o deph by projecing ace according o pd o cm, he projecion o screen coordinaes; creae local coordinae sysem and compue change m ro,camera rom local o camera coordinae sysem; compue direcion and coeiciens o relecion; compue polarizaion ransormaion or oubound (releced) beam: pacc,ou = m ro,camera o m rel o m ro,ligh source apply pacc,ou o ligh emanaing rom ligh source, compue and sore coherence marix; or he compuaion o he child beams, add reracion mapping o projecion and sore accumulaed projecion m acc = cm o ; se polarizaion ransormaion o relec change o coordinae sysem and reracion coeiciens: pacc = m ro,camera o m rans ; } or (d= o maximal recursion deph) { or (paren = every beam o deph d-) { projec aces according o paren s accumulaed projecion mapping m acc, paren, ollowed by pd; use projeced aces o spli paren beam ino child beams; or (every child beam) { compue direcion o reracion; creae local coordinae sysem and compue change m ro rom local o paren coordinae sysem; compue polarizaion ransormaion or oubound (reraced) beam pacc,ou = pacc, paren o m ro o m rans o m ro,ligh source apply pacc,ou o ligh emanaing rom ligh source, compue and sore coherence marix; or he compuaion o child beams, add relecion mapping r o projecion and sore accumulaed projecion macc = macc, paren o r ; add change o coordinae sysem and relecion coeiciens o polarizaion ransormaion pacc = pacc, paren o m ro o m rel }}} or (every beam compued) { use lighing model o deermine ligh inensiy or oubound direcion; muliply inensiy wih coherence marix o oubound direcion; use resuling inensiy o render polygon on screen; } To evaluae he perormance o our mehod, we have esed i on a PC running a GHz, having 5MBye o main memory and an NVidia Ti 400 graphics card We have used he graphics card's hardware ani-aliasing (wo-by-wo super-sampling) o reduce aliasing eecs Resuls 4 Perormance and image qualiy Figure 7 shows a ypical image obained wih ixed recursion deph, bu or dieren qualiy levels The ases version is parallel reracion, which yields images ha are qualiaively correc, bu no quaniaively correc (see also Fig 9) To saisy average rendering demands, in erms o image qualiy, he bes choice is perspecive reracion I is nearly correc and has good perormance A urher simpliicaion o he reracion leads o visible deviaion rom he correc image (Fig 9), while reducing rendering imes by jus 5% or small and 5% or large recursion dephs (Fig 8) Using specral sampling, ie, rendering he same scene or dieren wave lenghs, he color eecs due o diamond s dispersion [Edwards and Philipp 985] appear The rendering imes increase linearly wih he number o wavelenghs used The simulaion o deph o ield increases compuaional cos linearly wih he number o sampling poins As a smooh deph o ield usually requires 0 o 00 sampling poins, his opion is very expensive Fig 8: Scaling o rendering imes per rame wih recursion deph or he scene shown in Fig 7, wih parallel reracion (doed line), perspecive reracion (solid line) and perspecive reracion wih hree-wavelengh specral rendering (dashed line)
7 Online ID 0459 Page 7 4 Beam and ray racing The de aco sandard or rendering echniques is usually ray racing In his secion, we compare ray-raced images wih images rendered by our mehod For his purpose, he ray racer used or comparison mus be capable o handling Fresnel s equaions correcly Polarizaion handling is desirable, bu no necessary, as we can disable polarizaion racking in our mehod We chose o use he ray racer POV-Ray as i is powerul, readily available and an exension called MegaPOV 07 is available ha includes Fresnel s equaions As i is open-source, we could veriy he correc handling o Fresnel s equaions in he code Unorunaely, i does no rack polarizaion, so we had o disable polarizaion racking in our mehod in order o asser comparabiliy This was done by using he coeiciens or unpolarized ligh given a he end o secion Fresnel s equaions or boh he parallel and orhogonal componen In order o compare ray racing wih our mehod, we mus use a scene ha can be se up boh by he ray racers s scene language and our mehod While he cu could be convered easily or he ray racer, he lighing had o be simpliied in order o guaranee ha boh MegaPOV and our mehod perormed he same calculaions The lighing used or Figure 9 consiss o hree planes and wo spheres All ive objecs have homogeneous color and are li by pure ambien ligh, hus every poin on an objecs emis ligh wih he same inensiy The inensiies o he ive objecs are all dieren Rendering is done or a single wavelengh, ie, a single index o reracion Thereore, no colors are visible, as hey emerge rom dispersion, ie, a wave lengh dependen index o reracion Beam racing has he advanage o reducing aliasing [Ghanzanarpour and Hasenraz 998], as i is an area-sampling mehod in conras o ray racing, which is a poin-sampling mehod In ray racing, he sampling or he image pixels is done in soware An improvemen o image qualiy by ani-aliasing increases he compuaional cos (Fig 9d), whereas or beam racing, he ani-aliasing can be done in hardware, resuling in a negligible perormance reducion (a) Ray racing (b) Beam racing wih perspecive reracion (c) Beam racing wih parallel reracion (d) Rendering imes or dieren echniques (e) Image (b) minus (a) plus 50% grey () Image (c) minus (a) plus 50% grey Fig 9: Comparison o rendering echniques All images have a size o 800 x 800 pixel and make use o ani-aliasing (a) hrough (c) show he same scene, rendered wih ray racing, beam racing wih perspecive reracion and beam racing wih parallel reracion In order o emphasize he non-linear eecs o he reracion, he camera locaion was chosen close he sone (he disance beween camera and sone being less han six imes he sone s diameer) As all images closely resemble each oher, (e) and () show he dierences beween he beam- and he ray-raced images Fig 9(e) demonsraes ha he linearizaion used or perspecive reracion is a very good approximaion o he correc non-linear reracion Fig 9(d) shows he rendering imes per rame or beam racing wih perspecive reracion (solid line), ray racing wihou ani-aliasing (doed line) and ray racing wih ani-aliasing (dashed line) For beam racing, disabling ani-aliasing changes rame raes so lile ha, in his graph, i would yield he same line as ani-aliased beam racing The perormance advanage o beam racing agains ray racing ranges rom 00 o 900 or high image qualiy (wih ani-aliasing) and rom 600 o 600 or reduced image qualiy (wihou ani-aliasing)
8 Online ID 0459 Page 8 Fig 0: Comparison o phoograph wih resul produced by our mehod (a) Phoograph o a cubic zirconia sone o round brillian shape, aken wih a microscope under well-conrolled lighing condiions (b) Image rendered by our mehod wih he scene parameers maching he physical microscope seup Deph o ield is enabled wih superposiion o 7 individual rames Rendering ime: 00 s (a) phoograph (b) rendered wih our mehod 4 Beam racing and phoography While he comparison wih ray racing is convincing rom a compuer graphics poin o view, he ulimae es is he comparison wih real phoographs The simulaion o a real scene wih our mehod is only easible i he scene is well deined The mos criical par is he lighing We buil a dedicaed box wih a well-deined window or lighing The sone was placed a a ixed posiion in he box and viewed wih a microscope A digial relex camera was used, as i yields a linear connecion beween ligh inensiy and he RGB values o he image pixels The picures aken wih he camera were no alered in any way, hey were only cropped o he relevan size As no real diamond o appropriae size was available, we used a sone made o cubic zirconia, he bes commercial subsiue or diamond Using he index o reracion o cubic zirconia [Wood and Nassau 98], he daa o he microscopes objecive, he dimensions o he lighing window and he posiion o he sone under he microscope s objecive, we rendered he same scene wih our mehod Figure 0 shows he phoograph and he resul obained by our mehod Almos all o he relexes seen in he phoograph can be clearly ideniied in he digially produced duplicae; many o he colored relexes have he same color The dierences can be aribued or he mos par o he ac ha he sone s cu is no perec, as he locaion and size o he individual relexes depend very delicaely on he angles beween he individual aces Though he rendering was done wih jus hree wavelenghs (60, 540 and 445 nm or he red, green and blue componen, respecively), he colors are qualiaively correc Apparenly, his raher coarse approximaion o he ull specral disribuion already yields a good approximaion o he real image 5 Conclusions and possible exensions We have described a mehod or he rendering o cu diamonds I is possible o generae near-phoorealisic images o cu diamonds, a high resoluion and high recursion deph, wih our implemenaion o his mehod Today's commodiy PCs equipped wih conemporary graphics cards are suicien o generae hese images Concerning he rigorous evaluaion o our mehod we have compared our resuling images wih hose obained wih a popular ray racing package and wih acual phoographs o a cu sone In summary, our evaluaion procedures have demonsraed ha our implemenaion compares very avorably wih experimens The key conribuions and speciic srenghs o our novel approach are: Our mehod is exremely eicien, much more eicien in general han exising compeiive echniques we are aware o our mehod does no require any pre-compuaion seps our mehod is physically correc, as i akes ino accoun Snell s law, Fresnel s equaions and polarizaion our mehod can be used o produce highly realisic renderings o cu diamonds Possible exensions are he handling o colored sones by incorporaion o deph racking and he sones exincion coeiciens and he simulaion o phoographic areacs like bleeding due very srong relexes A poenially very ineresing applicaion or our mehod is he mahemaical opimizaion o diamond cus, as i can be used o consruc opimizaion uncions, eg or brilliance and ire, which, due o our mehod being an area sampling mehod, are coninuous and hus lend hemselves o numerous opimizaion algorihms 6 Reerences BORN, M AND WOLF, E 999 Principles o Opics, 7h ed Cambridge Universiy Press, Cambridge, UK CHIPMAN, R A 995 Mechanics o polarizaion ray racing Opical Engineering 4, 6, EDWARDS, D F AND PHILIPP H R 985 Cubic Carbon (Diamond) In Handbook o Opical Consans o Solids Academic Press, Orlando, Florida Palik E D, Ed, GHAZANFARPOUR, D AND HASENFRATZ, J-M 998 A beam racing mehod wih precise anialiasing or polyhedral scenes Compuers & Graphics,, 0-5 HECKBERT, P S AND HANRAHAN, P 984 Beam racing polygonal objecs In Compuer Graphics (Proceedings o ACM SIGGRAPH 84), 8,, ACM, 9-7 JACKSON, J D 999 Classical Elecrodynamics, hird ediion John Wiley & Sons, New York MEGAPOV Version 07 hp://megapovinearne/ POV-RAY hp://wwwpovrayorg/ SHREINER D 999 OpenGL Reerence Manual, hird ediion Addison Wesley Longman, Reading, Massachuses WOLFF, L B AND KURLANDER, D J 990 Ray Tracing wih Polarizaion Parameers IEEE Compuer Graphics & Applicaions 0, 6, WOOD, D L AND NASSAU, K 98 Reracive Index o cubic zirconia sabilized wih yria Applied Opics, 6,
Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)
Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,
More informationSTEREO PLANE MATCHING TECHNIQUE
STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo
More informationEffects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)
Foundaions of ompuer Graphics (Fall 2012) S 184, Lecure 16: Ray Tracing hp://ins.eecs.berkeley.edu/~cs184 Effecs needed for Realism (Sof) Shadows Reflecions (Mirrors and Glossy) Transparency (Waer, Glass)
More information4.1 3D GEOMETRIC TRANSFORMATIONS
MODULE IV MCA - 3 COMPUTER GRAPHICS ADMN 29- Dep. of Compuer Science And Applicaions, SJCET, Palai 94 4. 3D GEOMETRIC TRANSFORMATIONS Mehods for geomeric ransformaions and objec modeling in hree dimensions
More informationScattering at an Interface: Normal Incidence
Course Insrucor Dr. Raymond C. Rumpf Office: A 337 Phone: (915) 747 6958 Mail: rcrumpf@uep.edu 4347 Applied lecromagneics Topic 3f Scaering a an Inerface: Normal Incidence Scaering These Normal noes Incidence
More informationComputer representations of piecewise
Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom
More informationCAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL
CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz
More informationCENG 477 Introduction to Computer Graphics. Modeling Transformations
CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World
More informationMATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008
MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o
More informationEECS 487: Interactive Computer Graphics
EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified
More informationM y. Image Warping. Targil 7 : Image Warping. Image Warping. 2D Geometric Transformations. image filtering: change range of image g(x) = T(f(x))
Hebrew Universi Image Processing - 6 Image Warping Hebrew Universi Image Processing - 6 argil 7 : Image Warping D Geomeric ransormaions hp://www.jere-marin.com Man slides rom Seve Seiz and Aleei Eros Image
More informationRay Casting. Outline. Outline in Code
Foundaions of ompuer Graphics Online Lecure 10: Ray Tracing 2 Nus and ols amera Ray asing Ravi Ramamoorhi Ouline amera Ray asing (choose ray direcions) Ray-objec inersecions Ray-racing ransformed objecs
More informationImage segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding
Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same
More informationSpline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification
Las Time? Adjacency Daa Srucures Spline Curves Geomeric & opologic informaion Dynamic allocaion Efficiency of access Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen
More informationDesign Alternatives for a Thin Lens Spatial Integrator Array
Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of
More informationTraditional Rendering (Ray Tracing and Radiosity)
Tradiional Rendering (Ray Tracing and Radiosiy) CS 517 Fall 2002 Compuer Science Cornell Universiy Bidirecional Reflecance (BRDF) λ direcional diffuse specular θ uniform diffuse τ σ BRDF Bidirecional Reflecance
More informationA time-space consistency solution for hardware-in-the-loop simulation system
Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong
More informationAML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves
AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves
More informationA Matching Algorithm for Content-Based Image Retrieval
A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using
More informationIn Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12].
In Proceedings of CVPR '96 Srucure and Moion of Curved 3D Objecs from Monocular Silhouees B Vijayakumar David J Kriegman Dep of Elecrical Engineering Yale Universiy New Haven, CT 652-8267 Jean Ponce Compuer
More informationAn Improved Square-Root Nyquist Shaping Filter
An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com
More informationAn Adaptive Spatial Depth Filter for 3D Rendering IP
JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod
More informationCurves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures
Las Time? Adjacency Daa Srucures Geomeric & opologic informaion Dynamic allocaion Efficiency of access Curves & Surfaces Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen
More informationReal Time Integral-Based Structural Health Monitoring
Real Time Inegral-Based Srucural Healh Monioring The nd Inernaional Conference on Sensing Technology ICST 7 J. G. Chase, I. Singh-Leve, C. E. Hann, X. Chen Deparmen of Mechanical Engineering, Universiy
More informationCoded Caching with Multiple File Requests
Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a
More informationGauss-Jordan Algorithm
Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried
More informationNetwork management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);
QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is
More informationFIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS
FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2
More information4. Minimax and planning problems
CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems
More informationA NEW APPROACH FOR 3D MODELS TRANSMISSION
A NEW APPROACH FOR 3D MODELS TRANSMISSION A. Guarnieri a, F. Piroi a, M. Ponin a, A. Veore a a CIRGEO, Inerdep. Research Cener of Carography, Phoogrammery, Remoe Sensing and GIS Universiy of Padova, Agripolis
More informationAlgorithm for image reconstruction in multi-slice helical CT
Algorihm for image reconsrucion in muli-slice helical CT Kasuyuki Taguchi a) and Hiroshi Aradae Medical Engineering Laboraory, Toshiba Corporaion, 1385 Shimoishigami, Oawara, Tochigi 324-855, Japan Received
More informationAnnouncements For The Logic of Boolean Connectives Truth Tables, Tautologies & Logical Truths. Outline. Introduction Truth Functions
Announcemens For 02.05.09 The Logic o Boolean Connecives Truh Tables, Tauologies & Logical Truhs 1 HW3 is due nex Tuesday William Sarr 02.05.09 William Sarr The Logic o Boolean Connecives (Phil 201.02)
More informationLOW-VELOCITY IMPACT LOCALIZATION OF THE COMPOSITE TUBE USING A NORMALIZED CROSS-CORRELATION METHOD
21 s Inernaional Conference on Composie Maerials Xi an, 20-25 h Augus 2017 LOW-VELOCITY IMPACT LOCALIZATION OF THE COMPOSITE TUBE USING A NORMALIZED CROSS-CORRELATION METHOD Hyunseok Kwon 1, Yurim Park
More informationOptimal Crane Scheduling
Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move
More informationA METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS
A METHOD OF MODELING DEFORMATION OF AN OBJECT EMLOYING SURROUNDING IDEO CAMERAS Joo Kooi TAN, Seiji ISHIKAWA Deparmen of Mechanical and Conrol Engineering Kushu Insiue of Technolog, Japan ehelan@is.cnl.kuech.ac.jp,
More informationNEWTON S SECOND LAW OF MOTION
Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during
More informationNonparametric CUSUM Charts for Process Variability
Journal of Academia and Indusrial Research (JAIR) Volume 3, Issue June 4 53 REEARCH ARTICLE IN: 78-53 Nonparameric CUUM Chars for Process Variabiliy D.M. Zombade and V.B. Ghue * Dep. of aisics, Walchand
More informationPoint Cloud Representation of 3D Shape for Laser- Plasma Scanning 3D Display
Poin Cloud Represenaion of 3D Shape for Laser- Plasma Scanning 3D Displa Hiroo Ishikawa and Hideo Saio Keio Universi E-mail {hiroo, saio}@ozawa.ics.keio.ac.jp Absrac- In his paper, a mehod of represening
More informationToday. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough
Today Curves & Surfaces Moivaion Limiaions of Polygonal Models Some Modeling Tools & Definiions Curves Surfaces / Paches Subdivision Surfaces Limiaions of Polygonal Meshes Can We Disguise he Faces? Planar
More informationImage Based Computer-Aided Manufacturing Technology
Sensors & Transducers 03 by IFSA hp://www.sensorsporal.com Image Based Compuer-Aided Manufacuring Technology Zhanqi HU Xiaoqin ZHANG Jinze LI Wei LI College of Mechanical Engineering Yanshan Universiy
More informationLast Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?
Las Time: Curves & Surfaces Expeced value and variance Mone-Carlo in graphics Imporance sampling Sraified sampling Pah Tracing Irradiance Cache Phoon Mapping Quesions? Today Moivaion Limiaions of Polygonal
More informationEvaluation and Improvement of Region-based Motion Segmentation
Evaluaion and Improvemen of Region-based Moion Segmenaion Mark Ross Universiy Koblenz-Landau, Insiue of Compuaional Visualisics, Universiässraße 1, 56070 Koblenz, Germany Email: ross@uni-koblenz.de Absrac
More informationA Fast Stereo-Based Multi-Person Tracking using an Approximated Likelihood Map for Overlapping Silhouette Templates
A Fas Sereo-Based Muli-Person Tracking using an Approximaed Likelihood Map for Overlapping Silhouee Templaes Junji Saake Jun Miura Deparmen of Compuer Science and Engineering Toyohashi Universiy of Technology
More informationMidterm Exam Announcements
Miderm Exam Noe: This was a challenging exam. CSCI 4: Principles o Programming Languages Lecure 1: Excepions Insrucor: Dan Barowy Miderm Exam Scores 18 16 14 12 10 needs improvemen 8 6 4 2 0 0-49 50-59
More informationMORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES
MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image
More informationReinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi
Reinforcemen Learning by Policy Improvemen Making Use of Experiences of The Oher Tasks Hajime Kimura and Shigenobu Kobayashi Tokyo Insiue of Technology, JAPAN genfe.dis.iech.ac.jp, kobayasidis.iech.ac.jp
More informationSTRING DESCRIPTIONS OF DATA FOR DISPLAY*
SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac
More informationA New Semantic Cache Management Method in Mobile Databases
Journal o Compuer Science 1 (3): 351-354, 25 ISSN 1549-3636 Science Publicaions, 25 A New Semanic Cache Managemen Mehod in Mobile Daabases Shengei Shi, Jianzhong Li and Chaokun Wang School o Compuer Science
More informationSyntax Specification by Graph Grammars and Meta-Models
Ou Synax Speciicaion by Graph Grammars and Mea-Models Mark Minas Insiue or Soware Technology Universiä der Bundeswehr München Germany (Some) Dimensions o Visual Languages & Ediors DiaGen Edior archiecure
More informationImproving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services
Improving he Efficiency of Dynamic Service Provisioning in Transpor Neworks wih Scheduled Services Ralf Hülsermann, Monika Jäger and Andreas Gladisch Technologiezenrum, T-Sysems, Goslarer Ufer 35, D-1585
More informationLow-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany
Low-Cos WLAN based Time-of-fligh fligh Trilaeraion Precision Indoor Personnel Locaion and Tracking for Emergency Responders Third Annual Technology Workshop, Augus 5, 2008 Worceser Polyechnic Insiue, Worceser,
More informationOptics and Light. Presentation
Opics and Ligh Presenaion Opics and Ligh Wha comes o mind when you hear he words opics and ligh? Wha is an opical illusion? Opical illusions can use color, ligh and paerns o creae images ha can be
More informationSection 2. Mirrors and Prism Systems
Secion 2 Mirrors and Prism Sysems 2-1 Plane Mirrors Plane mirrors are used o: Produce a deviaion Fold he opical pah Change he image pariy Each ray from he objec poin obeys he law of reflecion a he mirror
More informationAudio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA
Audio Engineering Sociey Convenion Paper Presened a he 119h Convenion 2005 Ocober 7 10 New Yor, New Yor USA This convenion paper has been reproduced from he auhor's advance manuscrip, wihou ediing, correcions,
More information4 Error Control. 4.1 Issues with Reliable Protocols
4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can
More informationLAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation
Submission o Special Issue of CVIU on Model-based and Image-based 3D Scene Represenaion for Ineracive Visualizaion LAMP: 3D Layered, Adapive-resoluion and Muliperspecive Panorama - a New Scene Represenaion
More informationQuantitative macro models feature an infinite number of periods A more realistic (?) view of time
INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many
More informationVirtual Recovery of Excavated Archaeological Finds
Virual Recovery of Excavaed Archaeological Finds Jiang Yu ZHENG, Zhong Li ZHANG*, Norihiro ABE Kyushu Insiue of Technology, Iizuka, Fukuoka 820, Japan *Museum of he Terra-Coa Warrlors and Horses, Lin Tong,
More informationImage Content Representation
Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an
More informationReal-Time Non-Rigid Multi-Frame Depth Video Super-Resolution
Real-Time Non-Rigid Muli-Frame Deph Video Super-Resoluion Kassem Al Ismaeil 1, Djamila Aouada 1, Thomas Solignac 2, Bruno Mirbach 2, Björn Oersen 1 1 Inerdisciplinary Cenre for Securiy, Reliabiliy, and
More informationThe Impact of Product Development on the Lifecycle of Defects
The Impac of Produc Developmen on he Lifecycle of Rudolf Ramler Sofware Compeence Cener Hagenberg Sofware Park 21 A-4232 Hagenberg, Ausria +43 7236 3343 872 rudolf.ramler@scch.a ABSTRACT This paper invesigaes
More informationChapter Six Chapter Six
Chaper Si Chaper Si 0 CHAPTER SIX ConcepTess and Answers and Commens for Secion.. Which of he following graphs (a) (d) could represen an aniderivaive of he funcion shown in Figure.? Figure. (a) (b) (c)
More informationExperiments in Generalizing Geometry Theorems Stephen B. Gray
Experimens in Generalizing Geomery Theorems Sephen B. Gray. INTRODUCTION: THE PDN THEOREM Well-known advances in geomery have been made wih experimenal, or compueraided echniques. The irs was he proo o
More informationImproved TLD Algorithm for Face Tracking
Absrac Improved TLD Algorihm for Face Tracking Huimin Li a, Chaojing Yu b and Jing Chen c Chongqing Universiy of Poss and Telecommunicaions, Chongqing 400065, China a li.huimin666@163.com, b 15023299065@163.com,
More informationRao-Blackwellized Particle Filtering for Probing-Based 6-DOF Localization in Robotic Assembly
MITSUBISHI ELECTRIC RESEARCH LABORATORIES hp://www.merl.com Rao-Blackwellized Paricle Filering for Probing-Based 6-DOF Localizaion in Roboic Assembly Yuichi Taguchi, Tim Marks, Haruhisa Okuda TR1-8 June
More informationStreamline Pathline Eulerian Lagrangian
Sreamline Pahline Eulerian Lagrangian Sagnaion Poin Flow V V V = + = + = + o V xi y j a V V xi y j o Pahline and Sreakline Insananeous Sreamlines Pahlines Sreaklines Maerial Derivaive Acceleraion
More informationPART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR
. ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral
More informationREDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction.
BBM 0 - ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM REDUCTIONS May., 0 Bird s-eye view Desideraa. Classify problems according o compuaional requiremens. complexiy order of growh examples linear
More informationsource managemen, naming, proecion, and service provisions. This paper concenraes on he basic processor scheduling aspecs of resource managemen. 2 The
Virual Compuers A New Paradigm for Disribued Operaing Sysems Banu Ozden y Aaron J. Goldberg Avi Silberschaz z 600 Mounain Ave. AT&T Bell Laboraories Murray Hill, NJ 07974 Absrac The virual compuers (VC)
More informationMB86297A Carmine Timing Analysis of the DDR Interface
Applicaion Noe MB86297A Carmine Timing Analysis of he DDR Inerface Fujisu Microelecronics Europe GmbH Hisory Dae Auhor Version Commen 05.02.2008 Anders Ramdahl 0.01 Firs draf 06.02.2008 Anders Ramdahl
More informationDETC2004/CIE VOLUME-BASED CUT-AND-PASTE EDITING FOR EARLY DESIGN PHASES
Proceedings of DETC 04 ASME 004 Design Engineering Technical Conferences and Compuers and Informaion in Engineering Conference Sepember 8-Ocober, 004, Sal Lake Ciy, Uah USA DETC004/CIE-57676 VOLUME-BASED
More informationCOSC 3213: Computer Networks I Chapter 6 Handout # 7
COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:
More informationPacket Scheduling in a Low-Latency Optical Interconnect with Electronic Buffers
Packe cheduling in a Low-Laency Opical Inerconnec wih Elecronic Buffers Lin Liu Zhenghao Zhang Yuanyuan Yang Dep Elecrical & Compuer Engineering Compuer cience Deparmen Dep Elecrical & Compuer Engineering
More informationAnalysis of Various Types of Bugs in the Object Oriented Java Script Language Coding
Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened
More informationMotion Level-of-Detail: A Simplification Method on Crowd Scene
Moion Level-of-Deail: A Simplificaion Mehod on Crowd Scene Absrac Junghyun Ahn VR lab, EECS, KAIST ChocChoggi@vr.kais.ac.kr hp://vr.kais.ac.kr/~zhaoyue Recen echnological improvemen in characer animaion
More information1.4 Application Separable Equations and the Logistic Equation
1.4 Applicaion Separable Equaions and he Logisic Equaion If a separable differenial equaion is wrien in he form f ( y) dy= g( x) dx, hen is general soluion can be wrien in he form f ( y ) dy = g ( x )
More informationMOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS
NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..
More informationShortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.
Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah
More informationVisual Indoor Localization with a Floor-Plan Map
Visual Indoor Localizaion wih a Floor-Plan Map Hang Chu Dep. of ECE Cornell Universiy Ihaca, NY 14850 hc772@cornell.edu Absrac In his repor, a indoor localizaion mehod is presened. The mehod akes firsperson
More informationLearning in Games via Opponent Strategy Estimation and Policy Search
Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen
More informationCS422 Computer Networks
CS422 Compuer Neworks Lecure 2 Physical Layer Dr. Xiaobo Zhou Deparmen of Compuer Science CS422 PhysicalLayer.1 Quesions of Ineress How long will i ake o ransmi a message? How many bis are in he message
More informationParallel and Distributed Systems for Constructive Neural Network Learning*
Parallel and Disribued Sysems for Consrucive Neural Nework Learning* J. Flecher Z. Obradovi School of Elecrical Engineering and Compuer Science Washingon Sae Universiy Pullman WA 99164-2752 Absrac A consrucive
More informationWhy not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems
Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen
More informationIt is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );
Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x)
More informationFill in the following table for the functions shown below.
By: Carl H. Durney and Neil E. Coer Example 1 EX: Fill in he following able for he funcions shown below. he funcion is odd he funcion is even he funcion has shif-flip symmery he funcion has quarer-wave
More informationAutomatic Calculation of Coverage Profiles for Coverage-based Testing
Auomaic Calculaion of Coverage Profiles for Coverage-based Tesing Raimund Kirner 1 and Waler Haas 1 Vienna Universiy of Technology, Insiue of Compuer Engineering, Vienna, Ausria, raimund@vmars.uwien.ac.a
More informationMichiel Helder and Marielle C.T.A Geurts. Hoofdkantoor PTT Post / Dutch Postal Services Headquarters
SHORT TERM PREDICTIONS A MONITORING SYSTEM by Michiel Helder and Marielle C.T.A Geurs Hoofdkanoor PTT Pos / Duch Posal Services Headquarers Keywords macro ime series shor erm predicions ARIMA-models faciliy
More informationFACIAL ACTION TRACKING USING PARTICLE FILTERS AND ACTIVE APPEARANCE MODELS. Soumya Hamlaoui & Franck Davoine
FACIAL ACTION TRACKING USING PARTICLE FILTERS AND ACTIVE APPEARANCE MODELS Soumya Hamlaoui & Franck Davoine HEUDIASYC Mixed Research Uni, CNRS / Compiègne Universiy of Technology BP 20529, 60205 Compiègne
More informationX-Splines : A Spline Model Designed for the End-User
X-Splines : A Spline Model Designed for he End-User Carole Blanc Chrisophe Schlic LaBRI 1 cours de la libéraion, 40 alence (France) [blancjschlic]@labri.u-bordeaux.fr Absrac his paper presens a new model
More informationSam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.
8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged
More informationDesign and Application of Computer-aided English Online Examination System NONG DeChang 1, a
3rd Inernaional Conference on Maerials Engineering, Manufacuring Technology and Conrol (ICMEMTC 2016) Design and Applicaion of Compuer-aided English Online Examinaion Sysem NONG DeChang 1, a 1,2 Guangxi
More informationSchedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.
Schedule Curves & Surfaces Sunday Ocober 5 h, * 3-5 PM *, Room TBA: Review Session for Quiz 1 Exra Office Hours on Monday (NE43 Graphics Lab) Tuesday Ocober 7 h : Quiz 1: In class 1 hand-wrien 8.5x11 shee
More informationA Formalization of Ray Casting Optimization Techniques
A Formalizaion of Ray Casing Opimizaion Techniques J. Revelles, C. Ureña Dp. Lenguajes y Sisemas Informáicos, E.T.S.I. Informáica, Universiy of Granada, Spain e-mail: [jrevelle,almagro]@ugr.es URL: hp://giig.ugr.es
More informationProjection & Interaction
Projecion & Ineracion Algebra of projecion Canonical viewing volume rackball inerface ransform Hierarchies Preview of Assignmen #2 Lecure 8 Comp 236 Spring 25 Projecions Our lives are grealy simplified
More informationNURBS rendering in OpenSG Plus
NURS rering in OpenSG Plus F. Kahlesz Á. alázs R. Klein Universiy of onn Insiue of Compuer Science II Compuer Graphics Römersrasse 164. 53117 onn, Germany Absrac Mos of he indusrial pars are designed as
More informationProbabilistic Detection and Tracking of Motion Discontinuities
Probabilisic Deecion and Tracking of Moion Disconinuiies Michael J. Black David J. Flee Xerox Palo Alo Research Cener 3333 Coyoe Hill Road Palo Alo, CA 94304 fblack,fleeg@parc.xerox.com hp://www.parc.xerox.com/fblack,fleeg/
More informationLess Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks
Less Pessimisic Wors-Case Delay Analysis for Packe-Swiched Neworks Maias Wecksén Cenre for Research on Embedded Sysems P O Box 823 SE-31 18 Halmsad maias.wecksen@hh.se Magnus Jonsson Cenre for Research
More informationY. Tsiatouhas. VLSI Systems and Computer Architecture Lab
CMOS INEGRAED CIRCUI DESIGN ECHNIQUES Universiy of Ioannina Clocking Schemes Dep. of Compuer Science and Engineering Y. siaouhas CMOS Inegraed Circui Design echniques Overview 1. Jier Skew hroughpu Laency
More informationCitation Precision Engineering (2009), 33(2)
KURENAI : Kyoo Universiy Researc Tile Predicion and compensaion five-axis machining ceners of mach wih ki Auhor(s) Uddin, M. Sharif; Ibaraki, Soichi; Masushia, Tesuya Ciaion Precision Engineering (2009),
More informationTHE micro-lens array (MLA) based light field cameras,
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL., NO., A Generic Muli-Projecion-Cener Model and Calibraion Mehod for Ligh Field Cameras Qi hang, Chunping hang, Jinbo Ling, Qing Wang,
More information