检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《上海大学学报(自然科学版)》1997年第S1期81-85,共5页Journal of Shanghai University:Natural Science Edition
基 金:国家自然科学基金
摘 要:在边缘模型基活动图象压缩编码方法中,图象初始帧被分为激励区和背景区.在每个图象组中,初始帧背景区的静态压缩是整个方案的重要基础.本文提出了一种采用Delaunay三角剖分(DT)的表面描述算法,首先根据伪逆矩阵理论,采用最小二乘空间预测方法填充初始帧中的激励区部分,然后用DT算法剖分整个初始帧,最后获得少量待传特征点.传输时保证特征点收发的同序,克服了四点以上共圆带来的退化现象.实验表明,在压缩率近16倍时,重建图象质量仍可保持在30dB以上,主观图象质量也较良好.Initial image frame is divided into sensitized region and ambient region in edgemodel based method of moving image compression coding. In each image group, the still compression of ambient region is the vital foundation of the entire scheme. In the paper, we presents a surface description using Delaunay Triangulation (DT). First, accroding to the pseudoinverse theory, we use space prediction by least square to fill the sensitize region of the initial frame. Then, use DT to triangulate it. Thus, we obtain only few feature points for transmission. To avoid the reconstuction distortion caused by degeneracy, we arrange the bit stream of feature points by forming order. Experiment shows that the reconstructed image can keep at up 30 dB when the compression ratio is 16, simultaneously the subjective quality is also better.
关 键 词:DELAUNAY三角剖分 边缘模型基 图象压缩编码 边缘填充
分 类 号:TN911.21[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3