Joined Spectral Trees for Scalable SPIHT-Based Multispectral Image Compression

In this paper, the compression of multispectral images is addressed. Such 3-D data are characterized by a high correlation across the spectral components. The efficiency of the state-of-the-art wavelet-based coder 3-D SPIHT is considered. Although the 3-D SPIHT algorithm provides the obvious way to process a multispectral image as a volumetric block and, consequently, maintain the attractive properties exhibited in 2-D (excellent performance, low complexity, and embeddedness of the bit-stream), its 3-D trees structure is shown to be not adequately suited for 3-D wavelet transformed (DWT) multispectral images. The fact that each parent has eight children in the 3-D structure considerably increases the list of insignificant sets (LIS) and the list of insignificant pixels (LIP) since the partitioning of any set produces eight subsets which will be processed similarly during the sorting pass. Thus, a significant portion from the overall bit-budget is wastedly spent to sort insignificant information. Through an investigation based on results analysis, we demonstrate that a straightforward 2-D SPIHT technique, when suitably adjusted to maintain the rate scalability and carried out in the 3-D DWT domain, overcomes this weakness. In addition, a new SPIHT-based scalable multispectral image compression algorithm is used in the initial iterations to exploit the redundancies within each group of two consecutive spectral bands. Numerical experiments on a number of multispectral images have shown that the proposed scheme provides significant improvements over related works.

SPECK-Based Lossless Multispectral Image Coding

This letter proposes an efficient extension of the set partitioning embedded block (SPECK) algorithm to lossless multispectral image coding. Such a wavelet-based coder is widely referred to in the literature, especially for lossless image coding, and is considered to be one of the most efficient techniques exhibiting very low computational complexity when compared with other state-of-the-art coders. The modification proposed in this letter is simple and provides significant improvement over the conventional SPECK. The key idea is to join each group of two consecutive wavelet-transformed spectral bands during the SPECK coding since they show high similarities with respect to insignificant sets at the same locations. Simulation results, carried out on a number of test images, demonstrate that this grouping procedure considerably saves on the bit budget for encoding the multispectral images.

Is shyness context specific? Relation between shyness and online self-disclosure with and without a live webcam in young adults

The Internet provides a new tool to investigate old questions in experimental social psychology regarding Person x Context interaction. We examined the interaction of self-reported shyness and context on computer-mediated communication measures. Sixty female undergraduates unfamiliar were paired in dyads and engaged in a 10 min free chat conversation on the Internet with and without a live webcam. Free chat conversations were archived, transcripts were objectively coded for communication variables, and a linear mixed model used for data analysis of dyadic interaction was performed on each communication measure. As predicted, increases in self-reported shyness were significantly related to decreases in the number of prompted self-disclosures (after controlling for the number of opportunities to self-disclose) only in the webcam condition. Self-reported shyness was not related to the number of prompted self-disclosures in the no webcam condition, suggesting that shyness was context dependent. The present study appears to be the first to objectively code measures of Internet behaviour in relation to the study of personality in general and shyness in particular. Theoretical and clinical implications for understanding the contextual nature of shyness are discussed. (C) 2006 Elsevier Inc. All rights reserved.