A fast fractional image coding algorithm based on optimum matching
From MaRDI portal
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Source coding (94A29)
Recommendations
Cited in
(14)- An FFT-based technique for fast fractal image compression
- Fractal-based image coding with fast decoder convergence
- Fast orthogonalization algorithms for segmented image coding
- Fractal video coding using fast normalized covariance based similarity measure
- A fast encoding algorithm for fractal image compression using the DCT inner product
- GENERATING A FAST ROI MASK USING APPROXIMATE DIVISION OF CODE BLOCKS IN JPEG2000
- FRACTAL IMAGE COMPRESSION BASED ON MATCHING ERROR THRESHOLD
- scientific article; zbMATH DE number 1192493 (Why is no real title available?)
- scientific article; zbMATH DE number 1159229 (Why is no real title available?)
- Fast fractal image block coding based on local variances
- scientific article; zbMATH DE number 1564038 (Why is no real title available?)
- A fast fractal coding in application of image retrieval
- An improved fractal image coding method
- Fast fractal image encoding using one-norm of normalised block
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)
