Orthogonal Transforms in Bases of Slant Step Functions. II. Methods of Generating Orthogonal Slant Transforms with Fast Algorithms for Image Coding and Compression

Authors:
L. A. Gnativ
Affiliations:
V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2005

Citing 5
Cited 0

Transform Coding of Images

Transform Coding of Images
Fast Transforms: Algorithms, Analyses, Applications

Fast Transforms: Algorithms, Analyses, Applications
Orthogonal Transforms for Digital Signal Processing

Orthogonal Transforms for Digital Signal Processing
Methods of Synthesis of Efficient Orthogonal Transforms of High and Low Correlation and Their Fast Algorithms for Coding and Compressing Digital Images

Cybernetics and Systems Analysis
Orthogonal Transforms in Bases of Slant Step Functions. I. Constructing Complete Sets of Orthogonal Slant Step Functions

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recurrent matrix methods and methods based on the Walsh transform and rotation matrices generating orthogonal slant transforms of high and low correlation are proposed. These methods are used to develop efficient fast slant-transform algorithms without multiplication and additional permutations of output data.