An Analysis of Color Demosaicing in Plenoptic Cameras

Size: px
Start display at page:

Download "An Analysis of Color Demosaicing in Plenoptic Cameras"

Transcription

1 An Anlysis of Color Demosicing in Plenoptic Cmers Zhn Yu Jingyi Yu University of Delwre Newrk, DE 19716, USA Andrew Lumsdine Indin University Bloomington, IN 47405, USA Todor Georgiev Qulcomm Sn Diego, CA 92121, USA Abstrct A plenoptic cmer cptures the 4D rdince bout scene. Recent prcticl solutions mount microlens rry on top of commodity SLR to directly cquire these rys. However, they suffer from low resolution s hundreds of thousnds of views need to be cptured in single shot. In this pper, we develop simple but effective technique for improving the imge resolution of the plenoptic cmer by mneuvering the demosicing process. We first show tht the trditionl solution by demosicing ech individul microlens imge nd then blending them for view synthesis is suboptiml. In prticulr, this demosicing process often suffers from lising rtifcts, nd it dmges high frequency informtion recorded by ech microlens imge hence degrdes the imge qulity. We insted propose to demosic the synthesized view t the rendering stge. Specificlly, we first trnsform the rdince to the desired focl plne nd then pply frequency domin plenoptic resmpling. A full resolution color filtered imge is then creted by performing 2D integrl projection from the reprmeterized rdince. Finlly, we conduct demoscing to obtin the color result. We show tht our solution cn chieve visible resolution enhncement on dynmic refocusing nd depth-ssisted deep focus rendering. 1. Introduction Recent dvnces in computtionl photogrphy hve given rise to previously unexplored effects in imging. A notble exmple is the reliztion of the plenoptic (or light field ) cmer [25, 21, 2, 8], cmer tht uses microlens rry to cpture 4D rdince bout scene. The cquired rdince informtion cn be post-processed for either synthesizing dynmic depth of field effects or for recovering the 3D scene. There re numerous pplictions for this emerging cmer technology, rnging from entertinment (Lytro [22]) to depth recovery for industril nd scientific pplictions (Rytrix [26]). The plenoptic cmer, in essence, is single-shot, multiview cquisition device. In order to overcome the sptiongulr trdeoff, n ultr-high resolution sensor is commonly used. The resulting imges, however, re still t disppointingly low resolution. The Adobe light field cmer [8] cptures 20 different views of scene using 10 megpixel sensor, resulting in rendered imges with visible rtifcts t resolution of Ng[25] proposed different design with microlens rry covering 16 megpixel sensor. The dense ngulr resolution gretly suppressed rtifcts with higher refocusing power. Nevertheless, the imge resolution is low, equl to the number of microlenses in the cmer ( ). The recently relesed Lytro light field cmer uses 11 megpixel sensor for cpturing the rdince. Pictures published on Lytro s website still suffer from low resolution of 0.7 megpixel, with some visible rtifcts round thin objects nd shrp edges. In this pper, we develop simple but effective technique for improving the imge resolution of the plenoptic cmer by using more pproprite demosicing process. A plenoptic cmer, like trditionl color cmers, cptures color informtion with Color Filter Arry (CFA) msking the sensor pixels. We first show tht the trditionl solution [25, 21, 2, 8] tht demosics ech individul microlens imge nd then blends them for rendering is suboptiml. In prticulr, this demosicing process dmges high frequency informtion recorded by ech microlens imge, hence gretly degrding the chievble resolution of the finl photogrph. We insted perform demosicing on the synthesized color photogrph t ech refocusing plne Π. Specificlly, we first reprmeterize the light field to the desired focl plne nd then pply frequency-domin plenoptic resmpling. A full resolution color filtered imge is then creted by performing 2D integrl projection from the reprmeterized light field. Demosicing is performed s lst step to obtin the finl color result. Experiments on synthetic nd nturl scenes show tht our pproch genertes imges with higher resolution nd fewer rtifcts compred with clssicl plenoptic rendering. We demonstrte the qulity enhncements of our results in 1

2 Min lens Smpled imge plne Refocus plne Smpled imge plne Refocus plne Refocus plne Smpled imge plne Microlens rry Sensor Microlens Arry Sensor Min lens principle plne( plne) Min lens imge plne( plne) Microlens focl plne () Figure 1. Plenotpic Cmer Designs. () Ng. Lumsdine et l. severl pplictions such s dynmic refocusing nd depthssisted deep focus rendering. Without loss of generlity, in this pper, 2D simplifiction is used for visuliztion. However, forml mthemticl nlysis nd lgorithms re ll deling with 4D spce. 2. Bckground Integrl or light field photogrphy hs its roots in the methods introduced by Lippmnn [ 19] nd Ives [14] over 100 yers go. Recently, it hs re-emerged with the introduction of plenoptic cmers. In this section, we briefly review previous work in this field Plenoptic Cmer Design Over the lst twenty yers, numerous integrl cmers hve been built [2, 11, 13, 16]. However, it ws not until recently tht Ng [25] improved the trditionl plenoptic cmer design nd introduced new methods for computtionl refocusing. This plenoptic cmer plces the microlens rry on the imge plne Π of the min lens to seprte the converging rys onto the sensor behind it (Figure 1()). The sensor is locted t the focl plne of ech microlens so tht ech microlens is focusing t its opticl infinity (min lens principl plne). The F-numbers of the min lens nd ech microlens re mtched to void Cross-Tlk mong microlens imges. A version of this cmer is vilble from Lytro [22]. Lumsdine et l. [21] introduced nother design by focusing the microlens rry on Π nd correspondingly djusting the position of the microlens rry nd the sensor (Figure 1). In this cse ech microlens imge will hve smples with more sptil resolution nd less ngulr resolution on Π. Therefore this design is cpble of producing () (c) Figure 2. Projection of the rdince corresponding to focusing t different focl depth with the prmeteriztion of the smpled plne. higher resolution results when focusing ner the smpled imge plne. However, the lower ngulr resolution my cuse ringing rtifcts in out of focus regions of the rendered imge Refocusing s Rdince Trnsform In clssicl plenoptic or light field rendering, two prllel plne prmeteriztion is commonly used to represent rys, where ech ry is prmeterized with the coordintes of the minlens principl plne Π uv nd the minlens focl plne Π st. For simplicity, we use two dimensionl vectors s nd u to represent positions (s, t) nd (u, v) on Π st nd Π uv respectively. The irrdince I t positions cn then be computed s: I(s) = 1 R 2 r(s,u)cos 4 Φdu, (1) where R is the distnce between the Π st nd Π uv, nd cos 4 Φ is opticl vignetting term. Sme s [25], we combine cos 4 Φ into r(s,u) for further simplifiction. Eqution 1 shows tht ny photogrph produced by conventionl cmer is the result of 2D integrl projection of the ngulr dimensions of the rdince onto the sptil dimensions, where the slope of the projection relies on the focl depth of the cmer. The reprmeteriztion pproch of [13] llows us to refocus t different scene depths by trnsforming the rdince, s shown in Figure 2: I (s) = 1 R 2 r (s,u)du, (2) where r (s,u) =r(u +(s u) R,u), (3) R I is the irrdince t new focl depth, nd R is the distnce between Π uv nd the trget focl plne Π s t.

