Design of fast transforms for high-resolution image and video coding

Reznik, Yuriy A.; Chivukula, Ravi K.

doi:10.1117/12.831216

Cited by 7 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We show flow-graphs corresponding to mapping (13) and (14) in Figures 1.a and 1.b correspondingly. It can be observed that DST-VII can be computed by simply producing particularly re-ordered and zero-padded sequence as input to DFT, and collecting imaginary parts of odd-indexed DFT output values.…”

Section: Corollary 1 the Following Holdsmentioning

confidence: 99%

“…We start with mapping (13), establishing connection between DST-VII of length 4 and 9-point DFT. Then, we pick fast factorization of DFT of length 9.…”

Section: Fast Algorithms For Computing Dst-vi/vii Of Lengths N=48mentioning

confidence: 99%

“…[5][6][7] Such transforms are very well studied, and a number of efficient technique exists for their computation. 1,[8][9][10][11][12][13][14] Design of integer approximations of such transforms was also a subject of active study in recent years. 8,15,16 Much less known is a group of so-called "odd" sinusoidal transforms: DST and DCT of types V, VI, VII, and VIII.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fast computing of discrete cosine and sine transforms of types VI and VII

Chivukula

Reznik

2011

SPIE Proceedings

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Corollary 1 the Following Holdsmentioning

confidence: 99%

“…We start with mapping (13), establishing connection between DST-VII of length 4 and 9-point DFT. Then, we pick fast factorization of DFT of length 9.…”

Section: Fast Algorithms For Computing Dst-vi/vii Of Lengths N=48mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fast computing of discrete cosine and sine transforms of types VI and VII

Chivukula

Reznik

2011

SPIE Proceedings

Self Cite

View full text Add to dashboard Cite

show abstract

“…ξ ς η Such flexibility was already exploited to gain extra precision in the design of fixed-point algorithms in references 5,[18][19][20] .…”

Section: Conversion To Integer Arithmeticsmentioning

confidence: 99%

Efficient large size transforms for high-performance video coding

2010

Self Cite

View full text Add to dashboard Cite

This paper describes design of transforms for extended block sizes for video coding. The proposed transforms are orthogonal integer transforms, based on a simple recursive factorization structure, and allow very compact and efficient implementations. We discuss techniques used for finding integer and scale factors in these transforms, and describe our final design. We evaluate efficiency of our proposed transforms in VCEG's H.265/JMKTA framework, and show that they achieve nearly identical performance compared to much more complex transforms in the current test model.

show abstract

A hybrid video codec based on extended block sizes, recursive integer transforms, improved interpolation, and flexible motion representation

et al. 2011

Self Cite

View full text Add to dashboard Cite

This paper describes video coding technology proposal submitted by Qualcomm Inc. in response to a joint call for proposal (CfP) issued by ITU-T SG16 Q.6 (VCEG) and ISO/IEC JTC1/SC29/WG11 (MPEG) in January 2010. Proposed video codec follows a hybrid coding approach based on temporal prediction, followed by transform, quantization, and entropy coding of the residual. Some of its key features are extended block sizes (up to 64×64), recursive integer transforms, single pass switched interpolation filters with offsets (single pass SIFO), mode dependent directional transform (MDDT) for intra-coding, luma and chroma high precision filtering, geometry motion partitioning, adaptive motion vector resolution. It also incorporates internal bit-depth increase (IBDI), and modified quadtree based adaptive loop filtering (QALF). Simulation results are presented for a variety of bit rates, resolutions and coding configurations to demonstrate the high compression efficiency achieved by the proposed video codec at moderate level of encoding and decoding complexity. For random access hierarchical B configuration (HierB), the proposed video codec achieves an average BD-rate reduction of 30.88℅ compared to the H.264/AVC alpha anchor. For low delay hierarchical P (HierP) configuration, the proposed video codec achieves an average BD-rate reduction of 32.96℅ and 48.57℅, compared to the H.264/AVC beta and gamma anchors, respectively.

show abstract

Design of fast transforms for high-resolution image and video coding

Cited by 7 publications

References 23 publications

Fast computing of discrete cosine and sine transforms of types VI and VII

Fast computing of discrete cosine and sine transforms of types VI and VII

Efficient large size transforms for high-performance video coding

A hybrid video codec based on extended block sizes, recursive integer transforms, improved interpolation, and flexible motion representation

Contact Info

Product

Resources

About