Progressive transmission of medical images

A novel adaptive source-channel coding scheme for progressive transmission of medical images with a feedback system is therefore proposed in this dissertation. The overall design includes Discrete Wavelet Transform (DWT), Embedded Zerotree Wavelet (EZW) coding, Joint Source-Channel Coding (JSCC), prioritization of region of interest (RoI), variability of parity length based on feedback, and the corresponding hardware design utilising Simulink. The JSCC can achieve an efficient transmission by incorporating unequal error projection (UEP) and rate allocation. An algorithm is also developed to estimate the number of erroneous data in the receiver. The algorithm detects the address in which the number of symbols for each subblock is indicated, and reassigns an estimated correct data according to a decision making criterion, if error data is detected. The proposed system has been designed based on Simulink which can be used to generate netlist for portable devices. A new compression method called Compressive Sensing (CS) is also revisited in this work. CS exhibits many advantages in comparison with EZW based on our experimental results. DICOM JPEG2000 is an efficient coding standard for lossy or lossless multi-component image coding. However, it does not provide any mechanism for automatic RoI definition, and is more complex compared to our proposed scheme. The proposed system significantly reduces the transmission time, lowers computation cost, and maintains an error-free state in the RoI with regards to the above provided features. A MATLAB-based TCP/IP connection is established to demonstrate the efficacy of the proposed interactive and adaptive progressive transmission system. The proposed system is simulated for both binary and symmetric channel (BSC) and Rayleigh channel. The experimental results confirm the effectiveness of the design.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Channel Coding for Progressive Images in a 2-D Time-Frequency OFDM Block With Channel Estimation Errors

Coding and diversity are very effective techniques for improving transmission reliability in a mobile wireless environ- ment. The use of diversity is particularly important for multimedia communications over fading channels. In this work, we study the transmission of progressive image bitstreams using channel coding in a 2-D time-frequency resource block in an OFDM network, em- ploying time and frequency diversities simultaneously. In partic- ular, in the frequency domain, based on the order of diversity and the correlation of individual subcarriers, we construct symmetric -channel FEC-based multiple descriptions using channel erasure codes combined with embedded image coding. In the time domain, a concatenation of RCPC codes and CRC codes is employed to pro- tect individual descriptions. We consider the physical channel con- ditions arising from various coherence bandwidths and coherence times, leading to a range of orders of diversities available in the time and frequency domains. We investigate the effects of different error patterns on the delivered image quality due to various fade rates. We also study the tradeoffs and compare the relative effec- tiveness associated with the use of erasure codes in the frequency domain and convolutional codes in the time domain under different physical environments. Both the effects of intercarrier interference and channel estimation errors are included in our study. Specifi- cally, the effects of channel estimation errors, frequency selectivity and the rate of the channel variations are taken into consideration for the construction of the 2-D time-frequency block. We provide results showing the gain that the proposed model achieves com- pared to a system without temporal coding. In one example, for a system experiencing flat fading, low Doppler, and imperfect CSI, we find that the increase in PSNR compared to a system without time diversity is as much as 9.4 dB

Source-channel coding for robust image transmission and for dirty-paper coding

In this dissertation, we studied two seemingly uncorrelated, but conceptually related problems in terms of source-channel coding: 1) wireless image transmission and 2) Costa ("dirty-paper") code design. In the first part of the dissertation, we consider progressive image transmission over a wireless system employing space-time coded OFDM. The space-time coded OFDM system based on a newly built broadband MIMO fading model is theoretically evaluated by assuming perfect channel state information (CSI) at the receiver for coherent detection. Then an adaptive modulation scheme is proposed to pick the constellation size that offers the best reconstructed image quality for each average signal-to-noise ratio (SNR). A more practical scenario is also considered without the assumption of perfect CSI. We employ low-complexity decision-feedback decoding for differentially space- time coded OFDM systems to exploit transmitter diversity. For JSCC, we adopt a product channel code structure that is proven to provide powerful error protection and bursty error correction. To further improve the system performance, we also apply the powerful iterative (turbo) coding techniques and propose the iterative decoding of differentially space-time coded multiple descriptions of images. The second part of the dissertation deals with practical dirty-paper code designs. We first invoke an information-theoretical interpretation of algebraic binning and motivate the code design guidelines in terms of source-channel coding. Then two dirty-paper code designs are proposed. The first is a nested turbo construction based on soft-output trellis-coded quantization (SOTCQ) for source coding and turbo trellis- coded modulation (TTCM) for channel coding. A novel procedure is devised to balance the dimensionalities of the equivalent lattice codes corresponding to SOTCQ and TTCM. The second dirty-paper code design employs TCQ and IRA codes for near-capacity performance. This is done by synergistically combining TCQ with IRA codes so that they work together as well as they do individually. Our TCQ/IRA design approaches the dirty-paper capacity limit at the low rate regime (e.g., < 1:0 bit/sample), while our nested SOTCQ/TTCM scheme provides the best performs so far at medium-to-high rates (e.g., >= 1:0 bit/sample). Thus the two proposed practical code designs are complementary to each other