Sciweavers

52 search results - page 8 / 11
» Performance of universal codes over infinite alphabets
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
TIP
2002
93views more  TIP 2002»
13 years 8 months ago
Joint source-channel coding for motion-compensated DCT-based SNR scalable video
In this paper, we develop an approach toward joint source-channel coding for motion-compensated DCT-based scalable video coding and transmission. A framework for the optimal select...
Lisimachos P. Kondi, Faisal Ishtiaq, Aggelos K. Ka...
TWC
2010
13 years 3 months ago
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
Dimitris S. Papailiopoulos, George N. Karystinos
ICIP
2006
IEEE
14 years 10 months ago
Improving H.264/AVC Inter Compression with Multiscale Recurrent Patterns
In this paper we describe the ongoing work on a new paradigm for compressing the motion predicted error in a video coder, referred to as MMP-Video. This new coding algorithm uses ...
Eduardo A. B. da Silva, Murilo B. de Carvalho, Nun...
MIPS
2004
Springer
108views Multimedia» more  MIPS 2004»
14 years 1 months ago
Residual Motion Coding Method for Error Resilient Transcoding System
Abstract. For video adaptation in universal multimedia access systems, video contents have to be transcoded according to the requirements of network bandwidth and the performance o...
June-Sok Lee, Goo-Rak Kwon, Jae-Won Kim, Kyung-Hoo...