No / Coding using quantum states in an angular-momentum (2j+1)-dimensional Hilbert space H is considered in this paper. A concatenated code is studied in two steps. In the first step the space HN is considered and the code is its subspace HA spanned by the direct products of N angular-momentum states with the same m. In the second step the space HAM is considered and the code is its subspace HB spanned by the direct products of M angle states with the same m. It is shown that the code introduces redundancy with respect to any transformation.

Video coding systems based on 3D wavelet transforms offer several advantages over traditional hybrid video coders. This thesis proposes two 3D wavelet-based video-coding approaches. In the first approach, motion compensation with redundant-wavelet multihypothesis, in which multiple predictions that are diverse in transform phase contribute to a single motion estimate, is deployed into the fully scalable MC-EZBC video coder. The bidirectional motion-compensated temporaliltering process of MC-EZBC is adapted to the redundant-wavelet domain, wherein transform redundancy is exploited to generate a phase-diverse multihypothesis prediction of the true temporal filtering. In the second approach, a video coder is proposed that does not perform motion compensation explicitly, instead relying on the motion-selective characteristics of the 3D dual-tree discrete wavelet transform to isolate moving features. The transform coefficients are coded with binary set-partitioning using k-d trees in an algorithm that exploits within-subband spatiotemporal coherency as well as cross-subband correlation to achieve efficient coding.

This thesis present a new feature coding scheme for video-content matching tasks. The purpose of this feature coding scheme is to compress features under a strict bitrate budget. Features contain two parts of information: the descriptors and the feature locations. We propose a variable level scalar quantizer for descriptors and a variable block size location coding scheme for feature locations. For descriptor coding, the SIFT descriptors are transformed using Karhunen-Loéve Transform (KLT). This K-L transformation matrix is trained using the descriptors extracted from the 25K-MIRFLICKR image dataset. The quantization of descriptors is applied after descriptor transformation. Our proposed descriptor quantizer allocates different bitrates to the elements in the transformed descriptor according to the sequence order. We establish the correlation between the descriptor quantizer distortion and the video matching performance, given a strict bitrate budget. Our feature location coding scheme is built upon the location histogram coding method. Instead of using uniform block size, we use different sizes of blocks to quantize different areas of a video frame. We have achieved nearly 50% reduction in the bitrate allocated for location information compared to the bitrate allocated by the coding schemes that use uniform block size. With this location coding scheme, we achieve almost the same video matching performance as that of the uniform block size coding. By combining the descriptor and location coding schemes, experimental results have shown that the overall feature coding scheme achieves excellent video matching performance. / Thesis / Master of Applied Science (MASc)

Source coding, a central concept in information theory, is the study of encoding and decoding data. Depending on the topological structure of the sources, i.e. how the sources are connected with encoders, different rate distortion functions are used. In this thesis two different encoding schemes---distributed and decentralized---are discussed and compared with a benchmark (centralized) coding structure. Specifically, all structures for two and three sources are discussed and a special case for the multi-source (more than three sources) is calculated. This work gives a pathway to characterize the generalized multiterminal source coding systems by finding the difference in the rate distortion limits from the optimal centralized coding system. It is shown that in specific cases, some decentralized systems can achieve the Shannon lower bound in a high resolution regime. / Thesis / Master of Science (MSc)

The aim of source coding is to represent information as accurately as possible using as few bits as possible and in order to do so redundancy from the source needs to be removed. The aim of channel coding is in some sense the contrary, namely to introduce redundancy that can be exploited to protect the information when being transmitted over a nonideal channel. Combining these two techniques leads to the area of joint source-channel coding which in general makes it possible to achieve a better performance when designing a communication system than in the case when source and channel codes are designed separately. In this thesis four particular areas in joint source-channel coding are studied: analog (i.e. continuous) bandwidth expansion, distributed source coding over noisy channels, multiple description coding (MDC) and soft decoding. A general analog bandwidth expansion code based on orthogonal polynomials is proposed and analyzed. The code has a performance comparable with other existing schemes. However, the code is more general in the sense that it is implementable for a larger number of source distributions. The problem of distributed source coding over noisy channels is studied. Two schemes are proposed and analyzed for this problem which both work on a sample by sample basis. The first code is based on scalar quantization optimized for a certain channel characteristics. The second code is nonlinear and analog. Two new MDC schemes are proposed and investigated. The first is based on sorting a frame of samples and transmitting, as side-information/redundancy, an index that describes the resulting permutation. In case that some of the transmitted descriptors are lost during transmission this side information (if received) can be used to estimate the lost descriptors based on the received ones. The second scheme uses permutation codes to produce different descriptions of a block of source data. These descriptions can be used jointly to estimate the original source data. Finally, also the MDC method multiple description coding using pairwise correlating transforms as introduced by Wang et al. is studied. A modi fication of the quantization in this method is proposed which yields a performance gain. A well known result in joint source-channel coding is that the performance of a communication system can be improved by using soft decoding of the channel output at the cost of a higher decoding complexity. An alternative to this is to quantize the soft information and store the pre-calculated soft decision values in a lookup table. In this thesis we propose new methods for quantizing soft channel information, to be used in conjunction with soft-decision source decoding. The issue on how to best construct finite-bandwidth representations of soft information is also studied. / QC 20100920