3 2.3. Imge Demosicing While significnt mount of work on plenoptic cmers hs been focusing on improving the imge resolution [27, 5, 10], demosicing remins s n understudied problem. Demosicing, in essence, converts single-ccd color representtions of one color chnnel per-pixel into full per-pixel RGB. The most populr type of CFA in current use is the Byer filter [4]. Demosicing rw Byer imge requires n underlying imge model to guide decisions for reconstructing the missing color chnnels: t every pixel only one color chnnel is smpled nd therefore we need to use its nerby smples to reconstruct the other two chnnels. Mny sequentil methods [17, 15, 1, 12, 24] hve been introduced bsed on the ssumption tht green chnnel is less lised thn the other two due to higher smpling frequency. More sophisticted methods impose locl grdients [ 20] or frequency sttistics [18, 3, 6, 23] s constrints to improve the performnce. However, by fr nerly ll demosicing techniques im to process imges cptured by commodity digitl cmers nd very little work hs been focused on developing solutions specificlly for plenoptic cmers. Existing plenoptic cmers typiclly demosic ech individul microlens imge nd tret the cptured plenoptic function s cptured RGB imge. One exception is the pper by Georgiev et l. [9] tht pplies demosicing fter plenoptic rendering to improve plenoptic superresolution. The pproch presented in [9] used strightforwrd demosicing tht did not resmple the lightfield, resulting in significnt color rtifcts in out-of-focus regions of the rendered imges. Other relted work is the sptil domin multi-frme demosicing nd super-resolution technique reported in [ 7]. However, their focus is to combine multiple low resolution imges wheres we im to mnipulte demosicing to improve refocused imges produced by plenoptic rendering. 3. Imge Demosicing in Plenoptic Cmer Before proceeding with our nlysis, we introduce our nottion. Let I(s) represent the irrdince of pixel s on the imge plne Π s t nd r i represent the RGB rdince of smple ry in microlens m i. I i is the idel opticl RGB imge t m i. In relity, since color filter is used to seprte the colors, we insted consider color filtered imge I fi. For ech color chnnel, I fi cn be viewed s n undersmpled version of I i in tht chnnel. The demosicing opertor D upsmples I fi to recover I i Clssicl Rendering The clssicl plenoptic rendering pproch first pplies demosicing to ech individul microlens imge nd then pplies integrl projection s given in Eqution 2 for focused imge formtion. Let b denote the distnce from the () (c) Figure 3. Artifcts on the cptured rdince introduced by clssicl demosicing. () Ground Truth. Rw microlens imge nd its frequency spectrum. (c) Demosiced microlens imge nd its frequency spectrum. sensor to the microlens rry nd s i denote the loction of the opticl center of m i. In the discrete cse, if we focus t Π s t with distnce to the microlens rry, we cn rewrite the irrdince of Eqution 2 s: I (s) i D(I fi ((s i s) b +s i), (4) Let ω i denote the highest frequency of I i nd ω denote the smpling frequency of I fi. In the trivil cse ( i)[2ω i ω], we cn completely recover the full frequency microlens imges I i nd hence the refocused imge I. In the generl cse when ( j)[2ω j > ω], the spectrum of I fj exhibits lising due to undersmpling s shown in Figure 3. In this cse, the demosic opertor D is used to eliminte undersmpling rtifcts. However, D generlly behves s low pss filter, indiscrimintely removing high frequencies, thereby degrding the imge shrpness of the finl refocused imge. Finlly, if I fi is severely undersmpled, demosicing (such s tht performed by Adobe Photoshop Cmer Rw) cn introduce inconsistent color interpoltion nd cuse color blending in the refocused imge s shown in Figure 3(c) (blck nd white to colorful) Resolution on the Refocus Plne Unlike the clssicl pproch, which directly pplies demosicing to the microlens imges, we first project I fi onto the focused plne Π s t nd then perform demosicing. In this section, we provide theoreticl nlysis to show tht the projected imge I f on plne Π s t hs higher smpling frequency thn ny of the microlens imges, hence performing demosicing on I f could gretly improve the imge resolution. For simplicity, we model ech microlens s pinhole cmer nd only nlyze rys pssing through ech opticl center. Also for simplicity, nd without loss of

4 B C A Refocus plne (h) Δ(h) () s it will increse the resolution between AB. We cn then compute p C = +b h nd the distnce β between A nd C on the focl plne s: m1 h () m2 Microlens rry ˊ ˊ Sensor Figure 4. () Possible resolution enhncement on the refocus plne by projecting multiple microlens imges. Plots of function Δ d (h), β(h), nd γ(k). generlity, we show only one sptil dimension s. Consider two djcent pixels p A nd p B (p A <p B ) in specific microlens m 1 tht mp to two points A nd B on the trget focl plne Π s t. Assume the distnce between p A nd p B is 1, the distnce between two djcent microlenses is d, Π s t lies t distnce to the microlens rry, the sensor lies t distnce b to the microlens rry, nd the spcing between m 1 nd m 2 is h, s shown in Figure 4(). Note tht since the pixel distnce is vnishingly smll compred with, b, nd d, we simply tret these ltter quntities s integers. Our gol is to study how mny rys (pixels) from other microlenses would fll between A nd B on Π s t. This number pproximtes the fctor of resolution enhncement compred with the clssicl demosicing followed by rendering pproch. In order to pproximte this number, we first introduce function γ which mps the index of given microlens to its smpling point between A nd B. Since ll the microlenses out of the minimum period T of γ re duplictions of smples within T, we find out T of γ nd use it s the upper bound of the resolution enhncement. Note tht for ech microlens m 2 different from m 1,we cn hve t most 1 point between AB tht mps to pixel to m 2 s the length AB is preserved in ll microlenses. Assume A nd B mp to points p A nd p B in m 2, s shown in Figure 4(). Note tht p A nd p B my not be pixels. In the first cse, p A nd p B fll exctly on the pixels position. In tht cse, no dditionl rys (pixels) from m 2 would intersect the segment AB on plne Π s t. Therefore, m 2 would not contribute to enhncing the resolution between AB. Under similitude reltionship, the conclusion holds for ny pir of djcent pixels in m 1 nd m 2, i.e., m 2 would not contribute to enhncing the resolution to m 1 s imge. In the second cse, A nd B do not coincide with pixels in m k nd there is exctly one point C between A nd B tht mps to pixel in p C in m k. We cll C super-pixel 1 (+) h β(h) =( + b h + b h ) b. (5) Note tht function β(h) is periodic function with mini- +b mum period of < 1. For ech microlens, we cn substitute its distnce h into m 1 nd compute the loction of this super-pixel. If the super-pixels in some N microlenses hve identicl β vlues, then these microlenses only contribute 1 rther N super-pixels for enhncing the resolution between AB. To finlly compute the exct resolution enhncement, recll tht in the microlens rry setting, h = kd from m 1, where k is some positive integer nd d > 1. We cn then conctente the microlens smpling function ( Dirc comb) Δ d (h) with the distnce function β(h) s: Δ d (h) β(h). To further simplify, we cn fctor d into γ(h) d(+b) so tht γ(k) =Δ(k) β (k). where β (k) hs period nd Δ(k) hs period 1. Clerly γ(k) hs minimum integer period equl to the lest common integer multiple of d(+b) nd 1. We rewrite d(+b) s n irreducible frction two integers m n. Thus, S (k) hs minimum integer period m = gcd(,d(+b)), where gcd denotes the gretest common divisor opertor (Figure 4). Note tht the number of microlenses shring field of view lso constrins the number of distinct smples between p A nd p B. Since the shift from one microlens imge to nother for ny point p on Π s t is Δ=db, we cn compute the number of microlens covering p s: n p = d Δ = f. (6) f Combining with Eqution 5 we obtin tht the resolution enhncement fctor from microlens imge m i to Π s t is equl to min(m, n p ). Since b = f f, this fctor is controlled only by nd f, nmely, the depth of the scene nd the cmer optics Our Approch Projecting smples of ech microlens to the refocus plne Π s t gives us higher resolution imge I f. However, s shown in Figure 5(), when the cptured rdince is trnsformed to Π s t for projection, s proposed by Georgiev et l. [9], the spcing of ech color component is not uniform on I f, resulting in rndom RGB ptterns (Figure 6()). This issue cretes trouble for demosicing I f. Therefore crucil step of our pproch is to resmple the rdince with the prmeteriztion of Π s t to chieve constnt spcing on ech dimension (Figure 5).

5 Opticl phse spce () Color filtered imge Figure 5. Opticl phse spce illustrtion of resmpling the cptured rdince. () Directly projecting the cptured rdince onto the refocus plne. Projecting the resmpled rdince onto the refocus plne. () Resmpling We dopt similr pproch to tht in [28], which ws originlly developed for multi-frme single chnnel imge restortion. We use frequency-domin pproch to resmple the 4D color filtered rdince. This simplifies to reconstructing higher resolution color imge by perfect registrtion with n rry of low resolution color imges tken t the sme time in 2D imge restortion cse. Here we only consider the green rys. The other two chnnels cn be computed in similr mnner. Suppose we hve q microlenses. Ech microlens cptures low resolution rdince with N s nd N u smples on ech dimension. Let r o (s,u) be the originl green rys prmeterized by Π st nd Π uv. Given the distnce from Π st to the microlens rry, the registrtion of recorded sub-rdince r i cn be computed ccurtely s offsets σ s,σ u on ech dimension respectively. Therefore, the smpled rys by microlens m i is r i (s,u) =r o (s + σ si,u + σ ui ). In frequency domin, this yields: R i (S,U)=e j2π(σsis+σuiu) R o (S,U) (7) where R o (S,U) nd R i (S,U) re CFT of r o (s,u) nd r i (s,u) respectively. Let pixels under m i cpture r i with uniform spcing (T s,t u ), nd R di (Ω) be the discrete Fourier trnsform (DFT) of the rys recorded by i th microlens t frequency Ω=(ω s,ω u ). From the lising reltionship between CFT nd DFT, R di (Ω) stisfies the following eqution: R di (Ω)=K m s (R i ( ω s + m s f s, N m s T s u where K = 1 T st u, nd f s, f u re smpling frequencies on ech dimension of ll micro imges. All opertors rnge from to nd m s,m u re integers. Substituting R i from Eqution 7 to Eqution 8 yields: V Ω = M Ω R Ω, (9) where V Ω is q dimensionl column vector with i th element equl to R di (Ω); Let B S,B U be periodic boundries of R o such tht R o (S,U) =0for ny condition of Figure 6. Rendered results using () the pproch proposed by Georgiev et l. [9] nd our pproch. The out of focus foreground objects exhibit RGB ptterns in () due to non-uniform spcing of color components fter integrl projection. S >B S f s, U >B U f u stisfies; R Ω is 4B S B U dimensionl column vector with the k th element R o ( ωs N st s + ω γ s f s, u N ut u + γ u f u ), nd γ s = kmod(2b S ) B S, γ u = k 2B S B U, nd M Ω is q 4B S B U mtrix with (i, k) th element 1 exp{j2π[σ si ( ω s + γ s f s )+σ ui ( + γ u f u )]}. T s T u N s T s N u T u Since we know the loctions of Π st nd of ech microlens m i, σ si nd σ ui cn be ccurtely computed. R di (Ω) cn be cquired by performing the 4D DFT on the smpled rdince by ech microlens. Therefore Eqution 9 is solvble for unknown R Ω, which contins 2B S nd 2B U frequency smples of R o (Ω) on ech dimension respectively. Combining ll R Ω provides n estimte of R o with 2N s B S, 2N u B U smples rnging from ( B S f s, B U f u ) 1 1 to (B S f s nd B U f u ) with spcing ( N st s, N ut u ) on ech dimension respectively. We then use it to estimte r o (s,u) ( Ts 2B S, from (0, 0) to ((N s 1)T s, (N u 1)T u ), with spcing T u 2B U ). Hence the resolution of the resmpled rdince is incresed by 2B S, 2B U on s nd u compred with tht of ech originl microlens imge. An optimized process of solving for R Ω is presented in Appendix A. ω u + m u f u )), (8) N u T u Integrl Projection nd Demosicing As shown in Figure 5, with the previous resmpling process, we cn chieve n evenly-smpled rdince on the trget focl plne Π s t. The integrl projection is immeditely pplied to get I f. An exmple of the green chnnel of I f is shown by Figure 7(c). However, due to the higher smpling rte of the green chnnel, demosicing process is still needed for red nd blue chnnels of I f to render full RGB imge with the resolution of the green chnnel. ω u

6 Cptured Rdince Rendered Imge Resmpling Integrl Projection Demosicing () (c) Figure 7. From ()-(c), we compre the ground truth, the result using clssicl pproch, nd the result using our pproch. The frequency spectrums re shown in the bottom row. Trditionl sequentil demosicing frmeworks first recover full resolution green chnnel nd subsequently use tht green chnnel to fcilitte the recovery of red nd blue chnnels. In our cse, the full resolution green chnnel is lredy known fter the integrl projection. Bsed on this green chnnel, the red nd blue chnnels re reconstructed by pplying the stte-of-the-rt nisotropic dptive filtering [18] in the frequency domin. Figure 6 shows tht by employing the resmpling scheme, the demosicing cn be performed on the integrl projection result nd the finl imge is free of RGB ptterns. Suppose the resmpled rdince hs highest frequency ω. The most common sitution is ( i)[ω > 2ω i >ω]. In this cse the new demosicing process preserves more high frequency informtion of the rdince, hence producing higher resolution imge (Figure 7). In other cses such s ( i)[ω >ω>2ω i ] (very smooth regions such s plces with constnt color), both processes recover the full rdince nd the resolution of the resultnt imges re the sme. If ( i)[2ω i >ω >ω] (texture rich regions or shrp edges), the finl imges re both over-smoothed. As illustrted by column () nd of Figure 7, with the clssicl pproch, significnt losses in high frequency components occur in texture-rich regions nd the rendered result suffers from over-smoothing compred with the ground truth. Column (c) shows our method preserves much more high frequency informtion of the ground truth, therefore cpble of producing higher resolution imge. 4. Implementtion nd Applictions Figure 8 shows the pipeline for implementing our proposed plenoptic demosicing nd rendering scheme. We first resmple the rdince, then integrl project it onto the sptil domin, nd finlly demosic the color filtered result. Our experimentl dt is cptured by plenoptic cmer Figure 8. Our plenoptic demosicing nd rending pipeline. similr to tht described in [21]. We use 39-megpixel sensor with pixel size 6.8 μm. The min lens is mounted on the cmer with 13mm extension tube, which provides the needed spcing to estblish n pproprite distnce from the min lens focl plne to the microlens rry. The focl length of the min lens nd of ech microlens re 80mm nd 1500μm respectively. The microlens pitch is 500 μm, which mkes it work with the F-number of the min lens. The distnces between microlenses re 74 pixels Enhnced Dynmic Refocusing We first test our resolution enhncement performnce by synthesizing photogrphs with shllow depth of field. Figure 9 shows the comprison of our pproch nd clssicl rendering () on resolution chrt scene. The bottom rows of () nd compre the demosiced nd rw microlens imges of three highlighted regions. Note tht severe lising effects pper on ech rw microlens imge nd the structure of the resolution chrt is not visible. If demosicing is performed directly on ech microlens imge, colorful rtifcts re introduced, dmging the high frequency informtion nd over-smoothing microlens imges. As result, these regions could not be successfully reconstructed in the finl imge, s shown in (). On the contrry, our pproch utilizes ech lised microlens imge to resmple high resolution rdince before demosicing is performed. Thus preserving lrger portion of high frequency informtion nd producing higher resolution imge, s shown in. Also note tht low frequency regions such s the left bottom prt of the chrt re eqully cler in both cses, nd very high frequency regions such s the bottom of the red highlighted region re both blurry. The top row of Figure 10 shows n outdoor scene. Apprently, the numbers on the licence plte in re not visible but redble in (c). Another visible rtifct of the clssicl frmework here is tht smll regions of speculr highlight pper less shiny due to over-smoothing on ech microlens imge. In nother rel scene shown in the second row of Figure 10. In column, the first line of chrcters re brely

7 () Figure 9. Comprison of rendered imge employing clssicl pproch nd our pproch. () Clssicl pproch. Top row: Rendered imge. Bottom Row: Demosiced microlens imge. Our pproch. Top row: Rendered imge. Bottom row: Rw microlens imge. redble using the clssicl rendering. Nevertheless, they re clerly rendered with our pproch. Note tht colorful rtifcts introduced by demosicing ech microlens imge remin on positions of nf nd ffi in nd ringing rtifcts lso pper round the edges of the chrcters. Furthermore, the lower chrcters re totlly blurry in while still redble in (c) Extended Depth of Field Another populr ppliction of our method is the extended depth of field photogrphy. Our pproch precomputes the depth of the smpled rdince nd renders ech pixel by choosing its own depth mong smples utomticlly. We present our depth estimtion lgorithm designed for the cptured rdince in Appendix B. The third row of Figure 10 shows our extended depth of field ppliction on the sme dt s the second row. Note tht the originl out of focus regions such s the fce nd hir of the person re brought into focus, s if the photogrph is cptured by pinhole perture cmer. However, with our frmework, shown in (c), the rendered result preserves more high frequency informtion thn the clssicl pproch shown in, therefore produces much more detiled look. 5. Discussions nd Limittions We hve presented well-principled plenoptic demosicing nd rendering frmework, which preserves more high frequency informtion from the cptured rdince nd generte less lising rtifcts compred with the clssicl pproch. Our frmework does not pply demosicing directly to the imge cptured by the plenoptic cmer. Insted, with resmpling scheme which helps chieve constnt spcing on ech dimension, it dynmiclly performs demosicing fter integrl projection. Extensive experiments show tht this frmework could produce photogrphs with commercilly cceptble resolution. As nlyzed in Section 3.2, the resolution enhncement of ech plne in the scene chieved by our lgorithm vries ccording to the depth of the plne. This could cuse unplesnt results if the resolution enhncements re low on plnes of interests. In the extreme cse, the resolution could be s low s the clssicl frmework. Like clssicl plenoptic photogrphy, our pproch ssumes the cptured rdince re thin rys in order to reconstruct refocused imge. This is lso our ssumption for theoreticl resolution enhncement nlysis. 6. Acknowledgments Z. Yu nd J. Yu were supported by the Ntionl Science Foundtion under grnts IIS-CAREER nd IIS-RI , nd by the Air Force Office of Science Reserch under the YIP Awrd. Imgery used to crete the bottom two rows of Figure 10 re from WSCG 2010 ( courtesy of Vclv Scl. References [1] J. Adms nd J. H. Jr. Adptive color pln interpoltion in single sensor color electronic cmer, ptent us , [2] E. Adelson nd J. Wng. Single lens stereo with plenoptic cmer. IEEE Trnsctions on Pttern Anlysis nd Mchine Intelligence, 14:99 106, , 2 [3] D. Alleysson, S. Susstrunk, nd J. Herult. Liner demosicing inspired by the humn visul system. IEEE Trnsctions on Imge Processing, 14(4): , pr [4] B. E. Byer. Color imging rry. US Ptent 3,971,065, [5] T. E. Bishop, S. Znetti, nd P. Fvro. Light field superresolution. In IEEE ICCP, [6] E. Dubois. Filter design for dptive frequency-domin byer demosicking. In IEEE Interntionl Conference on Imge Processing, oct [7] S. Frsiu, M. Eld, nd P. Milnfr. Multifrme demosicing nd super-resolution of color imges. IEEE Trnsctions on Imge Processing, 15(1), jn [8] T. Georgeiv, K. C. Zheng, B. Curless, D. Slesin, S. Nyr, nd C. Intwl. Sptio-ngulr resolution trdeoff in integrl photogrphy. In Proceedings of Eurogrphics Symposium on Rendering, pges , [9] T. Georgiev, G. Chunev, nd A. Lumsdine. Superresolution with the focused plenoptic cmer. In Proc. SPIE 7873, doi: / , 4, 5 [10] T. Georgiev nd A. Lumsdine. Focused plenoptic cmer nd rendering. Journl of Electronic Imging, 19, [11] S. Gortler, R. Grzeszczuk, R. Szeliski, nd M. Cohen. The lumigrph. In Proceedings of ACM SIGGRAPH, pges 43 54,

8 () (c) Figure 10. Comprison of three results with clssicl pproch nd our pproch. First nd second row show shllow depth of field rendering. The third row shows extended depth of field rendering. () Our rendered result. nd (c) re enlrged highlighted regions in () with clssicl pproch nd our pproch respectively. [12] R. Hibbrd. Apprtus nd method for dptively interpolting full color imge utilizing luminnce grdients, ptent us , [13] A. Isksen, L. McMilln, nd S. Gortler. Dynmiclly reprmeterized light fields. In Proceedings of ACM SIGGRAPH, pges , [14] F. Ives. Prllx stereogrm nd process of mking sme, ptent us , [15] R. Kkrl nd Z. Bhrv. Adptive demosicing with the principl vector method. IEEE Trnsctions on Consumer Electronics, 48(4): , nov [16] M. Levoy nd P. Hnrhn. Light field rendering. In Proceedings of ACM SIGGRAPH, pges 31 42, [17] X. Li nd M. Orchrd. New edge-directed interpoltion. IEEE Trnsctions on Imge Processing, 10: , [18] N. Lin, L. Chng, Y. Tn, nd V. Zgorodnov. Adptive filtering for color filter rry demosicking. IEEE Trnsctions on Imge Processing, 16(10): , oct , 6 [19] G. Lippmnn. L photogrphie intgrle. Comptes-Rendus, Acdmie des Sciences, 146: , [20] W. Lu nd Y. Tn. Color filter rry demosicking: new method nd performnce mesures. IEEE T-IP, 12: , oct [21] A. Lumsdine nd T. Georgiev. The focused plenoptic cmer. In In Proc. IEEE ICCP, , 2, 6 [22] Lytro. 1, 2 [23] D. Menon nd G. Clvgno. Demosicing bsed on wvelet nlysis of the luminnce component. In IEEE Interntionl Conference on Imge Processing, volume 2, pges , [24] D. Muresn nd T. Prks. Demosicing using optiml recovery. IEEE Trnsctions on Imge Processing, 14(2), feb [25] R. Ng, M. Levoy, M. Brdif, G. Duvl, M. Horowitz, nd P. Hnrhn. Light field photogrphy with hnd-held plenoptic cmer. Stnford University Computer Science Tech Report, 2( ): , 2 [26] Rytrix. 1 [27] J. Stewrt, J. Yu, S. J. Gortler, nd L. McMilln. A new reconstruction filter for undersmpled light fields. EGSR 03, pges , [28] R. Tsi nd T. Hung. Multi-frme imge restortion nd registrtion. Advnces in Computer Vision nd Imge Processing, 1,

9 Appendices A. Solving R Ω If we seprte M Ω into components relted nd unrelted to Ω, it cn be further decomposed into D Ω M v, where the D Ω is digonl mtrix with i th digonl element equls to: 1 exp{j2π[σ si ( ω s ω u B S f s )+σ tu ( T s T u N s T s nd M v is p 4B S B U mtrix with [M v ] ik equls to: exp{j2π[σ si kmod(2b S )+σ ui k ]}. B S therefore we cn rewrite Eqution 9 s: M v R Ω = D 1 Ω V Ω. (10) Since M v is independent of Ω, therefore we only need to solve it once for ll smpled frequencies. The rows of M v re linerly independent if the shifts on dimensions stisfies σ si σ sj + n s T s, σ ui σ uj + n u T u, where i j nd n s,n u re some integers. If q 4B S B U, Eqution 10 is consistent. Otherwise, M v is singulr nd we obtin the minimum-norm, lest-squre-error estimte of R Ω by first computing the generlized inverse of M v. This yields: R Ω =(M T v M v ) 1 (M T v M v )D 1 Ω V Ω. (11) Note tht for ech micro imge, the smpling frequency on t, v dimensions out ofs,u is doubled for the green chnnel, therefore the resmpled rdince hs two times higher resolution on t, v dimensions of the green chnnel. B. Depth Estimtion on the Rdince Recll tht ech microlens imge cptures prt of the scene from different view point. Therefore, multi-view depth estimtion is fesible to retrieve the depth informtion from the entire cptured rdince. Out lgorithm itertively computes the depth of the pixel bsed on Grph Cuts. Given certin depth, we utilize the vrince of the corresponding pixels mong microlens imges s the dt term. Since our frmework does not perform demoscing on the rw dt. Therefore, when computing the dt term for ech pixel, only the pixels with the sme color chnnel in different microlens imges re used. One common problem with depth estimtion is tht even though the correct depth is ssigned to one pixel, the dt term could still be lrge due to occlusion. This problem is especilly severe in the rdince cse since mny views re involved in the computtion. To resolve the this issue, grdully incresing confidence threshold is given in ech itertion, so tht the pixels with lower depth will converge first nd the pixels with lrger depth my still generte dt terms bigger thn the threshold due to occlusion. Once the depth of one pixel is decided, it will not be involved in the computtion nymore. Thus, the pixels with lrge depth will void these low depth pixels nd produce low dt term if ssigned the correct depth in the lter itertions. The complete lgorithm is given in Algorithm 1. B U f u )]}, Algorithm 1 Clculte depth of ech pixel d i N u T u Require: Cptured rdince r for j =1 M do for i =1 N do if p i hs been ssigned with ny depth vlue then Continue; end if Compute dt term e d of pixel p i ; if e d >k j then {Dt term is bigger thn current threshold} Continue; else Add p i to grph end if end for Perform grph cuts; Assign depths to pixels in the grph; end for

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course L. Yroslvsky. Fundmentls of Digitl Imge Processing. Course 0555.330 Lecture. Imge enhncement.. Imge enhncement s n imge processing tsk. Clssifiction of imge enhncement methods Imge enhncement is processing

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

Digital approximation to extended depth of field in no telecentric imaging systems

Digital approximation to extended depth of field in no telecentric imaging systems Journl of Physics: Conference Series Digitl pproximtion to extended depth of field in no telecentric imging systems To cite this rticle: J E Meneses nd C R Contrers 0 J Phys: Conf Ser 74 0040 View the

More information

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1. Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution

More information

A Fast Imaging Algorithm for Near Field SAR

A Fast Imaging Algorithm for Near Field SAR Journl of Computing nd Electronic Informtion Mngement ISSN: 2413-1660 A Fst Imging Algorithm for Ner Field SAR Guoping Chen, Lin Zhng, * College of Optoelectronic Engineering, Chongqing University of Posts

More information

II. THE ALGORITHM. A. Depth Map Processing

II. THE ALGORITHM. A. Depth Map Processing Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A

More information

USING HOUGH TRANSFORM IN LINE EXTRACTION

USING HOUGH TRANSFORM IN LINE EXTRACTION Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,

More information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

Parallel Square and Cube Computations

Parallel Square and Cube Computations Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu

More information

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li 2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min

More information

9 Graph Cutting Procedures

9 Graph Cutting Procedures 9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric

More information

What are suffix trees?

What are suffix trees? Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl

More information

IMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho

IMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho IMAGE QUALITY OPTIMIZATIO BASED O WAVELET FILTER DESIG AD WAVELET DECOMPOSITIO I JPEG2000 Do Qun nd Yo-Sung Ho School of Informtion & Mechtronics Gwngju Institute of Science nd Technology (GIST) 26 Cheomdn-gwgiro

More information

Computing offsets of freeform curves using quadratic trigonometric splines

Computing offsets of freeform curves using quadratic trigonometric splines Computing offsets of freeform curves using qudrtic trigonometric splines JIULONG GU, JAE-DEUK YUN, YOONG-HO JUNG*, TAE-GYEONG KIM,JEONG-WOON LEE, BONG-JUN KIM School of Mechnicl Engineering Pusn Ntionl

More information

Image interpolation. A reinterpretation of low-pass filtering. Image Interpolation

Image interpolation. A reinterpretation of low-pass filtering. Image Interpolation Imge interpoltion A reinterprettion of low-pss filtering Imge Interpoltion Introduction Wht is imge interpoltion? (D-A conversion) Wh do we need it? Interpoltion Techniques 1D zero-order, first-order,

More information

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION Supplementry Figure y (m) x (m) prllel perpendiculr Distnce (m) Bird Stndrd devition for distnce (m) c 6 prllel perpendiculr 4 doi:.8/nture99 SUPPLEMENTARY FIGURE Confirmtion tht movement within the flock

More information

Dynamic Tone Mapping with Head-Mounted Displays

Dynamic Tone Mapping with Head-Mounted Displays Dynmic Tone Mpping with Hed-Mounted Displys Mtt Yu Deprtment of Electricl Engineering, Stnford University Abstrct The rel world consists of mny scenes which contin high dynmic rnge. While modern cmers

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES GENEATING OTHOIMAGES FO CLOSE-ANGE OBJECTS BY AUTOMATICALLY DETECTING BEAKLINES Efstrtios Stylinidis 1, Lzros Sechidis 1, Petros Ptis 1, Spiros Sptls 2 Aristotle University of Thessloniki 1 Deprtment of

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es

More information

Math 142, Exam 1 Information.

Math 142, Exam 1 Information. Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

MATH 25 CLASS 5 NOTES, SEP

MATH 25 CLASS 5 NOTES, SEP MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid

More information

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System Modeling nd Simultion of Short Rnge 3D Tringultion-Bsed Lser Scnning System Theodor Borngiu Anmri Dogr Alexndru Dumitrche April 14, 2008 Abstrct In this pper, simultion environment for short rnge 3D lser

More information

An Integrated Simulation System for Human Factors Study

An Integrated Simulation System for Human Factors Study An Integrted Simultion System for Humn Fctors Study Ying Wng, Wei Zhng Deprtment of Industril Engineering, Tsinghu University, Beijing 100084, Chin Foud Bennis, Dmien Chblt IRCCyN, Ecole Centrle de Nntes,

More information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve. Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the

More information

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl

More information

Geometric transformations

Geometric transformations Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22

More information

Illumination and Shading

Illumination and Shading Illumintion nd hding In order to produce relistic imges, we must simulte the ppernce of surfces under vrious lighting conditions. Illumintion models: given the illumintion incident t point on surfce, wht

More information

MTH 146 Conics Supplement

MTH 146 Conics Supplement 105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points

More information

Integration. September 28, 2017

Integration. September 28, 2017 Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my

More information

COMP 423 lecture 11 Jan. 28, 2008

COMP 423 lecture 11 Jan. 28, 2008 COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring

More information

INTRODUCTION TO SIMPLICIAL COMPLEXES

INTRODUCTION TO SIMPLICIAL COMPLEXES INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min

More information

Slides for Data Mining by I. H. Witten and E. Frank

Slides for Data Mining by I. H. Witten and E. Frank Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully

More information

Spectral Analysis of MCDF Operations in Image Processing

Spectral Analysis of MCDF Operations in Image Processing Spectrl Anlysis of MCDF Opertions in Imge Processing ZHIQIANG MA 1,2 WANWU GUO 3 1 School of Computer Science, Northest Norml University Chngchun, Jilin, Chin 2 Deprtment of Computer Science, JilinUniversity

More information

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016)

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016) \ Interntionl Conference on Mechnics, Mterils nd tructurl Engineering (ICMME 2016) Reserch on the Method to Clibrte tructure Prmeters of Line tructured Light Vision ensor Mingng Niu1,, Kngnin Zho1, b,

