Remote display of large raster images using JPEG2000 and the rectangular FishEye-View

Size: px
Start display at page:

Download "Remote display of large raster images using JPEG2000 and the rectangular FishEye-View"

Transcription

1 Remote dsplay of large raster mages usng JPEG2000 and the rectangular FshEye-Vew René Rosenbaum* Insttute of Computer Graphcs Unversty of Rostock Rostock Germany Davd S. Taubman School of Electr. Engneerng&Telecommuncaton Unversty of New South Wales Sydney 2052, N.S.W. Australa ABSTRACT In moble envronments, the sze of large raster mages often exceeds the dsplay area on small output devces. The rectangular FshEye-Vew as a Focus&Context technque can be used to provde an nteractve vew of the mage wthout zoomng and pannng. Ths paper presents the applcaton of JPEG2000 for the demand-drven transmsson of mage data optmzed for ths dsplay technque. The proposed method s fully complant to the JPEG2000 standard and enhances ts statc concept for regons of nterest to be fully dynamc. Due to lmted processng power at clent sde almost all calculatons belongng to the dynamc RoI-codng are executed at server sde. Keywords JPEG2000, regons of nterest (RoI), rectangular FshEye-Vew, mage codng, mage transmsson. 1. INTRODUCTION In moble envronments, the sze of large mages often exceeds the dsplay area of the user's output devce. The method commonly used to present such mages s to allow nteractve pan and zoom by the vewer. An mportant drawback of ths conventonal paradgm s that the dsplay cannot smultaneously provde nformaton about the user's regon of nterest, as well as surroundng areas. Whle the user can pan to new locatons, contextual nformaton, dentfyng the poston of the vew wthn the mage, s lost. These dffcultes become partcularly apparent when workng wth the small dsplays typcally avalable to moble devces. To overcome these drawbacks, dsplay technques from nformaton vsualzaton can also be appled to mage data. One of these methods s the FshEye- Permsson to make dgtal or hard copes of all or part of ths work for personal or classroom use s granted wthout fee provded that copes are not made or dstrbuted for proft or commercal advantage and that copes bear ths notce and the full ctaton on the frst page. To copy otherwse, or republsh, to post on servers or to redstrbute to lsts, requres pror specfc permsson and/or a fee. Journal of WSCG, Vol.11, No.1., ISSN WSCG 2003, February 3-7, 2003, Plzen, Czech Republc. Copyrght UNION Agency Scence Press Vew ntroduced by Furnas [Fur81] to dsplay large structures effcently. Ths general approach can also be appled to raster mages [Rau99]. It belongs to the group of Focus&Context technques, whch dsplay the user's current man area of nterest n an undstorted focus regon. Ths focus regon s embedded n a spatally dstorted representaton of the remanng mage areas. In ths way, the user receves both the nformaton whch s of prncple nterest and useful context nformaton for orentaton and further navgaton. Ths strategy substantally facltates nteractve navgaton wthn large mages. To dstngush between the mportance of dfferent mage regons, the concepts of regons of nterest (RoI) and level of detal (LoD), as proposed n [RS99], are used. In moble envronments the mage data must be often transmtted n compressed form before t can be dsplayed. Progressve refnement of the compressed representaton s a partcularly useful feature, snce t provdes an nteractve user at any gven pont n the transmsson wth a prevew of the whole mage nformaton. As explaned n Secton 2, the proposed rectangular FshEye-Vew s coupled wth a transmsson system whch supports compresson and *Thanks to German Academc Exchange Servce and Unversty of New South Wales for supportng the research.

