Here we propose scalable three-dimensional set partitioned embedded block (3D-SPECK) - an embedded, block-based, wavelet transform coding algorithm of low complexity for hyperspectral image compression. Scalable 3D-SP...
详细信息
Here we propose scalable three-dimensional set partitioned embedded block (3D-SPECK) - an embedded, block-based, wavelet transform coding algorithm of low complexity for hyperspectral image compression. Scalable 3D-SPECK supports both SNR and resolution progressive coding. After wavelet transform, 3D-SPECK treats each subband as a coding block. To generate SNR scalable bitstream, the stream is organized so that the same indexed bit planes are put together across coding blocks and subbands, so that the higher bit planes precede the lower ones. To generate resolution scalable bitstreams, each subband is encoded separately to generate a sub-bitstream. Rate is allocated amongst the sub-bitstreams produced for each block. To decode the image sequence to a particular level at a given rate, we need to encode each subband at a higher rate so that the algorithm can truncate the sub-bitstream to the assigned rate. Resolution scalable 3D-SPECK is efficient for the application of an image server. Results show that scalable 3D-SPECK provides excellent performance on hyperspectral image compression.
作者:
R. KurcerenJ.W. ModestinoElectrical
Computer and Systems Engineering Department and Center for Image Processing Research Rensselaer Polytechnic Institute Troy NY USA
The use of forward error-control (FEC) coding has emerged as a promising approach for real-time transport over ATM networks for cell-loss recovery. The use of an FEC-based transport protocol over networks with bandwid...
详细信息
ISBN:
(纸本)0780367111
The use of forward error-control (FEC) coding has emerged as a promising approach for real-time transport over ATM networks for cell-loss recovery. The use of an FEC-based transport protocol over networks with bandwidth constraints, however, is not obvious since FEC coding introduces an overhead which can possibly cause additional cell losses which, furthermore, tend to occur in bursts. In this work, an overall performance evaluation of FEC coding is provided by incorporating the effects of channel coding on the cell-loss characteristics of the network. It is shown that FEC coding with proper selection of channel coding rate can significantly improve the throughput at a multiplexer even under correlated cell-loss situations. We also develop and illustrate an information-theoretic approach for incorporating the effects of FEC coding into well-established queueing theory calculations. This is achieved by solving separately the channel-coding problem for the modeled transmission channel and the queueing problem for the network. The performance of some specific coding designs are shown to approach the information-theoretic predictions with increasing complexity and/or delay.
An algorithm for traversing voxels along a 3D line using only integer arithmetic is presented. Two kinds of subdivision, namely non-unit space subdivision and non-square space subdivision, could be used. A 2D algorith...
详细信息
An algorithm for traversing voxels along a 3D line using only integer arithmetic is presented. Two kinds of subdivision, namely non-unit space subdivision and non-square space subdivision, could be used. A 2D algorithm is first developed to find out the pixels a line passes through. Then based on it, an algorithm for traversing voxels along a 3D line in uniformly divided voxel space is proposed. Up to 3 voxels may be processed in one step and no accumulated error is made. The discriminator used in this algorithm is well refined, so that few calculations are required and the algorithm is simple and compact in form. Its comparison with existing voxel traversal algorithms shows that the new algorithm is not only free from accumulated error but also is the fastest.
In this paper, we present a new embedded wavelet image coding system using quadtree splitting and context modeling. It features low computational complexity and high compression efficiency, thanks to joint utilization...
详细信息
ISBN:
(纸本)0769510310
In this paper, we present a new embedded wavelet image coding system using quadtree splitting and context modeling. It features low computational complexity and high compression efficiency, thanks to joint utilization of two powerful embedded coding techniques-set partitioning and context modeling. With effective exploitation of strong statistical dependencies among the quadtree nodes built up from subband coefficients, the proposed algorithm substantially improves the coding efficiency of the existing set-partition coders for both lossy and lossless image compression. For example, our experimental results show that the new algorithm respectively outperforms zerotree-based SPIHT and quadtree-based SPECK by 0.7 dB and 1.0 dB at 0.5 bpp on an average.
We investigate the transport of scalable digital video over future third-generation (3G) wireless CDMA cellular systems By considering the resource requirements as the aggregate of the products of source coding rates ...
详细信息
We investigate the transport of scalable digital video over future third-generation (3G) wireless CDMA cellular systems By considering the resource requirements as the aggregate of the products of source coding rates and the energy per information bit to noise ratio, we propose a joint source coding and power control (JSCPC) scheme which simultaneously maximizes the quality of the delivered video while minimizing the total resource consumption. We demonstrate the efficacy of this approach using the ITU-T H.263+ video source coder, although the approach is generally applicable to other source coding schemes as well.
Lattice vector quantization (LVQ) offers substantial reduction in computational load and design complexity due to the lattice regular structure [1]. In this paper, we extended the SPIHT [2] coding algorithm with latti...
详细信息
Lattice vector quantization (LVQ) offers substantial reduction in computational load and design complexity due to the lattice regular structure [1]. In this paper, we extended the SPIHT [2] coding algorithm with lattice vector quantization to code hyperspectral images. In the proposed algorithm, multistage lattice vector quantization (MLVQ) is used to exploit correlations between image slices, while offering successive refinement with low coding complexity and computation. Different four-dimensional lattices and significance metrics are considered. Their rate-distortion performance is compared with other 2D and 3D wavelet-based image compression algorithms.
With fast computation and excellent compression efficiency, two embedded coding techniques, zero-tree/-block coding and context modeling of the subband/wavelet coefficients, have been widely utilized for image coding ...
详细信息
With fast computation and excellent compression efficiency, two embedded coding techniques, zero-tree/-block coding and context modeling of the subband/wavelet coefficients, have been widely utilized for image coding applications. In this research, we present a new embedded wavelet image coding algorithm with an attempt to combine advantages of these two successful coding schemes. The experimental results show that the proposed algorithm outperforms the respected zero-tree/-block coders, SPIHT and SPECK, in compression efficiency. It is also comparable to the state-of-art JPEG 2000 test coder in PSNR performance while retaining the attractive low-complexity feature of the zeroblock coders.
In this paper we describe a multi-layered video transport scheme for wireless channels capable of adapting to channel conditions in order to maximize end-to-end quality of service (QoS). This scheme combines a scalabl...
详细信息
In this paper we describe a multi-layered video transport scheme for wireless channels capable of adapting to channel conditions in order to maximize end-to-end quality of service (QoS). This scheme combines a scalable H.263+ video source coder with unequal error protection (UEP) across layers. The UEP is achieved by employing different channel codes together with a multiresolution modulation approach to transport the different priority layers. Adaptivity to channel conditions is provided through use of joint source-channel coding (JSCC) which attempts to jointly optimize the source and channel coding rates together with the modulation parameters to obtain the maximum achievable end-to-end QoS for the prevailing channel conditions. Results indicate that this adaptive JSCC scheme employing scalable video encoding together with a multiresolution modulation/coding approach leads to significant improvements in delivered video quality for specified channel conditions. In particular, the approach results in considerably improved graceful degradation properties for decreasing channel SNR.
作者:
R. KurcerenJ.W. ModestinoElectrical
Computer and Systems Engineering Department Center for Image Processing Research Rensselaer Polytechnic Institute Troy NY USA
A joint source-channel coding (JSCC) approach for ATM-based network transport of scalable variable bit rate (VBR) digital video is described. We provide a new methodology for finding the optimum source and channel cod...
详细信息
ISBN:
(纸本)0780362977
A joint source-channel coding (JSCC) approach for ATM-based network transport of scalable variable bit rate (VBR) digital video is described. We provide a new methodology for finding the optimum source and channel coding rates, together with the optimum data-partitioning ratio, to maximize the statistical multiplexing gain while maximizing the end-to-end video quality. The results provide a quantitative demonstration of the effectiveness of a scalable delivery approach over the single-layer JSCC.
In this paper, the source covariance matrices of multiple-input multiple-output (MIMO) interference channels (IFCs) are investigated from a game-theoretic perspective. It is proved that the requirement of sufficiently...
详细信息
In this paper, the source covariance matrices of multiple-input multiple-output (MIMO) interference channels (IFCs) are investigated from a game-theoretic perspective. It is proved that the requirement of sufficiently small interference-to- noise ratio (INR) is the sufficient condition for the uniqueness of the Nash bargaining (NB) solution. The structure of the source covariance matrices, which constitute the feasible set of NB solution, is analyzed by comparing them with the covariance matrices leading to the Nash equilibrium (NE). The existence of the NB solution and concavity of the rate product for MIMO IFCs are also studied.
暂无评论