More information

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,

More information

such that the S i cover S, or equivalently S

such that the S i cover S, or equivalently S MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i

More information

Chapter 2 Sensitivity Analysis: Differential Calculus of Models

Chapter 2 Sensitivity Analysis: Differential Calculus of Models Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls

More information

Fig.25: the Role of LEX

Fig.25: the Role of LEX The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing

More information

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants A Heuristic Approch for Discovering Reference Models by Mining Process Model Vrints Chen Li 1, Mnfred Reichert 2, nd Andres Wombcher 3 1 Informtion System Group, University of Twente, The Netherlnds lic@cs.utwente.nl

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

Power Transmittance of a Laterally Shifted Gaussian Beam through a Circular Aperture

Power Transmittance of a Laterally Shifted Gaussian Beam through a Circular Aperture Poer Trnsmittnce of Lterlly Shifted Gussin Bem through Circulr Aperture Triq Shmim Khj 1 nd Syed Azer Rez 1 1. Deprtment of Electricl Engineering, Lhore University of Mngement Sciences, DHA, Lhore 5479,

More information

A COLOUR CORRECTION PREPROCESSING METHOD FOR MULTIVIEW VIDEO CODING

A COLOUR CORRECTION PREPROCESSING METHOD FOR MULTIVIEW VIDEO CODING A COLOR CORRECTO REROCESSG METHOD FOR MLTEW DEO CODG Colin Doutre nd nos siopoulos Deprtment of Electricl nd Computer Engineering, niversity of British Columbi 66 Min Mll, 6T Z4, ncouver, BC, Cnd emil:

