Integer cosine transforms: methods to construct new order 8, 16 fast transforms and their application
From MaRDI portal
Publication:891108
DOI10.1007/S10559-014-9682-9zbMath1328.65280OpenAlexW2091871224MaRDI QIDQ891108
Publication date: 16 November 2015
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-014-9682-9
computational complexitynumerical examplefast algorithmsdiscrete cosine transforminteger cosine transformcoding efficiencyinteger step transformvideo coding standards
Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)
Related Items (6)
Integer cosine transforms for high-efficiency image and video coding ⋮ High-order integer cosine transform: construction method and fast algorithms for high-resolution image and video coding ⋮ Algorithms for fast implementation of 4-point integer sine type VII transforms without multiplication and separable directional adaptive transforms for intra prediction in image/video coding ⋮ Modified integer sine transforms. Construction method and separable directional adaptive transforms for intra prediction in image/video coding ⋮ A method to construct a large-size simple integer cosine transform for high-resolution image and video coding ⋮ Simple high-order integer cosine transform for high-resolution video coding
Cites Work
- 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. II: Methods of generating orthogonal slant transforms with fast algorithms for image coding and compression
This page was built for publication: Integer cosine transforms: methods to construct new order 8, 16 fast transforms and their application
