FRACTAL IMAGE COMPRESSION BASED ON MATCHING ERROR THRESHOLD
From MaRDI portal
Publication:3620458
DOI10.1142/S0218348X09004247zbMATH Open1159.94311MaRDI QIDQ3620458FDOQ3620458
Authors: Li-Xian Zou, Xingyuan Wang
Publication date: 14 April 2009
Published in: Fractals (Search for Journal in Brave)
Recommendations
- Fast fractal image encoding using an improved search scheme
- A fast fractional image coding algorithm based on optimum matching
- Improved algorithm of fractal image coding based on neighbour-searching
- scientific article; zbMATH DE number 5661169
- Novel prediction- and subblock-based algorithm for fractal image compression
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
Cited In (6)
- Fractal image compression based on the segmentation of square non-symmetry anti-packing
- Novel prediction- and subblock-based algorithm for fractal image compression
- A fast fractional image coding algorithm based on optimum matching
- Robust estimation of parameter for fractal inverse problem
- An edge property-based neighborhood region search strategy for fractal image compression
- A robust fractal color image watermarking algorithm
This page was built for publication: FRACTAL IMAGE COMPRESSION BASED ON MATCHING ERROR THRESHOLD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3620458)