{"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.