Joint content and shape adaptive transforms based on a GMRF model for coding arbitrary-shaped image segments
| dc.contributor.author | Senarath, Shehan | |
| dc.contributor.examiningcommittee | Pawlak, Miroslaw (Electrical and Computer Engineering) | |
| dc.contributor.examiningcommittee | Peng, Ke (Electrical and Computer Engineering) | |
| dc.contributor.supervisor | Yahampath, Pradeepa | |
| dc.date.accessioned | 2025-01-06T18:09:55Z | |
| dc.date.available | 2025-01-06T18:09:55Z | |
| dc.date.issued | 2024-12-10 | |
| dc.date.submitted | 2024-12-18T18:51:23Z | en_US |
| dc.degree.discipline | Electrical and Computer Engineering | |
| dc.degree.level | Master of Science (M.Sc.) | |
| dc.description.abstract | In image compression, shape-adaptive (SA) transform coding has been shown to outperform traditional block-based transform coding by better capturing the underlying textures of image regions. However, constructing optimal transforms for arbitrarily shaped image segments remains a challenging task. This thesis proposes a novel method for developing SA transforms by utilizing a non-causal finite lattice homogeneous Gauss-Markov random field (GMRF) model. The Karhunen-Loeve transform (KLT) of the GMRF model is employed as a compact, parameterized representation of the KLT for arbitrarily shaped image segments, with the model parameters effectively characterizing the image texture. This approach offers a significant advantage over existing SA transforms in the literature, as it allows for the optimization of the transform for each image segment. Specifically, if the GMRF model accurately describes the segment's texture, the resulting KLT will be the optimal transform for that segment. A key aspect of the proposed method is the introduction of a modified version of asymmetric Neumann boundary conditions, which are designed to maintain a high transform coding gain, even for arbitrarily shaped image segments. This enhancement ensures that the transform coding process is robust and effective across diverse image shapes and textures. Additionally, by employing a set of GMRF parameters estimated from a training set of images, the aforementioned approach is extended to enable joint content and shape adaptive transform (JCSAT) coding. This approach allows for the simultaneous adaptation to both the content and shape of image segments, leading to more efficient compression. Experimental results demonstrate that JCSAT coding surpasses the performance of other known SA transforms, as well as the widely used 2D-discrete cosine transform (2D-DCT), in terms of energy compaction efficiency and coding gain. This research makes an important contribution to the adaptive transform coding of images, providing a more flexible and optimal solution for coding arbitrarily shaped image regions in image and video compression applications. | |
| dc.description.note | February 2025 | |
| dc.description.sponsorship | University of Manitoba graduate fellowship | |
| dc.identifier.uri | http://hdl.handle.net/1993/38750 | |
| dc.language.iso | eng | |
| dc.rights | open access | en_US |
| dc.subject | Signal compression | |
| dc.subject | Shape adaptive coding | |
| dc.subject | Content adaptive coding | |
| dc.subject | Image compression | |
| dc.subject | Signal Processing | |
| dc.title | Joint content and shape adaptive transforms based on a GMRF model for coding arbitrary-shaped image segments | |
| dc.type | master thesis | en_US |
| local.subject.manitoba | yes | |
| project.funder.identifier | https://doi.org/10.13039/501100000038 | |
| project.funder.name | Natural Sciences and Engineering Research Council of Canada (NSERC) |