Sciweavers

31 search results - page 2 / 7
» A jointly optimal fractal DCT compression scheme
Sort
View
ICIP
2001
IEEE
14 years 6 months ago
Progressive fractal coding
Progressive coding is an important feature of compression schemes. Wavelet coders are well suited for this purpose because the wavelet coefficients can be naturally ordered accord...
Iv An Kopilovic, Dietmar Saupe, Raouf Hamzaoui
TIP
1998
122views more  TIP 1998»
13 years 4 months ago
An error resilient scheme for image transmission over noisy channels with memory
Abstract— This correspondence addresses the use of a joint sourcechannel coding strategy for enhancing the error resilience of images transmitted over a binary channel with addit...
Philippe Burlina, Fady Alajaji
TIP
2002
116views more  TIP 2002»
13 years 4 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
ICMCS
2000
IEEE
91views Multimedia» more  ICMCS 2000»
13 years 9 months ago
Streaming Video with Optimized Reconstruction-Based DCT
One fundamental problem with streaming video data over unreliable IP networks is that packets may be dropped or arrive too late for real-time playback. Traditional error-control s...
Xiao Su, Benjamin W. Wah
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 5 months ago
On the Optimality of Successive Decoding in Compress-and-Forward Relay Schemes
In the classical compress-and-forward relay scheme developed by (Cover and El Gamal, 1979), the decoding process operates in a successive way: the destination first decodes the co...
Xiugang Wu, Liang-Liang Xie