2 Fgure 1. The rectangular FshEye-Vew. an adapted progressve refnement. Secton 3 serves to famlarze the reader wth relevant aspects of the JPEG2000 compresson standard, adopted for our work. Secton 4 ntroduces a new approach for dynamc regon of nterest codng n JPEG2000, and descrbes how t can be used especally for the rectangular FshEye-Vew. Our proposal s completed by presentng results and a concluson n Sectons 5 and THE RECTANGULAR FISHEYE- VIEW Focus&Context technques are based on the reasonable assumpton that a user's degree of nterest decreases wth dstance from the focus regon. Accordngly, the rectangular FshEye-Vew apples varyng degrees of dstorton to dfferent parts of the mage, startng wth less dstorton near the focus regon, and progressng to strong dstorton near the borders of the avalable dsplay. These dstortons amount to selectve scalng (compacton) of rectangular regons from the orgnal mage, as llustrated n Fgures 1 and 2. Specfcally, the orgnal mage data s classfed nto separate RoI's each of whch s assgned a par of scalng factors, denoted H:V. Therefore, each orgnal mage regon s scaled horzontally by 1/H and vertcally by 1/V. As may be seen from the fgures, the choce of scalng factors s not completely arbtrary, snce the overall transformaton from orgnal mage to dsplay must preserve contnuty at the regon boundares. In addton to scalng parameters, each rectangular RoI may also be assgned a separate prorty value, whch s used to determne the order n whch compressed data wll be transmtted from server to clent. In order to maxmze the perceved mpact of progressve refnement, the underlyng transmsson system delvers hgher prorty mage data (e.g., the focus regon) earler than lower prorty data (context data). As the transmtted data arrves, t can be ncrementally decompressed and rendered to the user's dsplay. The exact nature of prorty values, and the way n whch they are used to control the sequence of transmtted data, s descrbed later n Secton 4. Snce some of the regons wll be scaled at clent sde, pror to dsplay n the rectangular FshEye-Vew, not all of the orgnal mage nformaton assocated wth those regons can be used. As an example, the upper left hand regon shown n Fgure 2 has scalng factors 4:4, meanng that only one quarter of the orgnal resoluton can actually be used, n each drecton. As we shall see, the multresoluton propertes of the Dscrete Wavelet Transform (DWT) employed by JPEG2000 may be exoted to transmt only the nformaton whch s actually relevant to the dstorted FshEye-Vew. 3. JPEG2000 In ths secton, we descrbe some of the most relevant features of the JPEG2000 mage compresson standard [J2kBA]. Whle JPEG2000 does generally provde superor compresson effcency to that of JPEG, ts most sgnfcant advantages rest wth ts support for progressve refnement of the mage nformaton n both resoluton and qualty, along wth ts support for regon of nterest access to the mage. Fgure 2. Appled scalng to the dfferent regons of nterest n X and Y drecton.

3 3.1 Multresoluton Decomposton and Compresson The JPEG2000 standard employs a dyadc multresoluton transform, known as the Dscrete Wavelet Transform (DWT) to analyze the mage nto a collecton of subband mages, each of whch contans nformaton from dfferent spatal frequency bands. Each successve resoluton level n the mage representaton conssts of three detal subbands, whch augment the nformaton avalable from the prevous resoluton level, havng half the number of samples n each drecton. One detal subband contans the nformaton requred to double the mage resoluton n the horzontal drecton; another contans the nformaton requred to double the resoluton vertcally; whle the thrd completes the nformaton requred to double the resoluton n both drectons. Fgure 3 llustrates the detal bands assocated wth two resoluton levels, together wth a separate lowest resoluton mage (top left n the fgure). The DWT coeffcents n each subband are further sub-dvded nto code-blocks, each of whch s ndependently encoded. The encoded code-block btstreams are then grouped nto contaners called precncts. Each precnct contans a number of correspondng code-blocks from every subband of a sngle resoluton level (Fg.3). Precncts form the base for the creaton of the fnal compressed btstream, whch s explaned n the next subsecton. 3.2 JPEG2000 Btstream Formaton Precnct structures play an mportant role n enablng resoluton- and regon-based access to JPEG2000 compressed mages. The precncts can have dfferent dmensons n each resoluton level and are used to lay down rules for the creaton of packets, whch form the fnal btstream. To allow progressve refnement of the mage representaton, the encoded data assocated wth each code-block s spread over a number of layers. Ths s generally done by an optmzaton procedure, whch ams to unformly ncrease the mage qualty by smlar perceptual ncrements n each successve layer. The fnal JPEG2000 btstream s constructed by concatenatng a lst of so-called packets, where each packet represents the compressed data contrbutons to a sngle layer, from code-blocks belongng to a sngle precnct. Thus, each precnct contrbutes one packet for each layer. Fgure 3. Multresoluton decomposton n JPEG2000 usng dfferent scalng values (blue: subband areas belongng to a sngle precnct). In the next secton, we brefly revew exstng proposed methods for adaptng the mage data transmsson, based on RoI's. 3.3 Regons of Interest n JPEG2000 In most of the proposed schemes for RoI encodng n JPEG2000, the supported regon has to be defned durng the mage encodng process [J2kBA,J2k2A,WBEB02,GCT00]. Ths has the drawback that the RoIs cannot easly be defned dynamcally, n accordance wth a user's nterests. One scheme has been proposed n [RSI02] to support dynamc regons of nterest. Here, JPEG2000's flexble packet syntax s used to adjust the sequence n whch compressed data packets are transmtted, so as to reflect the relevance of dfferent precncts to a regon of nterest. Even though the order of the compressed data s determned dynamcally, the transmtted nformaton always consttutes a complant JPEG2000 btstream, whch can be reconstructed and rendered progressvely usng a complant JPEG2000 decoder. No further RoI handlng s requred at the clent sde, and the decompressed data s sutable for dsplay wthn a rectangular FshEye-Vew. The next secton s concerned wth partcular consderatons for enhancng the effcency and sequencng of transmtted nformaton to be used wth the FshEye- Vew.