More information

Pointwise convergence need not behave well with respect to standard properties such as continuity.

Pointwise convergence need not behave well with respect to standard properties such as continuity. Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples

More information

Text mining: bag of words representation and beyond it

Text mining: bag of words representation and beyond it Text mining: bg of words representtion nd beyond it Jsmink Dobš Fculty of Orgniztion nd Informtics University of Zgreb 1 Outline Definition of text mining Vector spce model or Bg of words representtion

More information

Integration. October 25, 2016

Integration. October 25, 2016 Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve

More information

Topics in Analytic Geometry

Topics in Analytic Geometry Nme Chpter 10 Topics in Anltic Geometr Section 10.1 Lines Objective: In this lesson ou lerned how to find the inclintion of line, the ngle between two lines, nd the distnce between point nd line. Importnt

More information

AVolumePreservingMapfromCubetoOctahedron

AVolumePreservingMapfromCubetoOctahedron Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online

More information

CHAPTER 5 Spline Approximation of Functions and Data

CHAPTER 5 Spline Approximation of Functions and Data CHAPTER 5 Spline Approximtion of Functions nd Dt This chpter introduces number of methods for obtining spline pproximtions to given functions, or more precisely, to dt obtined by smpling function. In Section

More information

CHANGING STRATA AND SELECTION PROBABILITIES* Leslie Kish, The University of Michigan. Summary

