Unequal Compressive Imaging

Recently, novel compressive sensing (CS) techniques have been employed to concurrently perform compression and image sampling. Since an image has sparse representation in some proper transform basis, such as discrete cosine transform (DCT) and wavelet transform, we can reconstruct it from its undersampled random projections called measurements employing CS techniques. In this thesis, we propose unequal compressive imaging for different scenarios. First, we consider the fact that the area in an image which contains the main subject is more important to the viewer, e.g., the face in a portrait. As a result, we consider the main subject of the images to be the region of interest. We employ an existing algorithm to find the main subject area of the images, and propose to incorporate the coefficients of this area into more number of measurements compared to the rest. With this setup, the region of interest is reconstructed with a better quality, while the less important areas are slightly degraded. Further, we consider the fact that the low frequency coefficients of the sparse representation of an image (that convey most of the image information) mostly appear at the beginning of the sparse representation of the image. Therefore, we propose to use unequal compressive sampling to capture the beginning transform coefficients more strongly than the rest, and show that this would significantly improve the quality of the reconstructed image. Moreover, we exploit the structure of the wavelet tree (which results from the wavelet decomposition) to track the transform coefficients that correspond to the region of interest of images. We then propose an algorithm which strongly captures those transform coefficients that carry most of the image information and also those that correspond to the region of interest. With this setting, the overall quality of the reconstructed image is improved while the region of interest exhibits an even better quality.School of Electrical & Computer Engineerin

Performance Analysis of Regular and Irregular LDPC Codes on SPIHT Coded Image Data

The LDPC (Low Density Parity Check Code) has Shown interesting results for transmitting embedded bit streams over noisy communication channels. Performance comparison of regular and irregular LDPC codes with SPIHT coded image is done here. Different Error Sensitive classes of image data are obtained by using SPIHT algorithm as an image coder. Irregular LDPC codes map the more important class of data into a higher degree protection class to provide more protection. Different degree protection classes of an LDPC code improves the overall performance of data transmission against channel errors. Simulation results show the superiority of irregular LDPC over regular LDPC codes