4 4. DYNAMIC ROIS FOR THE FISHEYE-VIEW The basc dea of our approach s the prortzed transmsson of JPEG2000 packets, so as to mprove the effcency and rate of refnement of relevant regons n the FshEye-Vew. It s helpful to dfferentate between refnement n resoluton and refnement n qualty. Wth regard to resoluton, we take advantage of the fact that not all of the orgnal mage resoluton wll actually be dsplayed n nonfocal regons -- those wth scalng factors H > 1or V > 1. Ths means that some orgnal mage subbands can be dscarded n such regons, wthout any loss of nformaton. We use the term Level of Detal (LoD) and refer to the collecton of DWT subbands whch are relevant to the FshEye-Vew n any gven regon as the fnal LoD. These are the subbands, b, whose scalng factors H b : V (see Fg.3) satsfy b H b H or V b V, where H : V are the scalng factors for the regon. By prunng the transmtted nformaton to avod data whch les beyond the fnal LoD, valuable transmsson bandwdth can be saved. Wth regard to qualty, we take advantage of the fact that the perceved mpact of any gven layer on vsual qualty s generally lower n the context regons than the focus regon. Equvalently, unform perceved mage qualty generally nvolves a smaller number of layers for precncts whch contrbute only to the context regon than for precncts whch contrbute to the focus regon. One reason for ths s smply that the focus regon s by defnton more mportant to the nteractve user. Another reason s that non-focus regons are scaled. Scalng an mage regon by factors H : V reduces the mpact of quantzaton on mean squared error n the rendered mage by the factor HV. Although formal means may be derved for accommodatng ths later phenomenon through a resequencng of the orgnal packets, t s less clear how the former aspect should be accommodated n a rgorous manner. For the purpose of the presented study, a smple prortzaton scheme s employed to determne the number of layers from a context regon whch should be consdered perceptually smlar to a number of layers from the focus regon. To create a complant RoI-enhanced btstream whch can be easly decoded at clent-sde, our approach s based on [RSI02]. The orgnal mage s compressed only once, nto a JPEG2000 compressed btstream, whch can be used to serve clents wth dfferent focus regons. For any gven rectangular FshEye- Vew, specfed by the remote clent, a server determnes the RoIs, ther scalng values and ther fnal LoDs. For each RoI and each resoluton, the server determnes the set of precncts from that regon whch contrbute (ether completely, or n part) to the RoI. A precnct contrbutes to the RoI f ts spatal regon of support overlaps wth that of the RoI and ts resoluton contans one or more subbands whch belong to the RoI's fnal LoD. The set of contrbutng precncts determnes the collecton of packets from the orgnal compressed mage btstream whch are relevant to the FshEye- Vew. An RoI-scheduler then determnes the order n whch these packets are to be transmtted. The RoIenhanced btstream s created layer-wse, startng wth the lowest layer. To ensure that the sequence of constructed layers forms a complant JPEG2000 btstream, each layer must contan at least a place holder for every packet n the orgnal mage. However, only the contrbutng precncts are assgned non-empty packets n the current layer. All other precncts are assgned empty packets, whch contrbute no compressed data from ther code-blocks to the layer beng constructed. In order to explot the dfferent prorty assocated wth precncts whch contrbute to dfferent RoIs, the scheduler generally creates a transmtted btstream whch contans more layers than the orgnal btstream. The frst layer created by the scheduler contans all frst packets from those precncts whch contrbute to the hghest prorty RoI (the focus regon), wth all other packets empty. Subsequent layers created by the scheduler contan later packets from the precncts whch contrbute to the hghest prorty RoI and earler packets from the precncts whch contrbute only to lower prorty RoIs (context). For our current work, a smple prortzaton scheme s mplemented, wth each precnct,, assgned an nteger prorty ndex, p. Suppose that the ndex of the frst layer not yet transmtted from precnct s l { 1 l < L}, where L represents the number of layers n the orgnal JPEG2000 data stream. When the scheduler creates a new layer for transmsson, t ncludes a new packet for precnct only f ths s a contrbutng precnct and l p l p for all contrbutng precncts, j. Ths polcy gves a regon r, havng hgher prorty, a compettve edge of a pa p b layers over a regon r, havng lower b prorty. As descrbed n Secton 3.1 every packet contans mage nformaton from every subband of a resoluton level. Thus, a certan packet may contan more mage data than necessary to refne a scaled regon. Ths happens n every RoI where the fnal LoD contans some but not all subbands from a j j

