Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/21845
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Shirani, Shahram | - |
dc.contributor.advisor | Capson, David W. | - |
dc.contributor.author | Park, Insu | - |
dc.date.accessioned | 2017-08-14T14:44:42Z | - |
dc.date.available | 2017-08-14T14:44:42Z | - |
dc.date.issued | 2006-10 | - |
dc.identifier.uri | http://hdl.handle.net/11375/21845 | - |
dc.description.abstract | <p> A new area-based mesh simplification algorithm is described. The proposed algorithm removes the center vertex of a polygon which consists of n ≥ 3 faces and represents that polygon with n - 2 faces. A global search method is adapted that iteratively determines which vertex is to be removed using the proposed area-based distortion measurement. Although the global search method requires more computations compared to a local search method, it guarantees better quality of approximation. Various re-triangulations are also considered to improve the perceptual quality of the final approximation.</p> <p> From multiple re-triangulations, one with minimum distortion is selected to represent the original mesh. Experimental results demonstrate the performance of the proposed algorithm for data reduction while maintaining the quality of the rendered objects. The performance of multiple description decoder when not all descriptions are available depends on the decoding strategy. By approximating lost description the distortion can be reduced. When decoder reconstructs input source without having all descriptions different methods exist to approximate the lost description. We proposed two side decoding algorithms. The proposed side decoders are based on diagonal element and the probability of input source. When low bit-rate and complicated index assignment matrix are used the side decoder based on probability of input source is recommendable. To approximate the lost description we compare the performance of standard decoding method with the performance of proposed methods. A trade-off between the performance of decoder and computational complexity exists.</p> <p> An error concealment algorithm is proposed based on flow of facial expression to improve communication of animated facial data over a limited bandwidth channel with error. Facial expression flow is tracked using dominant muscles which are those with maximum change between two successive frames. By comparing the dominant muscle data with the predetermined expression information table, facial expression flow is determined. The receiver uses linear interpolation and the information on facial expression flow to interpolate the erroneous facial animation data. For objective comparison, a distortion measurement tool, which compares two 3D objects based on point-to-point difference, is introduced. Experimental results are provided to show that the proposed error concealment method improves the quality of an animated face communications.</p> | en_US |
dc.language.iso | en_US | en_US |
dc.subject | communication, 3D graphic models, polygon, algorithm | en_US |
dc.title | Communication of 3D Graphic Models | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | Electrical and Computer Engineering | en_US |
dc.description.degreetype | Thesis | en_US |
dc.description.degree | Master of Applied Science (MASc) | en_US |
Appears in Collections: | Digitized Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Park_Insu_2006Oct_Masters..pdf | 6.83 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.