2000 character limit reached
DCT-like Transform for Image Compression Requires 14 Additions Only
Published 2 Feb 2017 in cs.MM, cs.DS, stat.AP, and stat.CO | (1702.00817v1)
Abstract: A low-complexity 8-point orthogonal approximate DCT is introduced. The proposed transform requires no multiplications or bit-shift operations. The derived fast algorithm requires only 14 additions, less than any existing DCT approximation. Moreover, in several image compression scenarios, the proposed transform could outperform the well-known signed DCT, as well as state-of-the-art algorithms.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.