DCT-like Transform for Image Compression Requires 14 Additions Only

February 02, 2017 · Declared Dead · 🏛 arXiv.org

👻 CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors F. M. Bayer, R. J. Cintra arXiv ID 1702.00817 Category cs.MM: Multimedia Cross-listed cs.DS, stat.AP, stat.CO Citations 91 Venue arXiv.org Last Checked 1 month ago
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Multimedia

Died the same way — 👻 Ghosted