A novel progressive lossy-to-lossless coding method for mesh models of images

Xiao Feng, M. Adams
{"title":"A novel progressive lossy-to-lossless coding method for mesh models of images","authors":"Xiao Feng, M. Adams","doi":"10.1109/PACRIM.2015.7334820","DOIUrl":null,"url":null,"abstract":"A novel progressive lossy-to-lossless coding method is proposed for mesh models of images whose underlying triangulations have arbitrary connectivity. For a triangulation T of a set P of points, our proposed method represents the connectivity of T as a sequence of edge flips that maps a uniquely-determined Delaunay triangulation of P to T. The coding efficiency of our method is highest when the underlying triangulation connectivity is close to Delaunay, and slowly degrades as connectivity moves away from being Delaunay. Experimental results show our method to significantly outperform a simple baseline coding scheme and suggest our method to be superior to more traditional coding approaches for meshes whose connectivity does not deviate too far from being Delaunay.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"37 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2015.7334820","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A novel progressive lossy-to-lossless coding method is proposed for mesh models of images whose underlying triangulations have arbitrary connectivity. For a triangulation T of a set P of points, our proposed method represents the connectivity of T as a sequence of edge flips that maps a uniquely-determined Delaunay triangulation of P to T. The coding efficiency of our method is highest when the underlying triangulation connectivity is close to Delaunay, and slowly degrades as connectivity moves away from being Delaunay. Experimental results show our method to significantly outperform a simple baseline coding scheme and suggest our method to be superior to more traditional coding approaches for meshes whose connectivity does not deviate too far from being Delaunay.
一种新的图像网格模型的累进有损到无损编码方法
针对具有任意连通性的图像的网格模型,提出了一种新的渐进式有损到无损编码方法。对于点集P的三角剖分T,我们提出的方法将T的连通性表示为将P的唯一确定的Delaunay三角剖分映射到T的边缘翻转序列。当底层三角剖分连通性接近Delaunay时,我们的方法的编码效率最高,并且随着连通性远离Delaunay而缓慢降低。实验结果表明,我们的方法明显优于简单的基线编码方案,并且表明我们的方法优于更传统的网格编码方法,其连通性不会偏离Delaunay太远。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信