Scalable streaming of JPEG2000 images using hypertext transfer protocol
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Channelization Problem in Large Scale Data Dissemination
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
HYPER: A Hybrid Approach to Efficient Content-Based Publish/Subscribe
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Supporting region-of-interest cropping through constrained compression
MM '08 Proceedings of the 16th ACM international conference on Multimedia
Supporting zoomable video streams with dynamic region-of-interest cropping
MMSys '10 Proceedings of the first annual ACM SIGMM conference on Multimedia systems
A hybrid multicast-unicast infrastructure for efficient publish-subscribe in enterprise networks
Proceedings of the 3rd Annual Haifa Experimental Systems Conference
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Interactive panoramic video streaming system over restricted bandwidth network
Proceedings of the international conference on Multimedia
Adaptive encoding of zoomable video streams based on user access pattern
MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems
Combining content-based analysis and crowdsourcing to improve user interaction with zoomable video
MM '11 Proceedings of the 19th ACM international conference on Multimedia
ClassX: an open source interactive lecture StreamingSystem
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Interactive Zoom and Panning from Live Panoramic Video
Proceedings of Network and Operating System Support on Digital Audio and Video Workshop
Proceedings of the 5th ACM Multimedia Systems Conference
| Hi-index | 0.00 |
We consider the following problem in this paper: A video is encoded as a set of tiles T and is streamed to multiple users via a one-hop wireless LAN. Each user selects a region-of-interest (RoI), represented as a subset of T, in the video to watch. The RoI selected by the users may overlap. Each tile may be multicast or unicast. We define the tile assignment problem as: which subset of tiles should be multicast such that every user receives, within a transmission deadline, the subset of tiles pertaining to the RoI the user selected, while minimizing the number of unwanted tiles received by users. We present and evaluate five tile assignment methods. We show that: (i) minimizing transmission delay can lead to significant wasteful reception in the multicast group, (ii) using tile access probability to assign tiles frequently leads to assignments that violate the deadline, and (iii) a fast, greedy, heuristic works well: it performs close to the optimal method and can always find an assignment within the deadline (as long as such assignment exists).