Orthogonal transforms in bases of slant step functions. II: Methods of generating orthogonal slant transforms with fast algorithms for image coding and compression

DOI10.1007/s10559-005-0093-9zbMath1112.68484OpenAlexW1986631708MaRDI QIDQ2508799

L. A. Gnativ

Publication date: 20 October 2006

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-005-0093-9

zbMATH Keywords

fast algorithmsrotation matricestransform codingcorrelation modelshigh-correlation transformlow-correlation transformslant transformstransform efficiency

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

Integer cosine transforms: methods to construct new order 8, 16 fast transforms and their application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Methods of synthesis of efficient orthogonal transforms of high and low correlation and their fast algorithms for coding and compressing digital images
• Orthogonal transforms in bases of slant step functions. I: Constructing complete sets of orthogonal slant step functions

This page was built for publication: Orthogonal transforms in bases of slant step functions. II: Methods of generating orthogonal slant transforms with fast algorithms for image coding and compression