Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Index-Compressed Vector Quantisation Based On Index Mapping, Jamshid Shanbehzadeh, Philip Ogunbona
Index-Compressed Vector Quantisation Based On Index Mapping, Jamshid Shanbehzadeh, Philip Ogunbona
Professor Philip Ogunbona
The authors introduce a novel coding technique which significantly improves the performance of the traditional vector quantisation (VQ) schemes at low bit rates. High interblock correlation in natural images results in a high probability that neighbouring image blocks are mapped to small subsets of the VQ codebook, which contains highly correlated codevectors. If, instead of the whole VQ codebook, a small subset is considered for the purpose of encoding neighbouring blocks, it is possible to improve the performance of traditional VQ schemes significantly. The performance improvement obtained with the new method is about 3dB on average when compared with traditional …
Index Compressed Tree-Structured Vector Quantisation, Jamshid Shanbehzadeh, Philip Ogunbona
Index Compressed Tree-Structured Vector Quantisation, Jamshid Shanbehzadeh, Philip Ogunbona
Professor Philip Ogunbona
This paper introduces a novel coding scheme based on Tree-Structured Vector Quantisation (TSVQ) scheme for image compression. The genealogical relationship among the indices of the neighbouring blocks generated from vector quantisation is exploited to improve the coding performance of TSVQ. The proposed coding scheme provides about 3.5 dB improvement over the basic TSVQ scheme and outperforms VQ schemes with memory and JPEG coding standard at low bit-rates. In addition its performance is comparable with address VQ but with much less complexity.
Similarity Measures For Compressed Image Databases, P Sangassapaviriya, Philip Ogunbona
Similarity Measures For Compressed Image Databases, P Sangassapaviriya, Philip Ogunbona
Professor Philip Ogunbona
For image database applications it is desirable that functions such as searching, browsing and partial recall be done without the need to totally decompress the image. This has the advantage of alleviating possible burden and degradation that the network may suffer. Edge images derived from wavelet-compressed images are considered as index that can be queried by example. Zernike moment invariants are used as descriptors for the index edge image and the query sketch image. The descriptions are compared for the purpose of database searching. The query images were allowed to undergo translation, rotation, scaling and some deformation. Simulation results gave …
Content-Based Retrieval From Compressed-Image Databases, Philip Ogunbona, P Sangassapaviriya
Content-Based Retrieval From Compressed-Image Databases, Philip Ogunbona, P Sangassapaviriya
Professor Philip Ogunbona
There is an enormous amount of multi-media data including images, video, speech, audio and text, distributed among the various computer nodes on the Internet. The extent to which a user wiU be able to derive useful information from these data depends largely on the ease with which required data can be retrieved from the databases. The share volume of the data also poses a storage constraint on the databases; hence these data will need to exist in the compressed form on the databases. In this paper we concentrate on image data and propose a new paradigm in which a compressed …
Index Compressed Image Adaptive Vector Quantisation, Jamshid Shanbehzadeh, Philip Ogunbona
Index Compressed Image Adaptive Vector Quantisation, Jamshid Shanbehzadeh, Philip Ogunbona
Professor Philip Ogunbona
This paper introduces an improved image adaptive vector quantisation technique - index compressed image adaptive vector quantisation (IC-IAVQ). Despite its advantage over the universal codebook VQ, basic image adaptive VQ (IAVQ) is still suboptimum; it neglects the correlation among block indices in the encoded image. The new technique, IC-IAVQ, overcomes this suboptimality through a pre-processing and lossless compression of block indices. Simulation results using several images show that IC-IAVQ outperforms IAVQ and entropy coded IAVQ, especially at low bit-rates by about 2dB on average.