CHANGING STRATA AND SELECTION PROBABILITIES* Leslie Kish, The University of Michigan. Summary 124 CHANGING STRATA AND SELECTION PROBABILITIES* Leslie Kish, The University of Michign Summry Survey smples re often bsed on primry units selected from initil strt with probbilities proportionl to initil

More information

Digital Design. Chapter 6: Optimizations and Tradeoffs

Digital Design. Chapter 6: Optimizations and Tradeoffs Digitl Design Chpter 6: Optimiztions nd Trdeoffs Slides to ccompny the tetbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by Frnk Vhid, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com

More information

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin

More information

HW Stereotactic Targeting

HW Stereotactic Targeting HW Stereotctic Trgeting We re bout to perform stereotctic rdiosurgery with the Gmm Knife under CT guidnce. We instrument the ptient with bse ring nd for CT scnning we ttch fiducil cge (FC). Above: bse

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula: 5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

A TRIANGULAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Attia Mousa 1 and Eng. Salah M. Tayeh 2

A TRIANGULAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Attia Mousa 1 and Eng. Salah M. Tayeh 2 A TRIANGLAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Atti Mous nd Eng. Slh M. Teh ABSTRACT In the present pper the strin-bsed pproch is pplied to develop new tringulr finite element

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

Step-Voltage Regulator Model Test System

