A fast fractional image coding algorithm based on optimum matching
From MaRDI portal
Publication:5490776
zbMATH Open1101.94018MaRDI QIDQ5490776FDOQ5490776
Authors:
Publication date: 4 October 2006
Recommendations
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Source coding (94A29) Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (9)
- A fast fractal coding in application of image retrieval
- An improved fractal image coding method
- GENERATING A FAST ROI MASK USING APPROXIMATE DIVISION OF CODE BLOCKS IN JPEG2000
- A fast encoding algorithm for fractal image compression using the DCT inner product
- FRACTAL IMAGE COMPRESSION BASED ON MATCHING ERROR THRESHOLD
- Fast fractal image encoding using one-norm of normalised block
- Title not available (Why is that?)
- Fractal-based image coding with fast decoder convergence
- Fast fractal image block coding based on local variances
This page was built for publication: A fast fractional image coding algorithm based on optimum matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490776)