检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:肖嵩[1] 吴成柯[1] 张方[1] 李云松[1] 杜建超[1]
机构地区:[1]西安电子科技大学ISN国家重点实验室,西安710071
出 处:《计算机学报》2006年第1期171-176,共6页Chinese Journal of Computers
基 金:国家自然科学基金(60532060;60372043)和重点实验室基金(51434050105DZ01)资助.~~
摘 要:提出了一种感兴趣区域的多描述SPIHT编码方法.该方法将具有分层内嵌特性的SPIHT码流编码成多个描述子,通过对所有零树重新进行重要性排序,为每个描述子分配不同编码速率的完全编码码流和冗余码流.在分配速率时,优先对感兴趣区域分配较多的冗余,而对背景区域或非感兴趣区域分配速率较低的冗余,以进一步增强感兴趣区域的抗误码以及抗分组丢弃能力.文中对编码过程中零树、冗余树及其编码速率之间的关系进行了定量分析,并给出了重要性排序和冗余树分配的具体算法.实验证明,该文方法同其它感兴趣区域编码方法相比,可以进一步提高感兴趣区域在分组丢弃情况下的恢复图像质量.A new multiple description SPtHT coding for region of interest(ROI) is proposed to combat packet loss. The method codes the SPIHT bit stream into multiple descriptions, each with a variable number of fully coded original trees and partially coded redundant trees. After reordering the zero trees of wavelet according to their importance, the method assign different coding rates of original trees and redundant trees to each description. The more important parts of each tree are sent in more description than the less important parts, and in order to further improve the error resilience of ROI, more redundant trees are assigned to ROI than non-ROI. The relationship among zero trees, redundant trees and their coding rates are analyzed, and the algorithm of sorting process and assigning strategy of redundant trees are also presented in detail. Simulation results show that the method can further improve the reconstructed quality of ROI in the case of packet loss compared to other ROI coding methods.
关 键 词:多描述编码 SPIHT 感兴趣区域 QOS 小波零树编码
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.153.204