621 search results - page 61 / 125 » Compression of facial images using the K-SVD algorithm |
161
Voted
TOG
2002
15 years 3 months ago
2002
We present a new method for rendering high dynamic range images on conventional displays. Our method is conceptually simple, computationally efficient, robust, and easy to use. We...
118
click to vote
ICIP
2002
IEEE
15 years 9 months ago
2002
IEEE
Context-based adaptive entropy coding is an essential feature of modern image compression algorithms; however, the design of these coders is non-trivial due to the balance that mu...
134
click to vote
ICIP
1998
IEEE
16 years 5 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
143
click to vote
APCCAS
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we develop a robust bit-plane watermarking technique based on zerotree coding. A robust watermark is an imperceptible but indelible code that can be used for owners...
127
click to vote
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper, we present a low complexity Modulo-PCM based coding algorithm for high speed video cameras used in applications that demand very high frame rates. By compressing th...