Full metadata record
DC FieldValueLanguage
dc.contributor.authorPřibyl, J.
dc.contributor.authorZemčík, P.
dc.contributor.authorBurian, T.
dc.contributor.authorKudlac, B.
dc.contributor.editorOliviera, Manuel M.
dc.contributor.editorSkala, Václav
dc.date.accessioned2014-02-04T07:55:59Z-
dc.date.available2014-02-04T07:55:59Z-
dc.date.issued2013
dc.identifier.citationWSCG 2013: Full Papers Proceedings: 21st International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision in cooperation with EUROGRAPHICS Association, p. 49-58.en
dc.identifier.isbn978-80-86943-74-9
dc.identifier.urihttp://wscg.zcu.cz/WSCG2013/!_2013-WSCG-Full-proceedings.pdf
dc.identifier.urihttp://hdl.handle.net/11025/10594
dc.description.abstractData transfers scheduling is an important part of almost all distributed virtual walkthrough (DVW) applications. Its main purpose is to preserve data transfer efficiency and render quality during scene exploration. The most limiting factors here are network restrictions such as low bandwidth and high latency. Current scheduling algorithms use multi-resolution data representation, priority determination and data prefetching algorithms to minimize these restrictions. Advanced priority determination and data prefetching methods for DVW applications use mathematic description of motion to predict next position of each individual user. These methods depend on the recent motion of a user so that they can accurately predict only near locations. In the case of sudden but regular changes in user motion direction (road networks) or fast moving user, these algorithms are not sufficient to predict future position with required accuracy and at required distances. In this paper we propose a systematic solution to scheduling of data transfer for DVW applications which uses next location prediction methods to compute download priority or additionally prefetch rendered data in advance. Experiments show that compared to motion functions the proposed scheduling scheme can increase data transfer efficiency and rendered image quality during scene exploration.en
dc.format10 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesWSCG 2013: Full Papers Proceedingsen
dc.rights© Václav Skala - UNION Agencyen
dc.subjectdistribuovaný virtuální průchodcs
dc.subjectpohybová funkcecs
dc.subjectMarkovův řetězeccs
dc.subjectvirtuální prostředícs
dc.subjectpřenosy datcs
dc.titleA Motion-aware Data Transfers Scheduling for Distributed Virtual Walkthrough Applicationsen
dc.typekonferenční příspěvekcs
dc.typeconferenceObjecten
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.subject.translateddistributed virtual walkthroughen
dc.subject.translatedmotion functionen
dc.subject.translatedMarkov chainen
dc.subject.translatedvirtual environmentsen
dc.subject.translateddata transfersen
dc.type.statusPeer-revieweden
dc.type.driverinfo:eu-repo/semantics/conferenceObjecten
dc.type.driverinfo:eu-repo/semantics/publishedVersionen
Appears in Collections:WSCG 2013: Full Papers Proceedings

Files in This Item:
File Description SizeFormat 
Pribyl.pdfPlný text1,85 MBAdobe PDFView/Open


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/10594

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.