Fast Panorama Stitching for High-Quality Panoramic Images on Mobile Phones
|
|
- Nigel Holland
- 6 years ago
- Views:
Transcription
1 IEEE Trasatio o Cosumer Eletrois, vol. 56, o., 010IEEE Trasatio o Cosumer Eletrois, vol. 56, o., 010 Fast Paorama Stithig for High-Quality Paorami Images o Mobile Phoes Yige Xiog ad Kari Pulli, Member, IEEE Abstrat This paper addresses the problem of reatig high-resolutio ad high-quality paorami images from log image sequees with very differet olors ad lumiae i soure images. A fast stithig approah is proposed for ombiig a set of soure images ito a paorami image usig little memory, ad implemeted o mobile phoes. I this approah, olor orretio redues olor differees of soure images ad balaes olors ad lumiae i the whole image sequee, dyami programmig fids optimal seams i overlappig areas betwee adjaet images ad merges them together, ad image bledig further smoothes olor trasitios ad hides visible seams ad stithig artifats. A sequetial paorama stithig proedure ostruts paorami images. The advatages ilude fast proessig speed usig dyami programmig for optimal seam fidig, reduig memory eeds by usig the sequetial paorama stithig, ad improved quality of image labelig ad bledig due to the use of olor orretio. The approah has bee tested with differet image sequees ad it works well o both idoor ad outdoor sees1. Idex Terms Mobile paorama, image stithig, fast labelig, image bledig. I. INTRODUCTION A paorami image has a wide field of view, muh wider tha is available o ormal ameras suh as those i mobile phoes. By stithig together a sequee of overlappig ormal images, we a reate a paorami image. Image stithig is a very importat step i reatig paoramas. A simple pastig of overlappig images ito the fial paorama produes visible seams due to hages of see illumiatio ad amera resposes, or spatial aligmet errors. The task of image stithig is to fid optimal seams i overlappig areas of soure images, merge them alog the seams, ad miimize mergig artifats. I this paper, we are reatig high-resolutio ad high-quality paorami images o mobile phoes, so that a user a apture a image sequee of a wide rage of sees with a amera phoe ad see a paorami image reated immediately o the phoe. A. Bakgroud Mobile phoes are ot oly effiiet ommuiatio tools, but also apable omputatioal devies equipped with highresolutio digital ameras, high-quality olor displays, ad GPU hardware. Appliatios suh as mobile augmeted 1 Yige Xiog ad Kari Pulli are with Nokia Researh Ceter, Palo Alto, CA 94304, USA ( yige.xiog@okia.om; kari.pulli@okia.om). reality, mobile loal searh, ad mobile image mathig ad reogitio used to oly work o desktop omputers, but a ow ru o mobile phoes. Here we are buildig paorama appliatios o these devies. A paorama ostrutio proess requires a lot of omputatio ad memory. Mobile phoes oly have limited resoures. It is eessary to develop effiiet stithig methods to fit mobile appliatios. B. Related Work There are two mai ategories of urret image stithig approahes: trasitio smoothig ad optimal seam fidig. Trasitio smoothig approahes redue olor differees betwee soure images to make seams ivisible ad remove stithig artifats. Alpha bledig [1] is a widely used simple ad fast trasitio smoothig approah, but it aot avoid ghostig problems aused by objet motio ad small spatial aligmet errors. Reetly, gradiet domai image bledig approahes [5]-[8] have bee applied to image stithig. These algorithms a redue olor differees ad smooth olor trasitios usig gradiet domai operatios, produig high-quality omposite images. Optimal seam fidig approahes [4], [9]-[1] searh for seams i overlappig areas alog paths where differees betwee soure images are miimal. The seams a be used to label eah output image pixel with the iput image that should otribute to it label whih iput image otributes to eah output pixel. The ombiatio of optimal seam fidig ad trasitio smoothig for image stithig has also bee used i paorama appliatios [4], [13], ad [15]. Soure images are ombied by ompositig alog optimal seams. If the seams ad stithig artifats are visible, trasitio smoothig is applied to redue olor differees to hide the artifats. Curret paorama stithig approahes ruig o amera phoes a be foud i [13], [], ad [3]. I [13], graph ut is used for fidig optimal seams to merge the soure images together ad Poisso bledig is used for smoothig olor trasitios. High-quality paorami images a be obtaied. However, omputatioal ad memory osts are high. I [] ad [3], soure images are stithed together with a proedure iludig olor orretio, seam fidig, ad simple badliear bledig. The stithig proess is simple. However, the quality of paorami images is ot high. There are several problems i this approah. Pixels are easy saturated i olor orretio. It does ot work well for soure images i very differet olors ad lumiae. The simple bad-liear bledig is ot suffiiet whe olor orretio a ot
2 remove olor differees effiietly, whih results i lowquality paorami images. Like other liear bledig, movig objets o the overlappig areas will ause ghostig artifats. All these problems are solved i our proposed approah. We have reated a fast image stithig approah that uses relatively little memory. It iludes olor orretio, image labelig, ad image bledig operatios. We perform olor orretio for all soure images to redue olor differees ad smoothe remaiig olor trasitios betwee adjaet images. Sie the RGB pixel values of iput images are gamma-orreted ad therefore o-liear, we alulate the olor averages used to fid olor orretio oeffiiets usig liearized RGB values. A global adjustmet proess is applied to redue magitude of average olor orretio to lower the hae of saturatig pixel values durig olor orretio. I the image labelig operatio, a error surfae is ostruted with squared differees betwee overlappig images. A lowost path is foud through the error surfae by dyami programmig ad used as a optimal seam to reate labelig. The overlappig images are merged together alog the optimal seam. Compared to the ommoly used graph ut method, the labelig proess is muh faster ad memory osumptio is muh lower. I order to further smoothe olor trasitios betwee adjaet soure images, we perform image bledig after the soure images are merged usig image labels. A simple liear bledig is used whe soure images are similar i olor ad lumiae. Whe the olors remai too differet, Poisso bledig hides visible seams. The use of olor orretio for the soure images a improve qualities of image labelig ad image bledig. It a also speed up the bledig proess. A sequetial paorama stithig proedure is reated with the fast image stithig approah. I this way, we a produe high-resolutio paorami images from large soure images with low omputatioal ad memory osts. C. Cotributios We (i) propose a fast paorama stithig approah with olor orretio, fast labelig, ad image bledig for reatig high-resolutio ad high-quality paorami images o mobile phoes; (ii) improve qualities of optimal seam fidig ad trasitio smoothig by ombiig olor orretio with image labelig ad image bledig; (iii) redue omputatio of the Poisso bledig proess with pre-smoothig olor differees of soure images; (iv) reate a sequetial image stithig proedure for mobile appliatios to quikly ostrut high-resolutio paoramas with log image sequees usig little memory; (v) preset various examples ad ompare performae with other approahes to demostrate advatages of the proposed approah; (vi) implemet it o mobile phoes. II. SUMMARY OF OUR APPROACH Fig. 1 shows the workflow of the fast paorama stithig proedure. We start with settig the stithig order (S 0, S 1,, S ) of the soure images by sortig their offsets with respet to the fial paorama. We alulate olor orretio oeffiiets for eah eighborig image pair i the liearized RGB olor spae for all soure images, ad the ompute a global adjustmet fator that redues umulative olor orretio ad the risk of saturatig olors. Next, we fid a image with more realisti olors i the image sequee, ad adjust the first image usig a hai of relative olor orretios, modified with the global orretio fator, so that the olors of the best image remai after orretio as they were. After alloatig memory for the fial paorami image I ad iitializig it with the first image S 0, we start to stith other soure images to the paorami image sequetially. Start Set a stithig order (S 0, S 1,, S ) for the soure images by sortig their offsets. Calulate olor orretio for eah soure image pair ad obtai olor oeffiiets for all soure images. Calulate global adjustmet fator for the olor orretio oeffiiets. Fid a image with best olors i the image sequee ad use it to orret the olors of the first image. Perform olor orretio for the first image S 0 relative to the best image, set it as the base image, ad put it ito the paorami image I. Load the ext soure image as the urret image S. Perform olor ad lumiae ompesatio for the urret image S with the ompesatio oeffiiets ad the global adjustmet fator. Determie the overlap betwee the urret paorami image I ad the urret image S. Compute a error surfae i the overlappig area. Fid a miimal ost path through the error surfae with dyami programmig ad use it as a optimal seam for labelig. Cut the overlappig images alog the optimal seam ad merge them. o Perform image bledig ad update the urret paorami image I with the bledig result. Are all soure images doe? yes Obtai the fial paorami image I. Stop Fig. 1. Workflow of the fast paorama stithig approah. We load the ext soure image as the urret proessig image S ad perform olor orretio with the olor orretio oeffiiets ad the global adjustmet fator. I order to merge the urret image with the urret paorama, we extrat the overlappig area betwee these two images ad ompute a squared differee betwee the overlappig images as a error surfae. We fid a miimal ost path through the error surfae with dyami programmig. That path is used as a optimal seam to ut the overlappig images ad merge them together. We perform image bledig to further redue olor differees ad smooth olor trasitios betwee the
3 urret soure image S ad the paorami image I. With the bledig result, we a update the paorami image I. The proess is repeated for all soure images, util we obtai the fial paorami image. Ulike the global image stithig i [13], we do ot eed to keep all soure images i memory due to the sequetial stithig. The use of dyami programmig for optimal seam fidig allows image labelig muh faster tha usig graph ut. The ombiatio of olor orretio ad image bledig allows us to ostrut highquality paorami images. Although we desribe the approah usig the 1D stithig ase, i.e. ameras move horizotally or vertially, it has bee already exteded to 1D stithig, i.e. ameras move i ay arbitrary diretio ad soure images a be stithed together i ay arbitrary order. (a) (b) Fig.. Image stithig without ad with olor orretio III. COLOR AND LUMINANCE COMPENSATION We apture the images usig automated settigs for fous, exposure, ad white balae. As illumiatio hages aross the see, differet images have differet values for exposure ad white balae, leadig sometimes to large differees i olors i eighborig images. If o further olor proessig is doe, visible artifats may be reated i paorama stithig. Fig. (a) shows a example, where the upper row shows three soure images with differet olors. The bottom row shows a stithig result. I this ase, we a learly see olor differees ad seams betwee the soure images. It is eessary to perform olor orretio for the soure images to redue the differees ad improve the stithig quality. I order to better math the olors, we ompute light averages i the overlap area usig liearized RGB values istead of the default gamma-orreted RGB. I a image sequee S 0, S 1, S i, S, suppose S i-1 ad S i are adjaet images, ad o Si1 ad Sio are where image overlap. We ompute olor orretio oeffiiets for image S i by liearizig the gamma-orreted RGB values as ( P, i1( p)) p, i { R, G, B} ( i 1,,3,, ), (1) ( P ( p)) p, i where P,i-1 (p) is the olor value of pixel p i image S o i1 ; P,i (p) o is the olor value of pixel p i image S ; ad γ is a gamma i oeffiiet. Usually we set γ to.. For the first image S 0, we set α,0 to 1. To avoid saturatig olor values, we perform a global adjustmet for olor i the whole image sequee. We alulate a global adjustmet fator g for eah olor hael so that the overall adjustmets g α,i approximate 1 by solvig the least-squares equatio mi ( g, 1) { R, G, B}. () g 0 i i Equatio () is a quadrati futio i adjustmet g whih a be solved i losed form by settig the derivative to 0, g i0 i0, i, i { R, G, B} ( i 0,1,, ). (3) With the orretio oeffiiets α,i ad the global adjustmet fator g, we perform olor orretio for the whole image S i, 1/ P, i( p) ( g, i) P, i( p), { R, G, B} ( i 0,1,, ), (4) where P,i (p) is the olor value of pixel p i image S i i olor hael {R, G, B}. Sie the iput ad output values are gamma-orreted, we also gamma-orret adjustmets g α,i. As desribed before, we use a best image foud i the image sequee to orret olors for the first image. It is diffiult to automatially determie the image with the best olors, sie that is also partially a estheti judgmet all, ad ideally the user should selet the image whose olors she likes the best. As a heuristi, we selet the image with most similar meas i the R, G, ad B haels, usig the gray world assumptio ofte used i white balaig. Fig. (b) shows the results of olor orretio ad image stithig for the soure images show i Fig. (a). From the results we a see that olor orretio redues the olor differees so that hardly ay seam remais visible. There are two mai advatages i the way we do the olor orretio. Liearizig the light while alulatig the orretio fators mathes the olors better tha if the averages were alulated i gamma-orreted RGB, ad the global adjustmet for olor orretio oeffiiets atteuates the orretios, reduig aumulatio of orretios that may lead to olor saturatio. (a) (b) Fig. 3. Ghostig artifats aused by objet motio ad deghostig. IV. OPTIMAL SEAM FINDING AND IMAGE LABELING Objet motio ad spatial aligmet errors may ause ghostig artifats durig image stithig. Fig. 3 (a) shows a example where a perso was movig while the image sequee was aptured. From the stithig result we a see the ghostig problem aused by the motio. The objetive of optimal seam fidig is to fid seams i
4 the overlappig areas of soure images, reate labelig for all pixels i the omposite image, ad merge soure images alog the optimal seams. Sie eah pixel i the omposite image omes from oly oe soure image, the ghostig problems a be avoided. I mobile settigs, we wat a method that fids optimal seams quikly with usig little memory, so that it a be applied for reatig high-resolutio paorami images o mobile phoes. Like [11] ad [], we also use dyami programmig to fid optimal seams. We wat to merge the images o plaes where they differ the least. Suppose that abd is the overlappig area betwee the urret omposite image I ad the urret soure image S. I i o ad S i o are the overlappig images i the area abd of I ad S respetively. We ompute squared differees e betwee I i o ad S i o as a error surfae, o o e ( I S ). (5) We apply dyami programmig to fid a miimal ost path through this surfae. We sa the error surfae row by row ad ompute a umulative miimum squared differee E E( h, w) e( h, w) mi( E( h 1, w 1), (6) E( h 1, w), E( h 1, w 1)), where h =,, r ad w =,, are the idies of the rows ad olums of the error surfae, respetively. The optimal path m a be obtaied by traig bak the paths with a miimal ost from bottom to top. O the last row, the pixel with the miimum value is at the ed (h 0, w 0 ) of the optimal path. O the previous row, the miimum E(h 0 1,w), w{w 0 1,w 0,w 0 +1} deotes the positio (h 0 1,w) of the optimal path at this row. Similarly, we a follow the path up oe row at a time. Fig. 4 shows the proess of optimal seam fidig with dyami programmig. Fig. 4 (a) ad (b) are the overlappig areas of I ad S, respetively. The error surfae e show i Fig. 4 () is omputed as the squared differees betwee images Fig. 4 (a) ad (b). Usig that, the umulative miimum squared differee E is omputed ad is show i Fig. 4 (d). Fig. 4 (e) shows all possible paths. After traig bak with dyami programmig, we obtai the optimal path show i Fig. 4 (f), alog whih the two images i (a) ad (b) math best. We use that path as a optimal seam to reate labelig. We update the urret omposite image I by mergig the urret image S with the labelig iformatio ad otiue the labelig proess with the ext soure image. After all soure images are proessed, we obtai the fial omposite image. Sie optimal seams are used i the image stithig proess, the ghostig problems a be avoided. Fig. 3 (b) shows the result obtaied by image stithig with optimal seam fidig for the soure images show i Fig. 3 (a). From the result we a see that ghostig artifats i the overlappig area have bee removed by the optimal seam fidig proess. I this ase the paths resulted i a opy of the movig perso, other hoies for the path might result i the left, right, or either versio of the perso. I ay ase we avoided trasparet opies, or paths splittig the perso i two. Color orretio a improve quality of optimal seam fidig ad image labelig. We wat to fid a path where the images agree. This is more diffiult to do if the olors of the two images disagree as muh as i the sequee of Fig. 5. There is a movig objet (ar) i the see, ad we would like to fid a path that does ot iterset the ar, as the other images do ot otai it. However, o top left, where the images have ot bee olor-orreted, the miimum differee path goes through the ar. I top right, whe the olors have bee orreted before the path searh, the path avoids the ar, ad a osistet paorama ould be reated. Fig. 4. Proess of optimal seam fidig with dyami programmig. Fig. 5. Color-orretio improves the seam quality. Fig. 6. Simple liear bledig. V. TRANSITION SMOOTHING WITH IMAGE BLENDING Color orretio redues the differees betwee the images, whih makes bledig easier ad faster. I our fast paorama stithig approah, we have two image bledig proesses that a be used. A. Simple Liear Bledig For the soure images that are similar i olor ad lumiae after olor orretio, we perform a simple image bledig o a bad that is δ pixels wide o both sides of the seam, as show i Fig. 6. The ew olor value of pixel p i the overlappig area a be alulated by a weighted ombiatio of the orrespodig pixels P I (a) (b) () (d) (e) (f) I ( p) d 1 PI ( p) d PS p ( ) d1 d, (7), ew a m d p d 1 where d 1 ad d are distaes from pixel p to boudaries; P ( p) is the ew olor of pixel p; I, ew P I ( p) is the olor of pixel p i image I ; P S ( p) is the olor of pixel p i image S ; S
5 differet values of result i differet olor trasitios. Liear bledig is simple ad omputatioal ad memory osts are low. However, movig objets i the bledig bad areas will ause ghostig artifats. Furthermore whe soure images differ, liear bledig is ot eough to get rid of seams ad stithig artifats; more itesive bledig is required. B. Poisso Bledig Poisso bledig is a itesive image bledig approah that performs image bledig i the gradiet domai. I Poisso bledig, we reate a gradiet vetor field (G x, G y ) with gradiets of soure images usig the labelig obtaied usig optimal seams. I the sequetial image stithig proedure, the gradiet vetor field is opied from the urret soure image S, up util the seam betwee it ad the urret paorami image I (i Fig. 6 all the pixels of S to the right of the alulated seam). A divergee field div(g) is the omputed from the gradiet vetor field, G G x y div( G). (8) x y We use the divergee field as a guidae to ostrut a Poisso equatio I ( div( G), (9) where is the Laplaia operator I( I( I(. (10) x y I pratial implemetatio, we eed to use the disrete form of Equatio (9) I( x 1, I( x 1, I( y 1) I( y 1) 4 f ( Gx ( Gx( x 1, Gy ( (11) G y ( y 1) Equatio (11) is a liear partial differetial equatio, whih we solve by fixig the olors at the seam ad solvig ew olors I( over the gradiet field. We a solve the equatio usig a iterative ojugate gradiets solver. Fig. 7 shows a ompariso betwee the results reated by simple liear bledig ad Poisso bledig for the olororreted soure images show i Fig.. The upper figure shows the result usig simple liear bledig. A fait seam a still be see betwee the two soure images. However, o visible seam a be observed i the result reated by the Poisso bledig show o the bottom. By ompariso, the liear bledig is simple ad fast, but bledig quality is low. The Poisso bledig has higher quality; however it eeds more omputatio ad memory. While olor orretio was ruial for good quality i liear image bledig, it a also help to speed up the Poisso solver. Fig. 8 shows three soure images with very differet olors ad lumiae. The top row shows the results after 0 iteratios of Poisso solver, o the left startig from the origial iputs, o the right startig from olor-orreted iputs. Hudreds of further iteratios would be eeded to obtai omparable results without olor orretio. With loger sequees differees beome eve more prooued. Fig. 7. Results of liear bledig ad Poisso bledig. Fig. 8. Improved bledig quality ad speed with olor orretio. VI. IMPLEMENTATION A sequetial paorama stithig proedure is reated with the fast image stithig approah. We have two implemetatios for the proedure: keep the full resolutio paorami image i memory; reate a low-resolutio paorami image i memory for display ad save the full resolutio oe to disk blok by blok while it is reated. By ompariso, the previous oe is faster ad more oveiet for the viewig proess. It a keep stithig with frames as log as there is eough memory for the full resolutio paorami image, the urret soure image, ad some work arrays. The latter oe has o limitatio for the umber of frames as log as there is eough memory for the low-resolutio paorami image, the urret soure image, ad some work arrays. It eeds to re-load the full resolutio paorami image for viewig. By omparig with the global image stithig [13], both implemetatios use muh less memory. A omparig result is give i Setio VII.B. VII. EXAMPLES AND RESULT ANALYSIS We have implemeted the fast paorama stithig approah o mobile phoes for reatig high-resolutio ad highquality paorami images. We have tested it o both idoor ad outdoor sees ad obtaied good results. We preset examples for various sees, iludig log image sequees with soure images with very differet olors ad lumiae, ad ompare performae with other approahes to demostrate advatages of our paorama stithig i proessig speed ad memory osumptio. I this paper, the example appliatios ad results are obtaied o a mobile phoe with a 33 MHz proessor ad 18 MB RAM. It a also be ru o other mobile devies. I these appliatios, the size of soure images is We have also applied it to larger soure images, with good results.
6 (a) Soure image sequee. (b) Optimal seam fidig. () Liear bledig alog with the seams. (d) Poisso bledig with 5 iteratios. (e) Poisso bledig with 150 iteratios. (f) Soure images after olor orretio. (g) Liear bledig for soure images after olor orretio. (h) Poisso bledig with 5 iteratios for soure images after olor orretio. Fig. 9. Appliatio to a log image sequee with very differet olors ad lumiae i soure images. A. Log Image Sequees with very Differet Colors Fig. 9 shows a example of a log image sequee with images that have very differet olors ad itesities. With the results of this example, we a also demostrate the performae of eah proess i the approah. Fig. 9 (a) shows the origial soure images i the image sequee. There are 13 soure images with very differet olors ad lumiae i the image sequee. While it is aptured, some objets move i the see. The differet olors ad lumiae betwee the soure images are aused by the use of automated settigs of the amera. Fig. 9 (b) shows the omposite image obtaied by optimal seam fidig. From the result we a see that the optimal seam fidig proess i our paorama stithig a fid the best way to label images ad merge them to a omposite image. Although there are movig objets i overlappig areas of soure images, there is o ghostig or blurrig problems i the omposite image. The use of dyami programmig for optimal seam fidig is oe of the mai reasos why the proposed paorama stithig works fast. Fig. 9 () shows the result reated by the simple liear bledig for the omposite image obtaied by optimal seam fidig. From the result we a see that the olor differees aross the optimal seams are redued to some extet. This meas that the simple liear bledig proess a smooth olor trasitios aross the seams. The proessig speed of the bledig is very fast. However, sie the soure images are very differet i olors ad lumiae, the olor differees i the whole omposite image still a be see. Other proessig is eeded to further redue the differees.
7 Fig. 10. Paorami image reated by the approah i []. Fig. 11. Compariso of olor orretio approahes i [] ad i the proposed fast paorama stithig approah. Fig. 9 (d) shows a result produed by Poisso bledig i whih the liear solver uses 5 iteratios. From the result we a see that the effet of the bledig is almost the same as the simple liear bledig show i Fig. 9 (). It is still far away from a satisfyig result. The olor differees i the omposite image a still be see learly. Fig. 9 (e) shows a result obtaied by Poisso bledig after 150 iteratios. The result is improved muh ompared to the result show i Fig. 9 (d). This meas that muh more omputatio is eeded to obtai a better result. However, the result is still ot satisfyig. We a still see olor disotiuity i the omposite image, espeially o the right side. Fig. 9 (f) shows the soure images after olor orretio. From the result we a see that the olor orretio proess a redue differees i olors ad lumiae betwee two images ad adjust olors globally i the whole image sequee. Although the origial soure images are very differet, the differees are smoothed after olor orretio. Also, there are o pixel saturatio artifats after the olor orretio proess. We a see that the performae of the olor orretio proess is very satisfyig. Fig. 9 (g) shows a result reated by the simple liear bledig proess after olor orretio. As we a see, ombiatio of olor orretio with the simple liear bledig a produe very satisfyig paorami images. Both proesses of olor orretio ad liear bledig are simple ad use little memory. The ombiatio is suitable for mobile implemetatio ad appliatios. Fig. 9 (h) shows a result produed by Poisso bledig with the soure images after olor orretio. We a see that there are o visible artifats. I this ase, Poisso bledig still uses 5 solver iteratios, however, the result is muh better tha i Fig. 9 (e), whih uses 150 iteratios for the soure images that are ot proessed by olor orretio. Agai, the olusio is that olor orretio a improve Poisso bledig quality ad speed up the proessig speed. The ombiatio makes Poisso bledig muh more suitable for mobile devies. From the evaluatio of this example we a see that eah proess of the proposed paorama stithig approah futios well. The approah a produe high-quality ad high-resolutio paorami images o mobile phoes. It a hadle soure images i log image sequees with very differet olors ad lumiae. B. Compariso with Other Approahes Fig. 10 shows a paorami image reated by the approah proposed i [] with soure images show i Fig. 9 (a). From the result we a see that olor differees ad seams betwee soure images a be see learly. Sie the soure images are very differet i olors ad lumiae, the olor orretio approah a ot remove the differees ompletely ad the simple bad-liear bledig a ot smooth the olor trasitios, so that a low-quality paorami image is obtaied. Atually, this is oe of the mai disadvatages of the paorama stithig approah i []. It a ot hadle log image sequees with soure images i very differet olors ad lumiae. O the other had, for same image sequee, the proposed fast paorama stithig approah a produe high-quality paorami images show i Fig. 9 (g) ad (h) due to better olor orretio ad image bledig proedures. I geeral, the proposed approah a hadle this kid of image sequees very effetively. Fig. 11 shows a ompariso of olor orretio results betwee the approah i [] ad the proposed approah. I this ase, there are 14 soure images with very differet olors ad lumiae show i Fig. 11 (bottom). Fig. 11 (top) shows the paorami image reated with the olor orretio i []. From the result we a see that the olor orretio approah does ot work well. The olor differees ould ot be removed. There is a mai problem i this result that a large part of the pixels are saturated after olor orretio. Most details suh as i the sky ad road i this result are lost. Fig. 11 (middle) shows the paorami image reated with the olor orretio i the proposed approah. From the result we a see that all details are kept ad pixels are ot saturated after olor orretio. Colors i the whole paorami image are very atural. Color trasitios are smoothed. The good olor orretio promises to obtai high-quality paorami images. Furthermore, Poisso bledig a further improve quality of the fial result.
8 Fig. 1. Paorami image produed by the fast paorama stithig with 7 soure images i a idoor see with movig objets. Fig. 13. Paorami image produed by the fast paorama stithig with 8 soure images i a outdoor see with movig objets. Fig. 14. A paorami image reated by our fast paorama stithig with soure images o mobile phoes. TABLE I stithig is show o the top of COMPARISON OF MEMORY CONSUMPTION OF IMAGE STITCHING IN [13] AND THE PROPOSED APPROACH A B C We have ompared memory osumptios betwee the proposed sequetial paorama stithig with the global paorama stithig i [13] whih eeds to keep all soure images i memory for global optimizatio durig image stithig. The result is show i Table I. I the table, row A meas the umber of soure images used, B shows the memory osumptio usig global paorama stithig, ad C shows the memory osumptio of sequetial paorama stithig. The uit of memory osumptio is MB. From the results we a see that the more soure images i paorama stithig, the more memory the sequetial stithig saves. I this ompariso, both implemetatios keep full paorami images i memory durig paorama stithig. C. Image Stithig of a Idoor See Fig. 1 shows a example of a idoor see with 7 soure images. The result reated by the proposed fast paorama the figure. The stithig proess takes 19 seods ad the graph ut approah [13] takes 67 seods, about 35 times loger. We a also otie some other aspets. Although the people i the see are movig durig the apture of the sequee, the stithig proess fids good seams ad avoids ghostig ad blurrig problems aused by these movig objets. Although there are some differees of the soure images i olors ad lumiae, they are removed after olor orretio ad image bledig i the resultig paorami image. The olor trasitios are smoothed i the fial results. D. Image Stithig of a Outdoor See The outdoor image sequee i Fig. 13 (bottom) iludes eight soure images that are stithed together to reate a paorami image. Fig. 13 (top) shows the result reated by the fast paorama stithig approah. The stithig takes 3 seods ad the graph ut [13] takes 756 seods, about 3 times loger. Also here we fid good seams, ad seletig sigle iput image per output pixel helps to avoid ghostig problems due to objet motio.
9 E. Creatig 360 Paoramas with very Log Image Sequees Fig. 14 shows a 360 o paorami image. The top shows the reated paorami image ad the bottom shows the 17 soure images. From the image sequee we a see that the soure images are very differet i olors ad lumiae ad there are some movig objets i the see while the image sequee is aptured. However, the approah still produes a high-quality paorami image. The paorama stithig proess takes 34 seods ad agai is muh faster tha the ommoly used graph ut approah. Aordig to our tests, the loger the image sequees, the greater the speed advatage of the fast paorama stithig is. Sie the fast paorama stithig is a sequetial image stithig proedure, it oly eeds to keep the paorami image ad the urret soure image i memory. As log as there is eough memory for the fial paorama ad the urret soure image, the approah does ot are how may soure images are proessed. Fast proessig speed ad low memory osumptio are the mai advatages of the proposed approah, both very importat i a mobile implemetatio. Our approah has bee tested with may image sequees with differet ases o differet types of mobile phoes ad it performs well. VIII. DISCUSSION AND CONCLUSIONS A fast paorama stithig approah that uses little memory is developed ad implemeted o mobile phoes for reatig high-resolutio ad high-quality paorami images. It has bee tested with differet image sequees aptured uder differet lightig oditios. It is muh faster tha the graph ut approah. The fast stithig approah a be applied to reate high-resolutio paorami images with large soure images as log as the system has eough memory for the fial paorama ad the urret proessig soure image. The fast speed of the proposed approah is maily due to the fast labelig approah reated with dyami programmig. It is very simple to implemet. After the overlap betwee two images is loated, a error surfae is reated by omputig the squared differees of olors i the overlappig area. A lowost path where the image values agree is foud by dyami programmig. The path is used as the optimal seam to reate labelig, ad the two images a be ut alog the seam ad merged together. Labelig allows us also to avoid ghostig whe objets move as the images are aptured. Two image bledig proesses a be used i this fast paorama stithig approah. Whe soure images are suffiietly similar i olors after olor orretio, a simple ad fast liear bledig suffies. Whe soure images are too differet for the simple liear bledig, a Poisso bledig removes visible seams. Applyig olor orretio helps also Poisso solver to fid a good solutio faster. A sequetial paorama stithig proedure is reated ad itegrated with olor orretio, fast labelig, ad image bledig to reate paorami images. The itegratio allows us to reate high-resolutio paorami images from several large soure images quikly usig little memory. Future work iludes speedig up the Poisso bledig proess ad reduig its memory osumptio. REFERENCES [1] Y. Xiog ad K. Pulli, Mask based image bledig approah ad its appliatios o mobile devies, i SPIE Multispetral Image Proessig ad Patter Reogitio (MIPPR), 009. [] S. Ha, H. Koo, S. Lee, N. Cho, ad S. Kim, Paorama mosai optimizatio for mobile amera systems, IEEE Trasatios o, Cosumer Eletrois, vol. 53, o. 4, pp , Nov [3] S. Ha, S. Lee, N. Cho, S. Kim, B. So, "Embedded paorami mosai system usig auto-shot iterfae," IEEE Trasatios o Cosumer Eletrois, Vol. 54, No. 1, pp.16-4, Feb [4] A. Agarwala, M. Dotheva, M. Agrawala, S. Druker, A. Colbur, B. Curless, D. Salesi, ad M. Cohe, Iterative digital photomotage, ACM Tras. Graph, vol. 3, pp , 004. [5] A. Levi, A. Zomet, S. Peleg, ad Y. Weiss, Seamless image stithig i the gradiet domai, i Europea Coferee o Computer Visio (ECCV), 004, pp [6] P. Pérez, M. Gaget, ad A. Blake, Poisso image editig, ACM Tras. Graph., vol., o. 3, pp , 003. [7] J. Jia, J. Su, C.-K. Tag, ad H.-Y. Shum, Drag-ad-drop pastig, i ACM SIGGRAPH, 006, pp [8] Z. Farbma, G. Hoffer, Y. Lipma, D. Cohe-Or, ad D. Lishiski, Coordiates for istat image loig, ACM Tras. Graph., vol. 8, o. 3, pp. 1 9, 009. [9] N. Graias, M. Mahoor, S. Negahdaripour, ad A. Gleaso, Fast image bledig usig watersheds ad graph uts, Image Visio Comput., vol. 7, o. 5, pp , 009. [10] D. L. Milgram, Computer methods for reatig photomosais, IEEE Tras. Comput., vol. 4, o. 11, 1975, pp [11] A. A. Efros ad W. T. Freema, Image quiltig for texture sythesis ad trasfer, i ACM SIGGRAPH, 001, pp [1] J. Davis, Mosais of sees with movig objets, i IEEE Coferee o CVPR, 1998, pp [13] Y. Xiog ad K. Pulli, Gradiet domai image bledig ad implemetatio o mobile devies, i Iteratioal Coferee o Mobile Computig, Appliatios, ad Servies (MobiCase), 009. [14] V. Kolmogorov ad R. Zabih, What eergy futios a be miimized via graph uts, IEEE Trasatios o Patter Aalysis ad Mahie Itelligee, vol. 6, pp , 004. [15] Y. Xiog ad K. Pulli, Sequetial image stithig for mobile paorama, i IEEE Iteratioal Coferee o Iformatio, Commuiatios ad Sigal Proessig (ICICS), 009. BIOGRAPHIES Yige Xiog works at Nokia Researh Ceter. His researh iterest areas ilude omputer visio, patter reogitio, ad omputatioal photography. Previously he was a researh professor i Virgiia Polytehi Istitute ad State Uiversity ad Wright State Uiversity. He reeived PhD degree from Najig Uiversity of Aeroautis ad Astroautis. Kari Pulli is a researh fellow at Nokia Researh Ceter. He has bee a ative otributor to several mobile graphis stadards ad reetly wrote a book about mobile 3D graphis. Pulli reeived a PhD i omputer siee from Uiversity of Washigto ad a MBA from Uiversity of Oulu. Cotat him at kari.pulli@okia.om.
Fast and High-Quality Image Blending on Mobile Phones
Fast and High-Quality Image Blending on Mobile Phones Yingen Xiong and Kari Pulli Nokia Research Center 955 Page Mill Road Palo Alto, CA 94304 USA Email: {yingenxiong, karipulli}@nokiacom Abstract We present
More informationOptimal Placement of Mesh Points in Wireless Mesh Networks 1
Optimal Plaemet of Mesh Poits i Wireless Mesh etworks Suk Yu Hui 2, Kai Hau Yeug 2, ad Ki Yeug Wog 3 2 Departmet of Eletroi Egieerig, ity Uiversity of Hog Kog syhui@ee.ityu.edu.hk, eeayeug@ityu.edu.hk
More informationComparison of Convergence and BER Performance on LMS, RLS and NLMS in BPLC Systems
Iteratioal Joural of Siee ad Researh (IJSR) ISSN (Olie): 319-7064 Impat Fator (01): 3.358 Compariso of Covergee ad BER Performae o LMS, RLS ad NLMS i BPLC Systems Mohammed Mjahid 1, Nixo Mtoyole he Uiversity
More information7A.3 IMPROVING RADAR RAINFALL PRODUCTS EMPLOYING DATA FROM CELLULAR TELECOMMUNICATION NETWORKS
7A.3 IMPROVING RADAR RAINFALL PRODUCT EMPLOYING DATA FROM CELLULAR TELECOMMUNICATION NETWORK Aart Overeem, Wageige Uiversity ad Royal Netherlads Meteorologial Istitute, The Netherlads Hidde Leijse, Royal
More informationSensors & Transducers Published by IFSA Publishing, S. L.,
Sesors & Trasduers, Vol. 5, Issue 8, August 07, pp. 35-4 Sesors & Trasduers Published by IFSA Publishig, S. L., 07 http://www.sesorsportal.om Semi-Impliit Additive Operator Splittig Sheme for Image Segmetatio
More informationA Novel Method for Commutation Torque Ripple Reduction of Four-Switch, Three-Phase Brushless DC Motor Drive
A Novel Method for Commutatio Torque Ripple Redutio of Four-Swith, Three-Phase Brushless DC Motor Drive A. Halvaei-Niasar*, A. Vahedi** ad H. Moghbelli*** Dowloaded from ijeee.iust.a.ir at :28 IRST o Friday
More informationPerformance analysis of Piecewise linear Companding with various precoders for PAPR Reduction of OFDM Signals
Iteratioal Researh Joural of Egieerig ad Tehology (IRJET) e-iss: 395-0056 Volume: 03 Issue: Ot -06 www.irjet.et p-iss: 395-007 Performae aalysis of Pieewise liear Compadig with various preoders for PAPR
More informationAnomaly Detection in Time Series Data using a Fuzzy C-Means Clustering
Aomaly Detetio i Time Series Data usig a Fuzzy C-Meas Clusterig Hesam Izakia Witold Pedryz Departmet of Eletrial ad Computer Egieerig Uiversity of Alberta Edmoto, AB, T6G 2V4, Caada izakia@ualberta.a Departmet
More informationDC-link Capacitor Second Carrier Band Switching Harmonic Current Reduction in Two-Level Back-to-Back Converters
1 TPEL-Reg-016-08-153 - fial DC-lik Capaitor Seod Carrier Bad Swithig Harmoi Curret Redutio i Two-Level Bak-to-Bak Coverters Lei She, Serhiy Bozhko, Member, IEEE, Christopher Ia Hill, ad Patrik Wheeler,
More informationExperimental Performance Evaluation of AODV Implementations
Experimetal Performae Evaluatio of AODV Implemetatios Koojaa Kuladiithi, Asaga Udugama, Niko Fikouras, Carmelita Görg Uiversity of Breme Cmuiatio Networks (CN) Otto-Hah-Allee NW 1 28359 Breme {koo adu
More informationANALYSIS OF HIGH PERFORMANCE FIR FILTER USING IMPROVED DISTRIBUTED ARITHMETIC
Iteratioal Joural of Reet Advaes i Egieerig & Teholog (IJRAET) AALYSIS OF HIGH PERFORMACE FIR FILTER USIG IMPROVED DISTRIUTED ARITHMETIC hagalakshmi. Rekha K R ataraj K R 3 Asst Prof Departmet of ECE VKIT
More informationA SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS
A SELETIVE POINTE FOWADING STATEGY FO LOATION TAKING IN PESONAL OUNIATION SYSTES Seo G. hag ad hae Y. Lee Departmet of Idustrial Egieerig, KAIST 373-, Kusug-Dog, Taejo, Korea, 305-70 cylee@heuristic.kaist.ac.kr
More informationNON-MINIMUM PHASE MODEL OF VERTICAL POSITION ELECTRO-HYDRAULIC CYLINDER FOR TRAJECTORY ZPETC
NON-MINIMUM PHASE MODEL OF VERTICAL POSITION ELECTRO-HYDRAULIC CYLINDER FOR TRAJECTORY ZPETC Norlela Isha, Maidah Tajjudi,Hashimah Ismail,Mihael Patri,Yahaya Md Sam,Ramli Ada Faulty of Eletrial Egieerig,
More informationDESIGN ISSUES OF A DIGITAL BASEBAND GMSK-MODULATOR FOR AN AUTONOMOUS WIRELESS COMMUNICATION SYSTEM
7 th Iteratioal Coferee o DEVELOPMENT AND APPLICATION SYSTEMS S u e a v a, R o m a i a, M a y 27 29, 2 4 DESIGN ISSUES OF A DIGITAL BASEBAND GMSK-MODULATOR FOR AN AUTONOMOUS WIRELESS COMMUNICATION SYSTEM
More informationOn Capacity and Delay of Multi-channel Wireless Networks with Infrastructure Support
O Capaity ad Delay of Multi-hael Wireless Networks with Ifrastruture Support Hog-Nig Dai, Raymod Chi-Wig Wog, Hao Wag arxiv:60403v [sni] 8 Apr 06 Abstrat I this paper, we propose a ovel multi-hael etwork
More informationAlignment in linear space
Sequece Aligmet: Liear Space Aligmet i liear space Chapter 7 of Joes ad Pevzer Q. Ca we avoid usig quadratic space? Easy. Optimal value i O(m + ) space ad O(m) time. Compute OPT(i, ) from OPT(i-1, ). No
More informationPlanar dielectric waveguides
Plaar dieletri waveguides Abstrat: A optial waveguide is a physial struture that guides eletroageti waves i the optial spetru. They are used as opoets i itegrated optial iruits, as the trasissio ediu i
More informationCCD Image Processing: Issues & Solutions
CCD Image Processig: Issues & Solutios Correctio of Raw Image with Bias, Dark, Flat Images Raw File r x, y [ ] Dark Frame d[ x, y] Flat Field Image f [ xy, ] r[ x, y] d[ x, y] Raw Dark f [ xy, ] bxy [,
More informationA Study on Stepped Frequency Radar by Using Intra-Pulse Phase Coded Modulation
Proeedigs of the World ogress o Egieerig ad omputer Siee 28 WES 28, Otober 22-24, 28, Sa Fraiso, USA A Study o Stepped Frequey Radar by Usig Itra-Pulse Phase oded Modulatio. Fuushima ad. Hamada Abstrat
More informationLecture 4: Frequency Reuse Concepts
EE 499: Wireless & Mobile Commuicatios (8) Lecture 4: Frequecy euse Cocepts Distace betwee Co-Chael Cell Ceters Kowig the relatio betwee,, ad, we ca easily fid distace betwee the ceter poits of two co
More informationAPPLICATION NOTE UNDERSTANDING EFFECTIVE BITS
APPLICATION NOTE AN95091 INTRODUCTION UNDERSTANDING EFFECTIVE BITS Toy Girard, Sigatec, Desig ad Applicatios Egieer Oe criteria ofte used to evaluate a Aalog to Digital Coverter (ADC) or data acquisitio
More informationCHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER
95 CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 5.1 GENERAL Ru-legth codig is a lossless image compressio techique, which produces modest compressio ratios. Oe way of icreasig the compressio ratio of a ru-legth
More informationDensity Slicing Reference Manual
Desity Slicig Referece Maual Improvisio, Viscout Cetre II, Uiversity of Warwick Sciece Park, Millbur Hill Road, Covetry. CV4 7HS Tel: 0044 (0) 24 7669 2229 Fax: 0044 (0) 24 7669 0091 e-mail: admi@improvisio.com
More informationA SIMPLE METHOD OF GOAL DIRECTED LOSSY SYNTHESIS AND NETWORK OPTIMIZATION
49 A SIMPL MOD OF GOAL DIRCD LOSSY SYNSIS AND NWORK OPIMIZAION K. ájek a),. Michal b), J. Sedláek b), M. Steibauer b) a) Uiversity of Defece, Kouicova 65,63 00 ro,czech Republic, b) ro Uiversity of echology,
More informationPermutation Enumeration
RMT 2012 Power Roud Rubric February 18, 2012 Permutatio Eumeratio 1 (a List all permutatios of {1, 2, 3} (b Give a expressio for the umber of permutatios of {1, 2, 3,, } i terms of Compute the umber for
More informationA SIMPLE METHOD OF GOAL DIRECTED LOSSY SYNTHESIS AND NETWORK OPTIMIZATION
A SIMPL MOD OF GOAL DIRCD LOSSY SYNSIS AND NWORK OPIMIZAION Karel ájek a), ratislav Michal, Jiří Sedláček a) Uiversity of Defece, Kouicova 65,63 00 Bro,Czech Republic, Bro Uiversity of echology, Kolejí
More informationAC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM
AC 007-7: USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM Josue Njock-Libii, Idiaa Uiversity-Purdue Uiversity-Fort Waye Josué Njock Libii is Associate Professor
More informationWavelet Transform. CSEP 590 Data Compression Autumn Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)
Wavelet Trasform CSEP 59 Data Compressio Autum 7 Wavelet Trasform Codig PACW Wavelet Trasform A family of atios that filters the data ito low resolutio data plus detail data high pass filter low pass filter
More informationSolution 2. n n. n n R. n n. R n + = 1. n n = + n n. n n. n n. Insert R N = 0.95 and solve, + R n. 1 ln. =14.58 i.e. 15 pairs are needed.
.9 Dieletri irror Cosider a dieletri irror that is ade up of quarter wave layers of GaAs with H.8 ad AlAs with L.9, both aroud 5. The GaAs-AlAs dieletri irror is iside a vertial avity surfae eittig laser
More informationLogarithms APPENDIX IV. 265 Appendix
APPENDIX IV Logarithms Sometimes, a umerical expressio may ivolve multiplicatio, divisio or ratioal powers of large umbers. For such calculatios, logarithms are very useful. They help us i makig difficult
More informationPROJECT #2 GENERIC ROBOT SIMULATOR
Uiversity of Missouri-Columbia Departmet of Electrical ad Computer Egieerig ECE 7330 Itroductio to Mechatroics ad Robotic Visio Fall, 2010 PROJECT #2 GENERIC ROBOT SIMULATOR Luis Alberto Rivera Estrada
More informationHigh-Order CCII-Based Mixed-Mode Universal Filter
High-Order CCII-Based Mixed-Mode Uiversal Filter Che-Nog Lee Departmet of Computer ad Commuicatio Egieerig, Taipei Chegshih Uiversity of Sciece ad Techology, Taipei, Taiwa, R. O. C. Abstract This paper
More informationObjectives. Some Basic Terms. Analog and Digital Signals. Analog-to-digital conversion. Parameters of ADC process: Related terms
Objectives. A brief review of some basic, related terms 2. Aalog to digital coversio 3. Amplitude resolutio 4. Temporal resolutio 5. Measuremet error Some Basic Terms Error differece betwee a computed
More informationX-Bar and S-Squared Charts
STATGRAPHICS Rev. 7/4/009 X-Bar ad S-Squared Charts Summary The X-Bar ad S-Squared Charts procedure creates cotrol charts for a sigle umeric variable where the data have bee collected i subgroups. It creates
More informationOutline. Motivation. Analog Functional Testing in Mixed-Signal Systems. Motivation and Background. Built-In Self-Test Architecture
Aalog Fuctioal Testig i Mixed-Sigal s Jie Qi Dept. of Electrical & Computer Egieerig Aubur Uiversity Co-Advisors: Charles Stroud ad Foster Dai Outlie Motivatio ad Backgroud Built-I Self-Test Architecture
More informationMU-MIMO Downlink Scheduling Based On Users Correlation and Fairness
MU-MIMO Dowli Shedulig Based O Users Correlatio ad Fairess Zhao i *, Peifeg i *, Kag G Shi * State Key aboratory of Itegrated Servie Networs, Xidia Uiversity Departmet of Eletrial Egieerig ad Computer
More informationTMCM BLDC MODULE. Reference and Programming Manual
TMCM BLDC MODULE Referece ad Programmig Maual (modules: TMCM-160, TMCM-163) Versio 1.09 August 10 th, 2007 Triamic Motio Cotrol GmbH & Co. KG Sterstraße 67 D 20357 Hamburg, Germay http:www.triamic.com
More informationApplication of Improved Genetic Algorithm to Two-side Assembly Line Balancing
206 3 rd Iteratioal Coferece o Mechaical, Idustrial, ad Maufacturig Egieerig (MIME 206) ISBN: 978--60595-33-7 Applicatio of Improved Geetic Algorithm to Two-side Assembly Lie Balacig Ximi Zhag, Qia Wag,
More informationHOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING
HOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING H. Chadsey U.S. Naval Observatory Washigto, D.C. 2392 Abstract May sources of error are possible whe GPS is used for time comparisos. Some of these mo
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 3 Sigals & Systems Prof. Mark Fowler Note Set #6 D-T Systems: DTFT Aalysis of DT Systems Readig Assigmet: Sectios 5.5 & 5.6 of Kame ad Heck / Course Flow Diagram The arrows here show coceptual flow
More informationH2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress.
H2 Mathematics Pure Mathematics Sectio A Comprehesive Checklist of Cocepts ad Skills by Mr Wee We Shih Visit: weshih.wordpress.com Updated: Ja 2010 Syllabus topic 1: Fuctios ad graphs 1.1 Checklist o Fuctios
More informationFingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains
7 Figerprit Classificatio Based o Directioal Image Costructed Usig Wavelet Trasform Domais Musa Mohd Mokji, Syed Abd. Rahma Syed Abu Bakar, Zuwairie Ibrahim 3 Departmet of Microelectroic ad Computer Egieerig
More informationAUDIO SUSCEPTIBILITY OF THE BUCK CONVERTER IN CURRENT-MODE POWER STAGE
AUDIO SUSCEPTIBIITY OF THE BUCK CONVERTER IN CURRENTMODE POWER STAGE Costel PETREA Tehial Uiversity Gh.Asahi Iasi Carol I, o., 756, etrea@et.tuiasi.ro Abstrat: For the Buk Coverter oeratig i CurretMode
More informationImplementing a RAKE Receiver for Wireless Communications on an FPGA-based Computer System
Implemetig a RAK Reeiver for Wireless Commuiatios o a FPGA-based Computer System Ali M Shakiti Prof. Miriam Leeser Motorola, SPS Dept of letrial ad Computer g. Masfield, MA, 02048 Northeaster Uiversity
More informationTest Time Minimization for Hybrid BIST with Test Pattern Broadcasting
Test Time Miimizatio for Hybrid BIST with Test Patter Broadcastig Raimud Ubar, Maksim Jeihhi Departmet of Computer Egieerig Talli Techical Uiversity EE-126 18 Talli, Estoia {raiub, maksim}@pld.ttu.ee Gert
More informationA Modified Self-Tuning Fuzzy-Neural Controller
Iteratioal Joural of Egieerig ad Applied Siees (IJEAS) ISSN: 34-366, Volue-, Issue-3, Deeber 04 A Modified Self-Tuig Fuzzy-Neural Cotroller Hsiao-Kag Hwag, Yu-Ju Che, Chuo-Yea Chag, Rey-Chue Hwag* Abstrat
More informationCOS 126 Atomic Theory of Matter
COS 126 Atomic Theory of Matter 1 Goal of the Assigmet Video Calculate Avogadro s umber Usig Eistei s equatios Usig fluorescet imagig Iput data Output Frames Blobs/Beads Estimate of Avogadro s umber 7.1833
More informationONDURA-9. 9-Corrugation Asphalt Roofing Sheets I N S T A L L A T I O N I N S T R U C T I O N S
ONDURA-9 9-Corrugatio Asphalt Roofig Sheets I N S T A L L A T I O N I N S T R U C T I O N S Thak you for choosig ONDURA-9 for your roofig project. ONDURA-9 should be carefully istalled. Mistakes i istallatio
More informationSelection of the basic parameters of the lens for the optic-electronic target recognition system
Proceedigs of the 5th WSEAS It. Cof. o COMPUTATIONAL INTELLIGENCE, MAN-MACHINE SYSTEMS AND CYBERNETICS, Veice, Italy, November 0-, 006 317 Selectio of the basic parameters of the les for the optic-electroic
More information11.11 Two-Channel Filter Banks 1/27
. Two-Chael Filter Baks /7 Two-Chael Filter Baks M We wat to look at methods that are ot based o the DFT I geeral we wat to look at Fig..6 rom Porat ad igure out how to choose i & i to get Perect Reco
More informationImprove Power Quality Using Static Synchronous Compensator with Fuzzy Logic Controller
Iprove Power Quality Usig Stati Syhroous Copesator with Fuzzy ogi Cotroller Ghazafar Shahgholia, Mehdi Mahdavia, Ai Eai, Beha Ahadzade Departet of Eletrial Egieerig, Najafabad Brah, Islai Azad Uiversity,
More informationAkinwaJe, A.T., IbharaJu, F.T. and Arogundade, 0.1'. Department of Computer Sciences University of Agriculture, Abeokuta, Nigeria
COMPARATIVE ANALYSIS OF ARTIFICIAL NEURAL NETWORK'S BACK PROPAGATION ALGORITHM TO STATISTICAL LEAST SQURE METHOD IN SECURITY PREDICTION USING NIGERIAN STOCK EXCHANGE MARKET AkiwaJe, A.T., IbharaJu, F.T.
More informationData Acquisition System for Electric Vehicle s Driving Motor Test Bench Based on VC++ *
Available olie at www.sciecedirect.com Physics Procedia 33 (0 ) 75 73 0 Iteratioal Coferece o Medical Physics ad Biomedical Egieerig Data Acquisitio System for Electric Vehicle s Drivig Motor Test Bech
More informationDesign of FPGA- Based SPWM Single Phase Full-Bridge Inverter
Desig of FPGA- Based SPWM Sigle Phase Full-Bridge Iverter Afarulrazi Abu Bakar 1, *,Md Zarafi Ahmad 1 ad Farrah Salwai Abdullah 1 1 Faculty of Electrical ad Electroic Egieerig, UTHM *Email:afarul@uthm.edu.my
More informationPRACTICAL FILTER DESIGN & IMPLEMENTATION LAB
1 of 7 PRACTICAL FILTER DESIGN & IMPLEMENTATION LAB BEFORE YOU BEGIN PREREQUISITE LABS Itroductio to Oscilloscope Itroductio to Arbitrary/Fuctio Geerator EXPECTED KNOWLEDGE Uderstadig of LTI systems. Laplace
More informationAn Adaptive FEC Code Control Algorithm for Mobile Wireless Sensor Networks
JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 7, NO. 4, DECEMBER 2005 1 A Adaptive Code Cotrol Algorithm for Mobile Wireless Sesor Networks Jog-Suk Ah, Seug-Wook Hog, ad Joh Heidema Abstrat: For better
More informationEncode Decode Sample Quantize [ ] [ ]
Referece Audio Sigal Processig I Shyh-Kag Jeg Departmet of Electrical Egieerig/ Graduate Istitute of Commuicatio Egieerig M. Bosi ad R. E. Goldberg, Itroductio to Digital Audio Codig ad Stadards, Kluwer
More informationMassachusetts Institute of Technology Dept. of Electrical Engineering and Computer Science Fall Semester, Introduction to EECS 2.
Massachusetts Istitute of Techology Dept. of Electrical Egieerig ad Computer Sciece Fall Semester, 006 6.08 Itroductio to EECS Prelab Exercises Pre-Lab#3 Modulatio, demodulatio, ad filterig are itegral
More informationDetecting Moving Targets in SAR Via Keystoning and Phase Interferometry
5 The MITRE Corporation. All rights reserved. Approved for Publi Release; Distribution Unlimited. Deteting Moving Targets in SAR Via Keystoning and Phase Interferometry Dr. P. K. Sanyal, Dr. D. M. Zasada,
More informationGENERATE AND MEASURE STANDING SOUND WAVES IN KUNDT S TUBE.
Acoustics Wavelegth ad speed of soud Speed of Soud i Air GENERATE AND MEASURE STANDING SOUND WAVES IN KUNDT S TUBE. Geerate stadig waves i Kudt s tube with both eds closed off. Measure the fudametal frequecy
More informationPARAMETER ESTIMATION FOR THE EQUATION OF THE ELECTROSTATIC DISCHARGE CURRENT USING GENETIC ALGORITHMS
PARAMETER ESTMATON FOR THE EQUATON OF THE ELECTROSTATC DSCHARGE CURRENT USNG GENETC ALGORTHMS G.P. Fotis.F. Goos.A. Stathopulos Shool of Eletrial ad Coputer Egieerig, Eletri Power Departet, High Voltage
More informationGeneral Model :Algorithms in the Real World. Applications. Block Codes
Geeral Model 5-853:Algorithms i the Real World Error Correctig Codes I Overview Hammig Codes Liear Codes 5-853 Page message (m) coder codeword (c) oisy chael decoder codeword (c ) message or error Errors
More informationLossless image compression Using Hashing (using collision resolution) Amritpal Singh 1 and Rachna rajpoot 2
Lossless image compressio Usig Hashig (usig collisio resolutio) Amritpal Sigh 1 ad Racha rajpoot 2 1 M.Tech.* CSE Departmet, 2 Departmet of iformatio techology Guru Kashi UiversityTalwadi Sabo, Bathida
More informationDepartment of Electrical and Computer Engineering, Cornell University. ECE 3150: Microelectronics. Spring Due on April 26, 2018 at 7:00 PM
Departmet of Electrical ad omputer Egieerig, orell Uiersity EE 350: Microelectroics Sprig 08 Homework 0 Due o April 6, 08 at 7:00 PM Suggested Readigs: a) Lecture otes Importat Notes: ) MAKE SURE THAT
More informationPower Optimization for Pipeline ADC Via Systematic Automation Design
Power Optimizatio for Pipelie AD ia Systematic Automatio Desig Qiao Yag ad Xiaobo Wu Abstract--A efficiet geeral systematic automatio desig methodology is proposed to optimize the power of pipelie Aalog-to-Digital
More informationAME50461 SERIES EMI FILTER HYBRID-HIGH RELIABILITY
PD-94595A AME5046 SERIES EMI FILTER HYBRID-HIGH RELIABILITY Descriptio The AME Series of EMI filters have bee desiged to provide full compliace with the iput lie reflected ripple curret requiremet specified
More informationMeasurement of Equivalent Input Distortion AN 20
Measuremet of Equivalet Iput Distortio AN 2 Applicatio Note to the R&D SYSTEM Traditioal measuremets of harmoic distortio performed o loudspeakers reveal ot oly the symptoms of the oliearities but also
More informationSingle Bit DACs in a Nutshell. Part I DAC Basics
Sigle Bit DACs i a Nutshell Part I DAC Basics By Dave Va Ess, Pricipal Applicatio Egieer, Cypress Semicoductor May embedded applicatios require geeratig aalog outputs uder digital cotrol. It may be a DC
More informationCS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73,
CS 01 Schlag Jauary 6, 1999 Witer `99 CS 01: Adversary argumets This hadout presets two lower bouds for selectio problems usig adversary argumets ëku73, HS78, FG76ë. I these proofs a imagiary adversary
More informationlecture notes September 2, Sequential Choice
18.310 lecture otes September 2, 2013 Sequetial Choice Lecturer: Michel Goemas 1 A game Cosider the followig game. I have 100 blak cards. I write dow 100 differet umbers o the cards; I ca choose ay umbers
More informationUsing Color Histograms to Recognize People in Real Time Visual Surveillance
Usig Color Histograms to Recogize People i Real Time Visual Surveillace DANIEL WOJTASZEK, ROBERT LAGANIERE S.I.T.E. Uiversity of Ottawa, Ottawa, Otario CANADA daielw@site.uottawa.ca, lagaier@site.uottawa.ca
More informationNOISE IN A SPECTRUM ANALYZER. Carlo F.M. Carobbi and Fabio Ferrini Department of Information Engineering University of Florence, Italy
NOISE IN A SPECTRUM ANALYZER by Carlo.M. Carobbi ad abio errii Departet of Iforatio Egieerig Uiversity of lorece, Italy 1. OBJECTIVE The objective is to easure the oise figure of a spectru aalyzer with
More informationAl- Mustansiriyah J. Sci. Vol. 24, No 5, 2013
Al- Mustasiriah J. Si. Vol. 4 No 5 3 Comparative Stud of Multi-Sale Retie with Adaptive ad tegrated Neighborhood-Depedet Ehaemet Methods for Captured mages at Differet Camera Aperture Eqbal Shemal Mussaa
More informationA New Design of Log-Periodic Dipole Array (LPDA) Antenna
Joural of Commuicatio Egieerig, Vol., No., Ja.-Jue 0 67 A New Desig of Log-Periodic Dipole Array (LPDA) Atea Javad Ghalibafa, Seyed Mohammad Hashemi, ad Seyed Hassa Sedighy Departmet of Electrical Egieerig,
More informationInternational Power, Electronics and Materials Engineering Conference (IPEMEC 2015)
Iteratioal Power, Electroics ad Materials Egieerig Coferece (IPEMEC 205) etwork Mode based o Multi-commuicatio Mechaism Fa Yibi, Liu Zhifeg, Zhag Sheg, Li Yig Departmet of Military Fiace, Military Ecoomy
More informationEvolution of Biped Locomotion Using Bees Algorithm, Based On Truncated Fourier Series
Otober 20-22 2010 Sa Fraiso USA Evolutio of Biped Loomotio Usig Bees Algorithm Based O ruated Fourier Series Ebrahim Yazdi Vahid Azizi Abolfazl.Haghighat Abstrat I this paper a simple Fourier series based
More informationCombined Scheme for Fast PN Code Acquisition
13 th Iteratioal Coferece o AEROSPACE SCIENCES & AVIATION TECHNOLOGY, ASAT- 13, May 6 8, 009, E-Mail: asat@mtc.edu.eg Military Techical College, Kobry Elkobbah, Cairo, Egypt Tel : +(0) 4059 4036138, Fax:
More informationA New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code
Proceedigs of the 4th WSEAS It. Coferece o Electromagetics, Wireless ad Optical Commuicatios, Veice, Italy, November 0-, 006 107 A New Space-Repetitio Code Based o Oe Bit Feedback Compared to Alamouti
More informationLaboratory Exercise 3: Dynamic System Response Laboratory Handout AME 250: Fundamentals of Measurements and Data Analysis
Laboratory Exercise 3: Dyamic System Respose Laboratory Hadout AME 50: Fudametals of Measuremets ad Data Aalysis Prepared by: Matthew Beigto Date exercises to be performed: Deliverables: Part I 1) Usig
More informationThroughput Capacity of Multi-Channel Hybrid Wireless Network with Antenna Support
Appl. Math. If. Si. 8 No. 3 1455-1460 014 1455 Applied Mathematis & Iformatio Siees A Iteratioal Joural http://dx.doi.org/10.1785/amis/080363 Throughput Capaity of Multi-Chael Hybrid Wireless Networ with
More information4. INTERSYMBOL INTERFERENCE
DATA COMMUNICATIONS 59 4. INTERSYMBOL INTERFERENCE 4.1 OBJECT The effects of restricted badwidth i basebad data trasmissio will be studied. Measuremets relative to itersymbol iterferece, usig the eye patter
More informationCross-Layer Performance of a Distributed Real-Time MAC Protocol Supporting Variable Bit Rate Multiclass Services in WPANs
Cross-Layer Performace of a Distributed Real-Time MAC Protocol Supportig Variable Bit Rate Multiclass Services i WPANs David Tug Chog Wog, Jo W. Ma, ad ee Chaig Chua 3 Istitute for Ifocomm Research, Heg
More informationSmart Energy & Power Quality Solutions. ProData datalogger. Datalogger and Gateway
Smart Eergy & Power Quality Solutios ProData datalogger Datalogger ad Gateway Smart ad compact: Our most uiversal datalogger ever saves power costs Etheret coectio Modbus-Etheret-Gateway 32 MB 32 MB memory
More informationx y z HD(x, y) + HD(y, z) HD(x, z)
Massachusetts Istitute of Techology Departmet of Electrical Egieerig ad Computer Sciece 6.02 Solutios to Chapter 5 Updated: February 16, 2012 Please sed iformatio about errors or omissios to hari; questios
More informationCh 9 Sequences, Series, and Probability
Ch 9 Sequeces, Series, ad Probability Have you ever bee to a casio ad played blackjack? It is the oly game i the casio that you ca wi based o the Law of large umbers. I the early 1990s a group of math
More informationKMXP SERIES Anisotropic Magneto-Resistive (AMR) Linear Position Sensors
SERIES Aisotropic Mageto-Resistive (AMR) Liear Positio Sesors Positio sesors play a icreasigly importat role i may idustrial, robotic ad medical applicatios. Advaced applicatios i harsh eviromets eed sesors
More informationDesign of FPGA Based SPWM Single Phase Inverter
Proceedigs of MUCEET2009 Malaysia Techical Uiversities Coferece o Egieerig ad Techology Jue 20-22, 2009, MS Garde,Kuata, Pahag, Malaysia MUCEET2009 Desig of FPGA Based SPWM Sigle Phase Iverter Afarulrazi
More informationLocation Fingerprint Positioning Based on Interval-valued Data FCM Algorithm
Available online at www.sienediret.om Physis Proedia 5 (01 ) 1939 1946 01 International Conferene on Solid State Devies and Materials Siene Loation Fingerprint Positioning Based on Interval-valued Data
More informationA Robust Image Restoration by Using Dark channel Removal Method
Volume 6, Issue 3, Marh 2017, ISSN: 2278 1323 A Robust Image Restoration by Using Dark hannel Removal Method Ankit Jain 1 (MTeh. sholar), Prof. Mahima Jain 2 Department Of Computer Siene And Engineering,
More informationPrevious R&D of vibrating wire alignment technique for HEPS
Previous R&D of vibratig wire aligmet techique for HEPS WU Lei( 吴蕾 ) 1, WANG Xiao-log( 王小龙 ) 1,3 LI Chu-hua( 李春华 ) 1 QU Hua-mi( 屈化民 ) 1,3 1 Istitute of High Eergy Physics, Chiese Academy of Scieces, Beijig
More informationCOMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS
COMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS Mariusz Ziółko, Przemysław Sypka ad Bartosz Ziółko Departmet of Electroics, AGH Uiversity of Sciece ad Techology, al. Mickiewicza 3, 3-59 Kraków, Polad,
More informationINCREASE OF STRAIN GAGE OUTPUT VOLTAGE SIGNALS ACCURACY USING VIRTUAL INSTRUMENT WITH HARMONIC EXCITATION
XIX IMEKO World Cogress Fudametal ad Applied Metrology September 6, 9, Lisbo, Portugal INCREASE OF STRAIN GAGE OUTPUT VOLTAGE SIGNALS ACCURACY USING VIRTUAL INSTRUMENT WITH HARMONIC EXCITATION Dalibor
More informationProblem of calculating time delay between pulse arrivals
America Joural of Egieerig Research (AJER) 5 America Joural of Egieerig Research (AJER) e-issn: 3-847 p-issn : 3-936 Volume-4, Issue-4, pp-3-4 www.ajer.org Research Paper Problem of calculatig time delay
More informationDelta- Sigma Modulator based Discrete Data Multiplier with Digital Output
K.Diwakar et al. / Iteratioal Joural of Egieerig ad echology (IJE Delta- Sigma Mulator based Discrete Data Multiplier with Digital Output K.Diwakar #,.ioth Kumar *2, B.Aitha #3, K.Kalaiarasa #4 # Departmet
More informationThe Eye. Objectives: Introduction. PHY 192 The Eye 1
PHY 92 The Eye The Eye Objectives: Describe the basic process of image formatio by the huma eye ad how it ca be simulated i the laboratory. Kow what measuremets are ecessary to quatitatively diagose ear-sightedess
More informationQuality Monitoring for Multipath Affected GPS Signals
Joural of Global Positioig Systems (5 Vol. 4 No. -: 5-59 Quality oitorig for ultipath Affeted GPS Sigals aurizio Fatio Fabio ovis Politeio di orio Eletrois epartmet.so ua degli Abruzzi 4 9 orio Italy e-mail:
More information(2) The MOSFET. Review of. Learning Outcome. (Metal-Oxide-Semiconductor Field Effect Transistor) 2.0) Field Effect Transistor (FET)
EEEB73 Electroics Aalysis & esig II () Review of The MOSFET (Metal-Oxide-Semicoductor Field Effect Trasistor) Referece: Neame, Chapter 3 ad Chapter 4 Learig Outcome Able to describe ad use the followig:
More informationCHAPTER 8 JOINT PAPR REDUCTION AND ICI CANCELLATION IN OFDM SYSTEMS
CHAPTER 8 JOIT PAPR REDUCTIO AD ICI CACELLATIO I OFDM SYSTEMS Itercarrier Iterferece (ICI) is aother major issue i implemetig a OFDM system. As discussed i chapter 3, the OFDM subcarriers are arrowbad
More informationCP 405/EC 422 MODEL TEST PAPER - 1 PULSE & DIGITAL CIRCUITS. Time: Three Hours Maximum Marks: 100
PULSE & DIGITAL CIRCUITS Time: Three Hours Maximum Marks: 0 Aswer five questios, takig ANY TWO from Group A, ay two from Group B ad all from Group C. All parts of a questio (a, b, etc. ) should be aswered
More informationImage Contrast Enhancement based Sub-histogram Equalization Technique without Over-equalization Noise
World Academy of Sciece, Egieerig ad Techology Iteratioal Joural of Electrical ad Computer Egieerig Image Cotrast Ehacemet based Sub-histogram Equalizatio Techique without Over-equalizatio Noise Hyusup
More information