Algorithms for Transform Selection in Multiple-Transform Video Compression

With a proper transform, an image or motion-compensated residual can be represented quite accurately with a small fraction of the transform coefficients. This is referred to as the energy compaction property. When multiple transforms are used, selecting the best transform for each block that leads t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on image processing Ročník 22; číslo 12; s. 5395 - 5407
Hlavní autoři: Xun Cai, Lim, Jae S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.12.2013
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1057-7149, 1941-0042, 1941-0042
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:With a proper transform, an image or motion-compensated residual can be represented quite accurately with a small fraction of the transform coefficients. This is referred to as the energy compaction property. When multiple transforms are used, selecting the best transform for each block that leads to the best energy compaction is difficult. In this paper, we develop two algorithms to solve this problem. The first algorithm, which is computationally simple, leads to a locally optimal solution. The second algorithm, which is more computationally intensive, gives a globally optimal solution. We discuss the algorithms and their performance. Two-dimensional discrete cosine transform (2D-DCT) and direction-adaptive one-dimensional discrete cosine transforms (1D-DCTs) are used to evaluate the performance of our algorithms. Results obtained are consistent with their coding performance. As an application example of this paper, we apply our algorithm to evaluate the performance of a potential video compression system based on a very large number of transforms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:1057-7149
1941-0042
1941-0042
DOI:10.1109/TIP.2013.2284073