Fast orthogonalization algorithms for segmented image coding

DOI10.1016/S0165-1684(97)00109-6MaRDI QIDQ1389528zbMATH OpenFDO

Authors Wilfried Philips

Publication date 30 June 1998

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0165-1684(97)00109-6

zbMATH Keywords

orthogonalization algorithmorthonormal basesPRO algorithmsegmented image coding

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis (42C99) Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version).
• Orthogonal transforms in bases of slant step functions. II: Methods of generating orthogonal slant transforms with fast algorithms for image coding and compression
• Coding of segmented images using shape-independent basis functions
• Methods of synthesis of efficient orthogonal transforms of high and low correlation and their fast algorithms for coding and compressing digital images
• A fast fractional image coding algorithm based on optimum matching

Cited in

(5)

• Methods of synthesis of efficient orthogonal transforms of high and low correlation and their fast algorithms for coding and compressing digital images
• Orthogonal continuous segmentation polynomial
• Orthogonal transforms in bases of slant step functions. II: Methods of generating orthogonal slant transforms with fast algorithms for image coding and compression
• GENERATING A FAST ROI MASK USING APPROXIMATE DIVISION OF CODE BLOCKS IN JPEG2000
• Coding of segmented images using shape-independent basis functions

This page was built for publication: Fast orthogonalization algorithms for segmented image coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389528)