A new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivity
| dc.contributor.author | Han, Dan | |
| dc.contributor.supervisor | Adams, Michael D. | |
| dc.date.accessioned | 2016-11-03T15:45:41Z | |
| dc.date.available | 2016-11-03T15:45:41Z | |
| dc.date.copyright | 2016 | en_US |
| dc.date.issued | 2016-11-03 | |
| dc.degree.department | Department of Electrical and Computer Engineering | |
| dc.degree.level | Master of Applied Science M.A.Sc. | en_US |
| dc.description.abstract | A new progressive lossy-to-lossless coding framework for 2.5-dimensional (2.5-D) triangle meshes with arbitrary connectivity is proposed by combining ideas from the previously proposed average-difference image-tree (ADIT) method and the Peng-Kuo (PK) method with several modifications. The proposed method represents the 2.5-D triangle mesh with a binary tree data structure, and codes the tree by a top-down traversal. The proposed framework contains several parameters. Many variations are tried in order to find a good choice for each parameter considering both the lossless and progressive coding performance. Based on extensive experimentation, we recommend a particular set of best choices to be used for these parameters, leading to the mesh-coding method proposed herein | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/7614 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | mesh compression | en_US |
| dc.title | A new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivity | en_US |
| dc.type | Thesis | en_US |