This work introduces the three-dimensional steerable discrete cosine transform (3d-SdCT), which is obtained from the relationship between the discrete cosine transform (dCT) and the graph Fourier transform of a signal...
详细信息
This work introduces the three-dimensional steerable discrete cosine transform (3d-SdCT), which is obtained from the relationship between the discrete cosine transform (dCT) and the graph Fourier transform of a signal on a path graph. One employs the fact that the basis vectors of the 3d-dCT constitute a possible eigenbasis for the Laplacian of the product of such graphs. The proposed transform employs a rotated version of the 3d-dCT basis. We then evaluate the applicability of the 3d-SdCT in the field of 3d medical imagecompression. We consider the case where we have only one pair of rotation angles per block, rotating all the 3d-dCT basis vectors by the same pair. The obtained results show that the 3d-SdCT can be efficiently used in the referred application scenario and it outperforms the classical 3d-dCT.
In this paper we propose a 3d image compression method which is volume rendering oriented and uses wavelet transform. Via separable wavelet transform, dataset is decomposed into subbands with different importance to r...
详细信息
ISBN:
(纸本)7505338900
In this paper we propose a 3d image compression method which is volume rendering oriented and uses wavelet transform. Via separable wavelet transform, dataset is decomposed into subbands with different importance to rendering process. According to this difference, an efficient classified quantization and a bit allocation strategy are designed,and zero-tree structure is used to represent zero coefficients.
compression results obtained by using the three-dimensional discrete cosine transform are presented. The key aspects of the paper concern the adaptation to the 3d case of transform coding algorithms that are most ofte...
详细信息
compression results obtained by using the three-dimensional discrete cosine transform are presented. The key aspects of the paper concern the adaptation to the 3d case of transform coding algorithms that are most often used in the 2d case. This work focussed on two particular aspects that are the original contribution of this paper: (i) the adaptation to the 3d case of transform coefficients quantization method;(ii) the application of an octree analysis algorithm before transform. The algorithm was especially designed for tomographic images issued from scintigraphic measures, we finally obtained a compression rate of 100 for a quality measured by a 40 dB PSNR. (C) 1999 Elsevier Science B.V. All rights reserved.
A novel and efficient block-wise decomposition-based codec (BdC) for a three-dimensional (3d) light detection and ranging (LidAR) point cloud (PCd) image (BdCPCd) has been introduced in this paper. The raw LidAR data ...
详细信息
A novel and efficient block-wise decomposition-based codec (BdC) for a three-dimensional (3d) light detection and ranging (LidAR) point cloud (PCd) image (BdCPCd) has been introduced in this paper. The raw LidAR data is cleansed and normalized by applying the axis outlier detection and circular differential cosine transformation methods, respectively. Then, the iterative dimensionality reduction approach is used to decompose and quantize the tensor structured signal data through block-wise singular value decomposition and signal block vectorization methods, respectively. The final single order tensor is considered as a compressed bitstream for efficient transformation. The proposed BdCPCd is applied on three different dense 3d LidAR PCddata sets. The results demonstrate that it outperformed the four existing well-known compression techniques, such as WinRAR, 7-Zip, Tensor Tucker decomposition, and Random sample consensus (RANSAC) point cloudcompression algorithm. This iterative compression algorithm constantly reduces the 66.66% of tensor blocks in each iteration. This research proves that the BdCPCd compresses different sizes of 3d LidAR PCd spatial data to be reduced into six bytes and averagely increases the quality of the decompressedimage by 1.6 decibels than the existing Tucker based algorithm.
Integral imaging (II) is a promising technique for sensing and visualizing of three dimensional (3d) images because it produces autostereoscopic images without special illumination requirements. As with any 3d imaging...
详细信息
ISBN:
(纸本)0819463906
Integral imaging (II) is a promising technique for sensing and visualizing of three dimensional (3d) images because it produces autostereoscopic images without special illumination requirements. As with any 3d imaging, in order to produce high quality 3dimages, it is required to capture, record, transmit, process anddisplay an enormous amount of optical data. Therefore, a central challenge that rises is to store and transmit efficiently the huge amount of information. This can be done by applying appropriate data compression techniques that remove efficiently the inherent redundancy within the captureddata. In this work we survey previously developed II compression methods and, compare their performance. We present a new technique to cope with a common problem with some of the II compression methods, namely the choice of the compressiondepth to be applied in the various dimensions representing an II.
Integral imaging is a promising technique for delivering high-quality three-dimensional content. However, the large amounts of data producedduring acquisition prohibits direct transmission of Integral imagedata. A n...
详细信息
Integral imaging is a promising technique for delivering high-quality three-dimensional content. However, the large amounts of data producedduring acquisition prohibits direct transmission of Integral imagedata. A number of highly efficient compression architectures are proposed today that outperform standard two-dimensional encoding schemes. However, critical issues regarding real-time compression for quality demanding applications are a primary concern to currently existing Integral image encoders. In this work we propose a real-time FPGA-based encoder for Integral image and integral video content transmission. The proposed encoder is based on a highly efficient compression algorithm used in Integral Imaging applications. Real-time performance is achieved by realizing a pipelined architecture, taking into account the specific structure of an Integral image. The required memory access operations are minimized by adopting a systolic concept of data flow through the core processing elements, further increasing the performance boost. The encoder targets, real-time, broadcast-type high-resolution Integral image and video sequences and performs three orders of magnitude faster than the analogous software approach.
In this paper, we present a three-dimensional (3d) hyperspectral imagecompression algorithm based on zeroblock coding and wavelet transforms. An efficient Asymmetric 3d wavelet Transform (AT) based on the lifting tec...
详细信息
ISBN:
(纸本)081945592X
In this paper, we present a three-dimensional (3d) hyperspectral imagecompression algorithm based on zeroblock coding and wavelet transforms. An efficient Asymmetric 3d wavelet Transform (AT) based on the lifting technique and packet transform is used to reduce redundancies in both the spectral and spatial dimensions. The implementation via 3d integer lifting scheme allows to map integer-to-integer values, enabling lossy and lossless decompression from the same bit stream. To encode these coefficients after Asymmetric 3d wavelet transform, a modified3dSPECK algorithm - Asymmetric Transform 3d Set Partitioning Embedded bloCK (AT-3dSPECK) is proposed. According to the distribution of energy of the transformed coefficients, the 3dSPECK's 3d set partitioning block algorithm and the 3d octave band partitioning scheme are efficiently combined in the proposed AT-3dSPECK algorithm. Several AVIRIS images are used to evaluate the compression performance. Compared with the JPEG2000, AT-3dSPIHT and3dSPECK lossless compression techniques, the AT-3dSPECK achieves the best lossless performance. In lossy mode, the AT-3dSPECK algorithm outperforms AT-3dSPIHT and3dSPECK at all rates. Besides the high compression performance, AT-3dSPECK supports progressive transmission. Clearly, the proposed AT-3dSPECK algorithm is a better candidate than several conventional methods.
暂无评论