Step-Voltage Regulator Model Test System IEEE PES GENERAL MEETING, JULY 5 Step-Voltge Regultor Model Test System Md Rejwnur Rshid Mojumdr, Pblo Arboley, Senior Member, IEEE nd Cristin González-Morán, Member, IEEE Abstrct In this pper, 4-node

More information

Dynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012

Dynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012 Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.

More information

Paracatadioptric Camera Calibration Using Lines

Paracatadioptric Camera Calibration Using Lines Prctdioptric Cmer Clibrtion Using Lines Joo P Brreto, Helder Arujo Institute of Systems nd Robotics - Dept of Electricl nd Computer Engineering University of Coimbr, Coimbr, Portugl Abstrct Prctdioptric

More information

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization An Efficient Divide nd Conquer Algorithm for Exct Hzrd Free Logic Minimiztion J.W.J.M. Rutten, M.R.C.M. Berkelr, C.A.J. vn Eijk, M.A.J. Kolsteren Eindhoven University of Technology Informtion nd Communiction

More information

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed

More information

12-B FRACTIONS AND DECIMALS

12-B FRACTIONS AND DECIMALS -B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn

More information

Memory-Optimized Software Synthesis from Dataflow Program Graphs withlargesizedatasamples

Memory-Optimized Software Synthesis from Dataflow Program Graphs withlargesizedatasamples EURSIP Journl on pplied Signl Processing 2003:6, 54 529 c 2003 Hindwi Publishing orportion Memory-Optimized Softwre Synthesis from tflow Progrm Grphs withlrgesizetsmples Hyunok Oh The School of Electricl

