检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《自动化学报》2007年第10期1023-1028,共6页Acta Automatica Sinica
基 金:国家自然科学基金(60275001;60443005;60575008);教育部博士点基金项目(20040005016)资助~~
摘 要:提出一种率-失真优化的渐进几何压缩方法.根据三维模型细节信息分布的不均匀性,该方法将细节信息分块并对各块独立编码,然后以一定位率下重构网格几何失真最小为准则,将各块的位流优化组装成最终的码流,从而在渐进传输时使有限的网络带宽能优先分配给那些细节信息较为丰富的块.实验结果表明,与渐进几何压缩方法(Progressive geometry compression,PGC)相比,在低位率时本文方法重构网格的峰值信噪比(Peak signal-to-noise ratio,PSNR)提高了约2.25dB.此外,该方法也为实现三维网格感兴趣区域编码提供了新的方案.A novel scheme for rate-distortion (R-D) optimized progressive geometry compression is proposed. According to the non-uniform distribution of the model details, the model details are grouped into blocks, and each block is encoded independently. The encoded bit-streams of the blocks are assembled into a code stream based on R-D optimization, which ensures allocating bitrates to the blocks with richer details preferentially. Experimental results show that the proposed algorithm, compared with the well-known PGC, provides PSNR improvements by about 2.25 dB at low bitrate. Moreover, the scheme provides a new approach to realize region of interest (ROI) coding of 3D meshes efficiently.
关 键 词:率-失真优化 渐进几何雎缩 网格分块 感兴趣区域编码
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7