5 resoluton level. These RoIs have scalng factors H : V wth H V. To avod such redundant transmsson, t s necessary to generate new compressed data packets, whch contan non-empty contrbutons only from the code-blocks whch belong to subbands wthn the fnal LoD. The server can perform the necessary repacketzaton of codeblock contrbutons at some expense n computatonal complexty and sgnalng overhead wthn the JPEG2000 packet headers. As we shall see n the next secton, however, ths repacketzaton can have a sgnfcant benefcal mpact on the effcency wth whch data s transmtted for the FshEye-Vew. The dynamcally created packets can be scheduled n the same manner descrbed prevously. Note, however, that the RoI-schedulng task becomes more complex, snce t must keep track of both orgnal mage packets whch have been fully transmtted, and also orgnal packets whch have been only partally transmtted. Later changes n the user's focus regon may requre these partal packets to be completed by the transmsson of addtonal complementary packets. 5. RESULTS To demonstrate the effectveness of the proposed approach, we have mplemented a clent/server mage transmsson archtecture wth a b-drectonal communcaton. The clent smply conssts n a GUI, to defne and dsplay the rectangular FshEye-Vew, a JPEG2000-complant decoder to convert ncomng mage data, and a communcaton component to handle data transmsson from the server and the delvery of request parameters to the server. The server ncludes a transcodng element, whch dynamcally transcodes an orgnal btstream nto one wth the RoI-enhanced layerng, as descrbed above. The transcoded RoI-enhanced layers are transmtted to the clent packet by packet, n a sequence whch s compatble wth the JPEG2000 data stream syntax. We use the Kakadu JPEG2000 tools [Kak02] to accomplsh ths dynamc transcodng, ncludng, where necessary, the repacketzaton operatons descrbed n the prevous secton. Fgures 4 and 5 present numercal results whch ndcate the mpact of the proposed dynamc RoIs on transmsson effcency. The upper curve, marked orgnal n each of the fgures, corresponds to the orgnal transmsson scheme proposed n [RSI02]. In ths scheme, all nformaton relevant to the FshEye- Vew must eventually be transmtted to the clent. A second curve n each fgure dentfes the performance of our proposed transmsson scheme, where orgnal packets are not sub-dvded to accommodate dfferences n the horzontal and Fgure 4. The length of a layer ncreases wth the number of non-empty packets to nclude. vertcal scalng factors. The thrd, lowest curve, n each fgure corresponds to the proposed scheme, usng repacketzaton to avod the transmsson of subbands whch do not belong to the fnal LoD of any RoI. Both fgures correspond to the same mage, RoI parameters, and transmsson sequence, wth Fgure 4 dentfyng the sze of each transmtted RoI-enhanced layer, and Fgure 5 dentfyng the cumulatve sze of the layers. The orgnal mage consdered here has a Fgure 5. Comparson of the dfferent methods usng the length of the fnal btstream.