More information

Approximation by NURBS with free knots

Approximation by NURBS with free knots pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde

More information

Misrepresentation of Preferences

Misrepresentation of Preferences Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from

More information

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS S. H. Jongsm E. T. A. vn de Weide H. W. M. Hoeijmkers Overset symposium 10-18-2012 Deprtment of mechnicl engineering

More information

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl

More information

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs. Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online

More information

Spring 2018 Midterm Exam 1 March 1, You may not use any books, notes, or electronic devices during this exam.

Spring 2018 Midterm Exam 1 March 1, You may not use any books, notes, or electronic devices during this exam. 15-112 Spring 2018 Midterm Exm 1 Mrch 1, 2018 Nme: Andrew ID: Recittion Section: You my not use ny books, notes, or electronic devices during this exm. You my not sk questions bout the exm except for lnguge

More information

Presentation Martin Randers

Presentation Martin Randers Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes

More information

Progressive Transmission of Textured Graphic Model Over IP Networks

Progressive Transmission of Textured Graphic Model Over IP Networks Progressive Trnsmission of Textured Grphic Model Over IP Networks. Reserch Tem Project Leder: Other Fculty: Post Doc(s): Grdute Students: Undergrdute Students: Industril Prtner(s): Prof. C.-C. Jy Kuo,

More information

