检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:韩圣千[1] 娄函 王君来 HAN Shengqian;LOU Han;WANG Junlai(School of Electronic Information Engineering,Beihang University,Beijing 100191,China)
机构地区:[1]北京航空航天大学电子信息工程学院,北京100191
出 处:《通信学报》2022年第7期102-112,共11页Journal on Communications
基 金:国家自然科学基金资助项目(No.61871015)。
摘 要:为了刻画虚拟现实(VR)全景视频的传输流量需求,针对时空切片传输模式,首先,基于VR全景视频观看数据集,对传输流量评估与空间切块方式和时间分段方式之间的关系进行仿真。然后,基于仿真结果,对VR全景视频的传输流量进行统计建模,建立传输流量与空间切块数量和时间分段长度之间的函数关系。最后,基于得到的传输流量模型,提出一种VR全景视频时空切片方式的嵌套优化方法,其外层对空间切块数量进行遍历寻优,内层直接计算最优的时间分段长度。研究和仿真结果表明,传输流量近似服从正态分布,其均值和方差与时空切片方式有关;通过对不同类型的视频分别进行传输流量统计建模,基于所建立的流量模型优化得到的时空切片方式与通过仿真搜索得到的最优切片方式性能接近。To characterize the traffic load of virtual reality(VR)panoramic video under the spatio-temporal slicing transmission mode,firstly,based on a real-word VR video viewing dataset,the relationship between the traffic load and the spatio-temporal slicing strategy was evaluated via simulations.Secondly,on the basis of the simulation results,a sta-tistical traffic model was established,describing the interaction between the traffic load and the number of spatial tiles as well as the duration of temporal chunks.Finally,based on the established model,a hierarchical spatial-temporal slicing strategy optimization method was proposed,where the outer layer found the optimal number of spatial tiles by exhaustive searching while the inner layer could directly compute the optimal duration of temporal chunks.Research and simulation results show that the traffic load approximately follows a normal distribution,where the mean and variance are functions of the spatio-temporal slicing strategy.By establishing the traffic model for each type of videos,the optimized slicing strategy based on the established model performs close to the optimal strategy obtained by searching by simulations.
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.142.52.141