A new compact scheme, which outperforms in many cases quad-tree decomposition, for coding of digital images is proposed and analyzed. It is based on a suitable generalization of function-trees, introduced in [1]. In particular a new top-down approach to build functiontrees both for binary pictures and gray level images is presented. The proposed coding scheme can be adapted to compress digital ...

In this paper, we study the problem of compressing a data structure (e.g. tree, undirected and directed graphs) in an eecient way while keeping a similar structure in the compressed form. To date, there has been no proven optimal algorithm for this problem. We use the idea of building LZW tree in LZW compression to compress a binary tree generated by a stationary ergodic source in an optimal ma...

Zerotrees of wavelet coefficients have shown a good adaptability for the compression of three-dimensional images. EZW, the original algorithm using zerotree, shows good performance and was successfully adapted to 3D image compression. This paper focuses on the adaptation of EZW for the compression of hyperspectral images. The subordinate pass is suppressed to remove the necessity to keep the si...

The presence of a vertebral compression fracture is highly indicative of osteoporosis and represents the single most robust predictor for development of a second osteoporotic fracture in the spine or elsewhere. Less than one third of vertebral compression fractures are diagnosed clinically. We present an automated method for detecting spine compression fractures in Computed Tomography (CT) scan...

Zerotrees of wavelet coefficients have shown a good adaptability for the compression of three dimensional images. EZW, the original algorithm using zerotree, shows good performance and was successfully adapted to 3D image compression. This paper focuses on the adaptation of EZW for the compression of hyperspectral images. The subordinate pass is suppressed to remove the necessity to keep the si...

Recent deep learning models outperform standard lossy image compression codecs. However, applying these on a patch-by-patch basis requires that each patch be encoded and decoded independently. The influence from adjacent patches is therefore lost, leading to block artefacts at low bitrates. We propose the Binary Inpainting Network (BINet), an autoencoder framework which incorporates binary inpa...

A rapidly advancing field, image compression has seen many recent developments. A number of well-known compression algorithms dominate the world of lossy compression, but in the realm of lossless compression, fewer techniques have been explored. The most successful lossy compression methods are based on transform methodologies, commonly involving the KLT, cosine, and wavelet transforms. However...