Math 35 Review Sheet, Spring 2014

Math 35 Review Sheet, Spring 2014 Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided

More information

LETKF compared to 4DVAR for assimilation of surface pressure observations in IFS

LETKF compared to 4DVAR for assimilation of surface pressure observations in IFS LETKF compred to 4DVAR for ssimiltion of surfce pressure oservtions in IFS Pu Escrià, Mssimo Bonvit, Mts Hmrud, Lrs Isksen nd Pul Poli Interntionl Conference on Ensemle Methods in Geophysicl Sciences Toulouse,

More information

A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS

A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS Ji-Eun Roh (), Te-Eog Lee (b) (),(b) Deprtment of Industril nd Systems Engineering, Kore Advnced Institute

More information

Sketching Reaction-Diffusion Texture

Sketching Reaction-Diffusion Texture EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006), pp. 1 8 Sketching Rection-Diffusion Texture Pper ID 100 Abstrct In this work, we present n interctive interfce for sketching synthesized

More information

Available at ISSN: Vol. 4, Issue 2 (December 2009) pp (Previously Vol. 4, No.

Available at   ISSN: Vol. 4, Issue 2 (December 2009) pp (Previously Vol. 4, No. Avilble t http://pvmu.edu.edu/pges/398.sp ISSN: 93-9466 Vol. 4, Issue December 009 pp. 434 444 Previously Vol. 4, No. Applictions nd Applied Mthemtics: An Interntionl Journl AAM On -ry Subdivision for

More information

Tool Vendor Perspectives SysML Thus Far

Tool Vendor Perspectives SysML Thus Far Frontiers 2008 Pnel Georgi Tec, 05-13-08 Tool Vendor Perspectives SysML Thus Fr Hns-Peter Hoffmnn, Ph.D Chief Systems Methodologist Telelogic, Systems & Softwre Modeling Business Unit Peter.Hoffmnn@telelogic.com

More information

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

MATH 2530: WORKSHEET 7. x 2 y dz dy dx = MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl

More information

Accelerating 3D convolution using streaming architectures on FPGAs

Accelerating 3D convolution using streaming architectures on FPGAs Accelerting 3D convolution using streming rchitectures on FPGAs Hohun Fu, Robert G. Clpp, Oskr Mencer, nd Oliver Pell ABSTRACT We investigte FPGA rchitectures for ccelerting pplictions whose dominnt cost

More information

Agilent Mass Hunter Software

Agilent Mass Hunter Software Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss

More information

LECT-10, S-1 FP2P08, Javed I.

LECT-10, S-1 FP2P08, Javed I. A Course on Foundtions of Peer-to-Peer Systems & Applictions LECT-10, S-1 CS /799 Foundtion of Peer-to-Peer Applictions & Systems Kent Stte University Dept. of Computer Science www.cs.kent.edu/~jved/clss-p2p08

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In the last lecture, we discussed how valid tokens may be specified by regular expressions. LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.

More information

A Transportation Problem Analysed by a New Ranking Method

A Transportation Problem Analysed by a New Ranking Method (IJIRSE) Interntionl Journl of Innovtive Reserch in Science & Engineering ISSN (Online) 7-07 A Trnsporttion Problem Anlysed by New Rnking Method Dr. A. Shy Sudh P. Chinthiy Associte Professor PG Scholr

More information

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe CSCI 0 fel Ferreir d Silv rfsilv@isi.edu Slides dpted from: Mrk edekopp nd Dvid Kempe LOG STUCTUED MEGE TEES Series Summtion eview Let n = + + + + k $ = #%& #. Wht is n? n = k+ - Wht is log () + log ()

More information

Paracatadioptric Camera Calibration Using Lines

Paracatadioptric Camera Calibration Using Lines Prctdioptric Cmer Clibrtion Using Lines Joo P Brreto, Helder Arujo Institute of Systems nd Robotics - Dept of Electricl nd Computer Engineering University of Coimbr, 33 Coimbr, Portugl Abstrct Prctdioptric

More information

HOPC: A NOVEL SIMILARITY METRIC BASED ON GEOMETRIC STRUCTURAL PROPERTIES FOR MULTI-MODAL REMOTE SENSING IMAGE MATCHING

HOPC: A NOVEL SIMILARITY METRIC BASED ON GEOMETRIC STRUCTURAL PROPERTIES FOR MULTI-MODAL REMOTE SENSING IMAGE MATCHING ISPRS Annls of the Photogrmmetry, Remote Sensing nd Sptil Informtion Sciences, Volume III-1, 216 XXIII ISPRS Congress, 12 19 July 216, Prgue, Czech Republic : A NOVEL SILARITY METRIC BASED ON GEOMETRIC

More information

Alignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey

Alignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey Alignment of Long Sequences BMI/CS 776 www.biostt.wisc.edu/bmi776/ Spring 2012 Colin Dewey cdewey@biostt.wisc.edu Gols for Lecture the key concepts to understnd re the following how lrge-scle lignment

More information

A Study on Eye Gaze Estimation Method Based on Cornea Model of Human Eye

A Study on Eye Gaze Estimation Method Based on Cornea Model of Human Eye A Study on Eye Gze Estimtion Method Bsed on Corne Model of Humn Eye Eui Chul Lee 1 nd Kng Ryoung Prk 2 1 Dept. of Computer Science, Sngmyung University, 7 Hongji-dong, Jongro-Ku, Seoul, Republic of Kore

More information

Solutions to Math 41 Final Exam December 12, 2011

Solutions to Math 41 Final Exam December 12, 2011 Solutions to Mth Finl Em December,. ( points) Find ech of the following its, with justifiction. If there is n infinite it, then eplin whether it is or. ( ) / ln() () (5 points) First we compute the it:

More information

COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION

COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION Hee Ju Prk OLOUR IMAGE MATHING FOR DTM GENERATION AND HOUSE EXTRATION Hee Ju PARK, Petr ZINMMERMANN * Swiss Federl Institute of Technology, Zuric Switzerlnd Institute for Geodesy nd Photogrmmetry heeju@ns.shingu-c.c.kr

More information