首页 | 本学科首页   官方微博 | 高级检索  
     

矢量的线上投影表示法
引用本文:田斌,易克初,孙民贵. 矢量的线上投影表示法[J]. 电子学报, 2000, 28(10): 12-16
作者姓名:田斌  易克初  孙民贵
作者单位:1. 西安电子科技大学综合业务网国家重点实验室,西安 710071;2. 美国匹兹堡大学电子工程系,PA15260,USA
基金项目:国家自然科学基金资助项目 !(No .69872 0 2 7)
摘    要:本文提出一种矢量压缩编码新方法—线上投影法.它将输入矢量用它在某条空间直线上的投影近似表示,而用决定这条直线的两个参考点的序号和一个反映该投影点相对于两参考点位置的比例因子作为编码.由于一个大小为N的矢量量化码书中的码字可以确定N(N-1)/2条直线,因此这种方法可用较小的码书获得很高的编码精度.理论分析和实验结果表明:码书大小为N的线上投影法的编码精度与码书大小为N2的矢量量化法相当,并且明显优于用两个大小为N的码书构成的两级矢量量化法,而其码书生成和编码过程的计算复杂度均远远低于后者.它将是矢量信号高精度压缩编码的一种强有力的手段.

关 键 词:矢量量化  信源编码  矢量投影  
收稿时间:1999-07-23

Vector Representation Based on Projection of Point on a Line
TIAN Bin,YI Ke-chu,SUN Min-gui. Vector Representation Based on Projection of Point on a Line[J]. Acta Electronica Sinica, 2000, 28(10): 12-16
Authors:TIAN Bin  YI Ke-chu  SUN Min-gui
Affiliation:1. National Key Lab.on ISN,Xidian University,Xi'an 710071,China;2. Dept of Electrical Eng.,University of Pittsburgh,PA15260,USA
Abstract:This paper proposes a novel method for vector coding,which approximately represents a vector with its orthogonal projection on a straight line.It encodes every vector with 3 codes,where two are used to represent two reference points to determine a straight line,and the third one is used to describe the location of the projection point.Since a N sized vector quantization (VQ) codebook can determine N(N-1)/2 different straight lines,the new method can encode vectors with very high coding accuracy based on a rather small codebook.Theoretical analysis and experimental results suggest that its coding accuracy based on a N sized code book of size N N 2 is comparable with that of VQ coding based on a N 2 sized codebook,and much better than multi stage VQ based on two codebooks of size N,while its computational complexity is much lower than the latter ones under equivalent accuracy obtained.The method would be a powerful tool for vector coding with high accuracy requirement.
Keywords:VQ  source coding  vector projection
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号