6 sze of , and a compressed representaton of length 727 kb, consstng of 9 layers, wth 2 levels of DWT decomposton, as n Fgure 3. Addtonally, we use precncts of sze n the spatal doman and shrnk ths sze progressvely for precncts n lower resoluton levels, by factor 2 n each drecton. Thus, precncts n every resoluton level contrbute to a spatal area of approxmately the same sze. Ths polcy for szng precncts lmts the extent of ther spatal contrbuton and helps to speed up our mplementaton. The cumulatve bt-rate assocated wth each successve layer n the orgnal btstream s 2 tmes that of the prevous layer. The focus regon for the FshEye-Vew has been placed n the center of the mage, havng 1/8 of the full mage wdth and heght. A prortzaton ndex, p, of 3 s assgned to the precncts whch contrbute to the focus regon. The prortzaton ndex s reduced to 1 n the frst context belt (regons scaled by at most 2 n ether drecton), and 0 n the outer belt (regons scaled by at most 4 n any drecton). Accordngly, the fnal RoI-enhanced btstream contans 12 layers. The results presented n Fgures 4 and 5 are easly understood. The orgnal scheme produces the largest layers, and hence has the lowest transmsson effcency, because all subbands from all resolutons must be ncluded n both focus and context regons. The performance of the FshEye-adapted transmsson scheme s clearly superor, and most notably so when repacketzaton s used to avod redundant transmsson of subbands whch are not relevant to the scaled RoIs. From Fgure 4 we see that the rato between the most and least effcent transmsson schemes can be as large as 4.5:1. Ths s because RoIs whch have large scalng factors generally represent the largest porton of the orgnal mage, and these are the very RoIs whch stand to beneft most from the proposed FshEye-adapted transmsson scheme. Evdently, the effect of FshEye adaptaton s sgnfcant only n the later layers. Ths s because the prortzaton scheme delays the schedulng of context nformaton untl later layers; FshEye adaptaton affects only the packets whch belong to the context regon, not the unscaled focus regon. The strong ncrement n transmtted length observed at layer 4 corresponds to the frst appearance of packets from the second belt; these represent the largest regon on the orgnal mage. The cumulatve layer szes presented n Fgure 5 are perhaps more ndcatve of the overall mpact of our proposed transmsson scheme, revealng a maxmum overall gan of approxmately 3:1 n transmsson effcency relatve to the orgnal approach. Wth regard to objectve and subjectve qualty, the decoded and dsplayed FshEye-Vew mage appears to be almost dentcal (cp. Fgure 6) usng all three methods compared n Fgures 4 and 5. Ths confrms our asserton that subbands not belongng to a regon's fnal LoD can be safely omtted. (orgnal) (non-dvded) (dvded) Fgure 6. The scaled mage content appears almost dentcal for all three methods f dsplayed wthn FshEye-Vew. Dvdng packets nto ther subband contrbutons places ncreased demands on the server's computatonal resources. The addtonal state memory requred to keep track of these subband contrbutons, also places demands on the server's resources. Nevertheless, even low powered servers can beneft from our proposed approach to delverng orgnal undvded packets, snce fewer packets must be handled than n the orgnal case. Regardng processng at the clent sde, both the proposed approach wth undvded packets and the proposed approach wth full repacketzaton tend to reduce the clent's complexty, snce they reduce the amount of data whch must be decoded. Wth the orgnal scheme, a consderable amount of data may be decoded whch does not substantally contrbute to the rendered FshEye-Vew. In fact, the lowest clent complexty s acheved when the server repacketzes all orgnal packets whch contrbute only partally to the fnal LoD. Even though the results presented here suggest that sgnfcant gans n transmsson effcency can be obtaned by a FshEye-adapted transmsson scheme, t s worth notng that we are unable to fully elmnate the transmsson of redundant nformaton for regons