ITC/USA 2009 Conference Proceedings / The Forty-Fifth Annual International Telemetering Conference and Technical Exhibition / October 26-29, 2009 / Riviera Hotel & Convention Center, Las Vegas, Nevada / This paper describes a psychophysical experiment to measure visibility thresholds (VT) for quantization distortion in JPEG2000 and an associated quantization algorithm for visually lossless coding of color aerial images. The visibility thresholds are obtained from a quantization distortion model based on the statistical characteristics of wavelet coefficients and the deadzone quantizer of JPEG2000, and the resulting visibility thresholds are presented for the luminance component (Y) and two chrominance components (Cb and Cr). Using the thresholds, we have achieved visually lossless coding for 24-bit color aerial images at an average bitrate of 4.17 bits/pixels, which is approximately 30% of the bitrate required for numerically lossless coding.

This thesis introduces a novel method for accurate pitch detection and speech segmentation, named Multi-feature, Autocorrelation (ACR) and Wavelet Technique (MAWT). MAWT uses feature extraction, and ACR applied on Linear Predictive Coding (LPC) residuals, with a wavelet-based refinement step. MAWT opens the way for a unique approach to modeling: although speech is divided into segments, the success of voicing decisions is not crucial. Experiments demonstrate the superiority of MAWT in pitch period detection accuracy over existing methods, and illustrate its advantages for speech segmentation. These advantages are more pronounced for gain-varying and transitional speech, and under noisy conditions.

Lee Kar Kin Edwin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 129-134). / Text in English; abstracts in English and Chinese. / Lee Kar Kin Edwin. / Acknowledgement --- p.ii / Abstract --- p.iii / Contents --- p.vii / List of Figures --- p.ix / List of Tables --- p.xiii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- A brief review of transform-based video coding --- p.1 / Chapter 1.2 --- A brief review of content-based video coding --- p.6 / Chapter 1.3 --- Objectives of the research work --- p.9 / Chapter 1.4 --- Thesis outline --- p.12 / Chapter 2 --- Incorporation of DC Coefficient Restoration into Foreground/Background coding --- p.13 / Chapter 2.1 --- Introduction --- p.13 / Chapter 2.2 --- A review of FB coding in H.263 sequence --- p.15 / Chapter 2.3 --- A review of DCCR --- p.18 / Chapter 2.4 --- DCCRFB coding --- p.23 / Chapter 2.4.1 --- Methodology --- p.23 / Chapter 2.4.2 --- Implementation --- p.24 / Chapter 2.4.3 --- Experimental results --- p.26 / Chapter 2.5 --- The use of block selection scheme in DCCRFB coding --- p.32 / Chapter 2.5.1 --- Introduction --- p.32 / Chapter 2.5.2 --- Experimental results --- p.34 / Chapter 2.6 --- Summary --- p.47 / Chapter 3 --- Chin contour estimation on foreground human faces --- p.48 / Chapter 3.1 --- Introduction --- p.48 / Chapter 3.2 --- Least mean square estimation of chin location --- p.50 / Chapter 3.3 --- Chin contour estimation using chin edge detector and contour modeling --- p.58 / Chapter 3.3.1 --- Face segmentation and facial organ extraction --- p.59 / Chapter 3.3.2 --- Identification of search window --- p.59 / Chapter 3.3.3 --- Edge detection using chin edge detector --- p.60 / Chapter 3.3.4 --- "Determination of C0, C1 and c2" --- p.63 / Chapter 3.3.5 --- Chin contour modeling --- p.67 / Chapter 3.4 --- Experimental results --- p.71 / Chapter 3.5 --- Summary --- p.77 / Chapter 4 --- Wire-frame model deformation and face animation using FAP --- p.78 / Chapter 4.1 --- Introduction --- p.78 / Chapter 4.2 --- Wire-frame face model deformation --- p.79 / Chapter 4.2.1 --- Introduction --- p.79 / Chapter 4.2.2 --- Wire-frame model selection and FDP generation --- p.81 / Chapter 4.2.3 --- Global deformation --- p.85 / Chapter 4.2.4 --- Local deformation --- p.87 / Chapter 4.2.5 --- Experimental results --- p.93 / Chapter 4.3 --- Face animation using FAP --- p.98 / Chapter 4.3.1 --- Introduction and methodology --- p.98 / Chapter 4.3.2 --- Experiments --- p.102 / Chapter 4.4 --- Summary --- p.112 / Chapter 5 --- Conclusions and future developments --- p.113 / Chapter 5.1 --- Contributions and conclusions --- p.113 / Chapter 5.2 --- Future developments --- p.117 / Appendix A H.263 bitstream syntax --- p.122 / Appendix B Excerpt of the FAP specification table [17] --- p.123 / Bibliography --- p.129

