A fast fractional image coding algorithm based on optimum matching

MaRDI QIDQ5490776zbMATH OpenFDO

Authors

Publication date 4 October 2006

zbMATH Keywords

optimum matching3-line neighborhoodkick-out condition

Mathematics Subject Classification ID

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)

Recommendations

• Fast fractal image encoding using an improved search scheme
• An improved fractal image coding method
• Improved algorithm of fractal image coding based on neighbour-searching
• scientific article; zbMATH DE number 5661169
• FRACTAL IMAGE COMPRESSION BASED ON MATCHING ERROR THRESHOLD

Cited in

(11)

• Fast fractal image block coding based on local variances
• 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
• Fast fractal image encoding using one-norm of normalised block
• 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 1564038 (Why is no real title available?)
• Fractal video coding using fast normalized covariance based similarity measure
• Fractal-based image coding with fast decoder convergence

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)