7 wth certan scalng parameters. As shown n Fgure 2, the FshEye-Vew nvolves some RoIs whose horzontal and vertcal scalng parameters can dffer by a factor greater than 2. Unfortunately, the JPEG2000 decomposton scheme (see Fg.3) supports dfferent horzontal and vertcal resolutons only up to a factor of 2, so we are forced to transmt redundant nformaton for some regons. Consder, for example, a regon wth scalng parameters 4:1, as shown n Fgure 2. Such a regon must be reconstructed at 1/4 the orgnal resoluton n the horzontal drecton, but at full resoluton vertcally. Ths suggests that only the subbands marked 4:4, 4:2 and 2:1 n Fgure 3 need actually be sent to the decoder. The total number of transmtted subband samples n ths case s 3/8 of the orgnal mage samples, whle a perfectly effcent scheme would send only 1/4 the orgnal samples. Ths necesstates a transmsson of 1/8 more mage samples, but ensures that our approach s stll JPEG2000-complant. 6. CONCLUSIONS In ths paper, we have proposed new methods for transmttng a JPEG2000-complant btstream, so as to allow effcent remote browsng of large mages, usng a rectangular FshEye-Vew. Ths method s based on the successve creaton of new JPEG2000 layers, usng already encoded packets from an orgnal compressed mage. After each layer has been dynamcally created, t can be transmtted mmedately to the clent. Ths can be done wthout regard for the effect whch future clent nteracton may have on the packets to be ncluded n subsequent layers. The resultng stream of transmtted data can be decoded by a complant JPEG2000 decoder, at any pont n the transmsson process, allowng progressve refnement of the dsplayed FshEye- Vew. To avod the transmsson of redundant mage data, we assgn a fnal LoD to each regon of the FshEye- Vew, based on the scalng dstortons assocated wth that regon. Only mage data whch contrbutes to the refnement of ths LoD s consdered for transmsson. Ths strategy saves sgnfcant transmsson bandwdth, wthout damagng the vsual propertes of the mage, rendered wthn the FshEye-Vew. The JPEG2000 standard further allows an ntellgent server to repacketze the orgnal compressed data on the fly, so as to elmnate specfc subbands whch do not contrbute to any fnal LoDs. Our experments show that ths can lead to further mprovements n transmsson effcency, at the expense of some addtonal computaton and state management memory n the server. 7. REFERENCES [Fur81] Furnas, G. W.: "The FISHEYE vew: a new look at structured fles", Bell Laboratores Tech. Report, Murray Hll, New Jersey, [Rau99] Rauschenbach, U. The rectangular FshEye Vew as an effcent method for the transmsson and dsplay of large mages, n Proceedngs of IEEE-ICIP'99, Kobe, Japan, [RS99] Rauschenbach, U., Schumann, H. Demanddrven Image Transmsson wth Levels of Detal and Regons of Interest, Computers and Graphcs, Vol23/6, December, [J2kBA] JPEG2000 mage codng system, part1, Fnal Publcaton Draft, ISO/IEC JTC 1/SC29/WG 1 N2678, 19, July [J2k2A] JPEG2000 mage codng system, part2, Fnal Publcaton Draft, ISO/IEC JTC 1/SC29/WG 1 N2679, 19 July [WBEB02] Wang, Z., Banerjee, S., Evans, B., Bovk, A. Generalzed btplane-by-btplane shft method for jpeg2000 RoI codng, n Proc. IEEE- ICIP 02, Rochester, N.Y., September [GCT00] Grosbos, R., Santa Cruz, D., Ebrahm, T., New approach to jpeg2000 complant regon of nterest codng, SPIE 46th annual meetng, Applcatons of Dgtal Image Processng, July [RSI02] Rosenbaum, R., Schumann, H., Flexble, dynamc and complant regon of nterest codng n JPEG2000, n Proc. IEEE-ICIP02, Rochester, N.Y., September [Kak02] KAKADU, a comprehensve, heavly optmzed, fully complant software toolkt for JPEG2000 developers, Verson 3.3,

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Dynamic Code Block Size for JPEG 2000

Dynamic Code Block Size for JPEG 2000 Dynamc Code Block Sze for JPEG 2000 Png-Sng Tsa a, Yann LeCornec b a Dept. of Computer Scence, Unv. of Texas Pan Amercan, 1201 W. Unv. Dr., Ednburg, TX USA 78539-2999; b Sgma Desgns, Inc., 1778 McCarthy

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Effect of Single and Multiple ROI Coding on JPEG2000 Performance

