• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Ma Zhiqiang, Wang Lili, Zhang Xinwei, Ke Wei, Zhao Qinping. Remote Visualization for 3D Dynamic Scene Based on Image Space[J]. Journal of Computer Research and Development, 2014, 51(11): 2559-2572. DOI: 10.7544/issn1000-1239.2014.20130242
Citation: Ma Zhiqiang, Wang Lili, Zhang Xinwei, Ke Wei, Zhao Qinping. Remote Visualization for 3D Dynamic Scene Based on Image Space[J]. Journal of Computer Research and Development, 2014, 51(11): 2559-2572. DOI: 10.7544/issn1000-1239.2014.20130242

Remote Visualization for 3D Dynamic Scene Based on Image Space

More Information
  • Published Date: October 31, 2014
  • In remote visualization for complex 3D dynamic scene, compression and transmission for vertex trajectory needs computing huge vertex and has very slow computational speed. In order to solve these problems, we present a remote visualization method for 3D dynamic scene based on image space, which replaces vertex trajectory with sample trajectory to reduce the vertex number in computation and presents a parallel compression method to realize rapid and effect compression for dynamic datasets. First, adaptive sampling algorithm in space and time (time after space) using graphics pipeline and the construction of samples connective information is presented to obtain many animated depth images. Then, the trajectory of samples is compressed in parallel in each animated depth image, which reduces compression time effectively. Finally, compressed dynamic datasets are transferred to the client and 3D dynamic scene over some time is reconstructed. Reconstructed 3D dynamic scene during some time supplies the client with observation in arbitrary angles and has little decline in rendering quality. Exprement results also show that the algorithms realize rapid compression and reduce the number of dynamic datasets greatly, which reduce network latency limitation effectively.
  • Related Articles

    [1]Zhang Chao, Sun Guangyu, Zhang Xueying, Zhao Weisheng. Thermal Modeling and Management for Shift Operations of Racetrack Memory[J]. Journal of Computer Research and Development, 2017, 54(1): 154-162. DOI: 10.7544/issn1000-1239.2017.20150903
    [2]Zhang Fengjun, Zhao Ling, An Guocheng, Wang Hongan, Dai Guozhong. Mean Shift Tracking Algorithm with Scale Adaptation[J]. Journal of Computer Research and Development, 2014, 51(1): 215-224.
    [3]Guo Husheng, Wang Wenjian. A Support Vector Machine Learning Method Based on Granule Shift Parameter[J]. Journal of Computer Research and Development, 2013, 50(11): 2315-2324.
    [4]Wang Gang and Luo Zhigang. A Polynomial Time Approximation Scheme for the Traveling Salesman Problem in Curved Surfaces[J]. Journal of Computer Research and Development, 2013, 50(3): 657-665.
    [5]Rong Chuitian, Xu Tianren, Du Xiaoyong. Partition-Based Set Similarity Join[J]. Journal of Computer Research and Development, 2012, 49(10): 2066-2076.
    [6]Liu Jie, Liang Huaguo, Jiang Cuiyun. Test Compression Approach of Adopting Cyclic Shift and Optimal Coding[J]. Journal of Computer Research and Development, 2012, 49(4): 873-879.
    [7]Yuan Guanglin, Xue Mogen, Han Yusheng, Zhou Pucheng. Mean Shift Object Tracking Based on Adaptive Multi-Features Fusion[J]. Journal of Computer Research and Development, 2010, 47(9): 1663-1671.
    [8]Tang Yang, Pan Zhigeng, Tang Min, Pheng Ann Heng, Xia Deshen. Image Segmentation with Hierarchical Mean Shift[J]. Journal of Computer Research and Development, 2009, 46(9): 1424-1431.
    [9]Zhao Weizhong, Feng Haodi, and Zhu Daming. Improvement and Implementation of a Polynomial Time Approximation Scheme for Euclidean Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2007, 44(10): 1790-1795.
    [10]Wang Yiran, Chen Li, Feng Xiaobing, Zhang Zhaoqing. Global Partial Replicate Computation Partitioning[J]. Journal of Computer Research and Development, 2006, 43(12): 2158-2165.

Catalog

    Article views (1412) PDF downloads (832) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return