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
(i.e., preferred-directions 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. Through experimental results, we show that
our proposed coding method is able to significantly outperform a simple
baseline coding scheme. Furthermore, our proposed method can outperform
traditional connectivity coding methods for meshes that do not deviate
too far from Delaunay connectivity. This result is of practical
significance since, in many applications, mesh connectivity is often not
so far from being Delaunay, due to the good approximation properties of
Delaunay triangulations. / Graduate
| Identifer | oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/6395 |
| Date | 29 July 2015 |
| Creators | Feng, Xiao |
| Contributors | Adams, Michael David |
| Source Sets | University of Victoria |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | Available to the World Wide Web, http://creativecommons.org/licenses/by-nc-nd/2.5/ca/ |
Page generated in 0.0019 seconds