by Cheng Shu Ling. / Thesis submitted in: July 1997. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1998. / Includes bibliographical references (leaves 70-71). / Abstract also in Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Image Coding Standard: JPEG --- p.1 / Chapter 1.2 --- Video Coding Standard: MPEG --- p.6 / Chapter 1.2.1 --- MPEG history --- p.6 / Chapter 1.2.2 --- MPEG video compression algorithm overview --- p.8 / Chapter 1.2.3 --- More MPEG features --- p.10 / Chapter 1.3 --- Summary --- p.17 / Chapter Chapter 2 --- Error Resiliency --- p.18 / Chapter 2.1 --- Introduction --- p.18 / Chapter 2.2 --- Traditional approaches --- p.19 / Chapter 2.2.1 --- Channel coding --- p.19 / Chapter 2.2.2 --- ARQ --- p.20 / Chapter 2.2.3 --- Multi-layer coding --- p.20 / Chapter 2.2.4 --- Error Concealment --- p.20 / Chapter 2.3 --- MPEG-4 work on error resilience --- p.21 / Chapter 2.3.1 --- Resynchronization --- p.21 / Chapter 2.3.2 --- Data Recovery --- p.25 / Chapter 2.3.3 --- Error Concealment --- p.28 / Chapter 2.4 --- Summary --- p.29 / Chapter Chapter 3 --- Fixed length codes --- p.30 / Chapter 3.1 --- Introduction --- p.30 / Chapter 3.2 --- Tunstall code --- p.31 / Chapter 3.3 --- Lempel-Ziv code --- p.34 / Chapter 3.3.1 --- LZ-77 --- p.35 / Chapter 3.3.2 --- LZ-78 --- p.36 / Chapter 3.4 --- Simulation --- p.38 / Chapter 3.4.1 --- Experiment Setup --- p.38 / Chapter 3.4.2 --- Results --- p.39 / Chapter 3.4.3 --- Concluding Remarks --- p.42 / Chapter Chapter 4 --- Self-Synchronizable codes --- p.44 / Chapter 4.1 --- Introduction --- p.44 / Chapter 4.2 --- Scholtz synchronizable code --- p.45 / Chapter 4.2.1 --- Definition --- p.45 / Chapter 4.2.2 --- Construction procedure --- p.45 / Chapter 4.2.3 --- Synchronizer --- p.48 / Chapter 4.2.4 --- Effects of errors --- p.51 / Chapter 4.3 --- Simulation --- p.52 / Chapter 4.3.1 --- Experiment Setup --- p.52 / Chapter 4.3.2 --- Results --- p.56 / Chapter 4.4 --- Concluding Remarks --- p.68 / Chapter Chapter 5 --- Conclusions --- p.69 / References --- p.70

Yim, Ka Yee. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (p. 43). / Abstracts in English and Chinese. / Acknowledgements --- p.vii / TABLE OF CONTENTS --- p.viii / LIST OF TABLES --- p.x / LIST OF FIGURES --- p.xi / Chapter CHAPTER 1 : --- INTRODUCTION --- p.1 / Chapter 1.1. --- Motivation --- p.1 / Chapter 1.2. --- Overview --- p.2 / Chapter 1.3. --- H.264 Overview --- p.2 / Chapter CHAPTER 2 : --- CABAC --- p.7 / Chapter 2.1. --- Introduction --- p.7 / Chapter 2.2. --- CABAC Decoder Implementation Review --- p.7 / Chapter 2.3. --- CABAC Algorithm Review --- p.9 / Chapter 2.4. --- Proposed CABAC Decoder Implementation --- p.13 / Chapter 2.5. --- FSM Method Bin Matching --- p.20 / Chapter 2.6. --- CABAC Experimental Results --- p.22 / Chapter 2.7. --- Summary --- p.26 / Chapter CHAPTER 3 : --- INTEGRATION --- p.27 / Chapter 3.1. --- Introduction --- p.27 / Chapter 3.2. --- Reused Baseline Decoder Review --- p.27 / Chapter 3.3. --- Integration --- p.30 / Chapter 3.4. --- Proposed Solution for Motion Vector Decoding --- p.33 / Chapter 3.5. --- Synthesis Result and Performance Analysis --- p.37 / Chapter CHAPTER 4 : --- CONCLUSION --- p.39 / Chapter 4.1. --- Main Contribution --- p.39 / Chapter 4.2. --- Reflection on the Development --- p.39 / Chapter 4.3. --- Future Work --- p.41 / BIBLIOGRAPHY --- p.43