<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T06:29:48Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/16856" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/16856</identifier><datestamp>2026-09-24T03:14:55Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Shirani, Shahram</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Ebrahimi-Moghadam, Abbas</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-03-27T14:49:33Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-03-27T14:49:33Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-09</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/16856</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/16926</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In this thesis, novel progressive scalable region-of-interest (ROI) image coding&#xd;
schemes with rate-distortion-complexity trade-off based on residual vector&#xd;
quantization (RVQ) and matching pursuit (MP) are developed. RVQ and MP&#xd;
provide the encoder with multi-resolution signal analysis tools, which are useful for rate-distortion trade-off and can be used to render a selected region&#xd;
of an image with a specific quality. An image quality refinement strategy is&#xd;
presented in this thesis, which improves the quality of the ROI in a progressive&#xd;
manner. The reconstructed image can mimic foveated images in perceptual&#xd;
image coding context. The systems are unbalanced in the sense that the decoders have less computational requirements than the encoders. The methods also provide interactive way of information refinement for regions of image with receiver 's higher priority. The receiver is free to select multiple regions of interest and change his/her mind and choose alternative regions in the middle of signal transmission. The proposed RVQ and MP based image coding methods in this thesis raise a couple of issues and reveal some capabilities in image coding and communication. In RVQ based image coding, the effects of dictionary size, number of RVQ stages and the size of image blocks on the reconstructed image quality, the resulting bit rate, and the computational complexity are investigated. The progressive nature of the resulting bit-stream makes RVQ and MP based image coding methods suitable platforms for unequal error protection. Researchers have paid lots of attention to joint source-channel ( JSC) coding in recent years. In this popular framework, JSC decoding based on residual redundancy exploitation of a source coder output bit-stream is an interesting bandwidth efficient approach for signal reconstruction. In this thesis, we also addressed JSC decoding and error concealment problem for matching pursuit based coded images transmitted over a noisy memoryless channel. The problem is solved on minimum mean squared error (MMSE) estimation foundation and a suboptimal solution is devised, which yields high quality error concealment with different levels of computational complexity. The proposed decoding and error concealment solution takes advantage of the residual redundancy,&#xd;
which exists in neighboring image blocks as well as neighboring MP analysis stages, to improve the quality of the images with no increase in the required bandwidth. The effects of different parameters such as MP dictionary size and number of analysis stages on the performance of the proposed soft decoding method have also been investigated.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">region-of-interest image coding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">rate-distortion-complexity trade-off</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">matching pursuit</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">image quality refinement</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">joint source-channel</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Matching Pursuit and Residual Vector Quantization: Applications in Image Coding</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>