Low-complexity lossless codes for image and video coding | Zendy

Yuriy A. Reznik | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Low-complexity lossless codes for image and video coding

Author(s) -

Yuriy A. Reznik

Publication year - 2010

Publication title -

proceedings of spie, the international society for optical engineering/proceedings of spie

Language(s) - English

Resource type - Conference proceedings

SCImago Journal Rank - 0.192

H-Index - 176

eISSN - 1996-756X

pISSN - 0277-786X

DOI - 10.1117/12.862252

Subject(s) - golomb coding , computer science , lossless compression , theoretical computer science , tunstall coding , entropy encoding , variable length code , block code , coding (social sciences) , lossy compression , algorithm , data compression , mathematics , computer vision , artificial intelligence , image compression , decoding methods , image (mathematics) , image processing , statistics

We describe design of lossless block codes for geometric, Laplacian, and similar distributions frequently arising in image and video coding. Proposed codes can be understood as a generalization of Golomb codes, allowing more precise adaptation to values of parameters of distributions, and resulting in lower redundancy. Design of universal block codes for a class of geometric distributions is also studied.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research