Effect of Single and Multiple ROI Coding on JPEG2000 Performance I.J. Image, Graphcs and Sgnal Processng, 016, 4, 9-38 Publshed Onlne Aprl 016 n MECS (http://www.mecs-press.org/) DOI: 10.5815/jgsp.016.04.04 Effect of Sngle and Multple ROI Codng on JPEG000 Performance

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

More information

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Shape-adaptive DCT and Its Application in Region-based Image Coding

Shape-adaptive DCT and Its Application in Region-based Image Coding Internatonal Journal of Sgnal Processng, Image Processng and Pattern Recognton, pp.99-108 http://dx.do.org/10.14257/sp.2014.7.1.10 Shape-adaptve DCT and Its Applcaton n Regon-based Image Codng Yamn Zheng,

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL

COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL Nader Safavan and Shohreh Kasae Department of Computer Engneerng Sharf Unversty of Technology Tehran, Iran skasae@sharf.edu

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Network-Driven Layered Multicast with IPv6

Network-Driven Layered Multicast with IPv6 Network-Drven Layered Multcast wth IPv6 Ho-pong Sze and Soung C. Lew Department of Informaton Engneerng, The Chnese Unversty of Hong Kong, Shatn, N.T., Hong Kong {hpsze8, soung}@e.cuhk.edu.hk Abstract.

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video End-to-end Dstorton Estmaton for RD-based Robust Delvery of Pre-compressed Vdeo Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna, Santa

More information

An Image Compression Algorithm based on Wavelet Transform and LZW

An Image Compression Algorithm based on Wavelet Transform and LZW An Image Compresson Algorthm based on Wavelet Transform and LZW Png Luo a, Janyong Yu b School of Chongqng Unversty of Posts and Telecommuncatons, Chongqng, 400065, Chna Abstract a cylpng@63.com, b y27769864@sna.cn

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Real-time interactive applications

Real-time interactive applications Real-tme nteractve applcatons PC-2-PC phone PC-2-phone Dalpad Net2phone vdeoconference Webcams Now we look at a PC-2-PC Internet phone example n detal Internet phone over best-effort (1) Best effort packet

More information

Efficient Broadcast Disks Program Construction in Asymmetric Communication Environments

Efficient Broadcast Disks Program Construction in Asymmetric Communication Environments Effcent Broadcast Dsks Program Constructon n Asymmetrc Communcaton Envronments Eleftheros Takas, Stefanos Ougaroglou, Petros copoltds Department of Informatcs, Arstotle Unversty of Thessalonk Box 888,

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

CHAPTER 3 ENCODING VIDEO SEQUENCES IN FRACTAL BASED COMPRESSION. Day by day, the demands for higher and faster technologies are rapidly

CHAPTER 3 ENCODING VIDEO SEQUENCES IN FRACTAL BASED COMPRESSION. Day by day, the demands for higher and faster technologies are rapidly 65 CHAPTER 3 ENCODING VIDEO SEQUENCES IN FRACTAL BASED COMPRESSION 3.1 Introducton Day by day, the demands for hgher and faster technologes are rapdly ncreasng. Although the technologes avalable now are

More information

Video Proxy System for a Large-scale VOD System (DINA)

Video Proxy System for a Large-scale VOD System (DINA) Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Adapting Multimedia Internet Content for Universal Access

Adapting Multimedia Internet Content for Universal Access Adaptng Multmeda Internet Content for Unversal Access Rakesh Mohan, John R. Smth and Chung-Sheng L IBM T.J. Watson Research Center PO Box 704, Yorktown Heghts, NY 10598 {rakesh, jrsmth, csl}@watson.bm.com

More information

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES Ruxandra Olmd Faculty of Mathematcs and Computer Scence, Unversty of Bucharest Emal: ruxandra.olmd@fm.unbuc.ro Abstract Vsual secret sharng schemes

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

ARTICLE IN PRESS. Signal Processing: Image Communication

ARTICLE IN PRESS. Signal Processing: Image Communication Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Improved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment

Improved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment JOURNAL OF COMPUTERS, VOL. 4, NO. 9, SEPTEMBER 2009 873 Improved Resource Allocaton Algorthms for Practcal Image Encodng n a Ubqutous Computng Envronment Manxong Dong, Long Zheng, Kaoru Ota, Song Guo School

More information

Robust Classification of ph Levels on a Camera Phone

Robust Classification of ph Levels on a Camera Phone Robust Classfcaton of ph Levels on a Camera Phone B.Y. Loh, N.K. Vuong, S. Chan and C.. Lau AbstractIn ths paper, we present a new algorthm that automatcally classfes the ph level on a test strp usng color

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Image Content Dependent Compression of SAR Data

Image Content Dependent Compression of SAR Data Image Content Dependent Compresson of SAR Data Ursula Benz, Jens Fscher, Gunther Jäger Deutsches Zentrum für Luft- und Raumfahrt (DLR) e.v. P.O. Box 1116, D-82230 Wesslng, Germany Tel: ++49 08153 28 2312,

More information

Classification Based Mode Decisions for Video over Networks

Classification Based Mode Decisions for Video over Networks Classfcaton Based Mode Decsons for Vdeo over Networks Deepak S. Turaga and Tsuhan Chen Advanced Multmeda Processng Lab Tranng data for Inter-Intra Decson Inter-Intra Decson Regons pdf 6 5 6 5 Energy 4

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

An optimized workflow for coherent noise attenuation in time-lapse processing

An optimized workflow for coherent noise attenuation in time-lapse processing An optmzed workflow for coherent nose attenuaton n tme-lapse processng Adel Khall 1, Hennng Hoeber 1, Steve Campbell 2, Mark Ibram 2 and Dan Daves 2. 1 CGGVertas, 2 BP 75 th EAGE Conference & Exhbton ncorporatng

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

SAO: A Stream Index for Answering Linear Optimization Queries

SAO: A Stream Index for Answering Linear Optimization Queries SAO: A Stream Index for Answerng near Optmzaton Queres Gang uo Kun-ung Wu Phlp S. Yu IBM T.J. Watson Research Center {luog, klwu, psyu}@us.bm.com Abstract near optmzaton queres retreve the top-k tuples

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION 1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute

More information

Private Information Retrieval (PIR)

Private Information Retrieval (PIR) 2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more

More information

SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS

SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS J.H.Guan, F.B.Zhu, F.L.Ban a School of Computer, Spatal Informaton & Dgtal Engneerng Center, Wuhan Unversty, Wuhan, 430079,

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Local Quaternary Patterns and Feature Local Quaternary Patterns

Local Quaternary Patterns and Feature Local Quaternary Patterns Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents

More information

Interactive Multiresolution Surface Viewing

Interactive Multiresolution Surface Viewing Interactve Multresoluton Surface Vewng Andrew Certan z Jovan Popovć Tony DeRose Tom Duchamp Davd Salesn Werner Stuetzle y Department of Computer Scence and Engneerng Department of Mathematcs y Department

More information

2 optmal per-pxel estmate () whch we had proposed for non-scalable vdeo codng [5] [6]. The extended s shown to accurately account for both temporal an

2 optmal per-pxel estmate () whch we had proposed for non-scalable vdeo codng [5] [6]. The extended s shown to accurately account for both temporal an Scalable Vdeo Codng wth Robust Mode Selecton Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna Santa Barbara, CA 906 Abstract We propose

More information

Random Kernel Perceptron on ATTiny2313 Microcontroller

Random Kernel Perceptron on ATTiny2313 Microcontroller Random Kernel Perceptron on ATTny233 Mcrocontroller Nemanja Djurc Department of Computer and Informaton Scences, Temple Unversty Phladelpha, PA 922, USA nemanja.djurc@temple.edu Slobodan Vucetc Department

More information

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

Background Removal in Image indexing and Retrieval

Background Removal in Image indexing and Retrieval Background Removal n Image ndexng and Retreval Y Lu and Hong Guo Department of Electrcal and Computer Engneerng The Unversty of Mchgan-Dearborn Dearborn Mchgan 4818-1491, U.S.A. Voce: 313-593-508, Fax:

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Time-Varying Volume Geometry Compression with 4D Lifting Wavelet Transform

Time-Varying Volume Geometry Compression with 4D Lifting Wavelet Transform Tme-Varyng Volume Geometry Compresson wth 4D Lftng Wavelet Transform Yan Wang and Heba Hamza NSF Center for e-desgn, Unversty of Central Florda, Orlando, FL 32816-2996, USA {wangyan, hhamza}@mal.ucf.edu

More information