Paper
20 September 2007 High-dimensional data compression via PHLCT
Author Affiliations +
Abstract
The polyharmonic local cosine transform (PHLCT), presented by Yamatani and Saito in 2006, is a new tool for local image analysis and synthesis. It can compress and decompress images with better visual fidelity, less blocking artifacts, and better PSNR than those processed by the JPEG-DCT algorithm. Now, we generalize PHLCT to the high-dimensional case and apply it to compress the high-dimensional data. For this purpose, we give the solution of the high-dimensional Poisson equation with the Neumann boundary condition. In order to reduce the number of coefficients of PHLCT, we use not only d-dimensional PHLCT decomposition, but also d-1, d-2, . . . , 1 dimensional PHLCT decompositions. We find that our algorithm can more efficiently compress the high-dimensional data than the block DCT algorithm. We will demonstrate our claim using both synthetic and real 3D datasets.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhihua Zhang and Naoki Saito "High-dimensional data compression via PHLCT", Proc. SPIE 6701, Wavelets XII, 670127 (20 September 2007); https://doi.org/10.1117/12.733226
Lens.org Logo
CITATIONS
Cited by 2 patents.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Data compression

Algorithms

Image processing

Reconstruction algorithms

Image analysis

Signal processing

RELATED CONTENT


Back to Top