Dynamic overlay multicast in 3D video collaborative systems
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
Next generation session management for 3D teleimmersive interactive environments
Multimedia Tools and Applications
Color-plus-depth level-of-detail in 3D tele-immersive video: a psychophysical approach
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Multi-stream 3D video distribution over peer-to-peer networks
Image Communication
CZLoD: A psychophysical approach for 3D tele-immersive video
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special section of best papers of ACM multimedia 2011, and special section on 3D mobile multimedia
Prioritized evolutionary optimization in open session management for 3D tele-immersion
Proceedings of the 4th ACM Multimedia Systems Conference
OSM: Prioritized evolutionary QoS optimization for interactive 3D teleimmersion
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special issue of best papers of ACM MMSys 2013 and ACM NOSSDAV 2013
3DTI amphitheater: a manageable 3DTI environment with hierarchical stream prioritization
Proceedings of the 5th ACM Multimedia Systems Conference
| Hi-index | 0.00 |
3D tele-immersion (3DTI) has recently emerged as a new way of video-mediated collaboration across the Internet. Unlike conventional 2D video-conferencing systems, it can immerse remote users into a shared 3D virtual space so that they can interact or collaborate "virtually". However, most existing 3DTI systems can support only two sites of collaboration, due to the huge demand of networking resources and the lack of a simple yet efficient data dissemination model. In this paper, we propose to use a general publish-subscribe model for multi-site 3DTI systems, which efficiently utilizes limited network resources by leveraging user interest. We focus on the overlay construction problem in the publish-subscribe model by exploring a spectrum of heuristic algorithms for data dissemination. With extensive simulation, we identify the advantages of a simple randomized algorithm. We present optimization to further improve the randomized algorithm by exploiting semantic correlation. Experimental results demonstrate that we can achieve an improvement by a factor of five.