A new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivity

dc.contributor.authorHan, Dan
dc.contributor.supervisorAdams, Michael D.
dc.date.accessioned2016-11-03T15:45:41Z
dc.date.available2016-11-03T15:45:41Z
dc.date.copyright2016en_US
dc.date.issued2016-11-03
dc.degree.departmentDepartment of Electrical and Computer Engineering
dc.degree.levelMaster of Applied Science M.A.Sc.en_US
dc.description.abstractA 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 hereinen_US
dc.description.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/7614
dc.languageEnglisheng
dc.language.isoenen_US
dc.rightsAvailable to the World Wide Weben_US
dc.subjectmesh compressionen_US
dc.titleA new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivityen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Han_Dan_MASc_2016.pdf
Size:
4.68 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description: