scispace - formally typeset
Search or ask a question

Showing papers by "Hannes Hartenstein published in 2000"


Journal ArticleDOI
TL;DR: This work presents a fractal coder that derives highly image-adaptive partitions and corresponding fractal codes in a time-efficient manner using a region-merging approach that leads to improved rate-distortion performance compared to previously reported pure fractal coders.
Abstract: A fractal coder partitions an image into blocks that are coded via self-references to other parts of the image itself. We present a fractal coder that derives highly image-adaptive partitions and corresponding fractal codes in a time-efficient manner using a region-merging approach. The proposed merging strategy leads to improved rate-distortion performance compared to previously reported pure fractal coders, and it is faster than other state-of-the-art fractal coding methods.

61 citations


Journal ArticleDOI
TL;DR: This work presents a new technique for reducing the encoding complexity of fractal image compression that is lossless, i.e., it does not sacrifice any image reconstruction quality for the sake of speedup, and outperforms other currently known lossless acceleration methods.
Abstract: In fractal image compression the encoding step is computationally expensive. We present a new technique for reducing the encoding complexity. It is lossless, i.e., it does not sacrifice any image reconstruction quality for the sake of speedup. It is based on a codebook coherence characteristic of fractal image compression and leads to a novel application of the fast Fourier transform-based cross correlation. The proposed method is particularly well suited for use with highly irregular image partitions for which most traditional (lossy) acceleration schemes lose a large part of their efficiency. For large ranges our approach outperforms other currently known lossless acceleration methods.

27 citations


Journal ArticleDOI
TL;DR: An algorithm is proposed that starts from an initial mapping obtained by collage coding and iteratively provides a sequence of contractive mappings whose fixed points monotonically approach the original image.

21 citations